GATE CS 2027
One short page per topic: the definitions, the formulas, the mistakes to avoid and a quick-revision list. Switch on revision mode to see only what you reread before the exam.
Adders are the core combinational blocks of arithmetic. A half adder adds two bits; a full adder adds three bits (two operands and a carry-in). Chaining full adders yields a ripple-carry adder (RCA); carry-lookahead (CLA) computes the carries in parallel to cut the delay.
Algebraic minimization rewrites a Boolean expression using identities until literal count, term count, or gate count drops, without changing the truth table. It is the syllabus's first minimization technique: no map drawing, no tabular covering.
The all-pairs shortest-paths problem asks for δ(i,j) for every pair of vertices.
Every model in the theory of computation (finite automata, pushdown automata, Turing machines) processes strings built from a fixed finite alphabet. A language is simply a set of strings.
An analogy is a pair of items in some relation, A : B, together with a third item C; the task is to find the item D that stands in the same relation to C: A : B :: C : D. The items can be words, numbers, letter groups or figures.
A C array is a fixed number of objects of one type stored contiguously in memory. Arrays and pointers are closely tied: in most expressions an array name turns into a pointer to its first element, and the subscript a[i] is defined through pointer arithmetic.
