Exam preparation workspace
GATE Computer Science and Information Technology Syllabus
Covers algorithms, data structures, computer networks, databases, and software engineering, ideal for those pursuing careers in IT and software development.
5 quiz attempts so far Dual AI-verified 1 free quiz, then ₹19 per quiz — or all at once for up to 30% less
10 questions · instant score · no card
Students preparing for GATE Computer Science and Information Technology
View all
Formula of the day
Uniform distribution · 48 formulae in the cheatsheet
Trap of the day
k-stage pipeline speedup approaches k only as n→∞. For small n the (k-1) fill cost dominates.
Revision & Exam Traps· 8 formulae · 5 traps
Algorithms · Recurrences
Architecture · Speedup
Architecture · Cache
Architecture · Pipeline (k stages)
Maths · Set theory
Digital · De Morgan
OS · Paging
Digital · Number systems
Algorithms
Master theorem needs f(n) polynomially comparable to n^(log_b a). Cases like f(n)=n log n fall in the gap and need the extended form.
Big-O is an upper bound; Θ is tight. "Is O(n²)" does not forbid an algorithm also being O(n).
Architecture
k-stage pipeline speedup approaches k only as n→∞. For small n the (k-1) fill cost dominates.
OS
Logical-address bits decide #pages; physical-address bits decide #frames. Don’t swap them.
Digital
2’s complement range is asymmetric: the most negative value has no positive counterpart, so negating it overflows.
GATE Computer Science and Information Technology Syllabus (2025)
10 subjects · 130 topics
Select a topic from the list to start revising.