Coverage dashboard
Syllabus coverage
Every line of the official syllabus must map to at least one concept page. Anything unmapped is shown in red.
Syllabus lines
130
Covered by a built page
94
Planned only
36
Unmapped
0
Source: Official syllabus PDF, GATE 2027 IIT Madras (CS_GATE2027_Syllabus.pdf), supplied by the user. General Aptitude is not in the CS syllabus PDF. Its items come from the project brief and must be checked against the official GA syllabus.
Every syllabus line is mapped to at least one planned concept (see the concept map). A line turns green once a built page covers it. Pages are written subject by subject.
Engineering Mathematics
32 / 32 mapped- Propositional logicS1.dm.logic
- First order logicS1.dm.fol
- SetsS1.dm.sets
- RelationsS1.dm.relations
- FunctionsS1.dm.functions
- Partial orders and latticesS1.dm.posets
- MonoidsS1.dm.monoids
- GroupsS1.dm.groups
- Graphs: connectivityS1.dm.graphs.conn
- Graphs: matchingS1.dm.graphs.match
- Graphs: colouringS1.dm.graphs.color
- Combinatorics: countingS1.dm.comb.counting
- Combinatorics: recurrence relationsS1.dm.comb.recurrence
- Combinatorics: generating functionsS1.dm.comb.gf
- MatricesS1.la.matrices
- DeterminantsS1.la.det
- System of linear equationsS1.la.linsys
- Eigenvalues and eigenvectorsS1.la.eigen
- LU decompositionS1.la.lu
- LimitsS1.calc.limits
- Continuity and differentiabilityS1.calc.continuity
- Maxima and minimaS1.calc.maxmin
- Mean value theoremS1.calc.mvt
- IntegrationS1.calc.integration
- Random variablesS1.ps.rv
- Uniform distributionS1.ps.uniform
- Normal distributionS1.ps.normal
- Exponential distributionS1.ps.exponential
- Poisson distributionS1.ps.poisson
- Binomial distributionS1.ps.binomial
- Mean, median, mode and standard deviationS1.ps.descriptive
- Conditional probability and Bayes theoremS1.ps.bayes
Digital Logic
7 / 7 mapped- Boolean algebra and minimization: algebraic techniqueS2.boolean.algebraic
- Boolean algebra and minimization: Karnaugh mapS2.boolean.kmap
- Boolean algebra and minimization: tabular methodS2.boolean.tabular
- Design of combinational circuitsS2.design.comb
- Design of sequential circuitsS2.design.seq
- Number representation and arithmetic: fixed pointS2.number.fixed
- Number representation and arithmetic: floating pointS2.number.float
Computer Organization and Architecture
12 / 12 mapped- Instruction setS3.isa
- Addressing modesS3.addressing
- Design of arithmetic and logic unit (ALU)S3.alu
- Design of control unit: hardwiredS3.cu.hardwired
- Design of control unit: microprogrammedS3.cu.micro
- Memory interfacingS3.memory.interfacing
- Memory hierarchy: performanceS3.memory.hierarchy
- Cache memory mappingS3.memory.cache
- I/O interface: interruptS3.io.interrupt
- I/O interface: DMAS3.io.dma
- Instruction pipeliningS3.pipeline
- Pipeline hazardsS3.hazards
Programming and Data Structures
10 / 10 mapped- Programming in CS4.c
- RecursionS4.recursion
- ArraysS4.arrays
- StacksS4.stacks
- QueuesS4.queues
- Linked listsS4.linkedlists
- TreesS4.trees
- Binary search treesS4.bst
- Binary heapsS4.heaps
- GraphsS4.graphs
Algorithms
10 / 10 mapped- SearchingS5.searching
- SortingS5.sorting
- HashingS5.hashing
- Asymptotic worst case time and space complexityS5.complexity
- Algorithm design technique: greedyS5.greedy
- Algorithm design technique: dynamic programmingS5.dp
- Algorithm design technique: divide-and-conquerS5.dc
- Graph traversalsS5.traversals
- Minimum spanning treesS5.mst
- Shortest pathsS5.sssp
Theory of Computation
9 / 9 mapped- Regular expressionsS6.regex
- Finite automataS6.fa
- Context-free grammarsS6.cfg
- Push-down automataS6.pda
- Regular languagesS6.lang.regular
- Context-free languagesS6.lang.cf
- Pumping lemmaS6.pumping
- Turing machinesS6.tm
- UndecidabilityS6.undecidability
Compiler Design
9 / 9 mapped- Lexical analysisS7.lexical
- ParsingS7.parsing
- Syntax-directed translationS7.sdt
- Runtime environmentsS7.runtime
- Intermediate code generationS7.icg
- Local optimisationS7.localopt
- Data flow analyses: constant propagationS7.dfa.constprop
- Data flow analyses: liveness analysisS7.dfa.liveness
- Data flow analyses: common sub expression eliminationS7.dfa.cse
Operating System
11 / 11 mapped- System callsS8.syscalls
- ProcessesS8.processes
- ThreadsS8.threads
- Inter-process communicationS8.ipc
- Concurrency and synchronizationS8.sync
- DeadlockS8.deadlock
- CPU schedulingS8.cpusched
- I/O schedulingS8.iosched
- Memory managementS8.memory
- Virtual memoryS8.vm
- File systemsS8.fs
Databases
10 / 10 mapped- ER-modelS9.er
- Relational model: relational algebraS9.ra
- Relational model: tuple calculusS9.trc
- Relational model: SQLS9.sql
- Integrity constraintsS9.integrity
- Normal formsS9.nf
- File organizationS9.fileorg
- Indexing (e.g., B and B+ trees)S9.indexing
- TransactionsS9.txn
- Concurrency controlS9.cc
Computer Networks
16 / 16 mapped- Principles of layeringS10.layering
- Basics of switching (circuit, packet and virtual circuit)S10.switching
- Performance metricsS10.perf
- Data link layer: error detectionS10.dll.error
- Data link layer: Medium Access ControlS10.dll.mac
- Data link layer: EthernetS10.dll.ethernet
- Distance vector routingS10.routing.dv
- Link state routingS10.routing.ls
- IPv4: fragmentationS10.ipv4.frag
- IPv4: CIDR notationS10.ipv4.cidr
- IPv4: Network Address TranslationS10.ipv4.nat
- TCP: flow controlS10.tcp.flow
- TCP: congestion controlS10.tcp.congestion
- Socket APIS10.socket
- DNSS10.dns
- HTTPS10.http
General Aptitude
4 / 4 mapped- Verbal aptitudeGA.verbal
- Quantitative aptitudeGA.quant
- Analytical aptitudeGA.analytical
- Spatial aptitudeGA.spatial