• What data structure is used for depth first traversal of a graph?

(a) Queue
(b) Stack
(c) List
(d) Tree

• Graph traversal is different froma tree traversal, because:

(a) Trees are not connected
(b) Graphs may have loops
(c) Trees have root
(d) None of these

• Graphs are represented using ____________.

(a) Adjacency tree
(b) Adjacency linked list and Matrices
(c) Both a and b
(d) Adjacency queue

• Which of the following is true?

(a) Prim’s algorithm initialises with a vertex
(b) Prim’s algorithm initialises with a edge
(c) Prim’s algorithm initialises with a vertex which has smallest edge
(d) Prim’s algorithm initialises with a forest

• Prim’s & Kruskal algorithm are ________.

(a) Divide and conquer algorithm
(b) Greedy algorithm
(c) Dynamic Programming
(d) Approximation algorithm

• What is the time complexity of Kruskal’s algorithm?

(a) O(log V)
(b) O(E log V)
(c) O(E2)
(d) O(V log E)

• What is an AVL tree?

(a) a tree which is balanced and is a height balanced tree
(b) a tree which is unbalanced and is a height balanced tree
(c) a tree with three children
(d) a tree with atmost 3 children

• Why to prefer AVL trees?*

(a) AVL Tree is easiest to implement.
(b) AVL tree store balance factor in every node which costs space
(c) AVL tree fails at scale
(d) AVL Tree is not efficient

• In a max-heap, element with the greatest key is always in the which node?

(a) Leaf node
(b) First node of left sub tree
(c) Root node
(d) First node of right sub tree

• Heap Data Structure can be used as _______.

(a) Priority queue
(b) Stack
(c) A decreasing order array
(d) Normal Array

• Depth First Search is equivalent to which of the traversal in the Binary Trees?

(a) Pre-order Traversal
(b) Post-order Traversal
(c) Level-order Traversal
(d) In-order Traversal

• Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

(a) O(V+E)
(b) o(v)
(c) o(E)
(d) None of the mentioned

• Symbol table is a data structure used by a language translator such as a compiler or interpreter, where each identifier (or symbol) in a program’s source code is associated with information relating to its declaration or appearance in the source.

(a) True
(b) False

• heap can be used as

(a) Priority queue
(b) Stack
(c) A decreasing order array
(d) Normal Array

• what is the complexity of adding an element to the heap _______.

(a) O(log n)
(b) O(log h)
(c) O(h)
(d) Both A and C

• In a max-heap, element with the greatest key is always in the which node?

(a) Leaf node
(b) First node of left sub tree
(c) Root node
(d) First node of right sub tree

• what is the complexity of adding an element to the heap

(a) O(log n)
(b) O(nlog n)
(c) nlog
(d) logn

• the worst case complexity of deleting any arbitrary node value element from heap is

(a) O(logn)
(b) O(n)
(c) O(nlogn)
(d) O(n^2)

• A connected planar graph having 6 vertices, 7 edges contains _____________ regions.

(a) 15
(b) 3
(c) 1
(d) 11

• Which of the following properties does a simple graph not hold?

(a) Must be connected
(b) Must be unweighted
(c) Must have no loops or multiple edges
(d) Must have no multiple edges

• For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?

(a) v=e
(b) v = e+1
(c) v + 1 = e
(d) v = e-1

• A graph with all vertices having equal degree is known as a __________.

(a) Multi Graph
(b) Regular Graph
(c) Simple Graph
(d) Complete Graph

• Which of the following statements for a simple graph is correct?

(a) Every path is a trail
(b) Every trail is a path
(c) Every trail is a path as well as every path is a trail
(d) Path and trail have no relation

• What is the number of edges present in a complete graph having n vertices?

(a) (n (n+1)/2
(b) (n*(n-1)/2)
(c) r
(d) Information given is insufficient