My Report

Data Structure II Practice Test 10


Correct Answer: 2 points | Wrong: -1 point
Grades: A* (100% score) | A (80%-99%) | B (60%-80%) | C (40%-60%) | D (0%-40%)
advertisement

1. Most Efficient Time Complexity of Topological Sorting is? (V - number of vertices, E - number of edges)

2. The words are separated by a space of how many durations?

3. How many conditions have to be met if an NP- complete problem is polynomially reducible?

4. For which symbol there is no standard representation in Morse Code?

5. Who formulated the first ever algorithm for solving the Hamiltonian path problem?

6. Subset sum problem is an example of NP-complete problem.

7. Choose the weakest cipher from the following?

8. FIFO algorithm is used by __________ operating system.

9. Consider a reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 of frame size 3. Calculate the number of page faults using optimal page replacement algorithm.

10. The cost required to execute a FIFO algorithm is expensive.


 

Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.