CS Fundamentals
200 articles in this topic
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.
Order of Elements in Groups Explained: Formulas and Worked Examples
Learn how to find an element's order using direct powers, gcd formulas, cycle lengths and Lagrange's theorem. Each worked result is checked against its generated subgroup.
CPU Scheduling in Operating Systems: Algorithms, Gantt Charts and Worked Examples
Trace one process set through five CPU scheduling policies, calculate every core metric, and extend the method to switching costs and MLFQ.
Database Recovery in DBMS: Log-Based Recovery, Checkpoints, and a Fully Worked Crash Example
Learn how logs, WAL, checkpoints, undo, and redo restore a DBMS after failure. Then replay a complete crash log to find the final values of A, B, and C.
Non-Deterministic Finite Automata (NFA): Design, Epsilon Closures and NFA-to-DFA Conversion
Learn to follow every branch of an NFA without guesswork. Two worked machines connect active-state sets, epsilon closure and a complete eight-state DFA conversion.
Software Sizing: LOC and Function Point Estimation with Worked Examples
LOC and function points answer different sizing questions. Learn both through a four-module LOC estimate, a full function-point calculation, and unit-safe effort conversions.
Computer Organization and Architecture Basics: Complete Guide with Worked Examples
Follow an instruction from bits through the CPU, memory and I/O, then solve exact examples on overflow, CPI, pipelines, cache fields, AMAT and interrupts.
Boolean Expressions in Digital Electronics: Laws, Canonical Forms and Worked Simplification
Learn one Boolean function from notation to truth table, canonical forms, simplification and NAND gates, with checks that expose common errors.