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

51.
The page which is referenced and not modified is less important than the page which is modified but not referenced.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

52.
The dictionary ordering of elements is known as?

A. Lexicographical order

B. Colexicographical order

C. Well order

D. Sorting

Answer & Solution Discuss in Board Save for Later

53.
Stable marriage problem is an example of?

A. Branch and bound algorithm

B. Backtracking algorithm

C. Greedy algorithm

D. Divide and conquer algorithm

Answer & Solution Discuss in Board Save for Later

54.
How many recursive calls are there in Recursive matrix multiplication by Strassen's Method?

A. 5

B. 7

C. 8

D. 4

Answer & Solution Discuss in Board Save for Later

55.
What among the following is the basic idea of fleury's algorithm?

A. Never travel across a bridge of untraveled part of the graph

B. Never travel across a bridge

C. Travel across the bridge of untraveled part, if there is no other choice

D. Travel across a bridge again over the traveled part of the graph

Answer & Solution Discuss in Board Save for Later

56.
Optimal page replacement algorithm is said to satisfy . . . . . . . .

A. Online algorithm

B. Stack algorithm

C. Queue algorithm

D. Array algorithm

Answer & Solution Discuss in Board Save for Later

57.
From the following given tree, what is the computed codeword for 'c'?

A. 111

B. 101

C. 110

D. 011

Answer & Solution Discuss in Board Save for Later

58.
Where does the tortoise point to, when the hare has completed one iteration of the sequence?

A. First node of the linked list

B. Last node of the linked list

C. Middle node of the linked list

D. Any random node of the linked list

Answer & Solution Discuss in Board Save for Later

59.
Which of the following is not a type of graph in computer science?

A. undirected graph

B. bar graph

C. directed graph

D. weighted graph

Answer & Solution Discuss in Board Save for Later

60.
The number of colors required to color the edges of a simple graph is equal to the maximum degree of a graph.

A. True

B. False

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

51. The page which is referenced and not modified is less important than the page which is modified but not referenced.

Answer & Solution

52. The dictionary ordering of elements is known as?

Answer & Solution

53. Stable marriage problem is an example of?

Answer & Solution

54. How many recursive calls are there in Recursive matrix multiplication by Strassen's Method?

Answer & Solution

55. What among the following is the basic idea of fleury's algorithm?

Answer & Solution

56. Optimal page replacement algorithm is said to satisfy . . . . . . . .

Answer & Solution

57. From the following given tree, what is the computed codeword for 'c'?

Answer & Solution

58. Where does the tortoise point to, when the hare has completed one iteration of the sequence?

Answer & Solution

59. Which of the following is not a type of graph in computer science?

Answer & Solution

60. The number of colors required to color the edges of a simple graph is equal to the maximum degree of a graph.

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

51.
The page which is referenced and not modified is less important than the page which is modified but not referenced.

52.
The dictionary ordering of elements is known as?

53.
Stable marriage problem is an example of?

54.
How many recursive calls are there in Recursive matrix multiplication by Strassen's Method?

55.
What among the following is the basic idea of fleury's algorithm?

56.
Optimal page replacement algorithm is said to satisfy . . . . . . . .

57.
From the following given tree, what is the computed codeword for 'c'?

58.
Where does the tortoise point to, when the hare has completed one iteration of the sequence?

59.
Which of the following is not a type of graph in computer science?

60.
The number of colors required to color the edges of a simple graph is equal to the maximum degree of a graph.