Self Assessment on Data Structures

Minimum number of fields in each node of a doubly linked list is ____

• 2

• 3

• 4

• None of the above

A graph in which all vertices have equal degree is known as ____

• Complete graph

• Regular graph

• Multi graph

• Simple graph

A vertex of in-degree zero in a directed graph is called a/an

• Root vertex

• Isolated vertex

• Sink

• Articulation point

A graph is a tree if and only if graph is

• Directed graph

• Contains no cycles

• Planar

• Completely connected

The elements of a linked list are stored

• In a structure

• In an array

• Anywhere the computer has space for them

• In contiguous memory locations

A parentheses checker program would be best implemented using

• List

• Queue

• Stack

• Any of the above

To perform level-order traversal on a binary tree, which of the following data structure will be required?

• Hash table

• Queue

• Binary search tree

• Stack

Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?

• Queue

• Linked list

• Binary search tree

• None of above

A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.

• Threaded tree

• Complete binary tree

• M-way search tree

• Full binary tree

Which of following data structure is more appropriate for implementing quick sort iteratively?

• Deque

• Queue

• Stack

• Priority queue