CS Fundamentals

260 articles in this topic

File Systems and I/O for GATE: Allocation, Inodes and Worked Examples

A file-system question becomes manageable when you trace the path from a name to an inode, blocks and device I/O. Work through allocation, offsets and timing with reproducible examples.

Updated 21 Aug 20267 min readOperating Systems

ER Diagram in DBMS: Complete Guide with Worked Examples for GATE and Interviews

Learn to read a crowded ER diagram, reduce it to the minimum relational tables, and avoid the weak-entity, multivalued-attribute, and relationship traps that change the answer.

Updated 21 Aug 20267 min readDBMS

Pushdown Automata and CFG: Construction, Stack Traces and CFL Tests

Build a CFG and PDA for one language, trace both, convert the grammar, and settle the main CFL property traps with proofs.

Updated 21 Aug 20266 min readTheory of Computation

Computer Organization and Architecture for GATE: Syllabus Areas, Weightage Pattern and Prep Order

See what COA covers in GATE CS, where recent-paper questions concentrate, and how to sequence pipelining, cache, control and I/O preparation.

Updated 19 Aug 20265 min readComputer Organization & Architecture

Binary, Octal and Hexadecimal: Worked Conversions, Arithmetic and GATE Exam Traps

Follow one value across four bases, then add unlike radices safely and verify the result through binary grouping and decimal place value.

Updated 19 Aug 20265 min readDigital Logic

Functions in C Programming: Complete Guide with Worked Examples

Learn how C functions behave in memory, why ordinary swaps fail, how arrays decay, and how recursive calls unwind through clear code traces.

Updated 19 Aug 20266 min readC Programming & Data Structures

Mobile Technology in Computer Networks: Cellular Concepts, GSM, CDMA and Handoff with Worked Examples

Build a clear picture of cellular networks, GSM roles, CDMA decoding, handoff and Mobile IP, then test it with two fully worked numericals.

Updated 19 Aug 20266 min readComputer Networks

Formal Grammar and Chomsky Hierarchy for GATE: Worked Derivations and Classification

Learn formal grammar from G=(V,T,P,S), derive aaabbb, classify Types 3 to 0, and prove why id+id*id is ambiguous before practising quick checks.

Updated 19 Aug 20266 min readCompiler Design

Introduction to Viewing in Computer Graphics: Window-to-Viewport Mapping with a Worked Example

Follow a point and a triangle from a world window to a viewport. Derive the transform, audit the arithmetic, and separate clipping, distortion, and y-axis reversal.

Updated 19 Aug 20266 min readEngineering Mathematics

Virtual Machines in Operating Systems: Hypervisors, Isolation and a Worked Resource Plan

Follow one three-VM host plan from the hypervisor layer to CPU scheduling, address translation, virtual I/O, isolation, snapshots and migration.

Updated 19 Aug 20266 min readOperating Systems

Decomposition in DBMS: Lossless Join, Dependency Preservation and 4NF with Worked Examples

Learn the two decomposition checks through concrete joins, attribute closures, the 3NF and BCNF trade-off, and a worked 4NF example.

Updated 19 Aug 20265 min readDBMS

Theory of Computation for GATE: Syllabus Map, Weightage Audit and Preparation Order

Map the official Theory of Computation syllabus, audit its completed GATE 2026 paper weightage, and revise finite automata, PDA and Turing machines in dependency order.

Updated 19 Aug 20265 min readTheory of Computation