Data Structure II Practice Test 10

1. What is meant by the power set of a set?

2. Which word tells a word rate of Morse code's shorter code durations for common characters such as "e" and "t".?

3. Topological sort can be implemented by?

4. What is the minimal Hamming distance between any two correct codewords?

5. As the number of frames available increases, the number of page faults decreases.

6. By what factor time complexity is reduced when we apply square root decomposition to a code?

7. Which of the following is true about the time complexity of the recursive solution of the subset sum problem?

8. In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?

9. Optimal page replacement algorithm is said to satisfy __________

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