21. What is the rule for encryption in playfair cipher if the letters in a pair are identical?
22. Optimal page replacement algorithm is implemented in . . . . . . . .
23. The number of colors used by a proper coloring graph is called?
24. Playfair cipher is harder to crack than keyword cipher.
25. What happens when the backtracking algorithm reaches a complete solution?
26. Vigenere cipher is an example of . . . . . . . .
27. How many Hamiltonian paths does the following graph have?

28. If GCD of two number is 8 and LCM is 144, then what is the second number if first number is 72?
29. Which one of the following is an application for matching?
30. Tower of hanoi problem can be solved iteratively.
Read More Section(Miscellaneous on Data Structures)
Each Section contains maximum 100 MCQs question on Miscellaneous on Data Structures. To get more questions visit other sections.
- Miscellaneous on Data Structures - Section 1
- Miscellaneous on Data Structures - Section 2
- Miscellaneous on Data Structures - Section 3
- Miscellaneous on Data Structures - Section 4
- Miscellaneous on Data Structures - Section 5
- Miscellaneous on Data Structures - Section 7
- Miscellaneous on Data Structures - Section 8
- Miscellaneous on Data Structures - Section 9
- Miscellaneous on Data Structures - Section 10
- Miscellaneous on Data Structures - Section 11
- Miscellaneous on Data Structures - Section 12