Fall 2026: Design and Analysis of Algorithms - Revision history

Mkwiki: /* Resources */

2026-09-07T17:25:31Z

Resources

Mkwiki: /* Practicals LIst */

2026-09-07T17:23:32Z

Practicals LIst

Mkwiki: /* Labs */

2026-09-07T17:21:59Z

Labs

Mkwiki: /* Lab 1: ( week of 17th August 2026 ) */

2026-09-07T17:20:33Z

Lab 1: ( week of 17th August 2026 )

Mkwiki: /* Logistics */

2026-08-18T06:55:40Z

Logistics

Mkwiki: /* Logistics */

2026-08-18T06:55:19Z

Logistics

Mkwiki: /* Lectures */

2026-08-18T06:54:30Z

Lectures

Mkwiki: /* Lectures */

2026-08-18T06:52:32Z

Lectures

Mkwiki: /* Labs */

2026-08-18T06:48:16Z

Labs

Mkwiki: /* Lab 1: ( week of 24th & 31st August 2026 ) */

2026-08-18T06:47:54Z

Lab 1: ( week of 24th & 31st August 2026 )

@@ Line 69: / Line 69: @@
 == Resources ==
 '''References:'''
-* '''Text Book''': Tan P.N., Steinbach M, Karpatne A. and Kumar V. Introduction to Data Mining, Second edition, Sixth Impression, Pearson, 2023.
+* '''R1''': Cormen, T.H., Leiserson, C.E., Rivest, R. L., Stein C. Introduction to Algorithms, 4th edition, Prentice Hall of India, 2022.
+* '''R2''': Kleinberg, J., Tardos, E. Algorithm Design, 1st edition, Pearson, 2013.

@@ Line 55: / Line 55: @@
 === '''Practicals LIst '''===
-) Write a program to sort the elements of an array using Insertion Sort (The program
+#  Write a program to sort the elements of an array using Insertion Sort (The program should report the number of comparisons).
-should report the number of comparisons).
+#  Write a program to sort the elements of an array using Merge Sort (The program should report the number of comparisons).
-) Write a program to sort the elements of an array using Merge Sort (The program
+#  Write a program to sort the elements of an array using Heap Sort (The program should report the number of comparisons).
-should report the number of comparisons).
+#  Write a program to sort the elements of an array using Quick Sort (The program should report the number of comparisons).
-) Write a program to sort the elements of an array using Heap Sort (The program
+#  Write a program to multiply two matrices using the Strassen’s algorithm for matrix multiplication.
-should report the number of comparisons).
+#  Write a program to sort the elements of an array using Count Sort.
-) Write a program to sort the elements of an array using Quick Sort (The program
+#  Display the data stored in a given graph using the Breadth-First Search algorithm.
-should report the number of comparisons).
+#  Display the data stored in a given graph using the Depth-First Search algorithm.
-) Write a program to multiply two matrices using the Strassen’s algorithm for matrix
+#  Write a program to determine a minimum spanning tree of a graph using the Prim’s algorithm.
-multiplication.
+#  Write a program to determine the shortest path from a given node s to the other nodes of a graph using the Dijkstra’s algorithm.
-) Write a program to sort the elements of an array using Count Sort.
+#  Write a program to solve the 0-1 knapsack problem using Dynamic Programming.
 == Resources ==

@@ Line 54: / Line 54: @@
 * Turn off'''(shut down) your assigned computer and arrange the chair''' before you leave the lab.
