Computer Science Quizzes
A computer science quiz tests core CS fundamentals - algorithms, data structures, complexity analysis, operating systems, networks, and databases. QuizFlex hosts free CS quizzes for university courses and tech-interview prep.
Free computer science quizzes covering algorithms, data structures, Big O complexity, operating systems, networking, and SQL.
Data Structures & Algorithms: Medium Challenge
AI-generated quiz: Data Structures & Algorithms: Medium Challenge
Data Structures & Databases: Core Concepts
AI-generated quiz: Data Structures & Databases: Core Concepts
Operating Systems: Kernel Command Challenge
AI-generated quiz: Operating Systems: Kernel Command Challenge
Operating Systems: Core Concepts Challenge
AI-generated quiz: Operating Systems: Core Concepts Challenge
Operating Systems: Processes and Programs in Action
AI-generated quiz: Operating Systems: Processes and Programs in Action
Operating Systems: Core Concepts Challenge
AI-generated quiz: Operating Systems: Core Concepts Challenge
Operating Systems: Core Concepts Crucible
AI-generated quiz: Operating Systems: Core Concepts Crucible
Database Structures: Core Concepts Challenge
AI-generated quiz: Database Structures: Core Concepts Challenge
File Structures & Databases: Expert Challenge
AI-generated quiz: File Structures & Databases: Expert Challenge
Database Architecture: Expert Level Challenge
AI-generated quiz: Database Architecture: Expert Level Challenge
SQL WHERE Clause: Mastering Data Filtering
AI-generated quiz: SQL WHERE Clause: Mastering Data Filtering
Frequently asked questions about computer science quizzes
What CS fundamentals do FAANG interviews test?
Hash tables, trees (especially binary search trees and tries), graphs (BFS/DFS, shortest paths), dynamic programming, system design basics, and Big O analysis. Cover these six and you handle most interview rounds at top tech companies.
How is Big O complexity calculated?
Count the dominant operation as input size grows. A single loop over n is O(n). A nested loop is O(n²). A divide-and-conquer recursion is usually O(n log n). Drop constants and lower-order terms - only the asymptotic behaviour matters.
Are these CS quizzes good for university exams?
Yes - they're calibrated to typical CS101 through CS401 difficulty. Pair them with the algorithms quiz for cumulative review before midterms and finals.
Can I generate a quiz from my CS textbook?
Yes - upload a CS textbook PDF (CLRS, Sipser, Tanenbaum, etc.) and QuizFlex will generate questions calibrated to undergraduate level, with worked examples for any algorithmic question.