Maharashtra and Goa SET (MH SET) Data Structures and Algorithms Previous Year Questions
Try the preview and open any solution for a worked explanation.
Maharashtra and Goa SET (MH SET) practice pack
The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.
Question 1
With regard to linked list, which of the statements is FALSE ?
Question 2
Which of the following sorting does not have worst case running time of O(n2) ?
Question 3
In breadth first search of a graph, which data structure is used to hold nodes ?
Question 4
In the __________ traversal, we visit all of a vertex’s descendants before we move on to an adjacent vertex.
Question 5
Identify the odd one :
Question 6
Stack has applications in :
Question 7
The post-order and in-order traversal of a Binary tree generates the same output. Then the tree is :
Question 8
Given a complete graph G with 5 vertices, then the graph G has how many spanning trees :
Question 9
Consider an undirected graph G with vertices {A, B, C, D}. In graph G, every edge has distinct weight. Edge CD has minimum weight. Edge AB has maximum weight. Then, which of the following is false ?
Question 10
Consider the graph shown below:

Which of the following are the edges in the MST (Minimum Spanning Tree) of the given graph?
Previous papers with Data Structures and Algorithms questions
Maharashtra and Goa SET (MH SET) practice pack
The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.