Top MCQs on Data Structures | DSA Quiz for Beginners

Last Updated :
Discuss
Comments

Question 1

Two Basic Operations used in queue are:

  • push and pop

  • Enqueue & Dequeue

  • insert and remove

  • None of these

Discuss it

Question 2

In the below image, which type of representation of a graph is used?

Graph

  • Adjacency matrix

  • Adjacency list

  • both

  • None

Discuss it

Question 3

What is the time complexity for DFS?

  • O(v +e )

  • O(v * e)

  • O(v)

  • None

Discuss it

Question 4

The maximum degree of any vertex in a single graph with N vertices is_____.

  • n

  • n - 1

  • 2n

  • n+1

Discuss it

Question 5

Graphs are represented using ___________.
 

  • Adjacency list

  • Adjacency tree

  • Adjacency queue

  • None

Discuss it

Question 6

A graph G is called a ________ if it is a connected acyclic graph?

  • Cyclic graph

  • Regular graph

  • Not a graph

  • Tree

Discuss it

Question 7

BFS uses which data structure?

  • stack

  • Queue

  • Tree

  • Hash

Discuss it

Question 8

What is the maximum number of edges in an acyclic undirected graph with n vertices?

  • n

  • n -+1

  • n - 2

  • n - 1

Discuss it

Question 9

A tree data structure is a------ data structure.

  • Hierarchical

  • Pre-defined

  • primary

  • None

Discuss it

Question 10

The tree that has left value smaller than the root value and right node greater than the root value, is called?

  • Binary tree

  • Binary search tree

  • complete tree

  • None

Discuss it

There are 30 questions to complete.

Take a part in the ongoing discussion
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy