Data Structures

91. The concatenation of two characters s1 and s2 is symbolically represented as_________.

1. s1 / s2.
2. s1 * s2.
3. s1 || s2.
4. s1 + s2.

View answer

92. The correctness of a divide and conquer algorithm is usually proved by _________.

1. mathematical theorem.
2. de-Morgan `s law.
3. mathematical induction.
4. none.

View answer

93. The data items in a record form a _________ structure which can be described by means of level numbers.

1. hierarchical.
2. procedural.
3. indexed.
4. leveled.

View answer

94. The data structure required to check whether an expression contains balanced parenthesis is?

1. queue
2. stack
3. linked list
4. file

View answer

95. The depth of a complete binary tree is given by__________.

1. Dn = n log2n.
2. Dn = n log2n+1.
3. Dn = log2n.
4. Dn = log2n+1.

View answer

96. The earliest use of _________ sorting was in conjunction with network analysis.

1. topological.
2. bubble.
3. radix.
4. heap.

View answer

97. The efficiency of a BFS algorithm is dependent on _________.

1. Algorithm.
2. Tree.
3. Problem.
4. Graph.

View answer

98. The efficient searching algorithm for algorithm for a sorted array is _________.

1. Binary search.
2. Linear search.
3. Indexed search.
4. Repeated search.

View answer

99. The elements of an array are allocated in spaces_________.

1. successively.
2. randomly.
3. alternately.
4. on any order.

View answer

100. The hashing file space is divided into_________.

1. nodes and roots.
2. roots and slots.
3. buckets and slots.
4. slots and nodes.

View answer