CS Fundamentals
261 articles in this topic
NFA Basics and Design: Build and Trace Nondeterministic Automata
Learn how an NFA branches, trace complete state sets, handle epsilon-closure, and convert a worked three-state machine into its reachable-subset DFA.
CPU Organization Basics: Registers, Instruction Cycle and Worked Examples
Follow PC, MAR, MDR, IR and AC through LOAD, ADD and STORE on a small 16-bit CPU. Then calculate opcode space, address capacity and common trace traps.
Pixel and Color Models Explained: RGB, CMY and HSV Worked Examples
Follow one 8-bit RGB pixel through raster coordinates, raw storage, ideal CMY, HSV, two grayscale rules and 2-bit quantisation, with every convention stated.
C Programming for GATE: A 6-Week Topic-by-Topic Plan
Turn C revision into a 48-hour subject sprint. This plan moves from expressions and control flow to pointers, recursion, PYQ review, and timed mixed drills.
Routing Protocols in Computer Networks: Distance Vector, Link State, RIP, OSPF, BGP with Worked Examples
Build routing from the control plane to Internet-wide policy. Compare how RIP, OSPF, and BGP carry updates, use ports and timers, react to failure, and create common GATE CS traps.
Lexical Analysis and Tokens in Compiler Design: Worked Examples for GATE CS
See how a lexer turns source characters into tokens. The worked scan follows one complete line, builds symbol-table references, and exposes common traps.
Number of Simple Undirected Unlabeled Graphs: Counting Step by Step
Learn why labeled and unlabeled graph counts differ, enumerate every shape on three vertices, and use Burnside's lemma to obtain 11 shapes on four vertices.
Linux Operating System: Kernel, Processes, Files and Worked Examples
Build a layer-by-layer model of Linux, then follow a system call, translate a virtual address and calculate file permissions by hand.
Big Data Systems for GATE CS: CAP Theorem, Sharding and MapReduce with Worked Examples
See what changes when a database spreads across machines. Build a clear mental model of shards, replicas, CAP choices, quorums, MapReduce and NoSQL.
Chomsky Hierarchy Explained: Grammar Types, Worked Classification and Exam Traps
Learn how to test a grammar from Type 3 outwards, distinguish all four production classes, classify a complete grammar, and derive its strings step by step.
Computer Interfaces in COA: Registers, Handshaking and I/O Mode Numericals
Learn how an I/O interface decodes addresses, uses data, status and control registers, coordinates handshakes, and changes CPU occupancy across polling, interrupts and DMA.
Image Fundamentals Explained: Sampling, Quantisation and Worked Examples
Follow one grayscale image from its pixel grid and histogram to downsampling, 2-bit quantisation, reconstruction error, neighbourhoods and distance measures.