CS Fundamentals
259 articles in this topic
First and Follow Sets Explained: Rules, Worked Example and LL(1) Checks
Learn a repeatable way to compute FIRST and FOLLOW sets, handle nullable suffixes, and use the results to test a grammar and fill its LL(1) parsing table.
Trees in Graph Theory: Properties, Eccentricity, Diameter, Radius and Center
Build every important tree metric from one eight-vertex example, then use structural tests, a distance table and the two-sweep method to check each answer.
Distributed Systems in Operating Systems: Clocks, Consistency and Worked Examples
Build a connected understanding of distributed systems through exact examples of duplicate RPC calls, logical clocks, leader election, replica quorums and block recovery.
Basics of DBMS: Full Concept Set with Worked Examples for GATE and Interviews
Connect the core DBMS ideas through concrete tables: why databases beat files, how keys and normalization work, how ER designs become relations, and how ACID protects a bank transfer.
Decidability in Regular Languages: DFA Tests, Worked Example and Exam Traps
Learn why DFA decision problems halt, how graph searches settle key language properties, and how a product automaton exposes the counterexample 10.
Computer Architecture Evolution and History: From Stored Programs to Multicore Systems
Follow the causal path from physical reconfiguration to stored programs, integrated processors, memory hierarchy and multicore, with checked numerical examples.
Shift Registers Explained: Types, Timing and a 4-Bit Worked Trace
Learn one reliable method for tracing shift registers. Fix the bit order, apply simultaneous next-state equations, and follow a complete four-clock example.
Data Types in C Explained: Ranges, Conversions and Worked Exam Examples
Learn how C types control ranges and conversions, then apply the rules to overflow, mixed arithmetic, sizeof and signed-unsigned exam questions.
Node.js Routing and Controllers Tutorial: Build a Runnable Express API
Build a small Express users API from scratch, separate routes from controllers, and test successful and failed requests against predictable responses.
Symbol Table in Compiler Design: Errors, Passes and Worked Examples
Follow one scoped program from symbol-table insertion to type checking and error recovery, then see why a compiler phase is not the same thing as a pass.
Spanning Tree and Spanning Forest: Definitions, Construction and Worked Examples
Learn how to construct and verify spanning trees and forests, why their edge counts are n - 1 and n - c, and when edge weights change the question.
File Management in Operating Systems: Allocation, Directories and Worked Examples
Connect a filename to its inode, open-file state, and physical blocks. Then compare allocation methods and solve one complete block-allocation example.