CS Fundamentals
451 articles in this topic

Semaphores and Process Ordering in OS: P/V Traces, Worked Examples and GATE Traps
Learn one consistent semaphore convention, then trace ordering constraints, shared-variable updates, bounded-buffer permits, rendezvous, and deadlock step by step.

SQL Aggregate Functions: COUNT, SUM, AVG, MIN and MAX with Examples
Use one runnable sales table to see exactly how SQL aggregates treat rows, NULL values, duplicates and groups. Every result includes the arithmetic behind it.

PDA Design and Basics: Worked Stack Traces and Exam Question Patterns
Learn how a pushdown automaton uses its stack, then design and trace a complete machine for a^n b^n. The worked CFG conversion and rejection checks make every move testable.

Computer Classification and Flynn’s Taxonomy: The Four Classes with a Worked Vector Example
A machine can belong to several computer classes at once. Learn the four classification axes, Flynn’s matrix, vector and multicore traces, and exam traps.

Decimal Conversion Explained: Binary, Octal and Hexadecimal Worked Examples
Learn one dependable method for converting values between decimal, binary, octal and hexadecimal, including fractions, shortcuts and checks.

Structures in C: Syntax, Member Access and Worked Examples
Learn how C structures group related values, then trace object and pointer access through complete, implementation-safe examples.

Cyber Threats and Attacks Explained: Types, Worked DDoS Example and Exam Traps
Learn to separate threats, vulnerabilities, vectors and attacks, then apply the distinctions to a calculated DDoS scenario and exam-style questions.

Intermediate Code Generation in Compiler Design: One Cross-Concept Worked Example
Carry one C-like fragment from its source facts to typed temporaries, three-address code, quadruples and a control-flow graph, with every value traced.

Closure, Semigroup and Monoid: Worked Algebraic Structure Examples
Learn a reliable order for testing closure, associativity and identity. Worked tables and counterexamples show exactly when a structure becomes a semigroup or monoid.

Round Robin Scheduling Explained: Gantt Charts, Waiting Time and GATE Traps
Learn a fixed Round Robin queue convention, trace staggered arrivals, calculate CT, TAT, WT and RT, and see how quantum size and context-switch cost change results.

Query Languages in DBMS: Relational Algebra, SQL and a Worked Query
Follow one database request from plain English to relational algebra, intermediate relations, relational calculus and SQL, with every result traced.

NFA to DFA Conversion: Subset Construction, Worked Example, and Exam Traps
Learn subset construction by converting one three-state NFA row by row, checking the result with strings, and then minimising the reachable DFA.