CS Fundamentals
485 articles in this topic
Lattices and Hasse Diagrams for GATE: Posets, LUB, GLB and the Lattice Test, Solved
Learn to read covering relations, compute joins and meets, and prove whether a poset is a lattice through two complete worked examples.
Updated 27 Jul 20266 min read197 viewsEngineering Mathematics
Multithreading in Java: Thread Lifecycle, synchronized and the Interview Question Set
Understand what Java threads share, trace a lost counter update, and separate BLOCKED, WAITING, and TIMED_WAITING with code you can explain.
Updated 27 Jul 20267 min readOperating Systems
GROUP BY and HAVING in SQL: Aggregation Questions from Placement Tests, Solved Step by Step
Trace two placement-style SQL queries from raw rows to grouped results. Learn exactly when to use WHERE, HAVING, COUNT(*), and COUNT(column).
Updated 26 Jul 20265 min readDBMS
Rice's Theorem for GATE: The Mechanical Test for Undecidability Questions
Run the semantic and non-trivial checklist on six machine properties, learn when Rice is silent, and separate undecidable from RE or non-RE.
Updated 26 Jul 20266 min readTheory of Computation
Coal India MT Systems Preparation Strategy: How Much of Your GATE CS Prep Transfers
Reuse your GATE CS foundation instead of rebuilding it. Most of the technical core transfers to MT Systems. The aptitude half is what you add, over ten weeks.
Updated 25 Jul 20265 min readComputer Organization & Architecture
Universal Gates for GATE: Realizing Any Function with Only NAND or Only NOR, and Counting the Minimum Gates
Turn SOP into NAND-only and POS into NOR-only circuits, count every gate, and learn the exact two-input counts for AND, OR, XOR and XNOR.
Updated 25 Jul 20266 min read148 viewsDigital Logic
DMA, Interrupts and Programmed I/O for GATE: Cycle-Stealing and Overhead Numericals Solved
Track who moves the data, who owns the bus and how often the CPU must intervene. Two worked numericals turn DMA and interrupt overhead into simple rate calculations.
Updated 24 Jul 20266 min read55 viewsC Programming & Data Structures
OSI vs TCP/IP Model for GATE: Which Layer Does What, with PYQ Traps
Map every OSI and TCP/IP layer to its function, PDU, address and device. Then trace an HTTP request through encapsulation and fix the usual layer traps.
Updated 24 Jul 20266 min read62 viewsComputer Networks
Closures in JavaScript Explained: Lexical Scope, the Loop Trap and Interview Questions
Go beyond the one-line closure definition. Predict a private counter, understand why var timers print 3 three times, and learn the two standard fixes.
Updated 24 Jul 20266 min readCompiler Design
Recurrence Relations for GATE: Solving Linear Recurrences by Characteristic Roots and Generating Functions
Solve one linear recurrence twice, see why both methods agree, and keep discrete-maths recurrences separate from the Master Theorem.
Updated 24 Jul 20265 min read64 viewsEngineering Mathematics
Magnetic Disk Numericals for GATE: Capacity, Seek Time and Transfer Rate Solved
Turn disk geometry into four reliable calculations. One fully specified disk is solved for capacity, rotation time, transfer rate and sector access time.
Updated 29 Jul 20266 min readOperating Systems
Cyber Threats and Malware Attacks: Types, Attack Chains and a Worked Incident
Learn to separate vectors, techniques and payloads, classify mixed malware behaviour, calculate exposure, and map controls to each incident stage.
Updated 26 Jul 20266 min readDBMS