Professional Documents
Culture Documents
Data Structure (DS) Solved Mcqs Set 2
Data Structure (DS) Solved Mcqs Set 2
B. linked lists
C. trees
D. queues
Answer: B
m
o of stack STACK_SIZE is 5
c
27. What will be the value of top, if there is a size
.
e
at
A. 5
B. 6
q M
C. 4
c
D. none
Answer: C
M
28. ………… is not the operation that can be performed on queue.
A. insertion
B. deletion
C. retrieval
D. traversal
Answer: D
29. 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
B. edges, vertices
C. vertices, paths
Answer: A
m
31. A ……….. is a graph that has weights of costs associated with its
o
edges.
.c
A. network
te
a
B. weighted graph
q M
C. both a and b
c
D. none a and b
Answer: C
M
32. In general, the binary search method needs no more than …………….
comparisons.
A. [log2n]-1
B. [logn]+1
C. [log2n]
D. [log2n]+1
Answer: D
C. circular queue
D. priority queue
Answer: B
Answer: D
35. Any node is the path from the root to the node is called
A. successor node
o m
.c
B. ancestor node
te
C. internal node
a
D. none of the above
q M
Answer: B c
M
36. Which is/are the application(s) of stack
A. function calls
Answer: D
37. 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
Answer: A
A. unary tree
B. binary tree
C. trinary tree
D. both b and c
Answer: B
B. lists
o m
C. stacks .c
te
D. tree
a
Answer: D
q M
c structure is linear type?
40. Which of the following data
A. array
M
B. tree
C. graphs
D. hierarchy
Answer: A
B. data arrangement
C. data configuration
D. data formation
Answer: A
B. linear array
Answer: B
B. one-dimensional array
C. vertical array
D. horizontal array
o m
Answer: B .c
te
a
44. Arrays are best data structures …………
q M
A. for relatively permanent collections of data
c
B. for the size of the structure and the data in the structure are constantly changing
M
C. for both of above situation
Answer: A
B. linked lists
C. graphs
D. trees
Answer: A
46. Each node in a linked list has two pairs of ………….. and ……………….
A. link field and information field
Answer: A
B. string
C. linear array
D. queue
Answer: C
o m
48. When does top value of the stack changes?
.c
te
A. before deletion
a
B. while checking underflow
q M
C. at the time of deletion
c
D. after deletion M
Answer: D
B. for the size of the structure and the data in the structure are constantly changing
Answer: A
B. for the size of the structure and the data in the structure are constantly changing
Answer: A