Data Structure MCQ Questions

This section focuses on "basics" of Data Structure. These Multiple Choice Questions (MCQ) should be practiced to improve the Data Structure skills required for various interviews (campus interviews, walk-in interviews, company interviews), placements, entrance exams and other competitive examinations.

1. How many cases are there, which are used to compare various data structure's execution time in a relative manner?

A. 2
B. 3
C. 4
D. 5

View Answer


2. Which case of data structure operation takes maximum time?

A. Worst Case
B. Average Case
C. Best Case
D. None of the above

View Answer


3. In Average case, if operation takes ƒ(n) time in execution, then m operations will take?

A. ƒ(n)
B. f(m)
C. mf(n)
D. nf(m)

View Answer


4. __________ is a single elementary unit of information representing an attribute of an entity.

A. Entity Set
B. Record
C. File
D. Field

View Answer


5. What is true about Interface in data structure?

A. Each data structure has an interface.
B. Interface represents the set of operations that a data structure supports.
C. An interface only provides the list of supported operations, type of parameters they can accept and return type of these operations.
D. All of the above

View Answer


6. Which of the following is not a Characteristics of a Data Structure?

A. Completeness
B. Correctness
C. Time Complexity
D. Space Complexity

View Answer


7. Which characteristics shows that running time or the execution time of operations of data structure must be as small as possible?

A. Completeness
B. Correctness
C. Time Complexity
D. Space Complexity

View Answer


8. Data items that cannot be divided are called as?

A. Group Items
B. Attribute and Entity
C. Elementary Items
D. File items

View Answer


9. Which of the following analysis known as theoretical analysis of an algorithm?

A. A Posterior Analysis
B. A Priori Analysis
C. A Feasibility Analysis
D. A Independent Analysis

View Answer


10. Which of the following analysis known as empirical analysis of an algorithm?

A. A Posterior Analysis
B. A Priori Analysis
C. A Feasibility Analysis
D. A Independent Analysis

View Answer


11. An algorithm should have _________ well-defined outputs

A. 0
B. 1
C. 0 or more
D. 1 or more

View Answer


12. __________ of an algorithm represents the amount of memory space required by the algorithm in its life cycle.

A. Space complexity
B. Time Complexity
C. Quadratic Complexity
D. Exponential Complexity

View Answer


13. The space required by an algorithm is equal to the sum of the following _______ components.

A. 1
B. 2
C. 3
D. 4

View Answer


14. Which is the formal way to express the upper bound of an algorithm's running time.

A. Big Oh Notation
B. Omega Notation
C. Theta Notation
D. None of the above

View Answer


15. The Omega notation is the formal way to express the __________ of an algorithms running time.

A. upper bound
B. medium bound
C. lower bound
D. both the lower bound and the upper bound

View Answer





Discussion


* You must be logged in to add comment.