CS Fundamentals
464 articles in this topic
Deadlock in Operating Systems: Four Conditions, Handling Methods and a Worked Banker's Algorithm
Build deadlock reasoning from resource-allocation graphs to safe-state checks. The five-process Banker's example also tests one safe and one unsafe request.
Updated 9 Sep 20266 min readOperating Systems
SQL Datatypes, Operators and NULL: Worked Examples and Three-Valued Logic
Use one four-row Employee table to master SQL type choices, operator precedence, NULL, three-valued logic, COALESCE and aggregate outputs step by step.
Updated 9 Sep 20265 min readDBMS
DFA Construction and Design: State Invariants, Worked Examples and Exam Traps
Learn a repeatable method for direct DFA design. Build and verify machines for strings containing 101 and for strings with even parity that end in 0.
Updated 9 Sep 20266 min readTheory of Computation
Direct Memory Access (DMA) Explained: Bus Cycles, Transfer Modes and a Worked Example
DMA becomes easier when you trace bus ownership, addresses and timing as one transfer. This guide follows a 6 KiB block through burst, cycle-stealing and transparent modes.
Updated 8 Sep 20266 min read52 viewsComputer Organization & Architecture
Advanced Boolean Algebra Laws and Logic Optimization: Worked Examples for GATE
Learn when a Boolean term can disappear and when hardware timing may justify keeping it. The worked example is checked by algebra, a truth table, a K-map, and circuit cost.
Updated 8 Sep 20265 min read61 viewsDigital Logic
Relationship Between Arrays and Pointers in C: Decay, Address Arithmetic and a Worked Memory Trace
See why an array is not a pointer, even when their displayed addresses match. Trace decay, pointer movement, sizeof, function parameters and bounds through one C array.
Updated 8 Sep 20265 min read118 viewsC Programming & Data Structures
Diffie-Hellman Key Exchange Explained: Worked Examples, Security and Exam Traps
Learn what Diffie-Hellman shares, calculate two exchanges by hand, trace an unauthenticated attack, and avoid the most common conceptual and arithmetic errors.
Updated 8 Sep 20266 min read107 viewsComputer Networks
LL(1) Parser Table Explained: FIRST, FOLLOW and a Complete Worked Example
Build an LL(1) parsing table from one grammar, verify every cell, and follow the stack from S$ to acceptance. The same example connects FIRST, FOLLOW, conflicts and epsilon moves.
Updated 8 Sep 20265 min readCompiler Design
Subgroup Definition and Verification Techniques: Worked Examples for GATE CS
Learn how to prove or reject a subgroup using the definition, the one-step test, operation tables, and precise counterexamples. The main worked example checks {0,3,6,9} in Z_12.
Updated 8 Sep 20266 min readEngineering Mathematics
Deadlock in Operating Systems: Four Conditions, Banker's Algorithm, and Worked Examples
Learn to diagnose deadlocks, read resource-allocation graphs, compute Need, verify a Banker's safe sequence, and separate prevention from recovery.
Updated 7 Sep 20266 min read63 viewsOperating Systems
SQL Query Optimization Basics: EXPLAIN, Indexes, and Worked Examples
Learn to read row flow, choose composite index order, rewrite date predicates, and compare before and after plans on a deterministic PostgreSQL fixture.
Updated 7 Sep 20265 min readDBMS
DFA Basics and Definitions: 5-Tuple, Transition Table and Worked String Traces
Understand what makes a finite automaton deterministic and complete. Build one DFA for strings ending in 01, trace inputs, test acceptance, and repair a missing transition.
Updated 7 Sep 20266 min readTheory of Computation