Time left:

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


1. ► Greedy algorithm doesn’t guarantee global optimal

A.
B.

2. ► Exact figures of memory usage is not important

A.
B.

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

A.
B.

4. ► For overlapping optimal substructure, dynamic programming gives optimal solution

A.
B.

5. ► Frequent cheap operations compensate expensive operations

A.
B.

6. ► Binary is not a divide and conquer algorithm

A.
B.

7. ► Good data structure make programs more efficient

A.
B.

8. ► Strongly connected component term is used in the context of directed graphs

A.
B.

9. ► Dynamic arrays can be proven to have constant time complexity with amortized analysis

A.
B.

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

A.
B.

11. ► String matching is quite common in scripting languages

A.
B.

12. ► Sorting algorithm with logarithmic component in complexity works faster

A.
B.

13. ► Binary search is there in algorithm package

A.
B.

14. ► Big-O notation has no hidden constant

A.
B.

15. ► Dijkstra’s algorithm makes best available solution choice at each step

A.
B.


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