LawMint Sign in

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 ?

Select one answer

Question 2

Which of the following sorting does not have worst case running time of O(n2) ?

Select one answer

Question 3

In breadth first search of a graph, which data structure is used to hold nodes ?

Select one answer

Question 4

In the __________ traversal, we visit all of a vertex’s descendants before we move on to an adjacent vertex.

Select one answer

Question 5

Identify the odd one :

Select one answer

Question 6

Stack has applications in :

Select one answer

Question 7

The post-order and in-order traversal of a Binary tree generates the same output. Then the tree is :

Select one answer

Question 8

Given a complete graph G with 5 vertices, then the graph G has how many spanning trees :

Select one answer

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 ?

Select one answer

Question 10

Consider the graph shown below:

Undirected graph with vertices a, b, c, d, e. Edges a-b weight 3, a-c weight 2, b-c weight 1, c-d weight 21, c-e weight 20.

Which of the following are the edges in the MST (Minimum Spanning Tree) of the given graph?

Select one answer

Continue practising

The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.

Maharashtra and Goa SET (MH SET) practice pack

The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.