AL_lecture_search_algorithm

AL_lecture_search_algorithm

1st - 3rd Grade

13 Qs

quiz-placeholder

Similar activities

WORD - Hipervinculos, busqueda y multimedia. 3G

WORD - Hipervinculos, busqueda y multimedia. 3G

1st - 5th Grade

10 Qs

BT CỦNG CỐ TIN 3 TUẦN 11

BT CỦNG CỐ TIN 3 TUẦN 11

3rd Grade

12 Qs

Desafio Santarenzinho

Desafio Santarenzinho

KG - University

11 Qs

contextualização

contextualização

2nd Grade

10 Qs

Unit 6 - lesson 2

Unit 6 - lesson 2

3rd - 4th Grade

17 Qs

EXAMEN I BIMESTRE- INFORMATICA - 3ER GRADO

EXAMEN I BIMESTRE- INFORMATICA - 3ER GRADO

3rd Grade

10 Qs

Quiz on important shortcuts keys used in ms word.

Quiz on important shortcuts keys used in ms word.

2nd - 4th Grade

10 Qs

Słowa kluczowe w C++

Słowa kluczowe w C++

1st Grade

16 Qs

AL_lecture_search_algorithm

AL_lecture_search_algorithm

Assessment

Quiz

Computers

1st - 3rd Grade

Practice Problem

Medium

Created by

Dilmurod Tuxtanazarov

Used 16+ times

FREE Resource

AI

Enhance your content in a minute

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

13 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Binarysearch algoritmi qanday arraydan qidiradi

tartiblangan

Tartiblanmagan

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

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

32

16

8

5

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

32

16

8

5

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How is the midpoint of the list calculated?​

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

midpoint=(lower_bound+upper_bound)/2​

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

midpoint= round ((lower_bound+upper_bound))

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the disadvantage of binary search algorithm?​

It takes longer time when compared to linear search algorithm​

It works only on sorted lists​

It is very complex to understand​

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the worst-case runtime of lookUp/get in a binary search tree?

O(n)

O(logn)

O(1)

O(n2)

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?