GATE CS Mastery
My library

Formula SheetFALGGATE CS 2027

Algorithms Formula Sheet

Formulas • Symbols • Conditions • Traps • Recall

A4 formula and reference sheet for GATE CS Algorithms: growth-rate order, loop counting, every master theorem case and the recurrences it does not cover, a sorting master table with comparison counts, greedy and DP recurrences with worked tables, BFS and DFS edge rules, topological order, SCC, MST and shortest-path conditions.

  • 9 A4 pagesone topic per page
  • PDF (A4)Version 1.0.1
  • Screen editionPhones, tablets, laptops
  • Print editionPrepared for A4 printing

₹19Regular price ₹29Launch price

Launch price: ₹19 instead of the regular ₹29.

Page 1 of 9

3 of 9 pages shown as images. The purchased PDF is sharper, searchable and has clickable bookmarks.

Page 1 of 9

What is inside

9 pages, one purpose each

  1. p. 1Cover, contents and how to useThe page map, a key to every box type, and the order to read on the last day.
  2. ALG-F02Asymptotics and Loop CountingNotation, growth order, loops, recurrences by hand
  3. ALG-F03The Master TheoremThree cases, extended log cases, where it fails
  4. ALG-F04Searching and SortingMaster table, comparison counts, lower bounds
  5. ALG-F05Divide and Conquer, GreedyStandard recurrences, greedy rules with proofs of fit
  6. ALG-F06Dynamic ProgrammingRecurrence, table size and time for each problem
  7. ALG-F07Graph TraversalsBFS, DFS, edge types, topological order, SCC, cuts
  8. ALG-F08MSTs and Shortest PathsCut and cycle rules, Prim, Kruskal, Dijkstra, Bellman-Ford
  9. ALG-F09Confused Pairs and RecallPairs that get swapped, facts to recall cold

How each page works

Built for fast revision

  • Formula cards with every symbol defined
  • Rearranged forms of the same relation
  • Use when: the question type the card answers
  • Trap: the mistake examiners set up
  • Worked examples
  • Reference tables
  • A closing page of confused pairs and Last-Minute Recall

About this pack

Scope

A formula and reference sheet for the Algorithms part of the GATE CS 2027 syllabus, organised as topic mini-sheets: asymptotic notation and loop counting; recurrences and the master theorem; searching and sorting; divide and conquer and greedy methods; dynamic programming; graph traversals; minimum spanning trees and shortest paths. The master theorem page sets out each case with its condition, the regularity check, the extended log cases and a table of recurrences the theorem does not cover, with the method to use instead. Sorting is collected in one table of best, average and worst times, space, stability and comparison counts. Each greedy and dynamic programming method is given as a recurrence with its table size and time, and worked on a small instance. A final page collects the pairs students confuse and a Last-Minute Recall list. Every worked number on the sheet was recomputed by a script. It is a revision aid for students who have already studied the topics; it does not replace a textbook or a course.

Is it right for you?

Who it is for, and how you get it

Who it is for

GATE CS 2027 candidates who have studied the subject and want fast, reliable revision: one page per sitting of about ten minutes, then the last-day sheet before the exam.

Screen edition

For phones, tablets and laptops. Clickable bookmarks jump between pages.

Print edition

The same pages prepared for A4 printing. Both editions are included.

Preparing more than one subject?Complete GATE CS Formula Sheet CollectionAll 12 packs including Algorithms Formula Sheet, for ₹149 (launch price).

Before you buy

Common questions

What exactly will I receive?

A 9-page A4 PDF in two editions: a screen edition for reading on a device and a print edition prepared for A4 printing. Nothing is shipped; it is a download.

Can I read it on my phone, and can I print it?

Yes. The PDF opens in any PDF reader on phones, tablets and computers, and the bookmarks jump between pages. You may print it for your own study.

Is it for GATE 2027?

Yes. The packs follow the official GATE CS 2027 syllabus, and each pack says what is in scope and what is covered in another pack. GATE CS Mastery is independent and not affiliated with IIT, IISc or the GATE organising committee.

How is this different from ordinary short notes?

Each page answers one question and uses labelled boxes: rules with their conditions, traps with the fix, comparison tables and small worked examples. Every pack ends with a traps sheet, a question-patterns sheet and a one-page last-day sheet.

What happens after I pay?

When Razorpay confirms the payment, download buttons appear straight away and a receipt is emailed to you. Later, My library sends a one-time link to your purchase email and shows fresh download links.

What if the payment succeeds but the download fails?

Do not pay again. Your purchase is recorded as soon as the payment is verified. Open My library, or write to support@gatecsmastery.com with your order ID or Razorpay payment ID. See the refund policy for when a refund applies.