Data Structures

81. The _________ is used in an elegant sorting algorithm.

  1. Heap sort.
  2. Quick sort.
  3. Merge sort.
  4. Radix sort.

Correct answer: (A)
Heap sort.

82. The advantage of a two-way list and a circular header list is combined into a _________.

  1. two-way circular header list.
  2. two-way circular list.
  3. two-way header circular list.
  4. None.

Correct answer: (A)
two-way circular header list.

83. The average number of key comparisons done in a successful sequential search in a list of length n is _________.

  1. log n
  2. n-1/2.
  3. n/2.
  4. n+1/2.

Correct answer: (D)
n+1/2.

84. A _________ is a linked list which always contains a special node called the header node, at the beginning of the list.

  1. Doubly Linked List.
  2. Circular List.
  3. Header Linked List.
  4. None.

Correct answer: (C)
Header Linked List.

85. The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is

  1. log2N
  2. n-1
  3. n
  4. None of the above

Correct answer: (B)
n-1

86. The children node of same parent is called_________.

  1. binary tree.
  2. tree.
  3. sibling.
  4. list.

Correct answer: (C)
sibling

87. The comparison tree is also called as _________.

  1. decision tree.
  2. binary tree.
  3. sequential tree.
  4. b+ tree.

Correct answer: (A)
decision tree.

88. The complexity of Binary search algorithm is _________.

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

Correct answer: (B)
O(log n ).

89. The complexity of Bubble sort algorithm is _________.

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

Correct answer: (C)
O(n2).

90. The complexity of linear search algorithm is_________.

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

Correct answer: (B)
O(n).

Previous
Page 9 of 15
Next
Copyright © EngineeringMCQ.com