Search Header Logo

Search techniques

Authored by Marlon Beckford

Computers

9th - 12th Grade

Used 63+ times

Search techniques
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The two search techniques that are used in computer science are:

Ascending and Grading

Binary and linear

Descending and Grading

Index and Numbers

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The process of arranging numbers in order is called:

sorting

listing

grouping

scaling

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The arrangement of numbers from smallest to largest is

ascending

descending

scaling

grouping

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The arrangement of numbers from largest to smallest is

binary

grouping

ascending

descending

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The __________________ search technique has to be done on a sorted array.

Linear

Descending

Binary

Ascending

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The _________________ search technique can be done on either a sorted or unsorted array.

Binary

Linear

Grouping

cluster

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The _____________________ technique search for the mid point of an array and compare it with the key.

Abstract

Linear

Sort

Binary

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?