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. O(1) means computing time is __________________

A. Constant
B. Quadratic
C. Linear
D. Cubic

View Answer


12. Which data structure allows deleting data elements from front and inserting at rear?

A. Stacks
B. Queues
C. Deques
D. Binary search tree

View Answer


13. Which of the following sorting algorithm is of divide-and-conquer type?

A. Bubble sort
B. Insertion sort
C. Quick sort
D. Selection sort

View Answer


14. The time factor when determining the efficiency of algorithm is measured by?

A. Counting microseconds
B. Counting the number of key operations
C. Counting the number of statements
D. Counting the kilobytes of algorithm

View Answer


15. In an array representation of binary tree the right child of root will be at location of?

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

View Answer


16. The upper bound on the time complexity of the nondeterministic sorting algorithm is?

A. O(n)
B. O(n log n)
C. O(1)
D. O( log n)

View Answer


17. In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do is expressed by using _________.

A. Central tendency
B. Differential equation
C. Order of magnitude
D. Order of execution

View Answer


18. What is the type of the algorithm used in solving the 8 Queens problem?

A. Backtracking
B. Dynamic
C. Branch and Bound
D. Both A and B

View Answer


19. Which of the following belongs to the algorithm paradigm?

A. Minimum & Maximum problem
B. Knapsack problem
C. Selection problem
D. Merge sort

View Answer


20. The [] notation is

A. Symmetric
B. Reflexive
C. Transitive
D. All of the above

View Answer


21. An algorithm should have _________ well-defined outputs

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

View Answer


22. __________ 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


23. 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


24. 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


25. 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.