Data Structure MCQ
Data Structure MCQ
Data Structure MCQ
MCQ QUESTIONS ON THE LIST & LINKED LIST IN DATA STRUCTURE SET-2 ........................ 37
A) Abstract level
B) Application level
C) Implementation level
2. A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called
……
Page 1 of 46
A) AVL tree
B) Red-black tree
C) Lemma tree
A) Abstract level
B) Application level
C) Implementation level
5. Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
A) True, False
B) False, True
C) True, True
D) False, False
A) Operations
B) Storage Structures
C) Algorithms
Page 2 of 46
A) Data
B) Operations
8. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of
item form the stack, when stack is not empty is called ………..operation.
A) push, pop
B) pop, push
C) insert, delete
D) delete, insert
9. ……………. Is a pile in which items are added at one end and removed from the other.
A) Stack
B) Queue
C) List
10. ………… 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
11. Which data structure allows deleting data elements from and inserting at rear?
A) Stacks
B) Queues
C) Dequeues
12. Which of the following data structure can’t store the non-homogeneous data elements?
A) Arrays
Page 3 of 46
B) Records
C) Pointers
D) Stacks
13. 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.
C) Both of them
D) Neither of them
A) Stacks
B) List
C) Strings
D) Trees
A) Graphs
B) Stacks
C) Binary tree
D) Queues
16. Which data structure is used in breadth first search of a graph to hold nodes?
A) Stack
B) queue
C) Tree
D) Array
17. Identify the data structure which allows deletions at both ends of the list but insertion at only
one end.
Page 4 of 46
C) Priority queues
D) Stack
A) Strings
B) Lists
C) Stacks
D) Graph
A) Graph
B) Trees
C) Binary tree
D) Stack
20. To represent hierarchical relationship between elements, Which data structure is suitable?
A) Dequeue
B) Priority
C) Tree
D) Graph
ANSWERS:
2. A) AVL tree
3. C) Implementation level
5. C) True, True
8. A) push, pop
9. B) Queue
Page 5 of 46
10. A) Stack
11. B) Queues
12. A) Arrays
14. D) Trees
16. B) queue
18. D) Graph
19. D) Stack
20. C) Tree
2. 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
Page 6 of 46
4. Match the following.
a) Completeness i) How long does it take to find a solution
b) Time Complexity ii) How much memory need to perform the search.
c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.
A) a-iii, b-ii, c-i
B) a-i, b-ii, c-iii
C) a-iii, b-i, c-ii
D) a-i, b-iii, c-ii
6. 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
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 V1 or two vertices of V2.
A) Partite
B) Bipartite
C) Rooted
D) Bisects
Page 7 of 46
11. 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
14. The advantage of …………….. is that they solve the problem if sequential storage representation.
But disadvantage in that is they are sequential lists.
A) Lists
B) Linked Lists
C) Trees
D) Queues
15. What will be the value of top, if there is a size of stack STACK_SIZE is 5
A) 5
B) 6
C) 4
D) None
17. There is an extra element at the head of the list called a ……….
A) Antinel
B) Sentinel
C) List header
D) List head
18. 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
Page 8 of 46
C) vertices, paths
D) graph node, edges
19. 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
20. In general, the binary search method needs no more than ……………. comparisons.
A) [log2n]-1
B) [logn]+1
C) [log2n]
D) [log2n]+1
ANSWERS:
1. B) Strongly Connected
2. A) Depth First
3. B) True, True, False
4. C) a-iii, b-i, c-ii
5. B) (N+1)/2
6. A) Linear search
7. D) True, True
8. C) Merge Sort
9. A) True, True10. B) Bipartite
11. B) 0 and -1
12. C) r=(r+1)% QUEUE_SIZE
13. C) Both i and ii
14. B) Linked Lists
15. C) 4
16. D) Traversal
17. B) Sentinel
18. A) vertices, edges
19. C) Both A and B
20. D) [log2n]+1
Page 9 of 46
B) The second subtree is called right subtree
C) The root cannot contain NULL
D) The right subtree can be empty
4. 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
8. 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
9. …………………. Is a directed tree in which out-degree of each node is less than or equal to two.
A) Unary tree
B) Binary tree
C) Trinary tree
D) Both B and C
Page 10 of 46
10. State true or false.
i) An empty tree is also a binary tree.
ii) In strictly binary tree, the out-degree of every node is either o or 2.
A) True, False
B) False, True
C) True, True
D) False, False
12. Which of the following data structure store the homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. Lists
13. When new data are to be inserted into a data structure, but there is not available space; this
situation is usually called ….
A. Underflow
B. overflow
C. houseful
D. saturated
14. 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
16. 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
17. Which of the following are the operations applicable an primitive data structures?
A. create
B. destroy
C. update
D. all of the above
Page 11 of 46
18. 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
ANSWERS:
Page 12 of 46
C) Stacks
D) Tree
8. Each node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
9. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
Page 13 of 46
10. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
ANSWERS:
8. Each node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
9. A …………………… does not keep track of address of every element in the list.
C) Linear array
Page 14 of 46
C) Both of the above
D) None of the above
4. 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
5. A ……………….. is a linear list in which insertions and deletions are made to from either end of the
structure.
A) circular queue
B) random of queue
C) priority
D) dequeue
10. A list which displays the relationship of adjacency between elements is said to be
A) linear
B) non linear
Page 15 of 46
C) linked list
D) trees
ANSWERS:
4. A linear list in which each node has pointers to point to the predecessor and successors nodes is
called as ..
C) Doubly Linked List
5. A ……………….. is a linear list in which insertions and deletions are made to from either end of the
structure.
D) dequeue
10. A list which displays the relationship of adjacency between elements is said to be
A) linear
Page 16 of 46
C) Data Management
D) Data Organization
Table of Contents
5. Match the following components of data structure based on the concept of Abstract Data Type
(ADT) with their definitions.
a) Operations i) Organizations of data implemented in lower level data structure.
b) Storage structures ii) Description on how to manipulate information in the storage structure.
c) Algorithms iii) Specifies the external appearance of data structure.
A) a-i, b-ii, c-iii
B) a-ii, b-iii, c-i
C) a-iii, b-i, c-ii
D) a-i, b-iii, c-ii
Page 17 of 46
7. Which of the following are linear type of data structure?
i) Linked list
ii) Stack
iii) Binary Tree
iv) Array
v) Queue
A) i, ii, iii and iv only
B) ii, iii, iv and v only
C) i, ii, iv and v only
D) All i, ii, iii, iv and v
10. In a binary search tree the node to be deleted will have two cases which are
i) An empty left sub-tree and non empty right sub-tree and vice versa.
ii) Non empty left sub-tree and right sub-tree.
iii) Empty left sub-tree and right sub-tree.
A) i and ii only
B) ii, and iii only
C) i and iii only
D) None of the above
ANSWERS:
1. B) Pointer
2. B) Data Structure
3. D) All i, ii, iii and iv
4. A) i, ii, iii and iv only
5. C) a-iii, b-i, c-ii
Page 18 of 46
6. D) a-iv, b-iii, c-ii, d-i
7. C) i, ii, iv and v only
8. A) i, ii and iii only
9. D) True, True, False, True, False
10. A) i and ii only
4) In the linked representation of the stack ……… behaves as the top pointer variable of stack.
A. Stop pointer
B. Begin pointer
C. Start pointer
D. Avail pointer
6) In linked representation of stack the null pointer of the last node in the list signals ……….
A. Beginning of the stack
B. Bottom of the stack
C. Middle of the stack
D. In between some value
Page 19 of 46
7) What happens when you push a new node onto a stack?
A. The new node is placed at the front of the linked list
B. The new node is placed at the back of the linked list
C. The new node is placed at the middle of the linked list
D. No Changes happens
8) A queue is a ………
A. FIFO
B. LIFO
C. FILO
D. LOFI
Page 20 of 46
C. Pop
D. Pump
17) ………. is the term used to delete an element from the stack.
A. Push
B. Pull
C. Pop
D. Pump
19) A pointer variable which contains the location at the top element of the stack is called …..
A. Top
B. Last
C. Final
D. End
ANSWERS:
Page 21 of 46
17) C. Pop
18) A. front
19) A. Top
20) D. all of the above
2) Before inserting into stack one must check the condition ………
A. Overflow
B. Underflow
C. Maximum elements
D. Existing elements
7) A queue in which insertion and deletion takes places from any position is called ……
A. circular queue
B. random of queue
C. priority
D. dequeue
Page 22 of 46
8) Deletion in the linked stack takes place by deleting ……..
A. Node pointed by the start process.
B. End of the list
C. Beginning of the list
D. Middle of the list
13) 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
15) The various operations that can be performed on stacks is/are …..
A. Insert an item into the stack
B. Delete an item from the stack
C. Display the contents of the stack
D. All of the above
16) …………. is a collection of elements such that each element has been assigned a processing
priority.
A. Priority queue
Page 23 of 46
B. Procedure queue
C. Main queue
D. Interrupt queue
18) Link fields holds pointers to the ………. element in the linked representation of stack.
A. Neighboring
B. Last
C. First
D. Middle
20) Reversing a great deal of space for each stack in memory will ………..
A. Decrease the numbers of times overflow may occur
B. Increase the numbers of times overflow may occur
C. Increase the number of times underflow may occur
D. Increase the number of times underflow may occur
ANSWERS:
1) C. circular
2) A. Overflow
3) C. double-ended queue
4) B. Underflow
5) D. both the ends
6) A. Before insertion
7) C. priority
8) A. Node pointed by the start process
9) A. FIFO lists
10) A. Front=Null
11) B. Special queue
12) C. An element is added in a queue
13) D. All of the above
14) A. Double-ended queue
15) D. All of the above
16) A. Priority queue
17) C. pop
18) A. Neighboring
19) C. top
20) A. Decrease the numbers of times overflow may occur
Page 24 of 46
SOLVED MCQ ON TREE AND GRAPH IN DATA
STRUCTURE SET-1
1) The operation of processing each element in the list is known as ……
A. sorting
B. merging
C. inserting
D. traversal
4) 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
7) Trees are said ………. if they are similar and have the same contents at corresponding nodes.
A. Duplicate
B. Carbon copy
C. Replica
D. Copies
Page 25 of 46
C. A tree d
D. All of the above
9) Every node N in a binary tree T except the root has a unique parent called the ……… of N.
A. Antecedents
B. Predecessor
C. Forerunner
D. Precursor
Read Also: Interview Questions on Stack and Queue in Data Structure set-2
14) 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
Page 26 of 46
17) In a 2-tree, nodes with 0 children are called …………
A. Exterior node
B. Outside node
C. Outer node
D. External node
Answers:
1) D. traversal
2) D. Digraph
3) A. Threaded trees
4) C. Unliterally connected
5) B. Terminal nodes
6) A. free graph
7) D. Copies
8) D. All of the above
9) B. Predecessor
10) D. both b and c
11) A. Array with pointers
12) D. All of the above
13) C. Empty
14) C. extended binary tree
15) C. 3
16) D. Dn = log2n+1
17) D. External node
18) C. Root, Left sub-tree, Right sub-tree
19) C. Internal node
20) B. Leaf
Page 27 of 46
MCQ QUESTIONS ON TREE AND GRAPH IN DATA
STRUCTURE SET-2
1) The post-order traversal of the binary tree is DEBFCA. Find out the pre-order traversal.
A. ABFCDE
B. ADBFEC
C. ABDECF
D. ABDCEF
2) While converting the binary tree into an extended binary tree, all the original nodes in the binary
tree are …….
A. Internal nodes on extended tree
B. External nodes on extended tree
C. Vanished on extended tree
D. Intermediate nodes on extended tree
3) The in-order traversal of the tree will yield a sorted listing of elements of tree in ……..
A. binary trees
B. binary search trees
C. heaps
D. binary heaps
4) In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in
the tree for efficiency. These special pointers are called ………
A. Leaf
B. Branch
C. Path
D. Thread
6) The in-order traversal of the tree will yield a sorted listing of elements of tree in…
A. Binary trees
B. Binary search trees
C. Merging
D. AVL Trees
Page 28 of 46
8) 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. E2 tree
10) The post order traversal of a binary tree is DEBFCA. Find out the pre-order Traversal.
A. ABFCDE
B. ADBFEC
C. ABDECF
D. ABDCEF
12) In-order traversing a tree resulted in E A C K F H D B G; the pre-order traversal would return.
A. FAEKCDBHG
B. FAEKCDHGB
C. EAFKHDCBG
D. FEAKDCHBG
14) In the linked representation of Binary trees LEFT[k] contains the …….. of at the node N, where k is
the location.
A. Data
B. Location and left child
C. Right child address
D. Null value
Page 29 of 46
16) Three standards ways of traversing a binary tree T with root R …….
A. Prefix, infix, postfix
B. Pre-process, in-process, post-process
C. Pre-traversal, in-traversal, post-traversal
D. Pre-order, in-order, post-order
17) A graph is said to be ……. if every node u in G is adjacent to every other node v in G.
A. Absolute
B. Entire
C. Inclusive
D. Complete
18) In threaded binary tree ……… points to higher nodes in the tree.
A. Info
B. Root
C. Threads
D. Child
Answers:
1) C. ABDECF
2) A. Internal nodes on extended tree
3) B. binary search trees
4) D. Thread
5) B. values in a node is greater than every value in children of it.
6) B. Binary search trees
7) B. e begins at u and ends at v
8) C. Extended binary tree
9) B. complete
10) C. ABDECF
11) D. All of the above
12) B. FAEKCDHGB
13) D. All of the above
14) A. Data
15) B. complete
16) D. Pre-order, in-order, post-order
17) D. Complete
18) C. Threads
Page 30 of 46
19) C. Lebeled
20) C. Both left & right subtrees are empty
2. For finding a node in a …………………, at each stage we ideally reduce the number of nodes we have
to check by half.
A) binary tree
B) binary search tree
C) AVL tree
D) binary heap tree
3. In the best case of BST, the time is on the order of ……………………, but in the worst case it requires
linear time.
A) log₂n
B) n
C) log₂(n+1)
D) n+1
4. …………………. of binary search tree starts by visiting the current node, then its left child and then its
right child.
A) Preorder traversal
B) In-order traversal
C) Linear traversal
D) Post-order traversal
5. The order with which the nodes are inserted affects the running time of the ……………………. search
algorithm.
A) AVL Tree
B) Red-Black Tree
C) Binary Search Tree
D) Binary Heap Tree
6. ……………….. of binary search tree starts by visiting the current node’s left child, then its right child
and finally the current node itself.
A) Preorder
B) In-order
C) Linear
D) Post-order
Page 31 of 46
7. With an ideal balance, the running time for inserts, searches and deletes, even in the worst case is
………………………
A) log₂n
B) n
C) log₂(n+1)
D) n+1
8. In binary search tree, a …………………. exists if starting from some node n there exists a path that
returns to n.
A) cycle
B) node
C) root
D) subtree
9. In binary search tree, a …………………… rooted to node n is the tree formed by imaging node n was a
root.
A) cycle
B) node
C) root
D) subtree
10. …………………………… is a binary search tree whose left subtree and right subtree differ in height by
at most 1 unit and whose left and right subtrees are themselves AVL trees.
A) Red-Black Tree
B) AVL Tree
C) Binary Head Tree
D) A-A Tree
11. ………………… is a binary search tree whose leaves are external nodes.
A) Red-Black Tree
B) AVL Tree
C) Binary Heap Tree
D) A-A Tree
13. A lemma is a red-black tree with n internal nodes has height at most ……………
A) 2lg(n)
B) 2n
C) 2lg(n+1)
D) n+1
14. While inserting into ………………………….., insertions are done at a leaf and will replace an external
node with an internal node with two external children.
A) red-black tree
Page 32 of 46
B) AVL tree
C) binary search tree
D) binary heap tree
15. For an AVL tree ………………………….. is the additional piece of information which indicates if the
difference in height between the left and right subtree is the same or if not, which of the two
subtrees has height one unit larger.
A) tree factor
B) balance factor
C) additional factor
D) unit factor
16. ………………… is a complete binary tree, that is completely filled except possibly at the bottom
level.
A) Red-Black Tree
B) AVL Tree
C) Binary Heap Tree
D) A-A Tree
17. In a …………………….. for every node X with a parent P, the key in P is less than or equal to the key
in X.
A) red-black
B) AVL
C) binary search
D) binary heap
18. An insertion into a ……………………….. is performed by inserting the new node in the location
referenced by next in the array and then “sifting it up” by comparing the key of the newly inserted
node with the key of the parent.
A) red-black
B) AVL
C) binary search
D) binary heap
19. While deleting nodes from a binary heap, …………………. node is replaced by the last leaf in the
tree.
A) left leaf
B) right leaf
C) root
D) cycle
Answers
Page 33 of 46
3. A) log₂n
4. A) Preorder traversal
5. C) Binary Search Tree
6. D) Post-order
7. A) log₂n
8. A) cycle
9. D) subtree
10. B) AVL Tree
11. A) Red-Black Tree
12. B) i, iii and iv only
13. C) 2lg(n+1)
14. A) red-black tree
15. B) balance factor
16. C) Binary Heap Tree
17. D) binary heap
18. D) binary heap
19. C) root
20.C) 1.44 lg n
Page 34 of 46
B. Circular header list
C. Linked list with header and trailer nodes
D. List traversed in two directions
11) In a linked list the ………. field contains the address of next element in the list.
A. Link field
B. Next element field
C. Start field
D. Info field
Table of Contents
READ ALSO: MCQ ON SEARCHING, MERGING AND SORTING METHODS IN DATA STRUCTURE
Page 35 of 46
13) ………. refers to a linear collection of data items.
A. List
B. Tree
C. Graph
D. Edge
16) A …….. is a linear list in which insertions and deletions are made to from either end of the
structure.
A. circular queue
B. random of queue
C. priority
D. dequeue
17) Indexing the …….. element in the list is not possible in linked lists.
A. middle
B. first
C. last
D. any where in between
18) A linear list in which the pointer points only to the successive node is ……
A. singly linked list
B. circular linked list
C. doubly linked list
D. none of the above
19) ………. may take place only when there is some minimum amount(or) no space left in free storage
list.
A. Memory management
B. Garbage collection
C. Recycle bin
D. Memory management
20) A linear list in which the last node points to the first node is ……..
A. singly linked list
B. circular linked list
C. doubly linked list
D. none of the above
ANSWERS:
Page 36 of 46
1) B. the size of the structure and the data in the structure are constantly changing.
2) D. traversal
3) A. Underflow
4) A. 2
5) D. List traversed in two directions
6) B. AVAIL
7) A. 0
8) C. circular linked list
9) B. Two fields
10) A. first record of the actual data
11) A. Link field
12) B. predecessor node
13) A. List
14) A. small batches of records from a file
15) B. Sentinel
16) D. dequeue
17) A. middle
18) A. singly linked list
19) B. Garbage collection
20) B. circular linked list
3) A ….. list is a header list where the node points back to the header node.
A. Circular header
B. Grounded header
C. Two-way header
D. One way header
Page 37 of 46
5) Header linked lists are frequently used for maintaining …….. in memory.
A. Polynomials
B. Binomial
C. Trinomial
D. Quadratic equation
6) The pointer that points to the first node in the list is ……..
A. FIRST
B. AVAIL
C. TOP
D. REAR
9) The list that requires two pointer variables FIRST and LAST is called ……..
A. Circular list
B. Header list
C. One way list
D. Two-way list
Read Also: Solved MCQ on List and Linked List in Data Structure
10) If the availability list is null, then the condition is said to be ………
A. nil block
B. availability list underflow
C. availability list overflow
D. memory loss
11) The list which has its own pointer is called ……..
A. pointer list
B. self pointer
C. free pool
D. own pointer
13) A ………. is a header list where the last node contains the null pointer.
A. grounded header list
Page 38 of 46
B. bottom header list
C. down header list
D. dropped header list
15) A …………. is a header list where the last node points back to the header node.
A. rounded header list
B. circular header list
C. common header list
D. forward header list
19) Which of the following conditions checks available free space in the avail list?
A. Avail=Null
B. Null=Avail
C. Avail=Max stack
D. Avail=Top
20) A linear list in which each node has pointed to the predecessor and successors nodes is called
……..
A. singly linked list
B. circular linked list
C. doubly linked list
D. linear linked list
Answers:
1) B. Avail list
2) B. one way chain
3) A. Circular header
Page 39 of 46
4) C. 2
5) A. Polynomials
6) A. FIRST
7) B. Linear arrays
8) C. two way chain
9) D. Two way list
10) B. availability list underflow
11) C. free pool
12) D. None of the above
13) A. grounded header list
14) A. successor node
15) B. circular header list
16) D. All of the above
17) C. 3
18) A. it is possible to get into an infinite loop
19) A. Avail=Null
20) C. doubly linked list
5) Sorting a file F usually refers to sorting F with respect to a particular key called …..
A. Basic key
B. Primary key
Page 40 of 46
C. Starting key
D. Index key
7) Selection sort first finds the ………. element in the list and put it in the first position.
A. Middle element
B. Largest element
C. Last element
D. Smallest element
9) The operation that combines the element is of A and B in a single sorted list C with n=r+s element
is called ….
A. Inserting
B. Mixing
C. Merging
D. Sharing
Read Also: Objective Questions on List and Linked List in Data Structure set-2
11) ………. sorting is good to use when alphabetizing a large list of names.
A. Merge
B. Heap
C. Radix
D. Bubble
13) Which of the following sorting algorithm is of divide and conquer type?
A. Bubble sort
B. Insertion sort
Page 41 of 46
C. Quicksort
D. Merge sort
15) The function used to modify the way of sorting the keys of records is called ……..
A. Indexing function
B. Hash function
C. Addressing function
D. All of the above
16) If the number of record to be sorted large and the key is short, then …… sorting can be efficient.
A. Merge
B. Heap
C. Radix
D. Bubble
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. Bubble
Answers:
1) C. Searching
2) C. Merge Sort
3) A. Insertion sort
4) D. Tree Sort
5) B. Primary key
Page 42 of 46
6) D. O(n logn)
7) D. Smallest element
8) D. partition and exchange sort
9) C. Merging
10) C. heap
11) C. Radix
12) D. selection sort
13) C. Quick sort
14) A. k way merging
15) B. Hash function
16) C. Radix
17) A. O(n logn)
18) C. Quick
19) D. O(n logn)
20) B. O(n2)
3) The complexity of the 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
Page 43 of 46
C. when the item is the last element in the array
D. Item is the last element in the array or item is not there at all
12) ………. 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
Page 44 of 46
13) …………order is the best possible for array sorting algorithm which sorts n item.
A. O(n logn)
B. O(n2)
C. O(n+logn)
D. O(logn)
14) ……… is rearranging pairs of elements which are out of order, until no such pairs remain.
A. Insertion
B. Exchange
C. Selection
D. Distribution
16) Which of the following sorting algorithm is of divide and conquer type?
A. Bubble sort
B. Insertion sort
C. Merge sort
D. Selection sort
17) …….. sorting algorithm is frequently used when n is small where n is total number of elements.
A. Heap
B. Insertion
C. Bubble
D. Quick
18) Which of the following sorting algorithm is of priority queue sorting type?
A. Bubble sort
B. Insertion sort
C. Merge sort
D. Selection sort
19) Which of the following is not the required condition for a binary search algorithm?
A. The list must be sorted
B. There should be direct access to the middle element in any sublist
C. There must be a mechanism to delete and/or insert elements in the list.
D. Number values should only be present
ANSWERS:
Page 45 of 46
3) B. running time
4) D. binary search algorithm is not efficient ..
5) A. when the item is somewhere in the middle ..
6) A. sorted linked list
7) A. O(n)
8) C. Both of the above
9) C. O(n2)
10) B. i-True, ii-False
11) D. O(n logn)
12) A. Insertion
13) C. O(n+logn)
14) B. Exchange
15) A. Radix sort
16) C. Merge sort
17) B. Insertion
18) D. Selection sort
19) C. There must be a mechanism to delete and/or insert elements in the list.
20) A. quick sort
Page 46 of 46