DATASTRUCTURES-3SEM

In the __________traversal we process all of a vertex’s descendents before we move to an adjacent vertex.

• Depth First

• Breadth First

• With First

• Depth Limited

The disadvantage in using a circular linked list is __________

• it is possible to get into infinite loop

• last node points to fist node.

• time consuming

• requires more memory space.

A graph is a collection of nodes, called __________ And line segments called arcs or__________ that connect pair of nodes.

• vertices, edges

• edges, vertices

• vertices, paths

• graph node, edges

State true of false.

i) A node is a parent if it has successor nodes.

ii) A node is child node if out degree is one.

• True, True

• False, True

• True, False

• False, False

TREE[1]=NULL indicates is _____________

• Overflow

• Empty

• Underflow

• Full

A terminal node in a binary tree is called __________

• Root

• Branch

• Child

• Leaf

If node N is a terminal node in a binary tree then its ________

• Right tree is empty

• Left tree is empty

• Both left & right sub trees are empty

• Root node is empty

Other name for directed graph is _________

• Direct graph

• Digraph

• Dir-graph

• Dgraph

(a)   are used to represent networks. The networks may include paths in a city or telephone network or circuit network.

A tree is composed of ____ connected by edges or lines.

• Fruit 
• Leaf Node
• Root Node
• Nodes