Search Header Logo

AHJN: Unit19-Computational Thinking

Authored by Ahmad Janoudi

Computers

12th Grade

AHJN: Unit19-Computational Thinking
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

38 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which search algorithm has a time complexity of O(log n)?

Binary search

Linear search

Bubble sort

Insertion sort

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a necessary condition for using a binary search algorithm?

The data must be sorted

The data must be stored in a linked list

The data must contain only numeric values

The data must be stored in a queue

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is NOT an abstract data type (ADT)?

Stack

Queue

Binary tree

Algorithm

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What notation is commonly used to compare the efficiency of algorithms?

Big O notation

Little O notation

Alpha-beta notation

Theta notation

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a linear search algorithm, what is the worst-case time complexity when searching through n elements?

O(n)

O(log n)

O(1)

O(n²)

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following statements about binary search is correct?

It has a worst-case time complexity of O(log n)

It always requires more comparisons than linear search

It can be used on unsorted data

It requires a linked list data structure

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How many comparisons would a binary search require in the worst case to find a value in a sorted array of 1024 elements?

10

11

512

1024

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?