🇮🇳 GATE · subject

GATE Engineering Mathematics Syllabus

The Engineering Mathematics syllabus for GATE in full: 5 chapters, 20 topics and 32 sub-topics, every one listed below, plus 50 Engineering Mathematics flashcards with answers.

5Chapters
20Topics
32Sub-topics
50Flashcards

Engineering Mathematics syllabus: all 5 chapters

Expand any chapter to see its topics and sub-topics.

  1. Linear Algebra

    3 topics
    • Matrices and Determinants
      • Matrix algebra and rank
      • System of linear equations and consistency
    • Eigenvalues and Eigenvectors
      • Characteristic equation and Cayley-Hamilton
      • Diagonalization
    • Vector Spaces
      • Linear independence and basis
      • Rank-nullity theorem
  2. Calculus

    5 topics
    • Limits, Continuity and Differentiability
    • Mean Value Theorems and Taylor Series
      • Rolle's and Lagrange's theorems
      • Maxima and minima
    • Multivariable Calculus
      • Partial derivatives and gradient
      • Directional derivatives, divergence and curl
    • Integration
      • Definite and improper integrals
      • Double and triple integrals
      • Line, surface and volume integrals
    • Vector Calculus Theorems
      • Green's theorem
      • Stokes' and Gauss divergence theorems
  3. Differential Equations

    4 topics
    • First Order ODEs
      • Separable, linear and exact equations
      • Integrating factors
    • Higher Order Linear ODEs
      • Homogeneous and particular solutions
      • Method of variation of parameters
    • Partial Differential Equations
      • Classification of second order PDEs
      • Heat, wave and Laplace equations
    • Initial and Boundary Value Problems
  4. Probability and Statistics

    4 topics
    • Probability Fundamentals
      • Conditional probability and Bayes' theorem
      • Random variables and distributions
    • Common Distributions
      • Binomial, Poisson and normal
      • Exponential and uniform
    • Descriptive Statistics
      • Mean, median, mode and standard deviation
      • Correlation and regression
    • Sampling and Estimation
  5. Numerical Methods and Complex Variables

    4 topics
    • Numerical Solution of Equations
      • Bisection, Newton-Raphson and secant methods
    • Numerical Integration
      • Trapezoidal and Simpson's rules
    • Numerical Solution of ODEs
      • Euler and Runge-Kutta methods
    • Complex Analysis
      • Analytic functions and Cauchy-Riemann equations
      • Cauchy's integral theorem and residues

