CS Fundamentals
485 articles in this topic
NFA to DFA Conversion for GATE: Subset Construction and State-Count Numericals
Convert two small NFAs into complete DFAs, handle epsilon-closure and the dead state, and separate the reachable state count from the 2^n worst case.
Updated 24 Jul 20266 min read118 viewsTheory of Computation
Hardwired vs Microprogrammed Control Unit for GATE: Microinstruction Sizing Numericals Solved
Separate the qualitative comparison from the sizing numerical. Two worked control-store examples show exactly where every microinstruction bit comes from.
Updated 22 Jul 20267 min readComputer Organization & Architecture
Multiplexer Realization for GATE: Implementing Any Boolean Function with a Smaller MUX, Solved
Learn why a smaller MUX is enough for a Boolean function, then wire a complete 4:1 example without guessing any data input.
Updated 22 Jul 20265 min read231 viewsDigital Logic
C Programming Interview Questions for Freshers: The 40 Asked in Vivas and Placement Drives
Prepare 40 common C questions with short interview-safe answers, then learn how to dry-run pointer mutation on a whiteboard.
Updated 22 Jul 20266 min readC Programming & Data Structures
CSS Box Model, Positioning and z-index Explained with Worked Layout Examples
Calculate a CSS box's real width, choose the right position value, and trace z-index with exact numbers. The examples turn common layout bugs into rules.
Updated 22 Jul 20266 min readComputer Networks
Phases of a Compiler for GATE: One Statement Traced Through Every Phase
Follow position = initial + rate * 60 through all six compiler phases. Each step shows the exact artifact, error class and hand-off that GATE can test.
Updated 29 Jul 20266 min readCompiler Design
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.
Updated 21 Jul 20265 min readEngineering Mathematics
Final Year Placement Preparation Plan: A 90-Day Schedule for Aptitude, Coding and Interviews
Run aptitude, coding and interviews as three connected streams across 90 days. The schedule includes weekly hours, phase checkpoints and a rule for missed days.
Updated 25 Jul 20266 min readOperating Systems
Relational Algebra for GATE: Operators, Tuple-Counting and Query Equivalence Drills
Calculate set, join, and outer-join cardinalities on concrete relations, then use selection and projection pushdown without changing query meaning.
Updated 21 Jul 20266 min readDBMS
Ambiguous Grammars, Precedence and Associativity for GATE: Two-Tree Proofs and Grammar Rewrites
Proving a grammar ambiguous takes one witness string and two parse trees. Removing the ambiguity takes precedence layers plus a chosen recursion direction.
Updated 21 Jul 20265 min readTheory of Computation
Booth's Algorithm for GATE: Signed Multiplication Traced Step by Step
Trace Booth multiplication through A, Q and Q-1, preserve the sign during every shift, and count additions and subtractions from bit transitions.
Updated 20 Jul 20265 min read68 viewsComputer Organization & Architecture
Flip-Flop Conversion for GATE: Excitation Tables and the SR, JK, D, T Conversion Recipe, Solved
Convert one flip-flop into another with the target transition, the available device's excitation table and a K-map. The solved JK-to-T case shows every row.
Updated 20 Jul 20266 min read102 viewsDigital Logic