GATE CS Preparation
Subject-wise strategy, PYQ analysis, and realistic study plans for GATE CS aspirants.
76 articles in this topic
Pointers in C for GATE
Draw pointers as addresses in boxes, then trace double pointers, arrays, swaps and precedence without guessing. The worked outputs show the method GATE rewards.
TCP Congestion Control for GATE
Track cwnd at one fixed point in every round, apply the correct growth rule, and reset it according to the stated loss signal. This guide works through the full table.
Master Theorem for GATE: All Cases, Boundary Traps and Solved Recurrences
Classify divide-and-conquer recurrences through one comparison, verify the regularity condition, and recognise the log-gap recurrences that need another method.
LL(1) Parsing Table Construction for GATE
Build an LL(1) table cell by cell, test it for conflicts, and see how left recursion and common prefixes break predictive parsing.
Linear Algebra for GATE CS
Reduce matrices cleanly, classify Ax=b by ranks, and turn eigenvalue properties into fast calculations. Each result is checked against an independent property.
fork() Questions in GATE
Trace three common fork() patterns without the off-by-one error, then handle return values, loops, printed output, and inherited buffers.
ER Model to Relational Mapping for GATE: Minimum Number of Tables Questions Solved
Count the minimum relations from cardinality and participation, then check the special rules for weak entities, relationship attributes, and multivalued attributes.
DFA Minimization for GATE
Remove unreachable states, split final from non-final states, and refine until every transition signature is stable. A complete six-state example shows each split.
Construct a Binary Tree from Traversals
Use inorder splits and preorder roots to rebuild a binary tree, then learn the BST shortcut and the cases where traversal data is not unique.
Banker's Algorithm for GATE: Safe Sequence Numericals with Full Allocation-Max-Need Matrices
Learn the safety algorithm through a five-process matrix, count every safe sequence, and repair an unsafe state with the smallest possible resource addition.
Attribute Closure and Candidate Keys for GATE
Compute closure to a fixed point, use RHS analysis to find every minimal key, and handle prime attributes and candidate-key counting without guessing.
SQL Queries for Placement Interviews: Second Highest Salary, Joins and GROUP BY Step by Step
SQL queries for placement interviews built step by step on one schema: second highest salary three approaches, joins with results shown, GROUP BY and HAVING.