CS Fundamentals
200 articles in this topic
IPv4 and Network Layer Protocols: Complete Guide with Worked Examples for GATE CS
Build a clear picture of IPv4, its support protocols and the header calculations that matter in GATE CS. Includes a complete fragmentation example.
Left Factoring in Compiler Design: Prefix Rules, Worked Grammars and Exam Traps
Learn how to find a useful common prefix, factor a grammar to a fixed point, preserve empty suffixes, and test what the result does and does not prove.
3D Object Representation, Geometric Transformations and Viewing: A Worked Pipeline
Track three vertices through a complete 3D graphics pipeline. The worked example makes matrix order, camera depth and viewport conversion explicit.
Memory Management in Operating Systems: Paging, Virtual Memory and Worked Examples
Connect allocation, paging, segmentation and virtual memory through one address-translation system, two access-time calculations and a full replacement trace.
Relational Model and Functional Dependencies in DBMS: Keys, Closure and Minimal Cover
Build keys, closures and a minimal cover from one seven-attribute enrolment relation. Then use the same dependencies to explain redundancy and decomposition.
Closure Properties of Regular, Context-Free and Recursive Languages for GATE: The Complete Table with MSQ Drills
Learn the closure table through the few cells that cause most mistakes, then test the logic on four solved MSQ statements.
Instruction Formats and Addressing Modes in COA: Complete Guide with Worked Examples
Learn how zero, one, two, and three-address instructions change a program, then solve expanding-opcode and effective-address questions step by step.
Synchronous Counter Analysis: Two Worked State Sequences for GATE
Analyse two three-bit synchronous counters step by step. One produces a binary MOD-8 sequence, while the other shows how unused states can trap a circuit.
Storage Classes, Structures and Enums in C: Worked Examples for GATE Output and sizeof Questions
Trace static variables across calls, calculate structure padding byte by byte, compare structures with unions, and follow enum values after an explicit jump.
Cloud Computing and IoT in Computer Networks: Complete Guide with Worked Examples
Learn how cloud models, IoT protocols, network throughput, messaging overhead, and edge latency fit together through three solved examples.
SSA and Control Flow in Compiler Design: Dominators, Phi Nodes and a Worked CFG
Build SSA as one connected process. This worked compiler-design example goes from a six-block CFG to dominators, phi placement, renaming and return value 3.
Mathematical Representation of Points and Lines in Computer Graphics: From Equations to Pixels
Follow one segment from Cartesian coordinates to line equations, a point projection, a homogeneous intersection and seven selected pixels.