Last Minute Notes Engineering Mathematics
Linear algebra is the highest-yield Engineering Mathematics topic for GATE CS. These condensed notes cover every result you need in the final hours before ...
Quick Revision: Linear Algebra Key Results and Formulas
Linear algebra is the highest-yield Engineering Mathematics topic for GATE CS. These condensed notes cover every result you need in the final hours before your exam.
Matrix operations: (AB)^T = B^T A^T. (AB)^{-1} = B^{-1} A^{-1}. det(AB) = det(A) det(B). det(A^T) = det(A). det(kA) = k^n det(A) for n times n matrix. det(A^{-1}) = 1/det(A).
Row echelon form: use Gaussian elimination. Rank = number of non-zero rows in row echelon form. Nullity = n - rank (rank-nullity theorem). For a square matrix n times n, rank n implies invertibility.
Linear system Ax=b: has a solution iff rank(A) = rank([A|b]). Unique solution iff rank(A) = rank([A|b]) = n. Infinitely many solutions iff rank(A) = rank([A|b]) < n. No solution iff rank(A) < rank([A|b]).
Eigenvalues: characteristic polynomial is det(A - lambda I) = 0. Sum of eigenvalues = trace(A). Product of eigenvalues = det(A). A matrix is singular iff 0 is an eigenvalue. Eigenvalues of A^k are lambda^k. Eigenvalues of A^{-1} are 1/lambda. Eigenvalues of kA are k times lambda.
Special matrices: symmetric matrix (A = A^T) has real eigenvalues. Orthogonal matrix (A^T = A^{-1}) has det = plus or minus 1 and eigenvalues of magnitude 1. Idempotent matrix (A^2 = A) has eigenvalues 0 or 1. Nilpotent matrix (A^k = 0 for some k) has all eigenvalues 0.
Cayley-Hamilton theorem: every square matrix satisfies its own characteristic polynomial. If the characteristic polynomial is p(lambda) = lambda^2 - 5*lambda + 6, then A^2 - 5A + 6I = 0. Use this to compute high powers of A without repeated multiplication.
Vector spaces: a set V with addition and scalar multiplication satisfying closure, associativity, commutativity, identity, inverse, and distributivity. Subspace must contain the zero vector, be closed under addition, and be closed under scalar multiplication. Span of vectors is the set of all linear combinations. Basis is a linearly independent spanning set. Dimension equals the number of basis vectors.
Quick Revision: Calculus, Differential Equations, and Probability
This block consolidates calculus and probability facts that GATE recycles. Review each formula and recall an application before continuing.
Limit laws: limit of (f+g) = limit of f + limit of g. Limit of f*g = (limit of f) * (limit of g). L'Hopital for 0/0: differentiate numerator and denominator separately and take the limit. Important limits: limit of sin(x)/x as x to 0 equals 1. Limit of (1 + 1/n)^n as n to infinity equals e.
Derivative rules: d/dx(x^n) = n x^{n-1}. d/dx(e^x) = e^x. d/dx(ln x) = 1/x. d/dx(sin x) = cos x. d/dx(cos x) = -sin x. Product rule: (uv)' = u'v + uv'. Chain rule: (f(g(x)))' = f'(g(x)) g'(x).
Maxima and minima: critical points at f'(x)=0 or undefined. Second derivative test: f''(a)>0 means local min, f''(a)<0 means local max, f''(a)=0 is inconclusive.
Integration: integral of x^n dx = x^{n+1}/(n+1) + C for n not -1. Integral of 1/x dx = ln|x| + C. Integral of e^x dx = e^x + C. Integration by parts: integral u dv = uv - integral v du.
Mean value theorems: Rolle's theorem: if f is continuous on [a,b], differentiable on (a,b), and f(a)=f(b), then there exists c in (a,b) with f'(c)=0. Lagrange mean value theorem: there exists c with f'(c) = (f(b)-f(a))/(b-a).
Ordinary differential equations: first-order linear ODE dy/dx + P(x)y = Q(x) solved with integrating factor mu = e^{integral P dx}. Second-order with constant coefficients: ay'' + by' + cy = 0 has characteristic equation ar^2 + br + c = 0. Two real roots: y = C1 e^{r1 x} + C2 e^{r2 x}. Repeated root: y = (C1 + C2 x) e^{rx}. Complex roots r = alpha plus minus beta i: y = e^{alpha x}(C1 cos(beta x) + C2 sin(beta x)).
Probability quick reference: P(A|B) = P(A intersect B) / P(B). Bayes: P(A|B) = P(B|A)P(A)/P(B). Independence: P(A intersect B) = P(A)P(B). Binomial distribution: P(X=k) = C(n,k) p^k (1-p)^{n-k}, mean=np, variance=np(1-p). Poisson: P(X=k) = e^{-lambda} lambda^k / k!, mean=variance=lambda. Normal: 68% within 1 sigma, 95% within 2 sigma, 99.7% within 3 sigma.
Quick Revision: Number Theory, Transforms, and Exam Strategy
This final Engineering Mathematics revision block covers number theory results, basic transform concepts, and an exam-day strategy framework to help you maximize marks within the 3-hour window.
Number theory essentials: gcd(a,b) = gcd(b, a mod b). lcm(a,b) = a*b / gcd(a,b). Bezout's identity: integers x, y exist such that gcd(a,b) = ax + by (found by Extended Euclidean Algorithm). Modular inverse of a mod m exists iff gcd(a,m)=1.
Fermat's Little Theorem: a^{p-1} congruent to 1 mod p for prime p and gcd(a,p)=1. Use to reduce large exponents: a^k mod p, reduce k modulo p-1. Example: 3^100 mod 7. By Fermat, 3^6 congruent to 1 mod 7. 100 = 16*6 + 4. So 3^100 = (3^6)^16 * 3^4 congruent to 1^16 * 81 congruent to 81 mod 7 = 4 mod 7.
Euler's Totient: phi(p) = p-1. phi(p^k) = p^{k-1}(p-1). phi(mn) = phi(m)phi(n) if gcd(m,n)=1. phi(12) = phi(4)*phi(3) = 2*2 = 4. Euler's theorem: a^{phi(m)} congruent to 1 mod m when gcd(a,m)=1.
Chinese Remainder Theorem application: x congruent to 2 mod 3 and x congruent to 3 mod 5. M = 15. M1 = 5, M2 = 3. Find inverse of 5 mod 3: 5 mod 3 = 2, inverse of 2 mod 3 = 2 (since 2*2=4=1+3). Find inverse of 3 mod 5: 3*2=6=1+5, so inverse is 2. x = 2*5*2 + 3*3*2 = 20 + 18 = 38 congruent to 8 mod 15.
Transform concepts for GATE CS: Laplace transform converts differential equations to algebraic equations. L{e^{at}} = 1/(s-a). L{t^n} = n!/s^{n+1}. Initial value theorem: limit of f(t) as t to 0 equals limit of s*F(s) as s to infinity.
Exam strategy for Engineering Mathematics: do eigenvalue/eigenvector questions first — they are the most predictable 2-mark questions. If a calculus problem requires integration by parts or substitution and you are unsure, skip and return — partial credit is not available in GATE, so incomplete work costs time without reward. For probability questions, always define events clearly before computing. For number theory, write out the Euclidean algorithm step by step — the answer emerges mechanically. Check your final answers dimensionally and with simple special cases when time allows.