CS Fundamentals
200 articles in this topic
Storage Classes in C (auto, static, extern, register): Scope, Lifetime and Exam Questions
Separate scope, lifetime, storage duration and linkage, then use one static-versus-auto program and a two-file extern example to predict exam answers.
Express.js REST API Tutorial: Routing, Middleware, and Error Handling the Production Way
Build one small courses API and trace every request through parsing, routing, 404 handling, and a single error path.
Compiler Design for GATE: Syllabus Areas, Weightage Pattern and How to Prepare
See what GATE Compiler Design covers, where practice questions concentrate, how to solve a complete FIRST/FOLLOW example, and which topics to study first.
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.
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.
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).
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.
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.
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.
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.
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.
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.