Name classes Sch. No.

Mr ADITYA SINGH 6
Binary search trees, height balanced trees,
Mr. SATYAM KANOJIYA AVL trees, 2-3 trees, B-trees hashing. 5
Mr. ANAND SINGH Introduction 35
Mr. ANURAG SHUKLA to lower-bound theory 62
Mr. KRISH ARSE 63

Mr. MOHIT VERMA 58

Mr. SABAVATH ROHITH RAM introduction to NP-Complete, and NP Hard 17
Ms. KHUSHBU JAMLIYA problems, examples of NP 29
complete problem like Hamiltonian path and
Mr. PANKAJ GUPTA circuits, eulerian paths and circuits 38
Mr. KATURI MANI VARDHAN 51

Mr. NIHAR DEV ARSE

Hamiltonian cycle problem, 23
introduction to branch & bound and its
Mr. PURU ARORA examples like 8 piece puzzle problem traveling 26
Mr. SOURAV PANDER salesperson problem. 56
Mr. MANJEET 48
Mr. SACHINADAN 52

Mr. VIKAS
Graph traversal: depth first search, breadth 36
first search, bi-connected components.
Mr. VAIBHAV VERMA 69
Backtracking concept and its examples likes 8
Mr. KUNAL KOSHTA queen’s problem 25
Mr. YASH CHOUKIKAR 34
Ms. RENU EKKA 19

Mr. VIKAS NIRANJAN 9

dynamic programming and problems based
Mr. GAURAV MAMGAIN on this approach such as 01 knapsack 39
problem, multi-stage graphs, shortest paths,
Mr. ABHINAV PATEL Traveling sales-person problem, reliability 42
Mr. SHIVAM SAGAR design problem. 49
Mr. ATUL JARYAL 54

Mr. ABHISHEK PATEL

greedy strategy, solutions based on greedy
strategy for knapsack problem, 2
Mr. ARYAMAN PUROHIT scheduling problem, minimum spanning trees, 3
shortest paths optimal merge patterns.
Mr. SASHANK SINGH 11
Mr. ASHISH MORWAL 21
 strategy for knapsack problem,
scheduling problem, minimum spanning trees,
shortest paths optimal merge patterns.

Mr. RAGHAV SHANKAR 28

Mr. BHUVAN SHIVHARE

32
Mr. ROHIT SHARMA Sorting techniques: merge sort, quick sort, 37
Mr. SOUKHYA VILASRAO selection problem etc., Matrix
multiplication. 47
GONDE
Mr. PRATHAMESH
PRASHANT NIKAM 50
Mr. AMAN VERMA 64

Mr. AJAY SINGH

MAHDORIYA Concepts of algorithm, asymptotic complexity, 73
Mr. AMIT RAI examples of analysis use of recurrence 74
Mr. SHUSHANT BOGAL relation in analysis of algorithms, master 1
method,
Mr. NAMAN MERAVI 20
Mr. SUMIT 68

Mr. ANANT JAIN 59

Mr. TUPTEWAR OMKAR greedy strategy, solutions based on greedy
60
SANJAY strategy for knapsack problem,
Mr. LABHANSHU GUPTA scheduling problem, minimum spanning trees, 7
Mr. TURAKA MANOJ shortest paths optimal merge patterns. 40
RAYUDU
Mr. SHIVAM GUPTA 55

Ms. LAKAVATHA RISHA SRI

introduction to NP-Complete, and NP Hard 44
problems, examples of NP
Ms. VIDUSHI SINGH 65
complete problem like Hamiltonian path
Mr. DEEPAK VERMA and circuits, eulerian paths and circuits 45
Mr. MAAZ AMIR 8

Mr. PATHLAVATH RAHUL Graph traversal: depth first search, breadth

first search, bi-connected components. 61
NAYAK
Mr. PHANIDHAR Backtracking concept and its examples likes 8 14
Mr. JAYESH KAUSHIK queen’s problem 31
Mr. NISHANT UPADHYAY 27

Mr. KRUSHAL LAMBA Concepts of algorithm, asymptotic

complexity, examples of analysis use of 30
Mr. ABHINAV GANGWAR recurrence 43
relation in analysis of algorithms, master
method, removal of recursion, heap and
heap sort
 Concepts of algorithm, asymptotic
complexity, examples of analysis use of
recurrence
Mr. SHIVA relation in analysis of algorithms, master 10
method, removal of recursion, heap and
Mr. PRATHAM UPADHYAY 41
heap sort
Mr. HARSHIT MAHOUR 46

Mr. VRAJKUMAR DARJI heap sort. 18

Mr. ANIKET SHUKLA Divide and conquer technique, analysis 67
Mr. MADHVENDRA SINGH and design of algorithms base on this 4
Mr. MD AZHAR MAQSOOD technique for 12
Mr. DHOMASE ANISH binary search, Sorting techniques: merge 24
RAMESH sort, quick sort, selection problem
Last date of submission of ppt Date of presentation
PPT Explaining the topics