CS Fundamentals
261 articles in this topic
Graph Matching: Maximal, Maximum and Perfect Matchings with Augmenting-Path Examples
Learn how maximal, maximum and perfect matchings differ. Follow one bipartite graph from a stuck greedy choice to a perfect matching using two augmenting paths.
Windows Operating System: Architecture, Processes, Memory and Worked Examples
Build a clear Windows architecture map, then practise exact traces for file I/O, thread scheduling, semaphores, paging and access checks.
Relational Algebra in DBMS: Complete Guide with Worked Queries
Learn relational algebra by tracing selection, projection, set operations, joins, and division through one small university database with exact outputs.
Simplification of CFG: Eliminate Epsilon, Unit and Useless Productions Step by Step
Learn the safe order for simplifying a context-free grammar. One example tracks every production through epsilon removal, unit closure, and useless-symbol removal.
Computer Memory Basics: Addressability, Capacity and Chip Organisation with Worked Examples
Learn to separate addresses, bytes, words, address lines and data lines. Worked examples cover a 256 KiB byte-addressable memory, chip organisation, and a 16K x 16 expansion.
Adders and Subtractors in Digital Logic: Circuits, Worked Examples and Exam Traps
Learn adders and subtractors from one-bit truth tables to four-bit ripple circuits, with verified addition, subtraction, overflow and delay examples.
File Handling in C: fopen, Read, Write, Append and Seek with Runnable Examples
Build safe C file workflows with text and binary examples. Write records, total them, append data, seek by byte offset, and handle failures.
Transport Layer Services in Computer Networks: TCP, UDP and Reliability with Worked Examples
Understand process-to-process delivery, compare TCP with UDP, and follow one connection through setup, loss recovery, flow control and closure.
Derivation and Recursion in CFG: Leftmost, Rightmost and Worked Examples
Follow three exact derivations to separate sentential forms from sentences, see how recursion behaves, and remove immediate left recursion without changing the language.
Logical Operators Explained: Negation, Conjunction and Disjunction with Worked Truth Tables
Learn how negation, conjunction and inclusive disjunction change truth values. Follow complete truth tables, scoped negations, De Morgan checks and a worked compound expression.
Virtual Memory in Operating Systems: Paging, TLB and Page Replacement with Worked Examples
Follow one virtual address through the TLB and page table, then calculate page faults, replacement traces and working-set pressure step by step.
DBMS Normalization from 1NF to BCNF: One Complete Worked Example
Follow one university-registration relation from a repeating group to BCNF. Compute both candidate keys, remove each dependency violation, and test the final split.