Engineering Mathematics
28 articles in this topic
Group Theory in Discrete Mathematics: Group Tests, Subgroups and Worked Examples
Learn a repeatable group test through addition and multiplication modulo 8, subgroups, cosets, a quotient map, and non-commuting permutations in S_3.
Functions in Discrete Mathematics: Types, Counting and Worked Examples
Learn how to recognise function types, count constrained mappings, compose rules in the correct order and decide when an inverse exists. Each idea is checked on finite sets.
Graph Theory for GATE CS: Concepts and Worked Examples
Build graph theory from two fully specified examples. Work through degree counts, connectivity, spanning trees, bipartiteness, planarity, and Euler and Hamilton checks.
Relations in Discrete Mathematics: Properties, Posets and Worked Examples
Build relations from Cartesian products, test their properties mechanically, and solve equivalence, partial-order, closure, and counting questions with exact examples.
Propositional and Predicate Logic in Discrete Mathematics: From Truth Tables to Quantifiers
Build logic from atomic propositions to nested quantifiers, with complete truth tables, canonical forms, countervaluations, and finite-domain checks.
Optimization in Discrete Mathematics: Linear Programming, Integer Methods and Worked Examples
Learn how to model and solve continuous and discrete optimization problems through a workshop LP, an integer branch-and-bound tree, an assignment matrix, and a dual.
Discrete Mathematics for GATE: Syllabus, Weightage Context and Preparation Order
Learn where Discrete Mathematics sits in GATE CS, how its syllabus areas connect, and how to cover them through a practical 45-hour study plan.
Lattices and Hasse Diagrams for GATE: Posets, LUB, GLB and the Lattice Test, Solved
Learn to read covering relations, compute joins and meets, and prove whether a poset is a lattice through two complete worked examples.
Recurrence Relations for GATE: Solving Linear Recurrences by Characteristic Roots and Generating Functions
Solve one linear recurrence twice, see why both methods agree, and keep discrete-maths recurrences separate from the Master Theorem.
Probability for GATE CS
Translate the wording into events before calculating. Exact dice, Bayes and expectation examples show how to build the denominator and avoid the standard independence trap.
Linear Algebra for GATE CS: Rank, Consistency and Eigenvalues
Reduce matrices cleanly, classify Ax=b by ranks, and turn eigenvalue properties into fast calculations. Each result is checked against an independent property.
Permutations and Combinations for GATE CS: Counting Questions Solved with a Repeatable Method
One repeatable method (choose, arrange, subtract) applied to 20 GATE-style counting problems, with the four-question decision procedure that replaces formula memorisation for permutations and combinations in GATE CS.