-=== '''Lab 0 '''===
+=== '''Practicals LIst '''===
-{| class="wikitable" style="text-align: justify;
+) Write a program to sort the elements of an array using Insertion Sort (The program
-|-
+should report the number of comparisons).
-! Task No.
+) Write a program to sort the elements of an array using Merge Sort (The program
-! Task
+should report the number of comparisons).
-! Assessment Period.
+) Write a program to sort the elements of an array using Heap Sort (The program
-! Submission Deadline
+should report the number of comparisons).
-|-
+) Write a program to sort the elements of an array using Quick Sort (The program
-| style="width: 8%"  | 1
+should report the number of comparisons).
-| style="width: 60%" | Implement Linear Search Algorithm
+) Write a program to multiply two matrices using the Strassen’s algorithm for matrix
-| style="width: 15%" |  --
+multiplication.
-| --
+) Write a program to sort the elements of an array using Count Sort.
-|-
+) Display the data stored in a given graph using the Breadth-First Search algorithm.
-| 2 || Implement Binary Search Algorithm || -- || --
+) Display the data stored in a given graph using the Depth-First Search algorithm.
-|}
+) Write a program to determine a minimum spanning tree of a graph using the Prim’s
 algorithm.
-=== '''Lab 1: ''' ( week of 17<sup>th</sup> August 2026  ) ===
+) Write a program to determine the shortest path from a given node s to the other nodes
-{| class="wikitable" style="text-align: justify;
+of a graph using the Dijkstra’s algorithm.
-|-
+) Write a program to solve the 0-1 knapsack problem using Dynamic Programming.
 == Resources ==

@@ Line 82: / Line 82: @@
 | style="width: 15%" |  17/08/2026 - 24/08/2026
 | 25/08/2026
 |}

@@ Line 1: / Line 1: @@
 == Logistics ==
 *Class Timings: '''Mondays''', '''Tuesdays''', and '''Thursdays''' 9:30 am - 10:30 am
-*Classroom: ('''R-43''')
+*Classroom: (''R-43'')
 *Lab Timings: '''Fridays''' 8:30 am - 10:30 am
 *Labs: Computer Lab 4 (''CL-3'')

@@ Line 29: / Line 29: @@
 |   '''''Dynamic Programming:'''''
 |  [unit3.pdf]
-| Chapter 5
+| Chapter 6 (R2)
 |-
 | Unit 4
-|   '''''Association Rule Mining:'''''
+|   '''''Hash Functions, Collision resolution schemes:'''''
 |  [unit4.pdf]
-| Chapter 4
+| Chapter 11 (R1)
 |}

@@ Line 17: / Line 17: @@
 |-
 | style="width: 12%; " |  Unit-1
-| style="width: 60%" |  '''''Introduction to Data Mining:'''''
+| style="width: 60%" |  '''''Searching, Sorting, Selection, Divide and Conquer:'''''
 | style="width: 15%" | [unit1.pdf]
-| Chapter 1
+| Chapter 2,4,6,7,8,9 (R1)
 |-
 | Unit 2
-|   '''''Data Pre-Processing:'''''
+|   '''''Graphs and Greedy algorithms:'''''
 |  [unit2.pdf]
-| Chapter 2
+| Chapter 3, 4 (R2) & 15(R1)
 |-
 | Unit 3
-|   '''''Cluster Analysis:'''''
+|   '''''Dynamic Programming:'''''
 |  [unit3.pdf]
 | Chapter 5

@@ Line 75: / Line 75: @@
 |}
-=== '''Lab 1: ''' ( week of 24<sup>th</sup> & 31<sup>st</sup> August 2026  ) ===
+=== '''Lab 1: ''' ( week of 17<sup>th</sup> August 2026  ) ===
 {| class="wikitable" style="text-align: justify;
 |-
@@ Line 84: / Line 84: @@
 |-
 | style="width: 8%"  style="text-align: center;   | 1
-| style="width: 60%" | Apply data cleaning techniques on any dataset (e.g., Paper Reviews dataset in UCI repository). Techniques may include handling missing values, outliers and inconsistent values. A set of validation rules can be prepared based on the dataset and validations can be performed.
+| style="width: 60%" | Write a program to sort the elements of an array using Insertion Sort (The program should report the number of comparisons).
-| style="width: 15%" |  24/08/2026 - 31/08/2026
+| style="width: 15%" |  17/08/2026 - 24/08/2026
-| 01/09/2026
+| 25/08/2026
 |}