Data Structures2

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?

• v=e

• v = e+1

• v + 1 = e

• v = e-1

For the tree below, write the pre-order traversal.

• 2, 7, 2, 6, 5, 11, 5, 9, 4

• 2, 7, 5, 2, 6, 9, 5, 11, 4

• 2, 5, 11, 6, 7, 4, 9, 5, 2

• 2, 7, 5, 6, 11, 2, 5, 4, 9

Which is the most appropriate data structure for reversing a word?

• queue

• stack

• tree

• graph

How many stacks are required for reversing a word algorithm?

• one

• two

• three

• four

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

• Leaf node

• First node of left sub tree

• root node

• First node of right sub tree

Heap exhibits the property of a binary tree?

• True

• False

Heap can be used as ________________

• Priority queue

• Stack

• A decreasing order array

• Normal Array

The number of elements in the adjacency matrix of a graph having 7 vertices is

• 7

• 14

• 49

• 34

The number of edges from the node to the deepest leaf is called _________ of the tree.

• Height

• Depth

• Length

• Width

The number of edges from the root to the node is called __________ of the tree.

• Height

• Depth

• Length

• Width