CS Fundamentals
171 articles in this topic
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.
Control Flow in C Programming: If-Else, Loops, Switch and Jump Statements with Worked Examples
Learn how C chooses, repeats and redirects execution. Trace common output questions step by step, including do-while, continue, switch fall-through and dangling else.
Introduction to Computer Networks: Layers, Topologies, Switching and Delay Formulas with Worked Examples
Build the Computer Networks foundation that later CN topics assume, including layer models, topology maths, switching choices and an end-to-end delay calculation.
Top-Down Parsing in Compiler Design: Recursive Descent, LL(1), FIRST and FOLLOW with Worked Examples
Learn top-down parsing from grammar preparation to predictive parsing, with one expression grammar carried through every calculation and trace.