GATE CS Preparation
Subject-wise strategy, PYQ analysis, and realistic study plans for GATE CS aspirants.
61 articles in this topic

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.

Visual Basic Programming Language: Syntax, Events and Worked Examples
Build a clear mental model of Visual Basic on .NET, then trace a Windows Forms result calculator from input validation to its final event-driven output.

Counting Functions for GATE: One-One, Onto and Bijections, with Every Formula Derived
Fix domain and codomain sizes first, then derive total, injective, surjective and bijective counts through choices, permutations and inclusion-exclusion.

Society, Law and Ethics in ICT: Privacy, Cybercrime and Worked Examples
Learn to separate social, legal, ethical and security questions through worked ICT cases on access, privacy, phishing, intellectual property and e-waste.

Moore vs Mealy Machines for GATE: State Diagrams, Conversion and State Minimization, Solved
Follow one overlapping 11 detector through Mealy and Moore forms, then convert, trace and minimize finite-state machines without losing a clock.

Internet Fundamentals: Architecture, Connections, DNS, URLs and Worked Examples
Build a clean mental model of the Internet and Web, then trace a browser request and calculate transfer time, cache expiry and segment count.

Pigeonhole Principle and Inclusion-Exclusion for GATE: Counting Problems Solved Step by Step
Make the guarantee step and the inclusion-exclusion signs automatic through two fully checked, GATE-shaped counting problems.