MCQ 1 ____________ is rearranging pairs of elements which are out of order, until no such pairs remain.

(A) Insertion (B) Exchange (C) Selection (D) Distribution

MCQ 2 The complexity of sorting algorithm measures the _______________ as a function of the number n of items to be sorter.

(A) average time (B) running time (C) average-case complexity (D) case-complexity

MCQ 3 The time complexity of quick sort is ______________.

(A) O(n) (B) O(logn) (C) O(n2) (D) O(n logn)

MCQ 4 Which of the following is an external sorting?

(A) Insertion Sort (B) Bubble Sort (C) Merge Sort (D) Tree Sort

MCQ 5 ___________ is a collection of elements such that each element has been assigned a processing priority.

(A) Priority queue (B) Procedure queue (C) Main queue (D) Interrupt queue

MCQ 6 Which of the following is an internal sorting?

(A) Tape Sort (B) 2-way Merge Sort (C) Merge Sort (D) Tree Sort

MCQ 7 Linked representation of binary tree needs _____________ parallel arrays.

(A) 4 (B) 2 (C) 3 (D) 5

MCQ 8 Which of the following is an application of stack?

(A) finding factorial (B) tower of Hanoi (C) infix to postfix conversion (D) all of the above

MCQ 9 Any node is the path from the root to the node is called?

(A) Successor node (B) Ancestor node (C) Internal node (D) None of the above

MCQ 10 A graph is said to be ______________ if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V₁ or two vertices of V₂.

(A) partite (B) bipartite (C) rooted (D) bisects

MCQ 11 ______________ is not an operation performed on linear list

(A) Insertion (B) Insertion & Deletion (C) Deletion & Traversal (D) None of the above

MCQ 12 For an algorithm the complexity of the average case is ?

(A) Much more complicated to analyze than that of worst case (B) Much more simpler to analyze than that of worst case (C) Sometimes more complicated and some other times simpler than that of worst case (D) None or above

MCQ 13 Process of removing an element from stack is called __________

(A) Create (B) Push (C) Evaluation (D) Pop

MCQ 14 A _____________ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

(A) Queue linked list (B) Stacks linked list (C) Both of them (D) Neither of them

MCQ 15 Which statement is true or false.

1. Node is a parent if it has successor nodes.
2. A node is child node if out degree is one.
<

(A) True, True (B) True, False (C) False, True (D) False, False

Correct Answer Choice B True, False
See Answer

MCQ 16 Linear arrays are also called ________________.

(A) Straight line array (B) One-dimensional array (C) Vertical array (D) Horizontal array

MCQ 17 A singly linked list is also called as ___________.

(A) linked list (B) one way chain (C) two way chain (D) right link

MCQ 18 The indirect change of the values of a variable in one module by another module is called ______________.

(A) internal change (B) inter-module change (C) side effect (D) side-module update

MCQ 19 TREE[1] = NULL indicates tree is ________________.

(A) Overflow (B) Underflow (C) Empty (D) Full

MCQ 20 The queue in which the insertion takes place in the first position after of last element is a _________________.

(A) priority (B) dequeue (C) circular (D) linked

MCQ 21 The another name of dequeue is _____________.

(A) divided queue (B) distributed queue (C) double ended queue (D) design queue

MCQ 22 The value of REAR is increased by 1 when ______________.

(A) An element is deleted in a queue (B) An element is traversed in a queue (C) An element is added in a queue (D) An element is merged in a queue

MCQ 23 The time complexity of quick sort is __________________.

(A) O(n) (B) O(logn) (C) O(n2) (D) O(n logn)

MCQ 24 The time complexity of heap sort is _____________.

(A) O(n) (B) O(logn) (C) O(n²) (D) O(n logn)

MCQ 25 The complexity of sorting algorithm measures the _______________ as a function of the number n of items to be sorter.

(A) average time (B) running time (C) average-case complexity (D) case-complexity