MCQ 1 Which one statement is True of False.
Statmement A : Network is a graph that has weights or costs associated with it.
Statmement B : An undirected graph which contains no cycles is called a forest.
Statmement C : A graph is said to be complete if there is no edge between every pair of vertices.

(A) Statement A, C is true and B is false (B) Statement A, B is true and C is false (C) All the statements are true (D) All the statements are false

MCQ 2 State True or False.
i) An undirected graph which contains no cycles is called forest.
ii) A graph is said to be complete if there is an edge between every pair of vertices.

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

MCQ 3 When determining the efficiency of algorithm the time factor is measured by ____________.

(A) counting microseconds (B) counting the number of key operations (C) counting the number of statements (D) counting the kilobytes of algorithm

MCQ 4 Which of the following name does not relate to stacks?

(A) FIFO lists (B) LIFO list (C) Piles (D) Push-down lists

MCQ 5 The memory address of fifth element of an array can be calculated by the formula

(A) LOC(Array[5] = Base(Array) + w(5 - lower bound), where w is the number of words per memory cell for the array (B) LOC(Array[5]) = Base(Array[5]) + (5 - lower bound), where w is the number of words per memory cell for the array (C) LOC(Array[5]) = Base(Array[4]) + (5 - Upper bound), where w is the number of words per memory cell for the array (D) None of the above

MCQ 6 If A[1][1] and A[2][1] are 1000 and 1010 respectively are the address and each element occupies 2 bytes then the array has been stored in ______________ order

(A) row major (B) column major (C) matrix major (D) None of the above

MCQ 7 Finding the location of the element with a given value is :

(A) Traversal (B) Search (C) Sort (D) None of the above

MCQ 8 Which of the following case does not exist in complexity theory.

(A) Best case (B) Worst case (C) Average case (D) Null case

MCQ 9 Which of the following is true about the characteristics of abstract data types?

• It exports a set of operations
• It exports a type
<

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

Correct Answer Choice C True, True
See Answer

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

(A) Ordinary queue (B) Single ended queue (C) Circular queue (D) Priority queue

MCQ 11 Arrays are best data structures

(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 non of above situation

MCQ 12 A ___________ is a graph that has weights of costs associated with its edges.

(A) Network (B) Weighted graph (C) Both A and B (D) None A and B

MCQ 13 Which of the following is non-liner data structure?

(A) Stacks (B) List (C) Strings (D) Trees

MCQ 14 State True or False.

• i) Binary search is used for searching in a sorted array.
• ii) The time complexity of binary search is O(log n).
<

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

Correct Answer Choice D True, True
See Answer

MCQ 15 In a queue, the initial values of front pointer f rare pointer r should be ______________ and _____________ respectively.

(A) 0 and 1 (B) 0 and −1 (C) −1 and 0 (D) 1 and 0

MCQ 16 A _______________ is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.

(A) Directed tree (B) Undirected tree (C) Dis-joint tree (D) Direction oriented tree

MCQ 17 A binary tree whose every node has either zero or two children is called ______________.

(A) complete binary tree (B) binary search tree (C) extended binary tree (D) data structure

MCQ 18 If the number of record to be sorted large and the key is long, then _____________ sorting can be efficient.

(A) Merge (B) Heap (C) Quick (D) Quick

MCQ 19 For an internal sorting algorithms, which statement is True or False.
Statement A → Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.
Statement B → The time required to read or write is considered to be significant in evaluating the performance of internal sorting.

(A) Both A and B are true statements (B) Statement A is true and B is false (C) Statement A is false and B is true (D) Both A and B are false statements

MCQ 20 Sorting algorithm can be characterized as _______________.

(A) Simple algorithm which require the order of n2 comparisons to sort n items. (B) Sophisticated algorithms that require the O(nlog2n) comparisons to sort items. (C) Both of the above (D) None of the above

MCQ 21 ____________ is the method used by card sorter.

(A) Radix sort (B) Insertion (C) Heap (D) Quick

MCQ 22 Merging k sorted tables into a single sorted table is called ______________.

(A) k way merging (B) k th merge (C) k + 1 merge (D) k − 1 merge

MCQ 23 A tree sort is also known as _______________ sort.

(A) quick (B) shell (C) heap (D) selection

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

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

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

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