Time left:

[All Quizzes] → [Introduction to Algorithms] → [Random - All Topics]


1. ► Big-O notation has no hidden constant

A.
B.

2. ► Greedy algorithm doesn’t guarantee global optimal

A.
B.

3. ► Binary search only operates on sorted sequence

A.
B.

4. ► Good data structure make programs more efficient

A.
B.

5. ► Smaller order terms cannot be ignored in analysis for small data set

A.
B.

6. ► Data structure needing large contiguous memory might fail to work even if that much memory is available

A.
B.

7. ► Exact figures of memory usage is not important

A.
B.

8. ► Topological sort requires O(V) space

A.
B.

9. ► Connected component algorithm is there in boost library

A.
B.

10. ► Brute force string matching relies on char by char comparison

A.
B.

11. ► Average case complexity of Rabin-Karp is O(nm)

A.
B.

12. ► Frequent cheap operations compensate expensive operations

A.
B.

13. ► Greedy algorithms always select local best possible solution

A.
B.

14. ► Rabin-Karp algorithm relies on hash function to convert strings to numbers

A.
B.

15. ► Amortized analysis is applicable when there is certain relationship between cheap and expensive operations

A.
B.


© 2016 VirtuQ™ Education All right reserved. | Terms of Use | Privacy Policy