MCQ's on Data Structure & Algorithm

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

counting the maximum memory needed by the algorithm
counting the minimum memory needed by the algorithm
counting the average memory needed by the algorithm
counting the maximum disk space needed by the algorithm

MCQ 2:
Linked lists are best suited

for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for None of the above situation

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

internal change
inter-module change
side effect
side-module update

MCQ 4:
In linear search algorithm the worst case occurs when?

The item is somewhere in the middle of the array
The item is not in the array at all
The item is the last element in the array
The item is the last element in the array or is not there at all

MCQ 5:
For an algorithm the complexity of the average case is ?

Much more complicated to analyze than that of worst case
Much more simpler to analyze than that of worst case
Sometimes more complicated and some other times simpler than that of worst case
None or above

MCQ 6:
The complexity of merge sort algorithm is _____________

O(n)
O(log n)
O(n²)
O(n log n)

MCQ 7:
When determining the efficiency of algorithm the time factor is measured by ______________________.

counting microseconds
counting the number of key operations
counting the number of statements
counting the kilobytes of algorithm

MCQ 8:
Why the elements of an array are stored successively in memory cells?

Because bythis way computer can keep track only the address of the first element and the addresses of other elements can be calculated
Because the architecture of computer memory does not allow arrays to store other than serially
Both A and B
None of the above

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

Arrays
Linked lists
Both of above
None of the above

MCQ 10:
The Average case occur in linear search algorithm.

When Item is somewhere in the middle of the array
When Item is not in the array at all
When Item is the last element in the array
When Item is the last element in the array or is not there at all

MCQ 11:
Two main measures for the efficiency of an algorithm are _____________________.

processor and memory
complexity and capacity
time and space
data and space

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

Traversal
Search
Sort
None of the above

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

Best case
Worst case
Average case
Null case

MCQ 14:
The operation of processing each element in the list is known as _______________.

Sorting
Merging
Inserting
Traversal

MCQ 15:
Each array declaration need not give, implicitly or explicitly, the information about

the name of array
the data type of array
the first data from the set to be stored
the index set of the array

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

Elementary items
Atoms
Scalars
All of above

MCQ 17:
Which of the following is two way list?

Grounded header list
Circular header list
Linked list with header and trailer nodes
None of the above

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

FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG

MCQ 19:
The memory address of the first?element?of an array is called

floor address
foundation address
first address
base address

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

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

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

FIFO lists
LIFO list
Piles
Push-down lists

MCQ 22:
The term push and pop is related to the

Array
Lists
Stacks
All of above

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

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

MCQ 24:
Two dimensional arrays are also called _____________________.

Tables arrays
Matrix arrays
Both A and B
None of the above

MCQ 25:
The situation when in a linked list START = NULL is _____________________.

underflow
overflow
housefull
saturated

MCQ 26:
A variable P is called pointer if

P contains the address of an element in DATA
P points to the address of first element in DATA
P can store only memory addresses
P contain the DATA and the address of DATA

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

Arrays
Records
Pointers
None

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

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

MCQ 29:
Binary search algorithm can not be applied to the

sorted linked list
sorted binary trees
sorted linear array
pointer array

MCQ 30:
___________________ is not an operation performed on linear list

Insertion
Insertion & Deletion
Deletion & Traversal
None of the above

MCQ 31:
The complexity of Binary search algorithm is

O(n)
O(log )
O(n²)
O(n log n)

MCQ 32:
Any node is the path from the root to the node is called?

Successor node
Ancestor node
Internal node
None of the above

MCQ 33:
The word "Stack" is also known as _________________.

Last in first out
First in last out
Last in last out
First in first out

MCQ 34:
An adjacency matrix representation of a graph cannot contain information of

nodes
edges
direction of edges
parallel edges

MCQ 35:
A linear collection of data elements where the linear node is given by means of pointer is called

linked list
node list
primitive list
None of these

MCQ 36:
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

row major
column major
matrix major
None of the above

MCQ 37:
The property of binary tree is

the first subset is called left subtree
the second subtree is called right subtree
the root cannot contain NULL
the right subtree can be empty

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

AVL tree
Red-black tree
Lemma tree
None of the above

MCQ 39:
Representation of data structure in memory is known as _________________.

recursive
abstract data type
storage structure
file structure

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

Function calls
Large number Arithmetic
Evaluation of arithmetic expressions
All of the above

MCQ 41:
________________ is a pile in which items are added at one end and removed from the other.

Stack
Queue
List
None of the above

MCQ 42:
__________________ is not the component of data structure.

Operations
Storage Structures
Algorithms
None of the above

