CS Fundamentals
460 articles in this topic

Liveness Analysis in Compiler Design: Data-Flow Equations and a Worked Example
A step-by-step guide to computing USE, DEF, IN and OUT on a looping control-flow graph, then tracing the result to one safe dead-store candidate.

Propositions in Logic: Non-Contradiction, Excluded Middle and Worked Truth Tables
Learn what makes a sentence a proposition, how excluded middle differs from non-contradiction, and how both laws simplify a larger truth table.

File Management in Operating Systems: Complete GATE Guide with Worked Examples
Follow report.bin from its pathname to its inode and data blocks, compare three allocation methods, size a free-space bitmap, and calculate multi-level inode capacity.

Serialization in Java: Object Streams, transient, serialVersionUID and Runnable Examples
Write and restore a complete Student object, trace every retained field, and learn how Java handles transient, static, shared and evolving state.

Theory of Computation for GATE: An 8-Week Topic-by-Topic Plan
Turn Theory of Computation into an eight-week routine with a dependency-based sequence, worked examples, an error loop, recovery time, and timed revision.

Floating-Point Basics: Binary Normalisation, Worked Examples and Exam Patterns
Connect sign, significand, exponent and bias through one continuous toy-format example. Then see exactly why 0.1 needs rounding and how spacing changes with scale.

DeMUX, Decoder and Encoder Explained: Truth Tables, Worked Circuits and Exam Traps
Follow binary 101 through a decoder, a DeMUX and an encoder, then use the same logic to realise a Boolean function and solve common exam checks.

Enums in C Explained: Values, a Worked Output Trace and Exam Traps
Learn how C assigns enum values, how explicit resets and duplicate constants behave, and how to trace enum-based switch output without missing fall-through.

Cloud Deployment Models: Public, Private, Community and Hybrid with a 60-VM Worked Example
Learn a four-question method to classify cloud deployment models, then carry one 60-VM workload through public, private, community, and hybrid designs.

SLR(1) Parser and Conflicts: LR(0) Items, FOLLOW Sets and a Full Parse
Build one SLR(1) parser from augmentation to acceptance. The same grammar exposes an LR(0) conflict, shows how FOLLOW removes it, and traces every move for aab$.

Implication and Biconditional Operators in Logic: Truth Tables, Equivalences and Exam Traps
Learn why implication fails only at T to F, how biconditional checks matching values, and how to translate if, only if, necessary and sufficient. Includes a full contrapositive proof and fast exam checks.

Distributed Systems in Operating Systems: Worked Examples for GATE and Interviews
Learn how distributed operating systems reason about messages, causality, coordination, consistency, replication, and partial failure. Follow exact RPC, clock, quorum, and file-replication examples built for exam and interview practice.