Engineering Mathematics forms the foundation of Computer Science and Information Technology. This section evaluates mathematical reasoning, logical thinking, probability, linear algebra, discrete mathematics, and calculus concepts that are frequently applied in algorithms, machine learning, artificial intelligence, data science, and computer systems.
Propositional Logic.
First Order Logic.
Sets.
Relations.
Functions.
Partial Orders.
Lattices.
Monoids.
Groups.
Graphs: Connectivity, Matching, Colouring.
Combinatorics: Counting, Recurrence Relations, Generating Functions.
Matrices.
Determinants.
System of Linear Equations.
Eigenvalues.
Eigenvectors.
LU Decomposition.
Limits.
Continuity.
Differentiability.
Maxima and Minima.
Mean Value Theorem.
Integration.
Random Variables.
Uniform Distribution.
Normal Distribution.
Exponential Distribution.
Poisson Distribution.
Binomial Distribution.
Mean.
Median.
Mode.
Standard Deviation.
Conditional Probability.
Bayes Theorem.
Engineering Mathematics is one of the highest scoring sections in GATE Computer Science & Information Technology. Give special attention to Discrete Mathematics, Graph Theory, Linear Algebra, Probability, Statistics, and Calculus. Practice previous GATE questions regularly and strengthen your conceptual understanding, as these topics are frequently asked in both theoretical and numerical formats.
Boolean algebra and minimization – algebraic technique, Karnaugh map, tabular method. Design of combinational and sequential circuits. Number representation and arithmetic (fixed and floating point).
Instruction set and addressing modes. Design of arithmetic and logic unit (ALU). Design of control unit – hardwired and microprogrammed. Memory interfacing and hierarchy: performance, cache memory mapping. I/O interface (interrupt and DMA). Instruction pipelining and pipeline hazards.
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Searching. Sorting. Hashing. Asymptotic worst case time complexity. Asymptotic worst case space complexity.
Greedy method. Dynamic programming. Divide-and-conquer.
Graph traversals. Minimum spanning trees. Shortest paths.
Regular expressions. Finite automata. Context-free grammars. Push-down automata.
Regular languages. Context-free languages. Pumping lemma.
Turing machines. Undecidability.
Lexical analysis. Parsing. Syntax-directed translation. Runtime environments. Intermediate code generation.
Local optimisation. Data flow analyses. Constant propagation. Liveness analysis. Common sub expression elimination.
Algorithms, Theory of Computation, and Compiler Design are among the highest-weightage subjects in the GATE Computer Science examination. Focus on understanding algorithm complexity, graph algorithms, automata theory, context-free grammars, Turing machines, lexical analysis, parsing, compiler optimization techniques, and previous GATE questions. Regular practice of numerical and conceptual problems will significantly improve your speed and accuracy.
Section 8
System Calls, Processes, Threads, Inter-Process Communication (IPC), Concurrency and Synchronization.
Deadlock, CPU Scheduling, I/O Scheduling.
Memory Management, Virtual Memory, File Systems.
Section 9
Learn layered communication architecture, protocol design, encapsulation, decapsulation, and responsibilities of each network layer.
Error detection and correction methods.
Channel sharing and collision control.
LAN communication standards and operation.
Reliable data transmission between sender and receiver.
Efficient network traffic management.
Network programming interface.
Domain Name System resolution.
Web communication protocol.