Binary search Quiz

Binary search Quiz

University

8 Qs

quiz-placeholder

Similar activities

Google Docs

Google Docs

5th Grade - University

13 Qs

QUIZ 7 PBO

QUIZ 7 PBO

University

10 Qs

Dart

Dart

University

10 Qs

QUIZ GAME

QUIZ GAME

University

10 Qs

informatika

informatika

7th Grade - University

10 Qs

Ulangkaji Navigation and Search Systems

Ulangkaji Navigation and Search Systems

University

10 Qs

Quiz 2 DS1D

Quiz 2 DS1D

University

12 Qs

Micro:bit

Micro:bit

4th Grade - University

12 Qs

Binary search Quiz

Binary search Quiz

Assessment

Quiz

Computers

University

Practice Problem

Hard

Created by

Easther Tie

Used 4+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

8 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

1. In which of the following cases, binary search algorithm is used?​

To search an element in an unordered list.

To search an element in a list of few elements.

To search an element in any ordered list with large number of elements

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

2. How does a binary search algorithm works?​

Dividing the list into halves until the item is matched with one in the list.​

Starts with the first element and checks the next element consecutively until a match is found.

None of the above​

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

3. An array with 32 elements is input to a binary search algorithm. How many maximum number of comparisons are performed?​

32

8

16

5

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

4. An array with 32 elements is input to a linear search algorithm. How many maximum number of comparisons are performed?​

32

8

16

5

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

5. How is the midpoint of the list calculated?​

midpoint= round ((first_element+last_element)/2)

midpoint= round ((lower_bound+upper_bound)/2)​

midpoint=(lower_bound+upper_bound)/2​

midpoint= round ((lower_bound+upper_bound))

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

6. Complete the sentence: The lower half of the list is discarded if the value at midpoint is …………………….. item searched.​

less than

equal to

greater than

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

7. True or False: The upper half of the list is discarded if the value at midpoint is greater than item searched.​

true

false

8.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

8. What is the disadvantage of binary search algorithm?​

It takes longer time when compared to linear search algorithm​

It is very complex to understand​

It works only on sorted lists​