Data Structures

121. The string with zero characters is called_________.

1. null string.
2. zero string.
3. one string.
4. empty string.

View answer

122. The time factor when determining the efficiency of algorithm is measured by_________.

1. counting microseconds.
2. counting the number of key operations.
3. counting the number of statements.
4. counting the kilobytes of algorithm.

View answer

123. The time required in best case for search operation in binary tree is _________.

1. O(n).
2. O(2n).
3. O(log n).
4. O( log 2n).

View answer

124. The unit equal to the number of bits needed to represent a character is called a _________.

1. byte.
2. bit.
3. mega bytes.
4. kilo bytes.

View answer

125. The Worst case occur in linear search algorithm when_________.

1. item is somewhere in the middle of the array.
2. item is not in the array at all.
3. item is the last element in the array.
4. item is the last element in the array or is not there at all.

View answer

126. To insert a new node in linked list free node will be available in _________.

1. Available list.
2. Avail list.
3. Free node list.
4. Memory space list.

View answer

127. To represent hierarchical relationship between elements, which data structure is suitable?

1. Dequeue.
2. Priority.
3. Tree.
4. Binary tree.

View answer

128. Two main measures for the efficiency of an algorithm are_________.

1. Processor and memory.
2. Complexity and capacity.
3. Time and space.
4. Data and space.

View answer

129. Uniform distribution of the hash address throughout the given set L is __________.

1. reduce the number of collision.
2. increase the number of collision.
3. totally avoid collision.
4. manage address.

View answer

130. What are the advantages of arrays?

1. Easier to store elements of same data type
2. Used to implement other data structures like stack and queue
3. Convenient way to represent matrices as a 2D array
4. All of the mentioned

View answer