Colleges · General · Computer Science

Engineering — Data Structures MCQ Drill

25 MCQs on Arrays, Linked Lists, Stacks, Queues, Trees, Hashing.

Questions
25
Duration
19 min
Difficulty
mixed
Bloom mix
50% Remember/Understand, 35% Apply, 15% Analyze
Use this template →

Free to import. Edit, then launch as a live quiz with a 6-digit PIN.

About this template

25 MCQs on Arrays, Linked Lists, Stacks, Queues, Trees, Hashing.

Sample questions (1 of 25)

  1. 1

    Best-case time complexity of binary search is:

    • A. O(1)✓ Correct
    • B. O(log n)
    • C. O(n)
    • D. O(n log n)
    Bloom: remember

Tags

engineeringdata structurescs
Use this template →

Free up to 50 participants. INR billing on Pro.

Related