Courses Taught
[2026-2027] SRM University-AP, Amaravati, Andhra Pradesh, India
- Design and analysis of algorithms (S3) (B. Tech Computer Science and Engineering - Track AI & ML)
- [Lectures] Introduction and basics of algorithms
- [Lectures] General problem solving techniques
- [Lectures] Search techniques and randomized algorithms
- [Lectures] Pattern matching and amortized analysis
- [Lectures] NP-hard problems
- [Practicals] Naive to improved algorithms: Geometric sum
- [Practicals] Recursion to non-recursion: Tower of Hanoi
- [Practicals] Sorting: Bucket sort
- [Practicals] Divide-and-conquer: Maximum subarray, Strassen's multiplication
- [Practicals] Greedy algorithms: Fractional knapsack, Task-scheduling, Huffman code
- [Practicals] Dynamic programming: 0/1 Knapsack problem
- [Practicals] Graph traversals: (bi)connected components, cycles, topological sort
- [Practicals] Optimization algorithms: Bellman-ford, Ford-Fulkerson methods
- [Practicals] Branch and bound: 8-Queens, 15-Puzzle
- [Practicals] pattern matching: Boyer-Moore, KMP
- [Practicals] Approximation algorithms: Travelling salesman problem
Data structures Complexity and growth functions Sorting and searching algorithms Hash tables Recursion and non-recursion
Master method for complexity Divide-and-conquer algorithms Binary search trees Greedy algorithms: Fractional knapsack, Prim’s and Kruskal’s algorithms Shortest paths: Dijkstra’s algorithm, all-pairs shortest paths Huffman coding Dynamic programming: 0/1 knapsack
BFS, DFS, Backtracking 8-Queen's problem Knight's tour Travelling salesman problem Branch and bound: 16-Puzzle problem TSSP Randomized algorithms: Playing cards
Pattern matching: Brute force Boyer-Moore KMP Probabilistic analysis Amortized analysis Competitive analysis>
Class NP: Examples and analysis Vertex cover Set cover Travelling salesman problem 3-SAT Approximation algorithms: Vertex cover, travelling salesman problem>
[2025-2026] Centrale Méditerranée, Château-Gombert, Marseille, France
- Informatique (S5 et S6) (L1 - tronc commun - ingénierie)
- TD: Les bases de java
- TP (Java): Création d'une classe
- TP (Java): Héritage
- Partie 1 (CM): Interface || Partie 2 (TP): Interface
- Partie 1 (CM): Exceptions || Partie 2 (TP): Exceptions
- TP (Java): Fichiers
- TD: Complexités des algorithmes
- TD: Algorithmes surs les arbres
- TP (Java): Programmations des algorithmes sur les arbres
- TD: Algorithmes sur les graphes
- TD: Programmation dynamique
- TD: Algorithmes sur les textes
- TP (Java): Textes et arbres lexicographiques
- TD: Dépendences fonctionnelles et normalisation
- TD: Diagramme entité / association
- TD: Algèbre relationnelle
- TP (SQL): Execution des requetes
Partie Java
Partie Algorithmes
Partie Bases de données
- Python scientifique (S7) (L2 MIE - Mathématiques-Informatique-Economie)
[2025-2026] Aix-Marseille Université, Saint Jérôme, Marseille, France
- Programmation et algorithmique (S2) (L1 MPCI - Mathématiques, Physique, Chimie et Informatique)
- CM: Prouver des algorithmes
- TD: Algorithmes itératifs et récursifs en pseudo-code
- TD: Partie 1: Tester son code || Partie 2: Développer un projet informatique || Partie 3: Projet pourcentage
- TD: Calcul de complexité d'un algorithme
- CM: Complexité d'un problème
- CM: Problème d'exponentiation
- CM: Complexité en moyenne
- CM: Problème du tri
- Algorithmique des arbres et graphes (S3) (L2 MPCI - Mathématiques, Physique, Chimie et Informatique)
[2022-2024] IUT Clermont Auvergne, Aubière, France
- Methodes d'optimisation (le Bachelor Universitaire de Technologie (BUT) Informatique - 2nd year)
[2016-2020] GMIT (affiliated to MAKAUT), Kolkata, India
- Graph Theory and Algorithms ● Linear and Abstract Algebra ● Probability ● Real and Complex Analysis ● Numerical Methods ● Differential Calculus ● Integral Transforms (For topic wise syllabus, click here) Bachelor of Technology (B. Tech) - 4 years - Departments of Civil Engineering, Computer Science Engineering, Electronics and Communications Engineering, Electrical Engineering and Mechanical Engineering
[2015-2016] GCECT (affiliated to MAKAUT), Kolkata, India
- Probability ● Integral Transforms ● Fourier Analysis ● Differential Equations (For topic wise syllabus, click here) Bachelor of Technology (B. Tech) - 2nd year - Departments of Ceramic Technology, Computer Science Engineering and Information Technology