CS Fundamentals
200 articles in this topic
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.
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.
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.
Pointers in C for GATE: Memory Diagrams and Output Traces
Draw pointers as addresses in boxes, then trace double pointers, arrays, swaps and precedence without guessing. The worked outputs show the method GATE rewards.
TCP Congestion Control for GATE
Track cwnd at one fixed point in every round, apply the correct growth rule, and reset it on the stated loss signal. A worked ten-RTT table follows the sawtooth.
LL(1) Parsing Table Construction for GATE
Build an LL(1) table cell by cell, test it for conflicts, and see how left recursion and common prefixes break predictive parsing.
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.
fork() Questions in GATE
Trace three common fork() patterns without the off-by-one error, then handle return values, loops, printed output, and inherited buffers.
ER Model to Relational Mapping for GATE: Minimum Number of Tables Questions Solved
Count the minimum relations from cardinality and participation, then check the special rules for weak entities, relationship attributes, and multivalued attributes.
DFA Minimization for GATE
Remove unreachable states, split final from non-final states, and refine until every transition signature is stable. A complete six-state example shows each split.
SQL Queries for Placement Interviews: Second Highest Salary, Joins and GROUP BY Step by Step
SQL queries for placement interviews built step by step on one schema: second highest salary three approaches, joins with results shown, GROUP BY and HAVING.
Operating System Interview Questions for Freshers: Top 50 with Answers
50 operating system interview questions for freshers, every one answered and grouped into the follow-up chains interviewers walk: process vs thread, context-switch cost, scheduling trade-offs, synchronization to deadlock, paging to thrashing, plus file-system quick-fires and a two-week prep plan.