MCQ 1 The number of comparisons done by sequential search is _______________.

(A) (n/2) + 1 (B) (n + 1)/2 (C) (n − 1)/2 (D) (n + 2)/2

MCQ 2 In a circular queue the value of r will be ____________ .

(A) r = r + 1 (B) r = (r + 1) % [QUEUE_SIZE − 1] (C) r = ( r + 1) % QUEUE_SIZE (D) r = ( r − 1) % QUEUE_SIZE

MCQ 3 State true or false.

1. An empty tree is also a binary tree.
2. In strictly binary tree, the out-degree of every node is either 0 or 2.
<

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

Correct Answer Choice C True, True
See Answer

MCQ 4 A data structure where elements can be added or removed at either end but not in the middle is called ______________.

(A) linked lists (B) stacks (C) queues (D) dequeue

MCQ 5 Which of the following data structure is non-linear type?

(A) Strings (B) Lists (C) Stacks (D) Tree

MCQ 6 Which of the following data structure is linear type?

(A) Array (B) Tree (C) Graphs (D) Hierarchy

MCQ 7 When does top value of the stack changes?

(A) Before deletion (B) While checking underflow (C) At the time of deletion (D) After deletion

MCQ 8 The disadvantage in using a circular linked list is ____________.

(A) It is possible to get into infinite loop. (B) Last node points to first node. (C) Time consuming (D) Requires more memory space

MCQ 9 Which of the following data structure is not linear data structure?

(A) Arrays (B) Linked lists (C) Both of the above (D) None of the above

MCQ 10 A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

(A) Singly Linked List (B) Circular Linked List (C) Doubly Linked List (D) Linear Linked List

MCQ 11 A list which displays the relationship of adjacency between elements is said to be

(A) linear (B) Non linear (C) linked list (D) tree

MCQ 12 A connected graph T without any cycles is called _____________.

(A) free graph (B) no cycle graph (C) non cycle graph (D) circular graph

MCQ 13 Which of the following data structures are indexed structures?

(A) Linear arrays (B) Linked lists (C) Graphs (D) Trees

MCQ 14 _____________ is a pile in which items are added at one end and removed from the other.

(A) Stack (B) Queue (C) List (D) None of the above

MCQ 15 Which of the following is not the part of ADT description?

(A) Data (B) Operations (C) Both of the above (D) None of the above

MCQ 16 The use of pointers to refer elements of a data structure in which elements are logically adjacent is _______________.

(A) pointers (B) linked allocation (C) stack (D) queue

MCQ 17 A _____________ does not keep track of address of every element in the list.

(A) Stack (B) String (C) Linear array (D) Queue

MCQ 18 In a priority queue, insertion and deletion takes place at ______________

(A) front, rear end (B) only at rear end (C) only at front end (D) any position

MCQ 19 Which of the following data structure is linear data structure?

(A) Trees (B) Graphs (C) Arrays (D) None of the above

MCQ 20 Graph G is ______________ if for any pair u, v of nodes in G there is a path from u to v or path from v to u.

(A) Literally connected (B) Widely Connected (C) Unliterally connected (D) Literally connected

MCQ 21 Trees are said ________________ if they are similar and have same contents at corresponding nodes.

(A) Duplicate (B) Carbon copy (C) Replica (D) Copies

MCQ 22 Sequential representation of binary tree uses ______________.

(A) Array with pointers (B) Single linear array (C) Two dimensional arrays (D) Three dimensional arrays

MCQ 23 The depth of complete binary tree is given by _____________.

(A) Dn = log 2 (n+1) (B) Dn = log 1/2 (n+1) (C) Dn = log (n+1) (D) Dn = log 2 (n-1)

MCQ 24 In ____________ search start at the beginning of the list and check every element in the list.

(A) linear search (B) binary search (C) hash Search (D) binary tree search

MCQ 25 Which of the following is not the internal sort?

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