CS Fundamentals
263 articles in this topic

C Programming Fundamentals: Complete Guide with Worked Examples for GATE and Placements
Build a reliable C foundation through traced outputs, pointer arithmetic, function calls, arrays, structures, recursion, and memory allocation.

Network Hardware Basics for GATE CS: Devices, OSI Layers, and Collision Domain Counting
Stop mixing up hubs, switches, and routers. Learn the device layers, domain-counting rules, transmission media, and a worked topology for GATE and interviews.

Code Optimization in Compiler Design: Basic Blocks, Data Flow and Worked Examples
Learn how compiler optimizers use basic blocks, control-flow graphs and data-flow facts. Two checked traces cover loop strength reduction, liveness and safe dead-code removal.

Group Theory in Discrete Mathematics: Group Tests, Subgroups and Worked Examples
Learn a repeatable group test through addition and multiplication modulo 8, subgroups, cosets, a quotient map, and non-commuting permutations in S_3.

Process Synchronization in Operating Systems: Semaphores, Critical Sections and Worked Examples
Build process-synchronization reasoning from a lost update to critical-section rules, semaphore operations, a capacity-3 buffer trace and common failure patterns.

Relational Calculus in DBMS: Tuple and Domain Calculus Explained with Worked Examples
Learn TRC and DRC through one small database, then trace existential and universal queries without getting caught by quantifier or safety mistakes.

Moore and Mealy Machines: Output Tracing, Conversion and Worked Examples
Learn how state outputs and transition outputs change a trace. Two binary examples show parity, Moore-to-Mealy conversion and the exact state splitting needed in the reverse direction.

Multiprocessors in COA: Concepts, Amdahl's Law and Cache Coherence Worked Examples
Connect multiprocessor classifications, interconnects, memory models, speedup and cache coherence. Then solve the Amdahl and MESI patterns GATE questions rely on.

Number Representation in Digital Electronics: Conversions, Complements and Worked Examples
Learn number representation through exact conversions, signed encodings, binary arithmetic, special codes, fixed point and IEEE 754 worked examples.

Structured Knowledge Representation Models: Semantic Networks, Frames, Scripts and Worked Inheritance
Learn how structured knowledge models store relations, attributes and events. Trace defaults and exceptions through one exact Bird, Penguin and Pingu example.

Data Communication in Computer Networks: Complete Guide with Worked Examples
Build the Data Communication basics that make Computer Networks numericals easier. Learn the core terms, choose the right formula, and solve four standard patterns step by step.

Bottom-Up Parsing in Compiler Design: Shift-Reduce, LR Parsers, and Worked Examples
Learn bottom-up parsing as a mechanical stack process, then work through an expression trace and a complete LR(0) automaton construction.