Computer Science Fundamentals: 100 Solved MCQs on Data Structures & Networking â The definitive technical question bank for computer science graduates preparing for lecturer exams, technical interviews, and university assessments.
Time Complexity & Big-O Quick Reference
| Data Structure | Access Time | Search Time | Insertion Time | Deletion Time |
|---|---|---|---|---|
| Array | O(1) | O(n) | O(n) | O(n) |
| Stack / Queue | O(n) | O(n) | O(1) | O(1) |
| Binary Search Tree (Balanced) | O(log n) | O(log n) | O(log n) | O(log n) |
| Hash Table | N/A | O(1) avg | O(1) avg | O(1) avg |
High-Yield Academic Pro-Tip
Remember that QuickSort has a worst-case time complexity of O(n^2) when the pivot selected is consistently the minimum or maximum element.
Important Academic & Examination Notice
Don’t confuse TCP (reliable, connection-oriented) with UDP (unreliable, connectionless, low latency for streaming).
Frequently Asked Questions
â Which networking layer does a router operate on?
Routers operate on Layer 3 (Network Layer) managing IP routing.