CS Fundamentals

263 articles in this topic

DMA, Interrupts and Programmed I/O for GATE: Cycle-Stealing and Overhead Numericals Solved

Track who moves the data, who owns the bus and how often the CPU must intervene. Two worked numericals turn DMA and interrupt overhead into simple rate calculations.

Updated 24 Jul 20266 min readC Programming & Data Structures

OSI vs TCP/IP Model for GATE: Which Layer Does What, with PYQ Traps

Map every OSI and TCP/IP layer to its function, PDU, address and device. Then trace an HTTP request through encapsulation and fix the usual layer traps.

Updated 24 Jul 20266 min readComputer Networks

Closures in JavaScript Explained: Lexical Scope, the Loop Trap and Interview Questions

Go beyond the one-line closure definition. Predict a private counter, understand why var timers print 3 three times, and learn the two standard fixes.

Updated 24 Jul 20266 min readCompiler Design

Recurrence Relations for GATE: Solving Linear Recurrences by Characteristic Roots and Generating Functions

Solve one linear recurrence twice, see why both methods agree, and keep discrete-maths recurrences separate from the Master Theorem.

Updated 24 Jul 20265 min readEngineering Mathematics

Magnetic Disk Numericals for GATE: Capacity, Seek Time and Transfer Rate Solved

Turn disk geometry into four reliable calculations. One fully specified disk is solved for capacity, rotation time, transfer rate and sector access time.

Updated 29 Jul 20266 min readOperating Systems

Cyber Threats and Malware Attacks: Types, Attack Chains and a Worked Incident

Learn to separate vectors, techniques and payloads, classify mixed malware behaviour, calculate exposure, and map controls to each incident stage.

Updated 26 Jul 20266 min readDBMS

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 readTheory 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 readDigital 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