Engineering Mathematics
7 articles in this topic
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
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
Relations trip up more GATE aspirants than sets do. This guide builds from basic set operations to the properties that matter, reflexive, symmetric and transitive, then shows how closures, equivalence relations and partial orders get tested.
Combinational circuits: multiplexers, decoders and adders explained
A combinational circuit's output depends only on its current inputs, with no stored state. This guide works through the building blocks GATE keeps testing, multiplexers, decoders, encoders and adders, and shows how a single MUX can implement any logic function.
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.