CS Fundamentals
261 articles in this topic
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.
Keys and Integrity Constraints in DBMS: Types, Rules and Worked Examples
Learn how superkeys, candidate keys, primary keys, foreign keys and integrity rules work together through one university database and a complete closure proof.
Closure Properties of Regular Languages: DFA Constructions and Exam Traps
Learn why regular languages remain regular under major operations. Build one product DFA, trace two strings, and compare the constructions operation by operation.
Character Encoding Schemes: ASCII, ISCII, Unicode and UTF-8 Worked Examples
Trace Aह😀 from code points to UTF-8, UTF-16BE and UTF-32BE. Then decode bytes, compare storage and correct the most common encoding mistakes.
Ex-OR and Ex-NOR Gates Explained: Truth Tables, Relations and a Worked Circuit
Learn why Ex-OR detects difference and Ex-NOR detects equality, then trace a three-input circuit and avoid the binary-cascade trap.
Character Pointers and Strings in C: Memory Layout, Worked Outputs and Exam Traps
Build a memory-first model for character pointers and C strings. Trace GATE to GITE and CAT to CBT, then check literals, bounds, terminators and capacity.
Network Security and Cryptography in Computer Networks: How Ciphers, Key Exchange, and TLS Actually Work
Cipher internals for computer networks: ECB vs CBC block modes, HMAC construction, square-and-multiply RSA, a Diffie-Hellman man-in-the-middle, and TLS.
Semantic Analysis and Syntax-Directed Translation: Worked Examples for GATE CS
Follow the compiler pipeline from symbol-table checks to attribute evaluation. Three worked examples trace an arithmetic expression, a declaration list, and postfix output.
Planar Graphs and Kuratowski's Theorem: Homeomorphism, K5 and K3,3 Worked Examples
Learn why crossings and edge bounds can mislead, then expose a hidden K3,3 by suppressing degree-two vertices in a complete worked example.
Introduction to Operating System: Core Concepts with a Worked CPU Schedule
Build a connected model of operating-system services, privilege, process states and kernel structures. Then trace an FCFS schedule with I/O and switching costs.
Concurrency Control in DBMS: Anomalies, Serializability, Locking and 2PL with Worked Examples
Connect the full DBMS concurrency-control chain through one precedence-graph schedule, strict 2PL examples, timestamp rules and recovery checks.