Data Structure (DS) Solved Mcqs set 2
26. 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
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
Download more sets at McqMate.com
Data Structure (DS) Solved Mcqs set 2
30. 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
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
33. 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
Download more sets at McqMate.com
Data Structure (DS) Solved Mcqs set 2
34. 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
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
B. large number arithmetic
C. evaluation of arithmetic expressions
D. all of the above
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
D. direction oriented tree
Answer: A
38. …………………. Is a directed tree in which outdegree of each node is
less than or equal to two.
Download more sets at McqMate.com
Data Structure (DS) Solved Mcqs set 2
A. unary tree
B. binary tree
C. trinary tree
D. both b and c
Answer: B
39. Which of the following data structure is non-linear type?
A. strings
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
41. 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
42. The simplest type of data structure is ………………
A. multidimensional array
B. linear array
Download more sets at McqMate.com
Data Structure (DS) Solved Mcqs set 2
C. two dimensional array
D. three dimensional array
Answer: B
43. Linear arrays are also called ……………….
A. straight line array
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
D. for none of the above
Answer: A
45. Which of the following data structures are indexed structures?
A. linear arrays
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
B. link field and avail field
C. avail field and information field
D. address field and link field
Download more sets at McqMate.com
Data Structure (DS) Solved Mcqs set 2
Answer: A
47. A …………………… does not keep track of address of every element in
the list.
A. stack
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
49. 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
50. 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 situation
Answer: A
Download more sets at McqMate.com
