Computer Science Test MCQs, Data Structures

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

15
Score: 0
Attempted: 0/15
Subscribe
1. . The main measure of the efficiency of the algorithm



2. . Big-oh allows the possibility the growth rates are the



3. . Which symbol tells us logarithms grow very slowly?



4. . The relative growth rates of two functions f(N) and g(N) by limₙ→0 f(N)/g(N) then



5. . Gcf()



6. . If M > N then M mod N



7. . An online algorithm that runs in



8. . In maximum subsequence, the input size is N = 100,000 then O(N³)



9. . N² symbol is



10. . log₂N symbol is



11. . Euclid’s algorithm is used for computing the



12. . The complexity of linear search algorithm



13. . The complexity of bubble sort algorithm



14. . The complexity of merge sort algorithm



15. . Which of the following case does not exist in complexity theory?



 

Data Structures MCQs

Basic Concepts

  1. Introduction to Data Structures
  2. Complexity Analysis MCQs

Linear Data Structures MCQs

  1. Arrays MCQs
  2. Linked Lists MCQs
  3. Stacks MCQs
  4. Queues MCQs

Non-Linear Data Structures MCQs

  1. Trees MCQs
  2. Heaps MCQs
  3. Graphs MCQs

Hashing MCQs MCQs

  1. Hash Tables

Sorting and Searching Algorithms MCQs 

  1. Sorting Algorithms MCQs
  2. Searching Algorithms MCQs

Miscellaneous

  1. Memory Management in data structures MCQs
  2. String Manipulation Algorithms MCQs
  1. Data Structures MCQs 1
  2. Data Structures MCQs 2
  3. Data Structures MCQs 3
  4. Data Structures MCQs 4
  5. Data Structures MCQs 5
  6. Stacks Solved MCQs
  7. Queues MCQs
  8. pointer mcqs
  9. Array MCQs

 

Computer Science Repeated MCQs Book Download

Related Posts:

Leave a Comment

All Copyrights Reserved 2025 Reserved by T4Tutorials