Computer Science Test

Question 1
5 / -1

What is the best-case time complexity of the Linear search?

A
O(n)

B
O(1)

C
O(n log n)

D
O(n²)

Question 2
5 / -1

Number of comparisons done by linear search to search for key = 15 in a a list of 6 elements L=[7,3,9,15,-6,11].

A
2

B
4

C
7

D
1

Question 3
5 / -1

In computer science, the process of finding an item with specified properties from a collection of items is known as ______.

A
Sorting

B
Searching

C
Merging

D
Traversal

Question 4
5 / -1

Which searching algorithm makes less number of comparisons/iterations when the key element is present at first index of the given sorted list of 5 elements

A
Binary Search

B
Linear Search

C
Both makes equal number of comparisons

D
Can't say anything

Question 5
5 / -1

In which of the following case binary search can be applied.

A
Given a list with sorted elements.

B
Given a list with unsorted elements.

C
Both unsorted and sorted list

D
None of the above

Question 6
5 / -1

Consider a list of 10 elements: L=[2, 83, 63, 23, 96, 55, 12, 34, 24, 44]. Determine the number of comparisons linear search makes to search for key = 12.

A
6

B
7

C
8

D
10

Question 7
5 / -1

Consider the following Binary Search algorithm implemented in python. Choose the option that can replace the blanks (i) and (ii) respectively.
def binarySearch(list, key):
first = 0
last = len(list) - 1
while(first <= last):
mid = (first + last)//2
if list[mid] == key:
return mid
elif key > list[mid]:
___________ (i)
else:
___________ (ii)
return -1

A
first = mid + 1 ,  last = mid + 1

B
first = mid - 1 ,  last = mid + 1

C
first = mid + 1 ,  last = mid - 1

D
first = mid - 1 ,  last = mid - 1

Question 8
5 / -1

Which of the following searching method works by comparing the value to be searched with every element of the array one by one in a sequence until a match is found?

A
Binary search

B
Linear search

C
Sequential search

D
II and III

Question 9
5 / -1

Number of comparisons/iterations done by Binary search to search for key = 15 in a list of 6 elements L=[7,3,9,15,-6,11].

A
2

B
1

C
3

D
None of the above

Question 10
5 / -1

Which of the following is/are true about the search in an array data structure with N element?
I. linear search is also called random search
II. At worst case, the number of comparisons needed in linear search is N

A
Only I

B
Only II

C
Both I and II

D
None of these

Submit Test

Computer Scienc...

Question 1

O(n)

O(1)

O(n log n)

O(n2)

Question 2

2

4

7

1

Question 3

Sorting

Searching

Merging

Traversal

Question 4

Binary Search

Linear Search

Both makes equal number of comparisons

Can't say anything

Question 5

Given a list with sorted elements.

Given a list with unsorted elements.

Both unsorted and sorted list

None of the above

Question 6

6

7

8

10

Question 7

first = mid + 1 , last = mid + 1

first = mid - 1 , last = mid + 1

first = mid + 1 , last = mid - 1

first = mid - 1 , last = mid - 1

Question 8

Binary search

Linear search

Sequential search

II and III

Question 9

2

1

3

None of the above

Question 10

Only I

Only II

Both I and II

None of these

User

Question Analysis

Results Announcement on: coming Monday

Stay Tuned: We’ll update you on your result via email or SMS.

O(n²)