MCQ 43:
_________________ is very useful in situation when data have to stored and then retrieved in reverse order.

Stack
Queue
List
Link list

MCQ 44:
___________________ level is where the model becomes compatible executable code

Abstract level
Application level
Implementation level
All of the above

MCQ 45:
Which of the following is true about the characteristics of abstract data types?
A) It exports a set of operations
B) It exports a type

True, False
False, True
True, True
False, False

MCQ 46:
Which of the following is not the part of ADT description?

Data
Operations
Both of the above
None of the above

MCQ 47:
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.

push, pop
pop, push
insert, delete
delete, insert

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

Stacks
Queues
Dequeues
Binary search tree

MCQ 49:
Which of the following data structure can?t store the non-homogeneous data elements?

Arrays
Records
Pointers
Stacks

MCQ 50:
Process of inserting an element in stack is called __________________.

Create
Push
Evaluation
Pop

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

Underflow
Garbage Collection
Overflow
Empty collection

MCQ 52:
Process of removing an element from stack is called __________

Create
Push
Evaluation
Pop

MCQ 53:
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.

Queue linked list
Stacks linked list
Both of them
Neither of them

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

Stacks
List
Strings
Trees

MCQ 55:
Herder node is used as sentinel in _________________.

Graphs
Stacks
Binary tree
Queues

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

Stack
queue
Tree
Array

MCQ 57:
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

Input restricted dequeue
Output restricted qequeue
Priority queues
Stack

MCQ 58:
Which of the following data structure is non linear type?

Strings
Lists
Stacks
Graph

MCQ 59:
Which of the following applications may use a stack?

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

MCQ 60:
Which of the following data structure is linear type?

Graph
Trees
Binary tree
Stack

MCQ 61:
To represent hierarchical relationship between elements, Which data structure is suitable?

Dequeue
Priority
Tree
Graph

MCQ 62:
Which of the statement(s) about stack data structure is/are NOT correct?

Null link is present in the last node at the bottom of the stack
Linked List are used for implementing Stacks
Top of the Stack always contain the new node
Stack is the FIFO data structure

MCQ 63:
A directed graph is _________________ if there is a path from each vertex to every other vertex in the digraph.

weakly connected
strongly Connected
tightly Connected
linearly Connected

MCQ 64:
In the _________________ traversal we process all of a vertex?s descendants before we move to an adjacent vertex.

depth first
breadth first
with first
depth limited

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

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

MCQ 66:
The number of comparisons done by sequential search is _____________________.

(n/2) + 1
(n+ 1)/2
(n - 1)/2
(n + 2)/2

MCQ 67:
In _________________ search start at the beginning of the list and check every element in the list.

linear search
binary search
hash Search
binary tree search

MCQ 68:
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).

True, False
False, True
False, False
True, True

MCQ 69:
Which of the following is not the internal sort?

Insertion Sort
Bubble Sort
Merge Sort
Heap Sort

MCQ 70:
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.

True, True
False, True
False, False
True, False

MCQ 71:
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.

partite
bipartite
rooted
bisects

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

0 and 1
0 and -1
-1 and 0
1 and 0

MCQ 73:
In a circular queue the value of r will be _________________ .

r = r + 1
r = (r + 1) % [QUEUE_SIZE - 1]
r = ( r + 1) % QUEUE_SIZE
r = ( r - 1) % QUEUE_SIZE

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

Reversing a string
Implementation of recursion
Job scheduling
Evaluation of postfix expression

MCQ 75:
Which of the following statement is true?
i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.
ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

i-only
ii-only
Both i and ii
None of both

MCQ 76:
The advantage of ____________________ is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

Lists
Linked Lists
Trees
Queues

MCQ 77:
What will be the value of top, if there is a size of stack STACK_SIZE is 5

5
6
4
None

MCQ 78:
_______________ is not the operation that can be performed on queue.

Insertion
Deletion
Retrieval
Traversal

MCQ 79:
There is an extra element at the head of the list called a __________________.

Antinel
Sentinel
List header
List head

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

vertices, edges
edges, vertices
vertices, paths
graph node, edges

MCQ 81:
A _____________ is a graph that has weights of costs associated with its edges.

Network
Weighted graph
Both A and B
None A and B

MCQ 82:
In general, the binary search method needs no more than ________________ comparisons.

[log2n] - 1
[logn] + 1
[log2n]
[log2n] + 1

MCQ 83:
Which of the following is not the type of queue?

Ordinary queue
Single ended queue
Circular queue
Priority queue

