Data Structures and Algorithms MCQ - Sorting and Searching

6 For a linear search in an array of n elements the time complexity for the best, worst and average case are ......., ....... and ........ respectively

A
O(n), O(1), and O(n/2)
B
O(1), O(n) and O(n/2)
C
O(1),O(n) and O(n)
D
O(1), O(n) and (n-1/2)

View Explanation
Comment

Correct AnswerOption C

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

7 The average time required to perform a successful sequential search for an element in an array A(1 : n) is given by

A
(n + 1)/2
B
log2n
C
n(n + 1)/2
D
n2

View Explanation
Comment

Correct AnswerOption A

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

8 Using the standard algorithm, what is the time required to determine that a number n is prime?

A
Linear time
B
Logarithmic time
C
Constant time
D
Quadratic time

View Explanation
Comment

Correct AnswerOption A

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Share this question

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

9 The average time required to perform a successful sequential search for an element in an array A (1 : n) is given by

A
Linear time
B
Logarithmic time
C
Constant time
D
Quadratic time

View Explanation
Comment

Correct AnswerOption A

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

10 Which of the following is false?

A
A serial search begins with the first array element
B
A serial search continues searching, element by element, either until a match is found or until the end of the array is encountered
C
A serial search is useful when the amount of data that must be search is small
D
For a serial search to work, the data in the array must be arranged in either alphabetical or numerical order

View Explanation
Comment

Correct AnswerOption D

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

First Previous 1 2 3 4 5 Next Last