Engineering Mathematics
Discrete mathematics, linear algebra, calculus, and probability — the quantitative core of GATE CS.
GATE CS/IT preparation
Discrete mathematics, linear algebra, calculus, and probability — the quantitative core of GATE CS.
Boolean algebra, Karnaugh maps, combinational and sequential circuits, and number representation.
Instruction sets, ALU and control design, cache mapping, I/O, and instruction pipelining.
Programming in C, recursion, arrays, stacks, queues, linked lists, trees, heaps, and graphs.
Searching, sorting, hashing, complexity, greedy methods, dynamic programming, and graph algorithms.
Regular expressions, automata, context-free grammars, pumping lemma, Turing machines, and undecidability.
Lexical analysis, parsing, syntax-directed translation, runtime environments, and data-flow analysis.
Processes, threads, synchronization, deadlock, CPU scheduling, virtual memory, and file systems.
ER and relational models, SQL, integrity constraints, indexing, transactions, and concurrency control.
Layering, switching, Ethernet, routing, IPv4, TCP flow and congestion control, DNS, and HTTP.