MCQ 1 The complexity of Bubble sort algorithm is

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

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

(A) Graph (B) Trees (C) Binary tree (D) Stack

MCQ 3 A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called?

(A) AVL tree (B) Red-black tree (C) Lemma tree (D) None of the above

MCQ 4 Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called ?

(A) Elementary items (B) Atoms (C) Scalars (D) All of above

MCQ 5 Which of the following is two way list?

(A) Grounded header list (B) Circular header list (C) Linked list with header and trailer nodes (D) None of the above

MCQ 6 Which of the resulting data structure cannot store the non-homogeneous data elements?

(A) Arrays (B) Records (C) Pointers (D) None

MCQ 7 Binary search algorithm can not be applied to the

(A) sorted linked list (B) sorted binary trees (C) sorted linear array (D) pointer array

MCQ 8 What is the difference between linear array and a record?

(A) An array is suitable for homogeneous data but the data items in a record may have different data type (B) In a record, there may not be a natural ordering in opposed to linear array. (C) A record form a hierarchical structure but a linear array does not (D) All of above

MCQ 9 ______________ level is where the model becomes compatible executable code

(A) Abstract level (B) Application level (C) Implementation level (D) All of the above

MCQ 10 Which of the following is not an inherent application of stack?

(A) Reversing a string (B) Implementation of recursion (C) Job scheduling (D) Evaluation of postfix expression

MCQ 11 In a 2-tree, nodes with 0 children are called?

(A) Exterior node (B) Outside node (C) Outer node (D) External node

MCQ 12 In a graph if e = [u, v], Then u and v are called _______________ .

(A) End points of e (B) Adjacent nodes (C) Neighbors (D) All of the above

MCQ 13 The term dequeue is the contraction of the name ______________.

(A) Double ended queue (B) Double sided queue (C) Double headed queue (D) Double address queue

MCQ 14 Which of the following sorting algorithm is of divide and conquer type?

(A) Bubble sort (B) Insertion sort (C) Quick sort (D) Merge sort

MCQ 15 ____________ order is the best possible for array sorting algorithm which sorts n item.

(A) O(n log n) (B) O(n²) (C) O(n + log n) (D) O(log n)

MCQ 16 ____________ is putting an element in the appropriate place in a sorted list yields a larger sorted order list.

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

MCQ 17 Before inserting into stack one must check the condition ________________.

(A) Overflow (B) Underflow (C) Maximum elements (D) Existing elements

MCQ 18 The complexity of selection sort is ______________.

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

MCQ 19 The way in which the data item or items are logically related defines __________________.

(A) storage structure (B) data structure (C) data relationship (D) data operation

MCQ 20 Two dimensional arrays are also called __________________.

(A) Tables arrays (B) Matrix arrays (C) Both A and B (D) None of the above

MCQ 21 The memory address of the first element of an array is called

(A) floor address (B) foundation address (C) first address (D) base address

MCQ 22 _______________ is not the component of data structure.

(A) Operations (B) Storage Structures (C) Algorithms (D) None of the above

MCQ 23 _____________ is a directed tree in which outdegree of each node is less than or equal to two.

(A) Unary tree (B) Binary tree (C) Trinary tree (D) Both B and C

MCQ 24 The operations that can be done in a circular queue is/are ________________

(A) Insert from the front end (B) Delete from front end (C) Display queue contents (D) All of the above

MCQ 25 Which of the following is not the type of queue?

(A) Ordinary queue (B) Special queue (C) Priority queue (D) Circular queue