Miscellaneous on Data Structures MCQ question and answer with solution Page-10 section-8

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 graph is also known as biclique?

A. Histogram

B. Complete Bipartite

C. Cartesian

D. Tree

Answer & Solution Discuss in Board Save for Later

92.

Consider the following pseudocode for the edge coloring problem of a graph. Which of the following best suits the blank?

Start traversing the graph using BFS traversal 
Pick up any vertex from the graph  
__________________________  
Traverse one its edges 
Repeat until all the edges of the graph are covered

A. Assign different colors to all the adjacent vertices

B. Delete all the connected edges

C. Assign a color to only one of its edge

D. Assign different colors to the connected edges, and mark those edges as colored

Answer & Solution Discuss in Board Save for Later

93.
If GCD of two numbers is 1, then the two numbers are said to be . . . . . . . .

A. Co-prime numbers

B. Prime numbers

C. Composite numbers

D. Rational numbers

Answer & Solution Discuss in Board Save for Later

94.
What will be the time complexity of the code to find a minimum element from an array of size n and uses square root decomposition(exclude pre processing time)?

A. O(√n)

B. O(n)

C. O(1)

D. O(n²)

Answer & Solution Discuss in Board Save for Later

95.
Which of the following problems is not NP complete?

A. Hamiltonian circuit

B. Bin packing

C. Partition problem

D. Halting problem

Answer & Solution Discuss in Board Save for Later

96.
What is the GCD of 20 and 12 using Euclid's algorithm?

A. 8

B. 2

C. 4

D. 6

Answer & Solution Discuss in Board Save for Later

97.
Beaufort cipher is an example of . . . . . . . .

A. mono-alphabetic cipher

B. poly-alphabetic cipher

C. transposition cipher

D. additive cipher

Answer & Solution Discuss in Board Save for Later

98.
What is the time complexity of the above code used to reverse a string?

A. O(1)

B. O(n)

C. O(n²)

D. O(n³)

Answer & Solution Discuss in Board Save for Later

99.
When all software that runs on a system is known beforehand, optimal page replacement algorithm can be used in a general-purpose operating system.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

100.
Topological sort can be implemented by?

A. Using Depth First Search

B. Using Breadth First Search

C. Using Depth and Breadth First Search

D. Using level ordered search

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 graph is also known as biclique?

Answer & Solution

Answer & Solution

93. If GCD of two numbers is 1, then the two numbers are said to be . . . . . . . .

Answer & Solution

94. What will be the time complexity of the code to find a minimum element from an array of size n and uses square root decomposition(exclude pre processing time)?

Answer & Solution

95. Which of the following problems is not NP complete?

Answer & Solution

96. What is the GCD of 20 and 12 using Euclid's algorithm?

Answer & Solution

97. Beaufort cipher is an example of . . . . . . . .

Answer & Solution

98. What is the time complexity of the above code used to reverse a string?

Answer & Solution

99. When all software that runs on a system is known beforehand, optimal page replacement algorithm can be used in a general-purpose operating system.

Answer & Solution

100. Topological sort can be implemented by?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

91.
Which graph is also known as biclique?

93.
If GCD of two numbers is 1, then the two numbers are said to be . . . . . . . .

94.
What will be the time complexity of the code to find a minimum element from an array of size n and uses square root decomposition(exclude pre processing time)?

95.
Which of the following problems is not NP complete?

96.
What is the GCD of 20 and 12 using Euclid's algorithm?

97.
Beaufort cipher is an example of . . . . . . . .

98.
What is the time complexity of the above code used to reverse a string?

99.
When all software that runs on a system is known beforehand, optimal page replacement algorithm can be used in a general-purpose operating system.

100.
Topological sort can be implemented by?