MCQ 1 The complexity of merge sort algorithm is _____________

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

MCQ 2 When determining the efficiency of algorithm, the space factor is measured by

(A) When determining the efficiency of algorithm, the space factor is measured by (B) counting the minimum memory needed by the algorithm (C) counting the average memory needed by the algorithm (D) counting the maximum disk space needed by the algorithm

MCQ 3 In linear search algorithm the worst case occurs when?

(A) The item is somewhere in the middle of the array (B) The item is not in the array at all (C) The item is the last element in the array (D) The item is the last element in the array or is not there at all

MCQ 4 The property of binary tree is

(A) the first subset is called left subtree (B) the second subtree is called right subtree (C) the root cannot contain NULL (D) the right subtree can be empty

MCQ 5 Which data structure is used in breadth first search of a graph to hold nodes?

(A) Stack (B) queue (C) Tree (D) Array

MCQ 6 A variable P is called pointer if

(A) P contains the address of an element in DATA (B) P points to the address of first element in DATA (C) P can store only memory addresses (D) P contain the DATA and the address of DATA

MCQ 7 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 8 Linked lists are best suited

(A) for relatively permanent collections of data (B) for the size of the structure and the data in the structure are constantly changing (C) for both of above situation (D) for None of the above situation

MCQ 9 Herder node is used as sentinel in _________________.

(A) Graphs (B) Stacks (C) Binary tree (D) Queues

MCQ 10 In a stack, if a user tries to remove an element from empty stack it is called ________________.

(A) Underflow (B) Garbage Collection (C) Overflow (D) Empty collection

MCQ 11 ____________ is very useful in situation when data have to stored and then retrieved in reverse order.

(A) Stack (B) Queue (C) List (D) Link list

MCQ 12 When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

(A) FAEKCDBHG (B) FAEKCDHGB (C) EAFKHDCBG (D) FEAKDCHBG

MCQ 13 If the values of a variable in one module is indirectly changed by another module, this situation is called

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

MCQ 14 Which of the following is not a limitation of binary search algorithm?

(A) Must use a sorted array (B) Requirement of sorted array is expensive when a lot of insertion and deletions are needed (C) There must be a mechanism to access middle element directly (D) Binary search algorithm is not efficient when the data elements are more than 1000.

MCQ 15 An adjacency matrix representation of a graph cannot contain information of

(A) nodes (B) edges (C) direction of edges (D) parallel edges

MCQ 16 Which is/are the application(s) of stack?

(A) Function calls (B) Large number Arithmetic (C) Evaluation of arithmetic expressions (D) All of the above

MCQ 17 Which of the following applications may use a stack?

(A) Data Transfer between two asynchronous process (B) Compiler Syntax Analyzer (C) Tracking of local variables at run time (D) A parentheses balancing program

MCQ 18 Which of the following data structure can’t store the non-homogeneous data elements?

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

MCQ 19 Which data structure allows deleting data elements from and inserting at rear?

(A) Stacks (B) Queues (C) Dequeues (D) Binary search tree

MCQ 20 Which of the following statement is false?

(A) Arrays are dense lists and static data structure. (B) Data elements in linked list need not be stored in adjacent space in memory (C) Pointers store the next data element of a list. (D) Linked lists are collection of the nodes that contain information part and next pointer.

MCQ 21 Which of the following is/are the levels of implementation of data structure

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

MCQ 22 The type of expression in which operator succeeds its operands is?

(A) Prefix Expression (B) Infix Expression (C) Postfix Expression (D) Both Prefix and Postfix Expressions

MCQ 23 In general, the binary search method needs no more than _____________ comparisons.

(A) [log 2n] − 1 (B) [log n] + 1 (C) [log 2n] (D) [log 2n] + 1

MCQ 24 A graph is a collection of nodes, called ________________ and line segments called arcs or ________________ that connect pair of nodes.

(A) vertices, edges (B) edges, vertices (C) vertices, paths (D) graph node, edges

MCQ 25 In the ____________ traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

(A) depth first (B) breadth first (C) with first (D) depth limited