81
Which of the following sorting algorithms does not have a worst case running time of O(n

^{2})?Answer: Option [D]

Questions

81
Which of the following sorting algorithms does not have a worst case running time of O(n^{2})?

Answer: Option [D]

83
The quick sort algorithm exploit _________ design technique

Answer: Option [D]

84
The data structure required to check whether an expression contains balanced parenthesis is

Answer: Option [A]

85
What data structure would you mostly likely see in a nonrecursive implementation of a recursive algorithm?

Answer: Option [C]

86
The number of leaf nodes in a complete binary tree of depth d is

Answer: Option [A]

87
The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum

Answer: Option [A]

88
A binary tree of depth “d” is an almost complete binary tree if

Answer: Option [C]

89
In a binary tree a sequence of consecutive edges is called ......

Answer: Option [A]

90
An adjacency matrix representation of a graph cannot contain information of:

Answer: Option [C]