IT/B.

Tech/4th Sem/PCC CS 404/February-2025

Govt. College of Engineering and Textile Technology (Serampore, Hooghly, West Bengal)
Topics Of PPT Presentation For CA1 Examination, Even Semester-2025(February-2025)
Subject Name: Design And Analysis Of Algorithm Paper Code: PCC CS 404
Sl University Name Surname Topic Name
No Roll No
1 11000223001 AMIK BHANDARI Linear Search
2 DAS Binary Search
11000223002 AMIT
3 HALDER Quick Sort
11000223003 ANKITA
4 11000223005 GHOSH Merge Sort
ARIJIT
5 ROY Heap Sort
11000223007 ARKAPRAVA
6 SHAW Shell Sort
11000223008 AYUSH KUMAR
7 HANSDA Divide And Conquer Algorithm
11000223009 BIDHAN
8 MANDI Big O Notation
11000223012 BISWAJIT
9 11000223014 IJAJ AHAMED Big Omega Notation
10 ROY Big Theta Notation
11000223015 INDRANIL
11 Time Complexity
11000223016 JISHU MONDAL
12 11000223017 MANISH NASIPURI Recurrence Relation
13 MIDDYA Back Substitution Method
11000223018 MD NURNAWAJ
14 11000223019 MD TOUFIQUE SHEIKH Recurrence Tree Method
15 11000223021 NISA DAS Master’s Theorem
16 11000223022 PRADEEP SHAW Iterative Method
17 11000223023 PROBAL GHOSH Job Sequencing with deadline
18 HANSDA Knapsack problem
11000223025 RAHUL
19 ROY MST using prime’s algorithm
11000223026 RAHUL
20 KUNDU MST using Kruskal’s algorithm
11000223027 RITU
21 MAITY Dijkastra’s algorithm
11000223028 RONI
22 HOSSAIN Conventional matrix multiplication
11000223029 SABBIR
23 11000223030 SABUJ MANNA Strassen’s Matrix Multiplication
24 11000223031 SAHELI BANK Matrix chain multiplication
25 11000223032 SAHIL JAISWAL Memorization technique
26 11000223033 SANDIP ROY Dynamic programming approch
27 11000223034 SAYAN BARUA Greedy approach
28 11000223035 SAYAN HALDER Ford Fulkerson Method
29 11000223036 SAYANTAN DATTA Augmenting path in flow problem
30 11000223037 SHYAM KUMAR MANDAL Residual Network in Flow problem
31 11000223038 SK MUSTAKIM Bellman Ford Algorithm
32 11000223039 SK SAFIN Brute Force approach
33 11000223040 SNEHA KARMAKAR Backtracking approach
34 11000223041 SNEHA SANTRA N queens problem
35 11000223042 SNEHASHISH DAS Graph coloring problem
36 11000223044 SOUPTIK BASU MALLICK Hamiltonian cycle problem
37 11000223045 SOUVIK BISWAS Travelling salesman problem
38 11000223046 SOUVIK DE BFS algorithm for graph
39 11000223047 SPANDAN MUKHERJEE DFS algorithm for graph
40 SUBHA Transitive Closure of a graph
11000223048 PRASANNA RAY
41 11000223049 SUJOY MANDAL Topological Sorting
42 11000223050 SWARNADEEP SHIT Bin Packing problem
43 Maximum and Minimum element of an
11000223051 SWASTIKA DUTTA
array
44 11000223053 TUHIN PAL 15 puzzle problem
45 11000223054 YASH SHARMA Insertion sort algorithm
46 11000224071 ADITYA GUPTA Searching technique
47 11000224022 AKASH BISWAS Polynomial time complexity
48 11000224023 BIKRAM KARMAKAR Exponential time complexity
49 Time complexity of quick sort
11000224024 DEBABRATA DAS
algorithm
50 Time complexity of merge sort
11000224025 DEEP ROY
algorithm
51 11000224026 SK ARIF HOSSAIN Substitution of variable technique
52 11000224027 SABITA RAJAK Tower of Hanoi problem
53 11000224070 SAYAN DAS Recursion in algorithm