MCQ 84:
State true or false.
i) The degree of root node is always zero.
ii) Nodes that are not root and not leaf are called as internal nodes.

True, True
True, False
False, True
False, False

MCQ 85:
Any node is the path from the root to the node is called?

Successor node
Ancestor node
Internal node
None of the above

MCQ 86:
Which statement is true or false.
A) A node is a parent if it has successor nodes.
B) A node is child node if out degree is one.

True, True
True, False
False, True
False, False

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

Directed tree
Undirected tree
Dis-joint tree
Direction oriented tree

MCQ 88:
_______________ is a directed tree in which outdegree of each node is less than or equal to two.

Unary tree
Binary tree
Trinary tree
Both B and C

MCQ 89:
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 0 or 2.

True, False
False, True
True, True
False, False

MCQ 90:
When new data are to be inserted into a data structure, but there is not available space; this situation is usually called _____________________.

Underflow
overflow
houseful
saturated

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

linked lists
stacks
queues
dequeue

MCQ 92:
Operations on a data structure may be _________________.

creation
destruction
selection
all of the above

MCQ 93:
The way in which the data item or items are logically related defines _____________________.

storage structure
data structure
data relationship
data operation

MCQ 94:
Which of the following are the operations applicable an primitive data structures?

create
destroy
update
all of the above

MCQ 95:
The use of pointers to refer elements of a data structure in which elements are logically adjacent is _________________.

pointers
linked allocation
stack
queue

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

Exterior node
Outside node
Outer node
External node

MCQ 97:
Arrays are best data structures

for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for non of above situation

MCQ 98:
Which of the following statement is false?

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

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

Prefix Expression
Infix Expression
Postfix Expression
Both Prefix and Postfix Expressions

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

Strings
Lists
Stacks
Tree

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

Abstract level
Application level
Implementation level
All of the above

MCQ 102:
The logical or mathematical model of a particular organization of data is called a ___________.

Data structure
Data arrangement
Data configuration
Data formation

MCQ 103:
The simplest type of data structure is _________________.

Multidimensional array
Linear array
Two dimensional array
Three dimensional array

MCQ 104:
Which of the following data structures are indexed structures?

Linear arrays
Linked lists
Graphs
Trees

MCQ 105:
A ________________ does not keep track of address of every element in the list.

Stack
String
Linear array
Queue

MCQ 106:
Which of the following data structure is linear type?

Array
Tree
Graphs
Hierarchy

MCQ 107:
Linear arrays are also called ____________________.

Straight line array
One-dimensional array
Vertical array
Horizontal array

MCQ 108:
Which of the following data structures are indexed structures?

Linear arrays
Linked lists
Graphs
Trees

MCQ 109:
Each node in a linked list has two pairs of ______________ and __________________.

Link field and information field
Link field and avail field
Avail field and information field
Address field and link field

MCQ 110:
When does top value of the stack changes?

Before deletion
While checking underflow
At the time of deletion
After deletion

MCQ 111:
Which of the following data structure is not linear data structure?

Arrays
Linked lists
Both of the above
None of the above

MCQ 112:
The disadvantage in using a circular linked list is ________________.

It is possible to get into infinite loop.
Last node points to first node.
Time consuming
Requires more memory space

MCQ 113:
The complexity of selection sort is ______________.

O(n)
O(n²)
O(n logn)
O(logn)

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

Singly Linked List
Circular Linked List
Doubly Linked List
Linear Linked List

MCQ 115:
A ________________ is a linear list in which insertions and deletions are made to from either end of the structure.

circular queue
random of queue
priority
dequeue

MCQ 116:
In a priority queue, insertion and deletion takes place at __________________

front, rear end
only at rear end
only at front end
any position

MCQ 117:
Which of the following is an application of stack?

finding factorial
tower of Hanoi
infix to postfix conversion
all of the above

MCQ 118:
The data structure which is one ended is _______________.

queue
stack
tree
graph

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

linear
non linear
linked list
tree

MCQ 120:
The time factor when determining the efficiency of algorithm is measured by

Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm

MCQ 121:
A singly linked list is also called as _____________.

linked list
one way chain
two way chain
right link

MCQ 122:
The space factor when determining the efficiency of algorithm is measured by

Counting the maximum memory needed by the algorithm
Counting the minimum memory needed by the algorithm
Counting the average memory needed by the algorithm
Counting the maximum disk space needed by the algorithm

MCQ 123:
The complexity of Bubble sort algorithm is

O(n)
O(log n)
O(n²)
O(n log n)

MCQ 124:
The indirect change of the values of a variable in one module by another module is called _________________.

internal change
inter-module change
side effect
side-module update

