CS Fundamentals
469 articles in this topic
Operator Precedence Parsing: Build the Table and Parse an Expression Step by Step
Build an operator-precedence table from a grammar, then use it to trace every shift and reduction for i+i*i.
Updated 19 Sep 20266 min readCompiler Design
Definition of a Function: Domain, Codomain, Range and Counting Formula
Build the definition from first principles, separate the three sets, verify one finite map, and count all functions before handling common restrictions.
Updated 19 Sep 20266 min readEngineering Mathematics
Windows OS Architecture: Processes, Memory, NTFS and Worked Examples
Follow one coherent map of Windows OS architecture, then solve thread scheduling, virtual-address translation and NTFS allocation examples step by step.
Updated 19 Sep 20266 min readOperating Systems
ORDER BY and LIMIT in SQL: Tutorial with Exact Outputs
Learn to sort SQL results deterministically, resolve ties, select top rows, and paginate with LIMIT and OFFSET using one eight-row orders table.
Updated 19 Sep 20266 min readDBMS
CFL Identification: Decision Rules, Worked Examples and Exam Traps
Learn a repeatable way to classify context-free languages, from constructive grammar and stack evidence to safe closure arguments and a complete non-CFL proof.
Updated 19 Sep 20267 min readTheory of Computation
Cache Mapping Techniques and Memory Units: Direct, Associative and Set-Associative Worked Example
Use one address to learn memory-unit conversion, cache organisation and the exact tag, index and offset fields for all three mapping techniques.
Updated 18 Sep 20266 min read50 viewsComputer Organization & Architecture
Logic Circuit Analysis: Boolean Simplification and Worked Examples
Learn a repeatable way to trace combinational circuits, simplify their Boolean expressions, and verify the result. Two worked examples cover a three-input network and a four-NAND XOR.
Updated 18 Sep 20265 min readDigital Logic
Basic Recursion in C: Call Stack, Worked Traces and Exam Patterns
Learn how recursive C functions descend, stop and unwind. Trace factorial and printed output, count Fibonacci calls, and compare recursion with iteration.
Updated 18 Sep 20265 min readC Programming & Data Structures
Selective Repeat ARQ: Window Rules, Worked Example and Exam Question Patterns
Build a reliable Selective Repeat trace from sender and receiver state, then test the window rule and utilisation formula with worked numbers.
Updated 18 Sep 20265 min readComputer Networks
Language Processing System in Compiler Design: Preprocessor to Loader with a Worked Trace
Follow one macro-containing C program through every language processor. The trace shows object-file relocation, a linker patch of +4, and the final value 7.
Updated 18 Sep 20265 min readCompiler Design
Bijective Function: Definition, Count Formula and Key Properties
Learn how to identify a bijection, construct its inverse, count bijections between finite sets, and avoid the mistakes that commonly spoil exam answers.
Updated 18 Sep 20266 min readEngineering Mathematics
NLP Processing Stages Explained: Lexical to Pragmatic Analysis with a Worked Example
Follow one two-sentence input through tokenisation, morphology, parsing, meaning, coreference and contextual interpretation, with every intermediate result visible.
Updated 18 Sep 20265 min readOperating Systems