Miscellaneous on Data Structures MCQ question and answer with solution Page-1 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

1.
The code for printing combinations is in-place.

A. true

B. false

Answer & Solution Discuss in Board Save for Later

2.
The problem of maximizing the sum of weights on edges connecting matched pairs of vertices is?

A. Maximum- mass matching

B. Maximum bipartite matching

C. Maximum weight matching

D. Maximum node matching

Answer & Solution Discuss in Board Save for Later

3.
What is the clique size of the line graph of bipartite graph?

A. 0

B. 1

C. 2

D. 3

Answer & Solution Discuss in Board Save for Later

4.
. . . . . . . . is a typical online problem from the competitive analysis to determine the optimal solution.

A. Page replacement algorithm

B. Segmentation

C. Paging

D. Segmentation with paging

Answer & Solution Discuss in Board Save for Later

5.
What is the worst case time complexity of quickselect?

A. O(n log n)

B. O(n²)

C. O(n)

D. O(log n)

Answer & Solution Discuss in Board Save for Later

6.
A hash table contains 10 slots and uses coalesced hashing to resolve collisions. The hash function used is key % 10. If the values 67, 23, 45, 11, 95 are inserted in the table, in what location would the key value 95 be inserted?

A. 7

B. 8

C. 9

D. 10

Answer & Solution Discuss in Board Save for Later

7.
What is the formula for Euclidean algorithm?

A. GCD (m,n) = GCD (n, m mod n)

B. LCM(m,n)=LCM(n, m mod n)

C. GCD(m,n,o,p) = GCD (m, m mod n, o, p mod o)

D. LCM (m,n,o,p) = LCM (m, m mod n, o, p mod o)

Answer & Solution Discuss in Board Save for Later

8.
What is the average case complexity of a quick hull algorithm?

A. O(N)

B. O(N log N)

C. O(N²)

D. O(log N)

Answer & Solution Discuss in Board Save for Later

9.
What will be the chromatic number for a line graph having n vertices?

A. 0

B. 1

C. 2

D. n

Answer & Solution Discuss in Board Save for Later

10.
In the edge coloring of a graph, which edges should be colored with different colors?

A. All adjacent edges

B. Opposite pair edges

C. Only 2 edges

D. Only 2 adjacent edges

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

1. The code for printing combinations is in-place.

Answer & Solution

2. The problem of maximizing the sum of weights on edges connecting matched pairs of vertices is?

Answer & Solution

3. What is the clique size of the line graph of bipartite graph?

Answer & Solution

4. . . . . . . . . is a typical online problem from the competitive analysis to determine the optimal solution.

Answer & Solution

5. What is the worst case time complexity of quickselect?

Answer & Solution

6. A hash table contains 10 slots and uses coalesced hashing to resolve collisions. The hash function used is key % 10. If the values 67, 23, 45, 11, 95 are inserted in the table, in what location would the key value 95 be inserted?

Answer & Solution

7. What is the formula for Euclidean algorithm?

Answer & Solution

8. What is the average case complexity of a quick hull algorithm?

Answer & Solution

9. What will be the chromatic number for a line graph having n vertices?

Answer & Solution

10. In the edge coloring of a graph, which edges should be colored with different colors?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

1.
The code for printing combinations is in-place.

2.
The problem of maximizing the sum of weights on edges connecting matched pairs of vertices is?

3.
What is the clique size of the line graph of bipartite graph?

4.
. . . . . . . . is a typical online problem from the competitive analysis to determine the optimal solution.

5.
What is the worst case time complexity of quickselect?

6.
A hash table contains 10 slots and uses coalesced hashing to resolve collisions. The hash function used is key % 10. If the values 67, 23, 45, 11, 95 are inserted in the table, in what location would the key value 95 be inserted?

7.
What is the formula for Euclidean algorithm?

8.
What is the average case complexity of a quick hull algorithm?

9.
What will be the chromatic number for a line graph having n vertices?

10.
In the edge coloring of a graph, which edges should be colored with different colors?