🇮🇳 GATE Statistics · subject
GATE Statistics Calculus Syllabus
Every chapter and topic of Calculus examined in GATE Statistics — 6 chapters, 32 topics, plus 50 flashcards written against it.
Calculus syllabus — full chapter and topic list
Expand any chapter to see its topics and sub-topics. This is the whole examinable outline for Calculus in GATE Statistics, not a summary of it.
-
Finite, Countable and Uncountable Sets
1 topic- Real Number System
-
Sequences of Real Numbers
4 topics- Convergence of Sequences
- Bounded Sequences
- Monotonic Sequences
- Cauchy Criterion for Convergence
-
Series of Real Numbers
4 topics- Convergence
- Tests of Convergence
- Alternating Series
- Absolute and Conditional Convergence
-
Power Series and Radius of Convergence
overviewExamined as a single unit within Calculus — no further topic split in the official outline.
-
Functions of a Real Variable
12 topics- Limit
- Continuity
- Monotone Functions
- Uniform Continuity
- Differentiability
- Rolle’s Theorem
- Mean Value Theorems
- Taylor’s Theorem
- L’Hospital Rules
- Maxima and Minima
- Riemann Integration and Its Properties
- Improper Integrals
-
Functions of Several Real Variables
11 topics- Limit
- Continuity
- Partial Derivatives
- Directional Derivatives
- Gradient
- Taylor’s Theorem
- Total Derivative
- Maxima and Minima
- Saddle Point
- Method of Lagrange Multipliers
- Double and Triple Integrals and Their Applications
Calculus flashcards for GATE Statistics
25 of 50 cards from the Calculus deck — real questions with worked answers.
State the completeness (least upper bound) axiom of the real number system $\mathbb{R}$.
Every non-empty subset of $\mathbb{R}$ that is bounded above has a least upper bound (supremum) in $\mathbb{R}$. Equivalently, every non-empty set bounded below has a greatest lower bound (infimum).
Define the supremum $\sup S$ of a set $S \subseteq \mathbb{R}$.
$\alpha = \sup S$ is the least upper bound: (i) $x \leq \alpha$ for all $x \in S$, and (ii) for every $\varepsilon > 0$ there exists $x \in S$ with $x > \alpha - \varepsilon$.
State the Archimedean property of $\mathbb{R}$.
For any real numbers $a > 0$ and $b$, there exists a natural number $n$ such that $na > b$. Equivalently, $\mathbb{N}$ is unbounded above in $\mathbb{R}$.
What does the density of rationals in $\mathbb{R}$ state?
Between any two distinct real numbers $a < b$ there exists a rational number $q$ with $a < q < b$ (and also an irrational number).
Give the $\varepsilon$-$N$ definition of convergence of a sequence $(a_n)$ to limit $L$.
$a_n \to L$ means: for every $\varepsilon > 0$ there exists $N \in \mathbb{N}$ such that $|a_n - L| < \varepsilon$ for all $n \geq N$.
Is a convergent sequence necessarily bounded? Is the converse true?
Every convergent sequence is bounded. The converse is false: a bounded sequence need not converge, e.g. $a_n = (-1)^n$.
Define a bounded sequence $(a_n)$.
$(a_n)$ is bounded if there exists $M > 0$ such that $|a_n| \leq M$ for all $n$; equivalently it is bounded above and below.
State the Bolzano–Weierstrass theorem for sequences.
Every bounded sequence of real numbers has a convergent subsequence.
Define a monotonic (monotone) sequence.
$(a_n)$ is monotonically increasing if $a_{n+1} \geq a_n$ for all $n$, and monotonically decreasing if $a_{n+1} \leq a_n$ for all $n$. It is monotonic if it is one of these.
State the Monotone Convergence Theorem for sequences.
A monotonic sequence converges if and only if it is bounded. An increasing sequence bounded above converges to its supremum; a decreasing sequence bounded below converges to its infimum.
Define a Cauchy sequence $(a_n)$.
$(a_n)$ is Cauchy if for every $\varepsilon > 0$ there exists $N$ such that $|a_m - a_n| < \varepsilon$ for all $m, n \geq N$.
State the Cauchy criterion for convergence in $\mathbb{R}$.
A sequence of real numbers converges if and only if it is a Cauchy sequence. (This expresses the completeness of $\mathbb{R}$.)
What are $\limsup a_n$ and $\liminf a_n$, and when does $\lim a_n$ exist in terms of them?
$\limsup a_n = \lim_{n\to\infty} \sup_{k \geq n} a_k$ and $\liminf a_n = \lim_{n\to\infty} \inf_{k \geq n} a_k$. The limit exists iff $\liminf a_n = \limsup a_n$.
State the Squeeze (Sandwich) theorem for sequences.
If $a_n \leq b_n \leq c_n$ for all large $n$ and $a_n \to L$, $c_n \to L$, then $b_n \to L$.
For a series $\sum a_n$, what is the necessary condition (n-th term test) for convergence?
If $\sum a_n$ converges then $a_n \to 0$. Conversely, if $a_n \not\to 0$ the series diverges. ($a_n \to 0$ alone is not sufficient.)
Define convergence of an infinite series $\sum_{n=1}^{\infty} a_n$.
The series converges to sum $S$ if the sequence of partial sums $S_N = \sum_{n=1}^{N} a_n$ converges to $S$ as $N \to \infty$.
For the geometric series $\sum_{n=0}^{\infty} r^{n}$, when does it converge and to what?
It converges iff $|r| < 1$, with sum $\dfrac{1}{1-r}$. It diverges for $|r| \geq 1$.
For the $p$-series $\sum_{n=1}^{\infty} \dfrac{1}{n^{p}}$, state the convergence condition.
Converges if $p > 1$ and diverges if $p \leq 1$. In particular the harmonic series ($p=1$) diverges.
State the Comparison Test for positive-term series.
If $0 \leq a_n \leq b_n$: convergence of $\sum b_n$ implies convergence of $\sum a_n$; divergence of $\sum a_n$ implies divergence of $\sum b_n$.
State the Limit Comparison Test.
For $a_n, b_n > 0$, if $\lim_{n\to\infty} \dfrac{a_n}{b_n} = c$ with $0 < c < \infty$, then $\sum a_n$ and $\sum b_n$ both converge or both diverge.
State the Ratio Test (D'Alembert) for $\sum a_n$.
Let $L = \lim_{n\to\infty} \left| \dfrac{a_{n+1}}{a_n} \right|$. If $L < 1$ the series converges absolutely; if $L > 1$ it diverges; if $L = 1$ the test is inconclusive.
State the Root Test (Cauchy) for $\sum a_n$.
Let $L = \limsup_{n\to\infty} |a_n|^{1/n}$. If $L < 1$ the series converges absolutely; if $L > 1$ it diverges; if $L = 1$ the test is inconclusive.
State the Integral Test for series.
If $f$ is positive, continuous and decreasing on $[1,\infty)$ with $f(n) = a_n$, then $\sum_{n=1}^{\infty} a_n$ and $\int_{1}^{\infty} f(x)\,dx$ either both converge or both diverge.
State Cauchy's condensation test.
For a non-increasing sequence $a_n \geq 0$, $\sum_{n=1}^{\infty} a_n$ converges iff $\sum_{k=0}^{\infty} 2^{k} a_{2^{k}}$ converges.
State Raabe's test for $\sum a_n$ (positive terms).
Let $L = \lim_{n\to\infty} n\left( \dfrac{a_n}{a_{n+1}} - 1 \right)$. If $L > 1$ the series converges; if $L < 1$ it diverges; $L = 1$ is inconclusive. Useful when the ratio test gives $1$.
Planning Calculus for GATE Statistics
Calculus is about 28% of the GATE Statistics syllabus by topic count — 32 of 116 topics, spread over 6 chapters. At roughly 45 minutes per topic plus 12 minutes per sub-topic, a first pass runs to about 25 hours.
The heaviest chapters are Functions of a Real Variable (12 topics), Functions of Several Real Variables (11 topics), Sequences of Real Numbers (4 topics) . Front-load those while your energy is high; the short chapters are better revision filler later.
Work top-down: read the chapter, then tick topics off individually rather than marking the whole chapter done. Sub-topics are where silent gaps hide.
Calculus (GATE Statistics) FAQ
What is in the GATE Statistics Calculus syllabus?
Calculus is split into 6 chapters — Finite, Countable and Uncountable Sets, Sequences of Real Numbers, Series of Real Numbers, Power Series and Radius of Convergence, Functions of a Real Variable and Functions of Several Real Variables, containing 32 topics and 0 sub-topics in total.
How is Calculus structured in the GATE Statistics syllabus?
6 chapters. Calculus accounts for about 28% of the topics in the whole GATE Statistics syllabus (32 of 116).
How long should I spend on Calculus for GATE Statistics?
Budget around 25 hours for a first pass through Calculus — about 45 minutes per topic plus 12 minutes per sub-topic across its 32 topics. Add revision cycles on top.
Are there flashcards for GATE Statistics Calculus?
Yes — a 50-card Calculus deck. Sample cards are printed on this page, and the full deck is free in the Examius app with spaced repetition scheduling.