| Year/Subject | Algorithms | ||
| Easy | Medium | Difficult | |
| 2015 MARCH-CS Scientist-C | 1.Hashing | 1.Hashing 2.Heap(2) 3.Greedy 4.Divide & Conquer 5.Sorting | — |
| 2016 MARCH-CS/IT/EC-STA | 1.Heap | 1.Sorting | — |
| 2016 MARCH-CS/IT-Scientist-B | 1.Sorting 2.NP Complete | 1.Hashing(2) 2.Recurrence Relation | — |
| 2016 DEC-IT-Scientist-B | 1.4-Queens Problem 2.Sorting(2) 3.MST 4.Mis | 1.Recurrence relation | — |
| 2016 DEC-CS-Scientist-B | 1.0/1 Knapsack 2.Sorting 3.Basics 4.Recurrence relation 5.Asymptotic Notations | — | — |
| 2017 JULY-IT-Scientist-B | — | 1.Recurrence relation | 1.Dynamic programming |
| 2017 JULY-CS-Scientist-B | 1.Sorting 2.DP 3.Kadane algorithm 4.Recurrence relation | 1.DFS | 1.Matrix chain multiplication |
| 2017 OCT-CS-SA | 1.All pair shortest path 2.Asymptotic equation 3.Recurrence relation | 1.Recurrence relation | 1.Time Complexity |
| 2017 OCT-IT-SA | 1.BFS 2.Recurrence relation 3.Hashing | 1.Recurrence Relation 2.Asymptotic Notations | 1.Recurrence relation |
| 2017 DEC-CS/IT-STA | 1.8 queens problem 2.Hashing 3.Sorting | 1.Sorting | — |
| 2017 DEC-CS/IT-Scientist-B | — | — | 1.Optimization algorithm |
| 2018 DEC-CS/IT-STA | 1.Sorting(insertion sort) 2.MST 3.Sorting(Merge sort)(2) 4.Recurrence 5.Connected components | — | — |
| 2018 DEC-CS/IT-Scientist-B | 1.Recurrence 2.Max-Heap 3.BST time complexity 4.Hashing(load factor) 5.Greedy algorithms 6.Max Heap Interchanges 7.Merge sort complexity | — | — |
