KTU S1

Mathematics for Information Science-1

GAMAT101 · 3.0 credits · 14 topics · official syllabus ↗

Module 1: Foundations of Calculus · 9 hrs

Limits revisited with the formal definition and one-sided tests, continuity and its failure modes, the derivative built as a limit of difference quotients, and linear approximation extended to Taylor series. Everything later in the course rests on this module, which is why it starts from the definitions rather than the rules.

Limits Revisited
Easy · ~25 min
→
Limit Laws and L'Hopital's Rule
Medium · ~28 min
→
Continuity
Medium · ~25 min
→
The Derivative as a Limit
Medium · ~28 min
→
Linear Approximation and Taylor Series
Hard · ~30 min
→

Module 2: Foundations of Multivariable Calculus · 9 hrs

Functions of two variables, seen through graphs, level curves and contours; limits and continuity extended to the plane, where the path you approach along starts to matter; and partial derivatives as the rate of change in one variable with the others held still.

Functions of Several Variables
Medium · ~25 min
→
Limits and Continuity in Two Variables
Hard · ~28 min
→
Partial Derivatives
Medium · ~28 min
→

Module 3: Calculus for Analysis and Unconstrained Optimisation · 9 hrs

The chain rule extended to compositions and to several variables, the gradient as the vector form of the derivative, directional derivatives, and the second-derivative test that classifies critical points as maxima, minima or saddles.

Composition and the Chain Rule
Medium · ~26 min
→
The Gradient and Directional Derivatives
Hard · ~30 min
→
Unconstrained Optimisation and the Second Derivative Test
Hard · ~30 min
→

Module 4: Calculus for Constrained Optimisation · 9 hrs

Optimisation once the variables are no longer free: elimination of a variable, Lagrange multipliers, iterative descent by following the negative gradient, and linear programming solved graphically and by the simplex procedure.

Constrained Optimisation and Lagrange Multipliers
Hard · ~32 min
→
Iterative Minimisation by Steepest Descent
Hard · ~26 min
→
Linear Programming and the Simplex Procedure
Hard · ~30 min
→