GATE Strategy & Roadmap
31 articles in this topic
Lossless Join and Dependency Preservation for GATE: Decomposition Checks Solved Step by Step
Test a decomposition for lossless join and dependency preservation using attribute closure, projected dependencies and a complete chase tableau.
IPv4 Header and Fragmentation for GATE: Offset, MTU and TTL Numericals Solved
Decode the IPv4 header, split a 4000-byte datagram across a 1500-byte MTU, and verify every offset, flag and fragment length.
CRC, Checksum and Hamming Code for GATE: Error Detection and Correction Numericals Solved
Work through CRC division, an Internet checksum, and Hamming(7,4) encoding and correction without losing marks to convention slips.
Three-Address Code, Quadruples and Triples for GATE: Intermediate Code Generation Solved
Translate a repeated arithmetic expression into six TAC instructions, then align every instruction with its quadruple and triple representation.
Thrashing and the Working Set Model for GATE: Why Page Faults Explode
See why adding processes can collapse CPU utilisation, compute three working-set windows, and derive the page-fault rate that doubles a 100 ns memory access.
Row Major and Column Major Address Calculation for GATE: 2D Array Numericals Solved
Derive both 2D array address formulas from a flat memory block. The same element is solved in row-major and column-major order for 0-based and 1-based indexing.
Infix to Postfix Conversion and Evaluation for GATE: Stack Applications Solved
Learn the two stack procedures behind expression conversion and evaluation. Complete traces show what happens to every operator, operand and parenthesis.
First Fit, Best Fit and Worst Fit for GATE: Contiguous Memory Allocation Numericals Solved
Run the same process stream through First Fit, Best Fit and Worst Fit. The full trace shows why every hole must be updated after every allocation.
Programming Language Design: Syntax, Semantics, Types, Scope and a Worked Mini-Language
Design MiniCalc from tokens to runtime, then trace how precedence, typing, environments, scope and parameter passing change what a program means.
Divide and Conquer for GATE: Recurrence Analysis of Merge Sort, Quick Sort and Binary Search
Turn split, solve and combine into a recurrence, then solve the standard Merge Sort, Quick Sort and Binary Search cases without relying on memorised answers.
Object-Oriented Programming (OOPS): Core Concepts with a Worked C++ Example
Build one connected OOP model, then trace how two account objects respond differently through the same C++ base-class interface.
CPU Performance Numericals for GATE: CPI, MIPS and Amdahl's Law Solved
Build every CPU performance answer from one equation. Then use it to solve weighted CPI, execution time, MIPS and Amdahl speedup without mixing the units.