Data Analysis And Design MCQs

By: Prof. Dr. Fazal Rehman | Last updated: April 30, 2025

1. : To solve any problem the first step is …
(A) Evaluate the problem
(B) Identify the problem
(C) Understand the problem
(D) None of these

2. : Solutions that require reasoning built on knowledge and experiences are …
(A) Heuristic solutions
(B) Algorithmic solutions
(C) Random solutions
(D) Banker’s solutions

3. : The complexity of worst-case in quick sort is …
(A) O(log n²)
(B) O(n)
(C) O(n²)
(D) O(n log²)

4. : The efficiency of the algorithms is estimated by…
(A) Memory and processor
(B) Time and space
(C) Complexity and capacity
(D) None of these

5. : Which one is not in complexity theory?
(A) Worst case
(B) Average case
(C) Null case
(D) Best case

6. : To sort an array of n elements in merge sort the worst-case time complexity is …
(A) O(log n)
(B) O(logₙ)
(C) O(n log n)
(D) None of these

7. : We can easily check the correctness and appropriateness of _____ solutions.
(A) Heuristic solutions
(B) Algorithmic solutions
(C) Random solutions
(D) Banker’s solutions

8. : A sort in which it compares the adjacent elements in the list is …
(A) Bubble sort
(B) Merge sort
(C) Insertion sort
(D) Quick sort

9. : Which one is best when the list is already sorted?
(A) Bubble sort
(B) Merge sort
(C) Insertion sort
(D) Quick sort

10. : The true and false values are used to represent the …
(A) Digital data
(B) Logical data
(C) Graphical data
(D) Numerical data

11. : PAC stands for
(A) Problem Analysis Chart
(B) Problem Act Chart
(C) Problem Access Code
(D) None of these

12. : We can improve the efficiency of quick sort by using …
(A) Recursive method
(B) Non-recursive method
(C) Binary tree method
(D) None of these