CS Fundamentals
261 articles in this topic
Backus-Naur Form (BNF) Explained: Grammar Rules, Worked Derivations and Exam Traps
Learn to read BNF as a grammar, not as punctuation. Follow complete derivations, compare ambiguous parses, and see how recursion affects parsing.
Computer Instruction Explained: Format, Instruction Cycle and a 16-Bit Worked Example
Decode an illustrative 16-bit load instruction, calculate its effective address, trace fetch through write-back, and learn the errors that change answers.
RSSB Computer Instructor Digital Logic and Computer Fundamentals: Worked Number Systems, Boolean Algebra and Memory Basics
Connect number systems, Boolean algebra, memory capacity and CPU organisation through four checked examples designed for RSSB Computer Instructor preparation.
Miscellaneous C Programming: Storage Classes, Operators, Type Conversion, Macros and Bitwise, Fully Solved
Learn the C rules behind predict-the-output questions, then apply them to five fully worked patterns covering static storage, precedence, conversions, macros and bits.
CSMA/CD and ALOHA for GATE: Efficiency and Minimum Frame Size Numericals Solved
Separate one-way delay from round-trip delay, then solve the standard CSMA/CD frame-size and ALOHA throughput numericals step by step.
Basic Blocks, Loops and Optimization Methods in Compiler Design: A Worked Example
Follow one three-address-code fragment from leader identification to a natural loop, then verify how invariant motion and strength reduction preserve its result.
Graph Traversal: Walk, Trail, Path, Circuit and Connectivity with Worked Examples
Use one six-vertex graph to distinguish walks, trails, paths, circuits and cycles. Then test reachability, components and a bridge with exact sequences.
Threads and Process Creation in OS: fork() Worked Examples
See exactly what processes and threads own, then trace copy-on-write, a conditional fork tree, and a shared-counter race without relying on shortcuts.
SQL in DBMS: Complete Guide with Queries, Joins and Worked Results
Learn SQL by following one college database from table creation to joins, aggregates, subqueries, and transactions. Every worked query includes the rows you should predict.
Complexity Theory in Theory of Computation: P, NP, NP-Completeness and Worked Examples
Build complexity theory from input encoding upwards, then test each idea through a verified certificate and a complete 9-vertex reduction graph.
IEEE 754 Floating-Point Standard: Binary32, Rounding and Worked Examples
Learn how IEEE 754 stores floating-point values, then encode -13.25, decode 0x3F400000, classify special values and reason about rounding errors.
Digital India and e-Governance: Models, Service Architecture and Worked ICT Examples
See how an e-governance service works from request to decision. Follow a fictional application, calculate workload and uptime, and test its controls.