CS Fundamentals
198 articles in this topic
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
Cache Memory Organization in COA: Mapping, Hit Ratio and Worked Examples
Learn cache organization through one 64 KB memory and 1 KB cache example, carried from address fields and mapping to AMAT, writes, replacement and directory size.
Number System in Digital Electronics: Base Conversion, Complements and Binary Arithmetic
Learn one dependable method for positional values, decimal fractions, binary grouping, complements, subtraction and signed overflow, with every step checked.