Scribd
Upload
22 views2 pages

Design & Analysis of Algorithm Course Breakdown

The document outlines the course structure for 'Design and Analysis of Algorithms' at Alhamd Islamic University Islamabad for Fall 2025, detailing prerequisites, credit hours, and a 16-week lecture schedule. Topics covered include algorithm fundamentals, analysis techniques, sorting algorithms, greedy algorithms, dynamic programming, graph algorithms, and NP-completeness. The course culminates in a midterm and final review, assessing knowledge through exams.

Uploaded by

Riaz Ahmad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views2 pages

Design & Analysis of Algorithm Course Breakdown

The document outlines the course structure for 'Design and Analysis of Algorithms' at Alhamd Islamic University Islamabad for Fall 2025, detailing prerequisites, credit hours, and a 16-week lecture schedule. Topics covered include algorithm fundamentals, analysis techniques, sorting algorithms, greedy algorithms, dynamic programming, graph algorithms, and NP-completeness. The course culminates in a midterm and final review, assessing knowledge through exams.

Uploaded by

Riaz Ahmad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Alhamd Islamic University Islamabad Campus

Course Title: Design and Analysis of Algorithms

Fall-2025

Credit Hours: 3 (Theory Only)


Pre-requisite: Data Structures, Discrete Mathematics, Programming Fundamentals

Course Schedule: 32 Lectures (16 Weeks)

Lecture
Week Topic Details
No.

What is an algorithm? Characteristics, time/space


1 1 Introduction to Algorithms
complexity

2 Mathematical Foundations Summations, logarithms, growth of functions

2 3 Asymptotic Notation Big O, Omega, Theta – formal definitions

Recurrences & Substitution


4 Solving T(n) with substitution
Method

Recursion Tree & Master


3 5 Visual and formulaic recurrence solutions
Theorem

6 Algorithm Analysis Techniques Worst, best, average case analysis

4 7 Divide and Conquer Design paradigm, recurrence relation

8 Merge Sort & Quick Sort Algorithm, analysis, comparison

5 9 Binary Search & Applications Algorithm, complexity, variations

10 Selection Algorithms Median of medians, QuickSelect

6 11 Greedy Algorithms – Intro Characteristics, when greedy works

12 Activity Selection Problem Real-world greedy strategy

7 13 Huffman Coding Optimal prefix codes, greedy strategy

14 Fractional Knapsack Problem Greedy solution, limitations

8 15 Dynamic Programming – Intro Overlapping subproblems, optimal substructure


Lecture
Week Topic Details
No.

Longest Common Subsequence


16 DP table creation, traceback
(LCS)

9 17 Matrix Chain Multiplication Optimal parenthesization using DP

18 0/1 Knapsack Problem Bottom-up approach

10 19 DP vs Greedy Comparison via problem-solving

20 Midterm Exam Covers Lectures 1–18

11 21 Backtracking – Introduction State-space tree, constraints

22 N-Queens Problem Recursive exploration, pruning

12 23 Graph Algorithms – Basics Graph representations, BFS, DFS

24 Topological Sort DAG properties, applications

13 25 Minimum Spanning Tree Kruskal’s and Prim’s Algorithms

26 Shortest Path Algorithms – I Dijkstra's algorithm

14 27 Shortest Path Algorithms – II Bellman-Ford, Negative weight cycles

28 All-Pairs Shortest Path Floyd-Warshall algorithm

15 29 NP-Completeness – I P, NP, NP-hard, polynomial reductions

30 NP-Completeness – II SAT, Clique, 3-SAT, introduction to approximation

16 31 Approximation Algorithms Greedy, heuristic methods overview

32 Final Review Course summary, FAQs, exam tips

You might also like