Scribd
Upload
107 views1 page

Algorithm

This document outlines the curriculum for an algorithms course. It includes the assessment breakdown, with class attendance, tests, midterm, and final exam comprising 10%, 20%, 30%, and 40% respectively. The lecture schedule covers topics over 16 weeks, including sorting algorithms, data structures, graph algorithms, and number theory. There are two class tests and a midterm. References include popular algorithms textbooks. Students must attend 70% of classes, submit assignments on time, and there are no excuses for missed tests or midterms.

Uploaded by

asasf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
107 views1 page

Algorithm

This document outlines the curriculum for an algorithms course. It includes the assessment breakdown, with class attendance, tests, midterm, and final exam comprising 10%, 20%, 30%, and 40% respectively. The lecture schedule covers topics over 16 weeks, including sorting algorithms, data structures, graph algorithms, and number theory. There are two class tests and a midterm. References include popular algorithms textbooks. Students must attend 70% of classes, submit assignments on time, and there are no excuses for missed tests or midterms.

Uploaded by

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

Curriculum

Assessment Method (%)


Class attendance 10
Class tests 20
Midterm Exam 30
Final Exam 40

Lecture Schedule

Weeks Topics
1-2 Introduction to algorithm and Mathematical Foundations such as Growth of Functions ,
Summations and Recurrences , Sets, Relations, Functions, Graphs, and Trees .

3-4 Sorting and Order Statistics (Heap sort, Quicksort, Lower Bounds for Sorting, Sorting in
Linear time), Stacks, lists, queues, recursion,
5-6 Design and Analysis Techniques (Dynamic Programming: Matrix Chain Multiplication,
LCS, Coin Changing, 0/1 knapsack)

CT-1
7-9 Design and Analysis Techniques (Greedy Algorithms: Activity selection, Knapsack)

Midterm
10-12 Basic Graph Algorithms, Spanning Trees

13 Shortest Path Algorithms, Max Flow*


CT-2
13-14 Backtracking(N-Queen), Branch and Bound(15 Puzzle)
15 Number-Theoretic Algorithms
16 Final

References : 1. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson,


Ronald L. Rivest, Clifford Stein.
2. Data Structures and Algorithms Made Easy by Narasimha Karumanchi.
3. Algorithms by Robert Sedgewick, Kevin Wayne
Grading System : As per the approved Grading scale of Metropolitan University (appendix-2).
Conditions for : 1. Assignments must be submitted on time
Students 2. Any excuses for re-class test and re-mid is strongly prohibited
3. Must attend at least 70% classes to appear at the final examination

Page 55 of 154

You might also like