MCQ 125:
Which of the following data structure is not linear data structure?

Arrays
Linked lists
Both of above
None of the above

MCQ 126:
Which of the following data structure is linear data structure?

Trees
Graphs
Arrays
None of the above

MCQ 127:
Other name for directed graph is _________________ .

Direct graph
Digraph
Dir-graph
Digraph

MCQ 128:
Binary trees with threads are called as _____________.

Threaded trees
Pointer trees
Special trees
Special pointer trees

MCQ 129:
If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?

ABDC
DCAB
DCBA
ABCD

MCQ 130:
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.

Literally connected
Widely Connected
Unliterally connected
Literally connected

MCQ 131:
In Binary trees nodes with no successor are called _________________.

End nodes
Terminal nodes
Final nodes
Last nodes

MCQ 132:
A connected graph T without any cycles is called ________________.

free graph
no cycle graph
non cycle graph
circular graph

MCQ 133:
Trees are said ___________________ if they are similar and have same contents at corresponding nodes.

Duplicate
Carbon copy
Replica
Copies

MCQ 134:
Every node N in a binary tree T except the root has a unique parent called the ____________ of N.

Antecedents
Predecessor
Forerunner
Precursor

MCQ 135:
In a graph if E = (u, v) means _____________

u is adjacent to v but v is not adjacent to u
e begins at u and ends at v
u is processor and v is successor
both b and c

MCQ 136:
Sequential representation of binary tree uses _________________.

Array with pointers
Single linear array
Two dimensional arrays
Three dimensional arrays

MCQ 137:
In a graph if e = [u, v], Then u and v are called _________________ .

End points of e
Adjacent nodes
Neighbors
All of the above

MCQ 138:
TREE[1] = NULL indicates tree is _____________________.

Overflow
Underflow
Empty
Full

MCQ 139:
A binary tree whose every node has either zero or two children is called ________________.

complete binary tree
binary search tree
extended binary tree
data structure

MCQ 140:
Linked representation of binary tree needs _________________ parallel arrays.

4
2
3
5

MCQ 141:
The depth of complete binary tree is given by ________________.

Dn = log 2 (n+1)
Dn = log 1/2 (n+1)
Dn = log (n+1)
Dn = log 2 (n-1)

MCQ 142:
Which indicates pre-order traversal?

Left sub-tree, Right sub-tree and root
Right sub-tree, Left sub-tree and root
Root, Left sub-tree, Right sub-tree
Right sub-tree, root, Left sub-tree

MCQ 143:
In a extended-binary tree nodes with 2 children are called ?

Interior node
Domestic node
Internal node
Inner node

MCQ 144:
A terminal node in a binary tree is called ?

Root
Leaf
Child
Branch

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

Bubble sort
Insertion sort
Merge sort
Selection sort

MCQ 146:
The queue in which the insertion takes place in the first position after of last element is a _____________________.

priority
dequeue
circular
linked

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

Overflow
Underflow
Maximum elements
Existing elements

MCQ 148:
The another name of dequeue is _____________.

divided queue
distributed queue
double ended queue
design queue

MCQ 149:
Before deletion condition into stack __________________ has to be checked.

Overflow
Underflow
Maximum elements
Existing elements

MCQ 150:
When does Top value of stack change in insertion process?

Before insertion
After insertion
At the time of insertion
While checking overflow

MCQ 151:
Deletion in the linked stack takes place by deleting ___________________.

a node pointed by the start process.
end of the list
beginning of the list
middle of the list

MCQ 152:
The condition _________________ indicate the queue is empty.

Front = Null
Null = Front
Front = Rear
Rear = Null

MCQ 153:
Which of the following is not the type of queue?

Ordinary queue
Special queue
Priority queue
Circular queue

MCQ 154:
The value of REAR is increased by 1 when ______________.

An element is deleted in a queue
An element is traversed in a queue
An element is added in a queue
An element is merged in a queue

MCQ 155:
The operations that can be done in a circular queue is/are __________________.

Insert from the front end
Delete from front end
Display queue contents
All of the above

MCQ 156:
The term dequeue is the contraction of the name ________________.

Double ended queue
Double sided queue
Double headed queue
Double address queue

MCQ 157:
The various operations that can be performed on stacks is/are

Insert an item into the stack
Delete an item from the stack
Display the contents of the stack
All of the above

MCQ 158:
_______________ is a collection of elements such that each element has been assigned a processing priority.

Priority queue
Procedure queue
Main queue
Interrupt queue

MCQ 159:
The deletion operation in stack is called _____________.

insert
push
pop
top

