Engineering Mathematics
Engineering Mathematics accounts for approximately 13 marks in GATE CS, the largest single allocation in the paper. Linear algebra alone contributes 4 to 6...
Linear Algebra for GATE CS: Matrices, Eigenvalues, and Systems
Engineering Mathematics accounts for approximately 13 marks in GATE CS, the largest single allocation in the paper. Linear algebra alone contributes 4 to 6 marks and appears consistently year after year. Mastery of matrices, determinants, eigenvalues, and linear systems is non-negotiable for a high score.
Matrix fundamentals begin with operations: addition, scalar multiplication, and matrix multiplication. Matrix multiplication is not commutative: AB is generally not equal to BA. The transpose of AB equals B-transpose times A-transpose. The inverse of AB equals B-inverse times A-inverse. A square matrix is invertible if and only if its determinant is non-zero.
Determinants for 2x2 and 3x3 matrices are tested directly. For larger matrices, use cofactor expansion or row reduction to triangular form, where the determinant is the product of diagonal entries. Row operations affect the determinant: swapping rows changes the sign, multiplying a row by a scalar multiplies the determinant by that scalar, adding a multiple of one row to another leaves the determinant unchanged.
Rank of a matrix is the dimension of its column space (or row space). For a system Ax=b, the system has a solution if and only if the rank of A equals the rank of the augmented matrix [A|b]. If the rank equals n (number of unknowns), the solution is unique. If rank is less than n, there are infinitely many solutions (if consistent) or no solution (if inconsistent).
Eigenvalues and eigenvectors are a major GATE focus. An eigenvalue lambda satisfies det(A - lambda I) = 0, the characteristic polynomial. Eigenvectors satisfy (A - lambda I)v = 0. Properties GATE tests: the sum of eigenvalues equals the trace (sum of diagonal entries), and the product of eigenvalues equals the determinant. A symmetric matrix has real eigenvalues and orthogonal eigenvectors. A matrix is diagonalizable if it has n linearly independent eigenvectors.
A worked example: find eigenvalues of the 2x2 matrix with rows [4,1] and [2,3]. Characteristic polynomial: (4-lambda)(3-lambda) - 2 = lambda^2 - 7*lambda + 10 = 0. Factor: (lambda-5)(lambda-2) = 0. Eigenvalues are 5 and 2. Check: trace = 4+3 = 7 = 5+2, determinant = 4*3 - 1*2 = 10 = 5*2. This verification step catches arithmetic errors on GATE.
Calculus and Probability: Core Concepts for GATE CS
Calculus and probability together contribute around 5 to 7 marks in GATE CS Engineering Mathematics. While GATE CS does not require deep calculus, limits, derivatives, integrals, and mean value theorems appear regularly. Probability is tested heavily due to its relevance to algorithms, randomized computing, and system reliability.
Limits and continuity: a function f is continuous at x=a if the limit as x approaches a of f(x) equals f(a), and both are defined. L'Hopital's rule resolves indeterminate forms 0/0 and infinity/infinity by differentiating numerator and denominator separately. For example, the limit of sin(x)/x as x approaches 0 equals 1, a frequently used result.
Derivatives measure instantaneous rate of change. Key rules: product rule d(uv)/dx = u dv/dx + v du/dx, quotient rule d(u/v)/dx = (v du/dx - u dv/dx) / v^2, chain rule d(f(g(x)))/dx = f'(g(x)) g'(x). Critical points where f'(x)=0 are candidates for maxima or minima. The second derivative test: if f''(a) > 0, the critical point is a local minimum; if f''(a) < 0, it is a local maximum.
Integration: the fundamental theorem of calculus connects differentiation and integration. Definite integrals compute areas. Common techniques include substitution, integration by parts (integral of u dv = uv - integral of v du), and partial fractions for rational functions.
Probability fundamentals: the sample space S contains all possible outcomes. An event is a subset of S. Probability P(A) satisfies P(A) >= 0, P(S) = 1, and P(A union B) = P(A) + P(B) - P(A intersect B). Conditional probability P(A|B) = P(A intersect B) / P(B). Bayes' theorem: P(A|B) = P(B|A) P(A) / P(B). Events A and B are independent if P(A intersect B) = P(A) P(B).
Random variables: a discrete random variable X takes countable values with probability mass function P(X=x). Expected value E(X) = sum of x P(X=x). Variance Var(X) = E(X^2) - (E(X))^2. Important distributions for GATE: Bernoulli (single trial with probability p of success), Binomial B(n,p) (n independent Bernoulli trials, mean np, variance np(1-p)), Poisson (events in fixed time, parameter lambda), and Uniform (all outcomes equally likely). GATE questions compute probabilities, expected values, or identify distributions from their properties.
Number Theory and Transform Methods in Engineering Mathematics
Number theory and selected transform concepts complete the Engineering Mathematics syllabus for GATE CS. Though these topics are smaller in contribution compared to linear algebra and probability, they are high-confidence marks because the question types are highly predictable.
Modular arithmetic underlies cryptography, hashing, and algorithm analysis. The key properties: (a+b) mod m = ((a mod m) + (b mod m)) mod m, similarly for multiplication. Division requires modular inverse. The inverse of a exists modulo m if and only if gcd(a,m)=1, in which case the inverse can be found using the Extended Euclidean Algorithm.
The Euclidean algorithm computes gcd(a,b) efficiently: gcd(a,b) = gcd(b, a mod b), with base case gcd(a,0) = a. For example, gcd(48,18): gcd(48,18) = gcd(18,12) = gcd(12,6) = gcd(6,0) = 6. This runs in O(log min(a,b)) steps. GATE may ask for gcd of two numbers or the number of iterations the algorithm takes.
Fermat's Little Theorem: if p is prime and gcd(a,p)=1, then a to the power (p-1) is congruent to 1 modulo p. This is used to compute large powers modulo a prime efficiently. For example, 2 to the power 100 modulo 101: since 101 is prime and gcd(2,101)=1, 2 to the 100 is congruent to 1 mod 101.
Euler's Totient Function phi(n) counts positive integers up to n that are coprime to n. For prime p, phi(p) = p-1. For prime power p^k, phi(p^k) = p^(k-1)(p-1). For general n = product of p_i^k_i, phi(n) = n times product over all primes p dividing n of (1 - 1/p). Euler's generalization: a to the phi(n) is congruent to 1 mod n when gcd(a,n)=1.
Chinese Remainder Theorem (CRT): if m1, m2, ..., mk are pairwise coprime moduli, the system x congruent to a_i mod m_i for all i has a unique solution modulo M = product of m_i. CRT appears in GATE in questions about simultaneous congruences or as a tool for fast modular arithmetic.
Transform methods such as Laplace and Fourier transforms are occasionally tested at a basic level. For GATE CS, the most relevant is understanding that convolution in the time domain corresponds to multiplication in the frequency domain, and that Z-transforms relate to difference equations. These concepts are tested in questions about linear systems and digital signal processing at a conceptual rather than computational level.