51. What is the minimum vertex cover for the following graph given below?

52. The quick hull algorithm runs faster if the input uses non- extreme points.
53. Playfair cipher is an example of . . . . . . . .
54. What is the basic unit of time measurement in Morse code transmission?
55. What is meant by number theory?
56. Given below is the pseudocode of the flooding algorithm. Node and message are denoted by n and m respectively. Which of the following best suits the blank?
if m.id was seen before, discard
else, add m.id to list of seen messages and ______
if m.id was seen before, discard
else, add m.id to list of seen messages and ______
57. Cross product is also known as?
58. The number of columns in the table used for encryption in rail fence cipher depends upon the given key value.
59. How many possible solutions occur for a 10-queen problem?
60. Hill cipher is harder to crack than playfair cipher.
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 6
- 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