Miscellaneous on Data Structures MCQ question and answer with solution

Home / Data Structure / Miscellaneous On Data Structures

Section 1 Section 2 Section 3 Section 4 Section 5 Section 6 Section 7 Section 8 Section 9 Section 10 Section 11 Section 12

91.
Which of the problems cannot be solved by backtracking method?

A. n-queen problem

B. subset sum problem

C. hamiltonian circuit problem

D. travelling salesman problem

Answer & Solution Discuss in Board Save for Later

92.
What is the magnitude of resultant of cross product of two parallel vectors a and b?

A. |a|.|b|

B. |a|.|b| cos(180)

C. |a|.|b| sin(180)

D. 1

Answer & Solution Discuss in Board Save for Later

93.
What will be the ciphered text corresponding to "EXAMPLE" if beaufort cipher is used for encryption with key as "PASS"?

A. LSAODGP

B. OPAGSDL

C. LDSGAPO

D. PGDOASL

Answer & Solution Discuss in Board Save for Later

94.
. . . . . . . . states that, on a page fault, the frame that has been in memory the longest is replaced.

A. Belady's anomaly

B. Second chance algorithm

C. Partial second chance algorithm

D. LRU replacement algorithm

Answer & Solution Discuss in Board Save for Later

95.
Which of the following recursive formula can be used to find the factorial of a number?

A. fact(n) = n * fact(n)

B. fact(n) = n * fact(n+1)

C. fact(n) = n * fact(n-1)

D. fact(n) = n * fact(1)

Answer & Solution Discuss in Board Save for Later

96.
How many stages of procedure does a non-deterministic algorithm consist of?

A. 1

B. 2

C. 3

D. 4

Answer & Solution Discuss in Board Save for Later

97.
Consider the given page reference string 3, 1, 0, 2, 1, 5, 6, 2, 8, 6, 9, 1. How many page faults will occur if the program has 4-page frames available to it and it uses the not recently used algorithm?

A. 6

B. 7

C. 8

D. 9

Answer & Solution Discuss in Board Save for Later

98.
Poly alphabetic cipher harder to decipher than mono alphabetic cipher.

A. true

B. false

Answer & Solution Discuss in Board Save for Later

99.
Solve the following recurrence using Master's theorem.
T(n) = 0.7 T (n/2) + 1/n

A. T(n) = O(n)

B. T(n) = O(log n)

C. T(n) = O(n²log n)

D. cannot be solved using master's theorem

Answer & Solution Discuss in Board Save for Later

100.
A two-out-of-five code consists of . . . . . . . .

A. Two 0s and three 1s

B. Three 0s and two 1s

C. Four 0s and one 1s

D. One 0s and four 1s

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

Miscellaneous on Data Structures MCQ question and answer with solution

91. Which of the problems cannot be solved by backtracking method?

Answer & Solution

92. What is the magnitude of resultant of cross product of two parallel vectors a and b?

Answer & Solution

93. What will be the ciphered text corresponding to "EXAMPLE" if beaufort cipher is used for encryption with key as "PASS"?

Answer & Solution

94. . . . . . . . . states that, on a page fault, the frame that has been in memory the longest is replaced.

Answer & Solution

95. Which of the following recursive formula can be used to find the factorial of a number?

Answer & Solution

96. How many stages of procedure does a non-deterministic algorithm consist of?

Answer & Solution

97. Consider the given page reference string 3, 1, 0, 2, 1, 5, 6, 2, 8, 6, 9, 1. How many page faults will occur if the program has 4-page frames available to it and it uses the not recently used algorithm?

Answer & Solution

98. Poly alphabetic cipher harder to decipher than mono alphabetic cipher.

Answer & Solution

99. Solve the following recurrence using Master's theorem. T(n) = 0.7 T (n/2) + 1/n

Answer & Solution

100. A two-out-of-five code consists of . . . . . . . .

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

91.
Which of the problems cannot be solved by backtracking method?

92.
What is the magnitude of resultant of cross product of two parallel vectors a and b?

93.
What will be the ciphered text corresponding to "EXAMPLE" if beaufort cipher is used for encryption with key as "PASS"?

94.
. . . . . . . . states that, on a page fault, the frame that has been in memory the longest is replaced.

95.
Which of the following recursive formula can be used to find the factorial of a number?

96.
How many stages of procedure does a non-deterministic algorithm consist of?

97.
Consider the given page reference string 3, 1, 0, 2, 1, 5, 6, 2, 8, 6, 9, 1. How many page faults will occur if the program has 4-page frames available to it and it uses the not recently used algorithm?

98.
Poly alphabetic cipher harder to decipher than mono alphabetic cipher.

99.
Solve the following recurrence using Master's theorem.
T(n) = 0.7 T (n/2) + 1/n

100.
A two-out-of-five code consists of . . . . . . . .