Binary Trees Questions

MCQ bookmark_border

11.

If yyy, xxx and zzz are the elements of a lexically ordered binary tree, then in preorder traversal which node will be traverse first

A

xxx

B

yyy

C

zzz

D

can not be determined

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

12.

If all c(i, j )

A

O(n log n)

B

O(n^3)

C

O(n^2)

D

O(log n)

E

O(n^4).

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

13.

Recursive algorithms are based on

A

Divideand conquer approach

B

Top-down approach

C

Bottom-up approach

D

Hierarchical approach

E

Heuristic approach.

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

14.

Worst case efficiency of binary search is

A

log2 n + 1

B

n

C

2n

D

log n.

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

15.

The time complexity of binary search in best, worst cases for an array of size N is

A

N, N2

B

1, Log N

C

Log N, N2

D

1, N log N

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

16.

Which of the following searching methods requires that all keys must reside in internal memory?

A

Binary search

B

Sequential search

C

Hashing

D

Depth first search

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

17.

Sequential search has a time complexity of O(n), and binary search has a time complexity of O(log(n)). What difference will it make when the size n is 1000?

A

You would not notice much difference because computers run very fast anyway

B

As n is 1000, binary search is twice as fast as sequential search

C

As n is 1000, binary search is 10 times as fast as sequential search

D

As n is 1000, binary search is 100 times as fast as sequential search.

Correct Answer: D

log(1024) = 10,  1000/log(1000) is roughly equal to 1000/10 = 100

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

18.

Worst case time complexity of binary search is ______________

A

O(n)

B

O(logn)

C

?(nlogn)

D

?(logn)

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

19.

Best case time complexity of binary search is ______________

A

O(n)

B

?(nlogn)

C

O(logn)

D

?(logn)

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

20.

Average case time complexity of binary search is ______________

A

O(n)

B

?(nlogn)

C

O(logn)

D

?(logn)

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion