CS Fundamentals
473 articles in this topic

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.

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.