CS Fundamentals
485 articles in this topic

Arrays and Pointers in C: Complete Guide with Worked Examples for GATE and Interviews
Build one clear mental model for C arrays and pointers. Trace addresses, decode tricky expressions, solve a 2D-array numerical, and practise an in-place reversal.

Flow Control in the Data Link Layer: Stop-and-Wait, Sliding Window, and Worked Examples
See Stop-and-Wait, sliding windows, Go-Back-N, and Selective Repeat as parts of one system. One link carries every calculation from efficiency to sequence bits.

Run-Time Environment in Compiler Design: Activation Records, Access Links, and Worked Examples
Learn how code, static data, heap, and stack work together at run time. Follow worked examples for recursion depth, stack bytes, and nonlocal access.

Graph Theory for GATE CS: Concepts and Worked Examples
Build graph theory from two fully specified examples. Work through degree counts, connectivity, spanning trees, bipartiteness, planarity, and Euler and Hamilton checks.

User-Level vs Kernel-Level Threads for GATE: The Three Multithreading Models, Decided
Decide thread-model statements by asking who schedules the thread and what a blocking call stalls. Six worked judgements make the comparison concrete.

SQL Tutorial: The Complete Learning Path from First Query to Transactions
Learn SQL in a deliberate order, using one small dataset to practise table creation, filtering, joins, grouping, subqueries and transactions.

Turing Machines in Theory of Computation: Design, Worked Trace and Decidability
A six-state Turing machine for L = {0^n1^n}: built from the seven-tuple, traced move by move on 0011 to XXYY and q_accept, then proved a decider rather than only a recogniser.

Floating Point Representation in COA: IEEE 754 Explained with Worked Examples
Learn the IEEE 754 single-precision layout through two complete conversions, then understand hidden bits, biased exponents, special values, and rounding errors.

Digital Systems and Boolean Algebra Basics: Complete Guide with a Worked Example
Connect bits, truth tables, Boolean laws, canonical forms, K-maps, and gates by following one three-input function from specification to a simplified circuit.

C Programming for GATE: Syllabus Areas, Weightage Pattern and How to Prepare
Understand where C fits in GATE CS, what exam questions test, and how to build reliable tracing skills through pointers, recursion and structured practice.

Data Link Layer Error Control in Computer Networks: Concepts, CRC, Hamming and Worked Examples
Build error control from first principles, then work through parity, CRC, Hamming code and checksum using bits you can verify by hand.

Lexical Analysis in Compiler Design: Tokens, Patterns, and DFA-Based Scanning with Worked Examples
Learn how a scanner turns source characters into tokens, how token patterns become DFAs, and how longest match, lookahead, and token-counting questions work.

