Engineering Mathematics
22 articles in this topic
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.
Group Theory and Algebraic Structures: Groups, Rings and Fields Explained
Group theory for GATE CS: binary operations, group axioms, abelian and cyclic groups, subgroups, Lagrange's theorem, rings, fields and a worked Zn example.
Set theory and relations: closures, equivalence and partial orders explained
Antisymmetric is not the negation of symmetric, a transitive closure is not finished after one pass, and a Hasse diagram is what is left once you delete every edge transitivity already implies. Set operations, relation properties, closures, equivalence classes and posets, worked for GATE.
Combinational circuits: multiplexers, decoders and adders explained
A combinational circuit's output depends only on its current inputs, with no stored state. Multiplexers, decoders, encoders and adders are the blocks GATE keeps testing, and a single 4-to-1 MUX can implement any three-variable Boolean function using just one inverter.
Regular expressions and the pumping lemma, with the exam angle
Regular expressions and the pumping lemma explained: the operators, closure properties, and a worked proof that a^n b^n is not regular, with the exam angle.