Top 350+ Solved Data Structures (DS) MCQ Questions Answer
Q. _______________ is a solution to a problem independent of programming language.
a. Efficient.
b. Linked list.
c. Data structure.
d. Algorithm.
Q. ________ is the situation where data-structure is empty.
a. Overflow.
b. Underflow.
c. Null.
d. Empty.
Q. When elements are deleted the nodes go to_________.
a. registers.
b. free pool.
c. recycle bin.
d. gets deleted permanently.
Q. Expression into postfix expression: (A - B) * (D / E)
a. ABDE - * /
b. - * / ABDE
c. A B - D E * /
d. * - A B / D E
Q. Each data item in a record may be a group item composed of sub-items; those items which areindecomposable are called ________
a. elementary items.
b. atoms.
c. scalars.
d. structure.
Q. What is the worst-case time for heap sort to sort an array of n elements?
a. O(log n).
b. O(n).
c. O(n log n).
d. O(n²).
Q. A binary tree of depth "d" is an almost complete binary tree if __________.
a. each leaf in the tree is either at level.
b. for any node.
c. both a and b.
d. None.
Q. Program module contains its own list of variables called ____________.
a. global.
b. scope.
c. local.
d. external.
Q. The number of nodes in a complete binary tree of level 5 is__________.
a. 15.
b. 20.
c. 63.
d. 31.
Q. The string with zero characters is called___________.
a. null string.
b. zero string.
c. one string.
d. empty string.
Q. The unit equal to the number of bits needed to represent a character is called a ________.
a. byte.
b. bit.
c. mega bytes.
d. kilo bytes.
Q. In variable length storage two dollar signs are used to signal the __________.
a. end of the string.
b. beginning of the string.
c. mid-level of the string.
d. index.