My Report

Data Structure II Mock 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
 10%

Question 1 of 10

1. Hamming codes can be used for both single-bit error and burst error detection and correction.

Question 1 of 10

Question 2 of 10

2. Who invented the inclusion-exclusion principle to solve the Hamiltonian path problem?

Question 2 of 10

Question 3 of 10

3. What will be the ciphered text corresponding to “SANFOUNDRY” if bifid cipher is used for encryption with key as “KEY” with period as 5?

Question 3 of 10

Question 4 of 10

4. Topological sort can be applied to which of the following graphs?

Question 4 of 10

Question 5 of 10

5. Topological sort is equivalent to which of the traversals in trees?

Question 5 of 10

Question 6 of 10

6. What will be the worst case time complexity of finding the sum of elements in a given range of (l,r) in an array of size n?

Question 6 of 10

Question 7 of 10

7. Under which of the following scenarios is page replacement algorithm required?

Question 7 of 10

Question 8 of 10

8. What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?

Question 8 of 10

Question 9 of 10

9. Which of the following ciphered text would have NOT used transposition cipher for encryption of the plain text “CIPHER”?

Question 9 of 10

Question 10 of 10

10. What is a subset sum problem?

Question 10 of 10


 

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.