0% found this document useful (0 votes)
3 views

Algorithms Lecture Plan

Algorithm
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views

Algorithms Lecture Plan

Algorithm
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CSO 221- Algorithms Dept.

of CSE, IIT (BHU), Varanasi

Course Plan and Evaluation Scheme

Convenor: Dr. Ajay Pratap Email ID: [email protected]

S. No. Topic Content Lectures


(hrs.)
1 Introduction to Algorithms, Problems and instances, average and 3
Algorithms worst-case analysis, elementary operations,
specifying an algorithm, and Euclid’s algorithm.

2 Growth of Asymptotic notation 3


functions

3 Sorting Quick sort, Heap sort, Merge sort 4

4 Divide and Recursion and iteration, recurrence equation, 3


conquer Master’s theorem

Searching, binary search 3

Changing two sections of an array, finding the 3


Median

Matrix multiplication, string processing 3


algorithms

5 Greedy Minimal spanning tree, shortest path, scheduling, 4


algorithms and knapsack problem

6 Dynamic Shortest paths and 0/1 Knapsack, Travelling 4


Programming Salesman problem, Graphical algorithm-
Traversing trees
7 Backtracking 8-queens’ problem, the sum of subsets 3

8 NP-Completeness Problems classes P, NP, and NP-completeness 7

Evaluation Scheme
Mid-Sem Exam: 30%, End-Sem Exam: 40%, Lab: 20%, Quiz, Assignment, Class
Assessment and Attendance: 10%.

You might also like