Top MCQs on Data Structures | DSA Quiz for Beginners

Last Updated :
Discuss
Comments

Question 1

Two Basic Operations used in queue are:

  • A

    push and pop

  • B

    Enqueue & Dequeue

  • C

    insert and remove

  • D

    None of these

Question 2

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

Graph
  • A

    Adjacency matrix

  • B

    Adjacency list

  • C

    both

  • D

    None

Question 3

What is the time complexity for DFS?

  • A

    O(v +e )

  • B

    O(v * e)

  • C

    O(v)

  • D

    None

Question 4

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

  • A

    n

  • B

    n - 1

  • C

    2n

  • D

    n+1

Question 5

Graphs are represented using ___________.
 

  • A

    Adjacency list

  • B

    Adjacency tree

  • C

    Adjacency queue

  • D

    None

Question 6

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

  • A

    Cyclic graph

  • B

    Regular graph

  • C

    Not a graph

  • D

    Tree

Question 7

BFS uses which data structure?

  • A

    stack

  • B

    Queue

  • C

    Tree

  • D

    Hash

Question 8

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

  • A

    n

  • B

    n -+1

  • C

    n - 2

  • D

    n - 1

Question 9

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

  • A

    Hierarchical

  • B

    Pre-defined

  • C

    primary

  • D

    None

Question 10

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

  • A

    Binary tree

  • B

    Binary search tree

  • C

    complete tree

  • D

    None

There are 30 questions to complete.

Take a part in the ongoing discussion