MCQ 160:
Link fields holds pointers to the _______________ element in the linked representation of stack.

middle
last
first
neighboring

MCQ 161:
The pointer associated with the stack is _____________.

front
rear
top
link

MCQ 162:
Reversing a great deal of space for each stack in memory will be.

Decrease the numbers of times overflow may occur
Increase the numbers of times overflow may occur
Increase the number of times underflow may occur
Increase the number of times underflow may occur

MCQ 163:
Finding the location of a given item in a collection of items is called _________________.

discovering
finding
searching
mining

MCQ 164:
Which of the following is an external sorting?

Insertion Sort
Bubble Sort
Merge Sort
Tree Sort

MCQ 165:
Very slow way of sorting is _______________.

Insertion sort
Heap sort
Bubble sort
Quick sort

MCQ 166:
Which of the following is an internal sorting?

Tape Sort
2-way Merge Sort
Merge Sort
Tree Sort

MCQ 167:
Sorting a file F usually refers to sorting F with respect to a particular key called _________________

Basic key
Primary key
Starting key
Index key

MCQ 168:
The time complexity of quick sort is __________________.

O(n)
O(logn)
O(n2)
O(n logn)

MCQ 169:
The total number of comparisons in a bubble sort is _________________.

O(n logn)
O(2n)
O(n²)
O(n)

MCQ 170:
Selection sort first finds the ______________ element in the list and put it in the first position.

Middle element
Largest element
Last element
Smallest element

MCQ 171:
Quick sort is also known as _________________

merge sort
tree sort
shell sort
partition and exchange sort

MCQ 172:
The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called _____________.

Inserting
Mixing
Merging
Sharing

MCQ 173:
A tree sort is also known as _________________ sort.

quick
shell
heap
selection

MCQ 174:
_______________ sorting is good to use when alphabetizing large list of names.

Merge
Heap
Radix
Bubble

MCQ 175:
The easiest sorting is ____________________.

quick sort
shell sort
heap sort
selection sort

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

Bubble sort
Insertion sort
Quick sort
Merge sort

MCQ 177:
Merging k sorted tables into a single sorted table is called ________________.

k way merging
k th merge
k + 1 merge
k - 1 merge

MCQ 178:
The function used to modify the way of sorting the keys of records is called _____________.

Indexing function
Hash function
Addressing function
All of the above

MCQ 179:
If the number of record to be sorted large and the key is short, then ____________ sorting can be efficient.

Merge
Heap
Radix
Bubble

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

Merge
Heap
Quick
Bubble

MCQ 181:
The time complexity of heap sort is ________________.

O(n)
O(logn)
O(n²)
O(n logn)

MCQ 182:
If the number of records to be sorted is small, then _______________ sorting can be efficient.

Merge
Heap
Selection
Bubble

MCQ 183:
The complexity of sorting algorithm measures the _______________ as a function of the number n of items to be sorter.

average time
running time
average-case complexity
case-complexity

MCQ 184:
Complexity of linear search algorithm is _____________.

O(n)
O(logn)
O(n²)
O(n logn)

MCQ 185:
Sorting algorithm can be characterized as _________________.

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

MCQ 186:
For an internal sorting algorithms, which statement is True or False.
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.
B) The time required to read or write is considered to be significant in evaluating the performance of internal sorting.

Both A and B are true statements
Statement A is true and B is false
Statement A is false and B is true
Both A and B are false statements

MCQ 187:
_____________ is putting an element in the appropriate place in a sorted list yields a larger sorted order list.

Insertion
Extraction
Selection
Distribution

MCQ 188:
_____________ order is the best possible for array sorting algorithm which sorts n item.

O(n logn)
O(n²)
O(n+logn)
O(logn)

MCQ 189:
_____________ is rearranging pairs of elements which are out of order, until no such pairs remain.

Insertion
Exchange
Selection
Distribution

MCQ 190:
_____________ is the method used by card sorter.

Radix sort
Insertion
Heap
Quick

MCQ 191:
_____________ sorting algorithm is frequently used when n is small where n is total number of elements.

Heap
Insertion
Bubble
Quick

MCQ 192:
Which of the following sorting algorithm is of priority queue sorting type?

Bubble sort
Insertion sort
Merge sort
Selection sort

MCQ 193:
Which of the following is not the required condition for binary search algorithm?

The list must be sorted
There should be the direct access to the middle element in any sub list
There must be mechanism to delete and/or insert elements in list.
Number values should only be present

MCQ 194:
Partition and exchange sort is _________________ .

quick sort
tree sort
heap sort
bubble sort