66,

67.

68,

69.

70.

71.

72,

73.

74,

75.

The upper bound on the time complexity of the nondeterministic sorting algorithm is :
(ಹ) ೦೧%) (೫) Ofnlogn) (೦ ‏رہ‎ ¢>) ೫)

There is a chain of 20 stores; each of the store having 5 departments. Then, which of the
following is a correct representation of array size ?

(५) 5*20 இணை © 20% D) 216

One from the following is also known as Pre-Order traversal. What that one is ?
‏یم‎ LNR ணன ண (D) NLR

From the following, select the valid data structure which reflects hierarchical relationship
between the elements :

(മ) Graph (8) Queue (09) Tree (D) Stack

Which of the following matrix does have high proportions of zero entries as the elements ?
(മ) Inverse Matrix (B) Sparse Matrix
(ಲ) Determinant Matrix (D) Square Matrix

Recursive algorithms are based on :
(മ) Divide and conquer approach (8) Top-down approach
(C) Bottom-up approach (D) Hierarchical approach

What do you call the selected keys in the quick sort method ?
(^) Outer key (B) Inner key ( Partitionkey (D) Pivotkey

How many nodes does a complete binary tree of level 5 have ?
(ಹ) 16 ® 15 © 32 ) ॐ

The Sorting method which is used for external sort is :
(^) Bubble sort (8) ‏عنم‎ sort (ಲ) Merge sort (D) Radix sort

A node of a directed graph G having no out-degree and a positive in-degree is called :
(മ) ടേ ‏عومد‎ (8) Sink node (ಲ) Sibling node (D) Null node

1 125/2017
{P.T.O}