Computer · Part B - Mathematical and Hardware Foundations · Major topic 4 of 39

Mathematical and Statistical Foundations

The mathematics that makes algorithms precise and computer-based evidence trustworthy. Build concrete intuition first, then symbolic and proof-based fluency.

138 items insideAsked 1× in the RPSC/RSSB papers we analysed, most recently 2013COM-04

Also look at: Science & Technology: Mathematics, Statistics and Data FoundationsPhysics: Mathematics for PhysicsBiology: Mathematics, Chemistry, Physics & Data for BiologyMaths: Mathematics Beyond Exams: Universal Roadmap

  1. 1

    Historical evolution — key dates

    • Euclid’s algorithm exemplifies precise stepwise computation.c. 300 BCE
    • Logarithms, analytic geometry and probability theory support complex calculation.1600s
    • Boolean algebra creates a mathematical path to digital logic.1854
    • Logic, set theory, computability and formal languages become foundations of theoretical CS.1930s
    • Information theory, operations research, numerical methods and statistical computing expand mathematical computing.1940s-1960s
    • Complexity, optimization, cryptography, data mining and statistical learning gain importance.1970s-2000s
    • Modern ML relies on linear algebra, probability, optimization, information theory and robust evaluation.2010s-2020s
  2. 2

    Arithmetic and number systems

    • Natural, integer, rational, real and complex numbers; magnitude; order; ratios; percentages; units; scientific notation
      7 more points
      • Natural, integer, rational, real and complex numbers
      • Magnitude
      • Order
      • Ratios
      • Percentages
      • Units
      • Scientific notation
    • Prime numbers, divisibility, factors, multiples, greatest common divisor, least common multiple, modular arithmetic.
    • Binary, octal, decimal, hexadecimal; base conversion; signed numbers; fixed-point and floating-point concepts
      4 more points
      • Binary, octal, decimal, hexadecimal
      • Base conversion
      • Signed numbers
      • Fixed-point and floating-point concepts
  3. 3

    Algebra and functions

    • Variables, expressions, equations, inequalities, polynomials, exponentials, logarithms, systems of equations.
    • Functions, domains/ranges, composition, inverse, piecewise functions, sequences, recurrence relations.
    • Vectors, matrices, matrix multiplication, rank, determinant, eigenvalues/eigenvectors, projections and decompositions.
  4. 4

    Logic and proof

    • Propositions, predicates, quantifiers, implication, equivalence, truth tables, inference rules.
    • Direct proof, contrapositive, contradiction, induction, strong induction, counterexample, invariant.
    • Sets, subsets, power sets, Cartesian products, relations, equivalence relations, partial orders, functions and mappings.
  5. 5

    Discrete mathematics

    Asked 1× · last 2013

    • Combinatorics; permutations; combinations; pigeonhole principle; inclusion-exclusion; recurrence solving
      6 more points
      • Combinatorics
      • Permutations
      • Combinations
      • Pigeonhole principle
      • Inclusion-exclusion
      • Recurrence solving
    • Graphs, directed graphs, trees, paths, cycles, connectivity, bipartite graphs, matching, planarity, graph colouring.
    • Discrete probability; random variables; expectation; variance; conditional probability; Bayes’ theorem; Markov chains
      7 more points
      • Discrete probability
      • Random variables
      • Expectation
      • Variance
      • Conditional probability
      • Bayes’ theorem
      • Markov chains
  6. 6

    Calculus and continuous methods

    • Limits, continuity, derivatives, partial derivatives, gradients, chain rule, integrals, multivariable calculus.
    • Taylor approximation; differential equations; numerical integration; root finding; error and convergence
      5 more points
      • Taylor approximation
      • Differential equations
      • Numerical integration
      • Root finding
      • Error and convergence
    • Optimization
      5 more points
      • Gradient descent
      • Convexity
      • Constrained optimization
      • Lagrange multipliers
      • Stochastic optimization
  7. 7

    Statistics and experimental reasoning

    • Descriptive statistics; sampling; distributions; estimators; confidence intervals; hypothesis tests; p-values; effect size
      8 more points
      • Descriptive statistics
      • Sampling
      • Distributions
      • Estimators
      • Confidence intervals
      • Hypothesis tests
      • P-values
      • Effect size
    • Correlation vs causation; confounding; study design; multiple testing; power; Bayesian inference; uncertainty
      7 more points
      • Correlation vs causation
      • Confounding
      • Study design
      • Multiple testing
      • Power
      • Bayesian inference
      • Uncertainty
    • Regression; classification metrics; cross-validation; bootstrap; time-series basics; calibration; data leakage
      7 more points
      • Regression
      • Classification metrics
      • Cross-validation
      • Bootstrap
      • Time-series basics
      • Calibration
      • Data leakage
  8. 8

    Information and coding mathematics

    • Entropy; conditional entropy; mutual information; source coding; lossless/lossy compression; channel capacity
      6 more points
      • Entropy
      • Conditional entropy
      • Mutual information
      • Source coding
      • Lossless/lossy compression
      • Channel capacity
    • Error-detecting and error-correcting codes; Hamming distance; parity; CRC; finite fields; coding theory
      6 more points
      • Error-detecting and error-correcting codes
      • Hamming distance
      • Parity
      • CRC
      • Finite fields
      • Coding theory
  9. 9

    Numerical and scientific computing

    • Precision, rounding, cancellation, conditioning, stability, convergence, numerical error and reproducibility.
    • Monte Carlo methods; simulation; random number generation; sensitivity analysis; uncertainty propagation
      5 more points
      • Monte Carlo methods
      • Simulation
      • Random number generation
      • Sensitivity analysis
      • Uncertainty propagation
  10. 10

    Optimization, decision and operations research

    • Linear/integer programming; combinatorial optimization; flow; scheduling; queuing; decision theory; game theory
      7 more points
      • Linear/integer programming
      • Combinatorial optimization
      • Flow
      • Scheduling
      • Queuing
      • Decision theory
      • Game theory
    • Multi-objective optimization; Pareto frontier; resource allocation; cost-benefit; constrained decision
      5 more points
      • Multi-objective optimization
      • Pareto frontier
      • Resource allocation
      • Cost-benefit
      • Constrained decision
  11. 11

    MTech depth

    • Measure/probability foundations as needed; convex analysis; advanced statistical inference; information geometry
      4 more points
      • Measure/probability foundations as needed
      • Convex analysis
      • Advanced statistical inference
      • Information geometry
    • Optimization convergence; randomized algorithms; high-dimensional statistics; causal inference; formal proof techniques
      5 more points
      • Optimization convergence
      • Randomized algorithms
      • High-dimensional statistics
      • Causal inference
      • Formal proof techniques