Top 350+ Solved Data Structures (DS) MCQ Questions Answer
Q. In a directed tree any node which has out degree 0 is called a terminal node or__________.
a. a tree.
b. a list.
c. a node.
d. a leaf.
Q. In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______tree.
a. directed.
b. structure.
c. ordered.
d. degree of.
Q. ______________ a tree means processing it in such a way that each node is visited only once.
a. Traversing.
b. Implement.
c. Partition.
d. Node.
Q. The length of the path is the number of_____________ on the path.
a. nodes.
b. fields.
c. data.
d. edges.
Q. The children node of same parent is called____________.
a. binary tree.
b. tree.
c. sibling.
d. list.
Q. The situation in linked list START = NULL is called_________
a. Overflow
b. Underflow
c. Zero
d. None of the above
Q. A code which deals about short form of a program is called __________ code.
a. program.
b. data.
c. pseudo.
d. derive
Q. Which of the application may use a stack?
a. Expression Evaluation
b. Keeping track of local variables at run time.
c. Syntax analyzer for a compiler
d. All of the above.
Q. The queue which wraps around upon reaching the end of the array is called as____________.
a. circular queue.
b. linked queue.
c. doubly linked list.
d. representation of queue.
Q. A _______________ is a reference to a memory location, which is used to store data that is described in adata type.
a. element.
b. variable.
c. pointer.
d. memory.
Q. If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order ofremoval?
a. ABCD
b. DCBA
c. DCAB
d. ABDC
Q. ____________ has certain attributes or properties which may be assigned values.
a. field system.
b. record.
c. entity.
d. files.
Q. Maximum degree in any vector in a graph with n vertices is ________.
a. n.
b. n-1.
c. n+1.
d. 2n+1.