CS Fundamentals
203 articles in this topic
Functions in Discrete Mathematics: Types, Counting and Worked Examples
Learn how to recognise function types, count constrained mappings, compose rules in the correct order and decide when an inverse exists. Each idea is checked on finite sets.
C Preprocessor and Macros: #define Traps, Macro vs Function and Output Questions
Macro questions become mechanical once you expand the text before applying C rules. Work through missing parentheses, repeated side effects and safer macro patterns.
File Organization and Indexing in DBMS: Complete Guide with Worked Block-Access Examples
Carry one 30,000-record EMPLOYEE file through heap, ordered, indexed, B+ tree, and hash access paths. See where every block-access figure comes from.
Deterministic Finite Automata (DFA): Design, Tracing and Minimisation with Worked Examples
Learn a repeatable way to design DFA states, trace binary inputs, build complements and products, and minimise a complete machine. Every transition is checked through exact tables and worked traces.
Input Output Organisation in COA: Programmed I/O, Interrupts and DMA, with Worked Examples
See how Data, Status and Control registers support programmed I/O, interrupts and DMA. Then solve a complete cycle-stealing bandwidth calculation.
Logic Gates in Digital Electronics: Truth Tables, Boolean Expressions and Worked Examples
Learn the seven basic logic gates, build and minimise a complete three-input truth table, then implement the result using only NAND gates. Hardware bubbles and delay paths are included.
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.