GATE Engineering Mathematics flashcards — 50 questions with answers

  1. What is the determinant of a $2\times 2$ matrix $A=\begin{pmatrix} a & b \\ c & d \end{pmatrix}$?

    $\det(A)=ad-bc$.

  2. State the key property relating the determinant of a product of two square matrices $A$ and $B$.

    $\det(AB)=\det(A)\,\det(B)$.

  3. How does $\det(A^{-1})$ relate to $\det(A)$, and when does $A^{-1}$ exist?

    $\det(A^{-1})=\dfrac{1}{\det(A)}$, and $A^{-1}$ exists if and only if $\det(A)\neq 0$ (i.e. $A$ is non-singular).

  4. If $A$ is an $n\times n$ matrix and $k$ a scalar, what is $\det(kA)$?

    $\det(kA)=k^{n}\det(A)$.

  5. Give the formula for the inverse of an invertible matrix $A$ in terms of its adjugate.

    $A^{-1}=\dfrac{1}{\det(A)}\,\operatorname{adj}(A)$, where $\operatorname{adj}(A)$ is the transpose of the cofactor matrix.

  6. Define the rank of a matrix.

    The rank is the maximum number of linearly independent rows (equivalently columns), i.e. the order of the largest non-zero minor, or the number of non-zero rows in its row-echelon form.

  7. For an $m\times n$ matrix $A$, what is the maximum possible value of $\operatorname{rank}(A)$?

    $\operatorname{rank}(A)\leq \min(m,n)$.

  8. What does it mean for an $n\times n$ matrix to have full rank, and what does it imply about invertibility?

    Full rank means $\operatorname{rank}(A)=n$. This implies $\det(A)\neq 0$, so $A$ is invertible (non-singular).

  9. State the rank condition (Rouché–Capelli theorem) for consistency of the linear system $AX=B$.

    The system is consistent if and only if $\operatorname{rank}(A)=\operatorname{rank}([A\,|\,B])$ (the coefficient and augmented matrices have equal rank).

  10. For a consistent system $AX=B$ in $n$ unknowns, when is the solution unique versus infinitely many?

    Unique solution if $\operatorname{rank}(A)=\operatorname{rank}([A|B])=n$; infinitely many solutions if $\operatorname{rank}(A)=\operatorname{rank}([A|B])=r<n$ (with $n-r$ free parameters).

  11. For a homogeneous system $AX=0$ in $n$ unknowns, when does it have a non-trivial solution?

    When $\operatorname{rank}(A)=r<n$, giving $n-r$ free variables. For a square $A$ this means $\det(A)=0$.

  12. Define an eigenvalue and eigenvector of a square matrix $A$.

    A scalar $\lambda$ is an eigenvalue with eigenvector $\vec{x}\neq \vec{0}$ if $A\vec{x}=\lambda\vec{x}$.

  13. Write the characteristic equation used to find the eigenvalues of $A$.

    $\det(A-\lambda I)=0$.

  14. What is the relationship between the trace of $A$ and its eigenvalues?

    $\operatorname{tr}(A)=\sum_{i}\lambda_{i}$, i.e. the sum of eigenvalues equals the sum of the diagonal entries.

  15. What is the relationship between $\det(A)$ and its eigenvalues?

    $\det(A)=\prod_{i}\lambda_{i}$, i.e. the product of all eigenvalues.

  16. If $\lambda$ is an eigenvalue of $A$, what are the eigenvalues of $A^{2}$, $A^{-1}$, and $A^{k}$?

    $\lambda^{2}$ for $A^{2}$, $\dfrac{1}{\lambda}$ for $A^{-1}$ (if $\lambda\neq 0$), and $\lambda^{k}$ for $A^{k}$, with the same eigenvectors.

  17. State the eigenvalue property of the eigenvalues of a triangular matrix.

    The eigenvalues of a triangular (or diagonal) matrix are exactly its diagonal entries.

  18. State the Cayley–Hamilton theorem.

    Every square matrix satisfies its own characteristic equation: if $p(\lambda)=\det(A-\lambda I)$, then $p(A)=0$.

  19. How can the Cayley–Hamilton theorem be used to find $A^{-1}$ for a non-singular matrix?

    From its characteristic equation $A^{n}+c_{n-1}A^{n-1}+\cdots+c_{1}A+c_{0}I=0$, solve for $I$ to express $A^{-1}=-\dfrac{1}{c_{0}}\big(A^{n-1}+c_{n-1}A^{n-2}+\cdots+c_{1}I\big)$.

  20. When is a square matrix $A$ diagonalizable in terms of its eigenvectors?

    $A$ is diagonalizable if and only if it has $n$ linearly independent eigenvectors (e.g. when all $n$ eigenvalues are distinct, or each eigenvalue's geometric multiplicity equals its algebraic multiplicity).

Show the other 30 Engineering Mathematics flashcards
  1. If $A$ is diagonalizable, write the diagonalization formula and what $P$ and $D$ contain.

    $A=PDP^{-1}$, where the columns of $P$ are the eigenvectors and $D$ is the diagonal matrix of corresponding eigenvalues.

  2. Using diagonalization $A=PDP^{-1}$, give a formula for $A^{k}$.

    $A^{k}=PD^{k}P^{-1}$, where $D^{k}$ is obtained by raising each diagonal eigenvalue to the power $k$.

  3. What can be said about the eigenvalues and diagonalizability of a real symmetric matrix?

    A real symmetric matrix has all real eigenvalues and is always orthogonally diagonalizable, with eigenvectors that can be chosen mutually orthonormal.

  4. Define a vector space (the key axioms).

    A set $V$ over a field with addition and scalar multiplication that is closed under both operations and satisfies: associativity/commutativity of addition, existence of a zero vector and additive inverses, and distributive/associative/identity laws for scalar multiplication.

  5. Define a subspace of a vector space $V$.

    A non-empty subset $W\subseteq V$ that is itself a vector space: it contains $\vec{0}$ and is closed under vector addition and scalar multiplication.

  6. Define linear independence of vectors $\vec{v}_{1},\dots,\vec{v}_{k}$.

    They are linearly independent if $c_{1}\vec{v}_{1}+\cdots+c_{k}\vec{v}_{k}=\vec{0}$ implies $c_{1}=\cdots=c_{k}=0$ (only the trivial combination gives zero).

  7. Define a basis of a vector space.

    A set of vectors that is both linearly independent and spans the entire space; its number of vectors equals the dimension of the space.

  8. State the Rank–Nullity theorem for a linear map / matrix $A$ with $n$ columns.

    $\operatorname{rank}(A)+\operatorname{nullity}(A)=n$, where nullity is the dimension of the null space (solution space of $A\vec{x}=\vec{0}$).

  9. Define the nullity of a matrix $A$.

    The nullity is the dimension of the null space (kernel) of $A$, i.e. the number of linearly independent solutions of $A\vec{x}=\vec{0}$, equal to the number of free variables.

  10. State the (precise) definition of $\lim_{x\to a} f(x)=L$.

    For every $\varepsilon>0$ there exists $\delta>0$ such that $0<|x-a|<\delta$ implies $|f(x)-L|<\varepsilon$.

  11. Give the three conditions for $f$ to be continuous at $x=a$.

    $f(a)$ is defined, $\lim_{x\to a}f(x)$ exists, and $\lim_{x\to a}f(x)=f(a)$.

  12. What is the relationship between differentiability and continuity at a point?

    If $f$ is differentiable at $a$ then it is continuous at $a$; the converse is false (e.g. $f(x)=|x|$ at $x=0$ is continuous but not differentiable).

  13. State the limit definition of the derivative $f'(x)$.

    $f'(x)=\lim_{h\to 0}\dfrac{f(x+h)-f(x)}{h}$.

  14. State 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$.

  15. State Lagrange's Mean Value Theorem.

    If $f$ is continuous on $[a,b]$ and differentiable on $(a,b)$, then there exists $c\in(a,b)$ such that $f'(c)=\dfrac{f(b)-f(a)}{b-a}$.

  16. State Cauchy's Mean Value Theorem.

    If $f,g$ are continuous on $[a,b]$, differentiable on $(a,b)$, and $g'\neq 0$ on $(a,b)$, then there exists $c\in(a,b)$ with $\dfrac{f'(c)}{g'(c)}=\dfrac{f(b)-f(a)}{g(b)-g(a)}$.

  17. Write the Taylor series expansion of $f(x)$ about $x=a$.

    $f(x)=\sum_{n=0}^{\infty}\dfrac{f^{(n)}(a)}{n!}(x-a)^{n}=f(a)+f'(a)(x-a)+\dfrac{f''(a)}{2!}(x-a)^{2}+\cdots$

  18. What is the Maclaurin series, and write the expansion of $e^{x}$.

    A Maclaurin series is a Taylor series about $a=0$: $e^{x}=\sum_{n=0}^{\infty}\dfrac{x^{n}}{n!}=1+x+\dfrac{x^{2}}{2!}+\dfrac{x^{3}}{3!}+\cdots$

  19. State the first-derivative condition for a critical point and the second-derivative test for a local extremum of $f(x)$.

    Critical points satisfy $f'(x)=0$. At such a point: $f''(x)>0\Rightarrow$ local minimum, $f''(x)<0\Rightarrow$ local maximum, $f''(x)=0\Rightarrow$ test inconclusive.

  20. For a function $f(x,y)$, state the necessary condition for a local extremum (stationary point).

    Both first partial derivatives vanish: $f_{x}=\dfrac{\partial f}{\partial x}=0$ and $f_{y}=\dfrac{\partial f}{\partial y}=0$.

  21. State the second-derivative (Hessian) test for $f(x,y)$ using $D=f_{xx}f_{yy}-f_{xy}^{2}$.

    At a stationary point: if $D>0$ and $f_{xx}>0$ it is a local minimum; if $D>0$ and $f_{xx}<0$ a local maximum; if $D<0$ a saddle point; if $D=0$ the test is inconclusive.

  22. Define the partial derivative $\dfrac{\partial f}{\partial x}$ of $f(x,y)$.

    $\dfrac{\partial f}{\partial x}=\lim_{h\to 0}\dfrac{f(x+h,y)-f(x,y)}{h}$ — differentiate with respect to $x$ treating $y$ as constant.

  23. Define the gradient $\nabla f$ of a scalar field $f(x,y,z)$ and state its geometric meaning.

    $\nabla f=\left(\dfrac{\partial f}{\partial x},\dfrac{\partial f}{\partial y},\dfrac{\partial f}{\partial z}\right)$. It points in the direction of greatest increase of $f$ and is normal to level surfaces.

  24. Give the formula for the directional derivative of $f$ in the direction of a unit vector $\hat{u}$.

    $D_{\hat{u}}f=\nabla f\cdot\hat{u}$, where $\hat{u}$ is a unit vector. Its maximum value is $|\nabla f|$ (along $\nabla f$).

  25. Define the divergence of a vector field $\vec{F}=(F_{1},F_{2},F_{3})$.

    $\operatorname{div}\vec{F}=\nabla\cdot\vec{F}=\dfrac{\partial F_{1}}{\partial x}+\dfrac{\partial F_{2}}{\partial y}+\dfrac{\partial F_{3}}{\partial z}$ — a scalar measuring net outflow per unit volume.

  26. Define the curl of a vector field $\vec{F}$ and what it measures.

    $\operatorname{curl}\vec{F}=\nabla\times\vec{F}=\begin{vmatrix}\vec{i}&\vec{j}&\vec{k}\\ \partial_x&\partial_y&\partial_z\\ F_1&F_2&F_3\end{vmatrix}$; it measures the local rotation (circulation density) of the field.

  27. What are the identities $\operatorname{curl}(\nabla f)$ and $\operatorname{div}(\operatorname{curl}\vec{F})$ equal to?

    $\nabla\times(\nabla f)=\vec{0}$ and $\nabla\cdot(\nabla\times\vec{F})=0$ (curl of a gradient and divergence of a curl are always zero).

  28. State the Fundamental Theorem of Calculus (evaluation form).

    If $F'(x)=f(x)$ on $[a,b]$, then $\displaystyle\int_{a}^{b}f(x)\,dx=F(b)-F(a)$.

  29. Write the integration by parts formula.

    $\displaystyle\int u\,dv=uv-\int v\,du$.

  30. What is an improper integral, and what does it mean for it to converge? Illustrate with $\int_{1}^{\infty}\frac{1}{x^{p}}\,dx$.

    An improper integral has an infinite limit or unbounded integrand; it converges if its limit exists (is finite). $\displaystyle\int_{1}^{\infty}\frac{dx}{x^{p}}$ converges if $p>1$ and diverges if $p\leq 1$.

GATE Engineering Mathematics FAQ

What is in the GATE Engineering Mathematics syllabus?

GATE Engineering Mathematics is split into 5 chapters: Linear Algebra, Calculus, Differential Equations, Probability and Statistics and Numerical Methods and Complex Variables. Together they contain 20 topics and 32 sub-topics.

How many chapters are in GATE Engineering Mathematics?

5 chapters, containing 20 topics and 32 sub-topics. The largest chapter is Calculus, with 5 topics.

Are there flashcards for GATE Engineering Mathematics?

Yes — a 50-card Engineering Mathematics deck, printed in full in the flashcards section of this page and available in the Examius app with spaced repetition. The free plan covers one exam of your choice, including its flashcards; Examius Pro, a one-time purchase, unlocks every other exam and deck.