Multiple
Choice Questions and Answers:-
1.
Which if 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
Answer:D
2.
A binary search tree whose left subtree and right subtree differ in hight by at
most 1 unit is called ……
A)
AVL tree
B)
Red-black tree
C)
Lemma tree
D)
None of the above
Answer:A
3.
……………….. level is where the model becomes compatible executable code
A)
Abstract level
B)
Application level
C)
Implementation level
D)
All of the above
Answer:C
4.
Stack is also called as
A)
Last in first out
B)
First in last out
C)
Last in last out
D)
First in first out
Answer:A
5.
Which of the following is true about the characteristics of abstract data
types?
i)
It exports a type.
ii)
It exports a set of operations
A)
True, False
B)
False, True
C)
True, True
D)
False, False
Answer:C
6.
…………… is not the component of data structure.
A)
Operations
B)
Storage Structures
C)
Algorithms
D)
None of above
Answer:D
7.
Which of the following is not the part of ADT description?
A)
Data
B)
Operations
C)
Both of the above
D)
None of the above
Answer:D
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
Answer:A
9.
……………. Is a pile in which items are added at one end and removed from the
other.
A)
Stack
B)
Queue
C)
List
D)
None of the above
Answer:B
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
Answer:A
11.
Which data structure allows deleting data elements from and inserting at rear?
A)
Stacks
B)
Queues
C)
Dequeues
D)
Binary search tree
Answer:B
12.
Which of the following data structure can’t store the non-homogeneous data
elements?
A)
Arrays
B)
Records
C)
Pointers
D)
Stacks
Answer:A
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.
A)
Queue linked list
B)
Stacks linked list
C)
Both of them
D)
Neither of them
Answer:A
14.
Which of the following is non-liner data structure?
A)
Stacks
B)
List
C)
Strings
D)
Trees
Answer:D
15.
Herder node is used as sentinel in …..
A)
Graphs
B)
Stacks
C)
Binary tree
D)
Queues
Answer:C
16.
Which data structure is used in breadth first search of a graph to hold nodes?
A)
Stack
B)
queue
C)
Tree
D)
Array
Answer:B
17.
Identify the data structure which allows deletions at both ends of the list but
insertion at only one end.
A)
Input restricted dequeue
B)
Output restricted qequeue
C)
Priority queues
D)
Stack
Answer:A
18.
Which of the following data structure is non linear type?
A)
Strings
B)
Lists
C)
Stacks
D)
Graph
Answer:D
19.
Which of the following data structure is linear type?
A)
Graph
B)
Trees
C)
Binary tree
D)
Stack
Answer:D
20.
To represent hierarchical relationship between elements, Which data structure
is suitable?
A)
Dequeue
B)
Priority
C)
Tree
D)
Graph
Answer:C
21.
A directed graph is ………………. if there is a path from each vertex to every other
vertex in the digraph.
A)
Weakly connected
B)
Strongly Connected
C)
Tightly Connected
D)
Linearly Connected
Answer:B
22.
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
Answer:A
23.
State True of False.
i)
Network is a graph that has weights or costs associated with it.
ii)
An undirected graph which contains no cycles is called a forest.
iii)
A graph is said to be complete if there is no edge between every pair of
vertices.
A)
True, False, True
B)
True, True, False
C)
True, True, True
D)
False, True, True
Answer:B
24.
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
Answer:C
25.
The number of comparisons done by sequential search is ………………
A)
(N/2)+1
B)
(N+1)/2
C)
(N-1)/2
D)
(N+2)/2
Answer:B
26.
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
Answer:A
27.
State True or False.
i)
Binary search is used for searching in a sorted array.
ii)
The time complexity of binary search is O(logn).
A)
True, False
B)
False, True
C)
False, False
D)
True, True
Answer:D
28.
Which of the following is not the internal sort?
A)
Insertion Sort
B)
Bubble Sort
C)
Merge Sort
D)
Heap Sort
Answer:C
29.
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
Answer:A
30.
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
Answer:B
31.
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
Answer:B
32.
In a circular queue the value of r will be ..
A)
r=r+1
B)
r=(r+1)% [QUEUE_SIZE – 1]
C)
r=(r+1)% QUEUE_SIZE
D)
r=(r-1)% QUEUE_SIZE
Answer:C
33.
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.
A)
i-only
B)
ii-only
C)
Both i and ii
D)
None of both
Answer:C
34.
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
Answer:B
35.
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
Answer:C
36.
………… is not the operation that can be performed on queue.
A)
Insertion
B)
Deletion
C)
Retrieval
D)
Traversal
Answer:D
37.
There is an extra element at the head of the list called a ……….
A)
Antinel
B)
Sentinel
C)
List header
D)
List head
Answer:B
38.
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
Answer:A
39.
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
Answer:C
40.
In general, the binary search method needs no more than ……………. comparisons.
A)
[log2n]-1
B)
[logn]+1
C)
[log2n]
D)
[log2n]+1
Answer:D
41.
Which of the following is not the type of queue?
A)
Ordinary queue
B)
Single ended queue
C)
Circular queue
D)
Priority queue
Answer:B
42.
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
Answer:D
43.
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.
A)
True, True
B)
True, False
C)
False, True
D)
False, False
Answer:C
44.
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
Answer:B
45.
State true of false.
i)
A node is a parent if it has successor nodes.
ii)
A node is child node if out degree is one.
A)
True, True
B)
True, False
C)
False, True
D)
False, False
Answer:B
46.
………………. is not an operation performed on linear list
a)
Insertion b) Deletion c) Retrieval d) Traversal
A)
only a,b and c
B)
only a and b
C)
All of the above
D)
None of the above
Answer:D
47.
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
Answer:D
48.
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
Answer:A
49.
…………………. 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
Answer:B
50.
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
Answer:C
51.
Which of the following data structures are indexed structures?
A.
Linear arrays
B.
Linked lists
C.
Queue
D.
Stack
Answer:A
52.
Which of the following data structure store the homogeneous data elements?
A.
Arrays
B.
Records
C.
Pointer
D.
Lists
Answer:B
53.
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
Answer:B
54.
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
Answer:D
55.
Operations on a data structure may be …..
A.
creation
B.
destruction
C.
selection
D.
all of the above
Answer:D
56.
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
Answer:B
57.
Which of the following are the operations applicable an primitive data
structures?
A.
create
B.
destroy
C.
update
D.
all of the above
Answer:D
58.
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
Answer:B
59.
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
Answer:A
60.
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.
Answer:C
61.
Which of the following data structure is non-linear type?
A)
Strings
B)
Lists
C)
Stacks
D)
Tree
Answer:D
62.
Which of the following data structure is linear type?
A)
Array
B)
Tree
C)
Graphs
D)
Hierarchy
Answer:A
63.
The logical or mathematical model of a particular organization of data is
called a ………
A)
Data structure
B)
Data arrangement
C)
Data configuration
D)
Data formation
Answer:A
64.
The simplest type of data structure is ………………
A)
Multidimensional array
B)
Linear array
C)
Two dimensional array
D)
Three dimensional array
Answer:B
65.
Linear arrays are also called ……………….
A)
Straight line array
B)
One-dimensional array
C)
Vertical array
D)
Horizontal array
Answer:B
66.
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 none of the above
Answer:A
67.
Which of the following data structures are indexed structures?
A)
Linear arrays
B)
Linked lists
C)
Graphs
D)
Trees
Answer:A
68.
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
Answer:A
69.
A …………………… does not keep track of address of every element in the list.
A)
Stack
B)
String
C)
Linear array
D)
Queue
Answer:C
70.
When does top value of the stack changes?
A)
Before deletion
B)
While checking underflow
C)
At the time of deletion
D)
After deletion
Answer:D
71.
Which of the following data structure is non-linear type?
A)
Strings
B)
Lists
C)
Stacks
D)
Tree
Answer:D
72.
Which of the following data structure is linear type?
A)
Array
B)
Tree
C)
Graphs
D)
Hierarchy
Answer:A
73.
The logical or mathematical model of a particular organization of data is
called a ………
A)
Data structure
B)
Data arrangement
C)
Data configuration
D)
Data formation
Answer:A
74.
The simplest type of data structure is ………………
A)
Multidimensional array
B)
Linear array
C)
Two dimensional array
D)
Three dimensional array
Answer:B
75.
Linear arrays are also called ……………….
A)
Straight line array
B)
One-dimensional array
C)
Vertical array
D)
Horizontal array
Answer:B
76.
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 none of the above
Answer:A
77.
Which of the following data structures are indexed structures?
A)
Linear arrays
B)
Linked lists
C)
Graphs
D)
Trees
Answer:A
78.
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
Answer:A
79.
Each array declaration need not give, implicitly or explicitly, the information
about
A)
the name of array
B)
the data type of array
C)
the first data from the set to be stored
D)
the index set of the array
Answer:C
80.
When does top value of the stack changes?
A)
Before deletion
B)
While checking underflow
C)
At the time of deletion
D)
After deletion
Answer:D
81.
The elements of an array are stored successively in memory cells because
A)
by this way computer can keep track only the address of the first element and
the addresses of other elements can be calculated
B)
the architecture of computer memory does not allow arrays to store other than
serially
C)
both of above
D)
none of above
Answer:A
82.
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 above situation
Answer:B
83.
Finding the location of the element with a given value is:
A)
Traversal
B)
Search
C)
Sort
D)
None of above
Answer:B
84.
The operation of processing each element in the list is known as
A)
Sorting
B)
Merging
C)
Inserting
D)
Traversal
Answer:D
85)
The complexity of the average case of an algorithm is
A)
Much more complicated to analyze than that of worst case
B)
Much more simpler to analyze than that of worst case
C)
Sometimes more complicated and some other times simpler than that of worst case
D)
None or above
Answer:A
86)
The Average case occur in linear search algorithm
)
When Item is somewhere in the middle of the array
B)
When Item is not in the array at all
C)
When Item is the last element in the array
D)
When Item is the last element in the array or is not there at all
Answer:A
87)
Which of the following case does not exist in complexity theory
A)
Best case
B)
Worst case
C)
Average case
D)
Null case
Answer:D
88)
The space factor when determining the efficiency of algorithm is measured by
A)
Counting the maximum memory needed by the algorithm
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
Answer:A
89)
The time factor when determining the efficiency of algorithm 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
Answer:B
90)
Two main measures for the efficiency of an algorithm are
A)
Processor and memory
B)
Complexity and capacity
C)
Time and space
D)
Data and space
Answer:C
91.
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 none of above situatio
Answer:A
92.
Which of the following data structure is not linear data structure?
A)
Arrays
B)
Linked lists
C)
Both of the above
D)
None of the above
Answer:D
93.
The disadvantage in using a circular linked list is …………………….
A)
It is possible to get into infinite loop.
B)
Last node points to first node.
C)
Time consuming
D)
Requires more memory space
Answer:A
94.
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
Answer:C
95.
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
Answer:D
96.
In a priority queue, insertion and deletion takes place at ………………
A)
front, rear end
B)
only at rear end
C)
only at front end
D)
any position
Answer:D
97.
The time complexity of quick sort is …………..
A)
O(n)
B)
O(n2)
C)
O(n log n)
D)
O(log n)
Answer:C
98.
Which of the following is an application of stack?
A)
finding factorial
B)
tower of Hanoi
C)
infix to postfix conversion
D)
all of the above
Answer:D
99.
The data structure which is one ended is ………………
A)
queue
B)
stack
C)
tree
D)
graph
Answer:B
100.
A list which displays the relationship of adjacency between elements is said to
be
A)
linear
B)
non linear
C)
linked list
D)
trees
Answer:A
0 Comments