Scribd
Upload
98 views2 pages

3it01: Design and Analysis of Algorithm CREDITS - 4 (LTP: 3,0,1)

The document outlines a course on design and analysis of algorithms. It is a 4 credit course with 3 hours of lectures and 2 hours of practical per week. The course aims to help students understand, design and analyze efficient algorithms. It is assessed through theory and practical exams. The course covers various algorithm design techniques like divide and conquer, greedy algorithms, dynamic programming, and exploring graphs. It also introduces asymptotic analysis and complexity classes. The expected outcomes are that students will be able to evaluate algorithm performance, solve recurrences, apply design methods, analyze graph problems, apply pattern matching, and differentiate complexity classes.

Uploaded by

Saakshi Patel
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
98 views2 pages

3it01: Design and Analysis of Algorithm CREDITS - 4 (LTP: 3,0,1)

The document outlines a course on design and analysis of algorithms. It is a 4 credit course with 3 hours of lectures and 2 hours of practical per week. The course aims to help students understand, design and analyze efficient algorithms. It is assessed through theory and practical exams. The course covers various algorithm design techniques like divide and conquer, greedy algorithms, dynamic programming, and exploring graphs. It also introduces asymptotic analysis and complexity classes. The expected outcomes are that students will be able to evaluate algorithm performance, solve recurrences, apply design methods, analyze graph problems, apply pattern matching, and differentiate complexity classes.

Uploaded by

Saakshi Patel
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/ 2

3IT01: DESIGN AND ANALYSIS OF ALGORITHM

CREDITS – 4 (LTP: 3,0,1)


Course Objective:
To understand, design and analyze efficient algorithm for various applications.
Teaching and Assessment Scheme:
Teaching Scheme
(Hours per Week) Credits Assessment Scheme
Total
Theory Practical Marks
L T P C
ESE CE ESE CE
3 0 2 4 60 40 20 30 150

Course Contents:

Unit Topics Teaching


No. Hours
1 Basics of Algorithm: 4
Introduction of algorithm, Designing of algorithm, Mathematical
notation, Sets, Functions and relations, Vectors and matrices, Linear
inequalities and linear equations.
2 Analysis of Algorithm: 5
The efficient algorithm, Average, Best and worst case analysis,
Asymptotic notations, Sorting algorithms and analysis: Bubble sort,
Selection sort, Insertion sort, Heap sort, Sorting in linear time : Bucket
sort, Radix sort and Counting sort.
3 Divide and Conquer Algorithm: 8
Introduction, Recurrence: substitution method and master theorem,
Problem solving using divide and conquer algorithm - Multiplying large
integers problem, Binary search, Sorting: Merge Sort, Quick Sort, Matrix
multiplication, Exponential.
4 Greedy Algorithm: 9
Characteristics of greedy algorithms, Problem solving using greedy
algorithm:Making change problem, Activity selection problem,
Minimum spanning trees: Kruskal’s algorithm, Prim’s algorithm,
Shortest paths, The knapsack problem, Job scheduling problem, Huffman
code.
5 Dynamic Programming: 9
Introduction, The principle of optimality, Problem solving using
dynamic programming: Calculating the binomial coefficient, Making
change problem, Assembly line-scheduling, Knapsack problem, All
points shortest path, Matrix chain multiplication, Longest common
subsequence.
6 Exploring Graphs: 6
Graphs and games: An introduction, Traversing graphs- Depth first
search, Breadth first search, Topological sort, Connected components,
Preconditioning, Backtracking and branch and bound: The eight queen’s
problem, Knapsack problem.
7 String Matching: 3
Introduction, The naive string matching algorithm, The Rabin-Karp
algorithm, String matching with finite automata.
Unit Topics Teaching
No. Hours
8 Introduction to NP-Completeness: 2
The class P and NP, Polynomial reduction, NP- completeness problem,
NP-Hard problems, Travelling salesman problem, Hamiltonian problem.
Total 45
List of References:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction
to Algorithms”, Third Edition ,PHI Publication.
2. Gills Brassard, Paul Bratley, “Fundamental of Algorithms”, Second Edition,PHI Publication
3. Dave and Dave, “Design and Analysis of Algorithms”, Second Edition ,Pearson Publication.
4. Anany Levitin, “Introduction to Design and Analysis of Algorithms”, Third Edition ,Pearson
Publication.

Course Outcomes (COs):


At the end of this course students will be able to …
1. Evaluate the asymptotic performance of algorithms.
2. Derive and solve recurrences performance using divide-and-conquer algorithms.
3. Find optimal solution by applying various design methods.
4. Understand, solve and analyze various graph applications.
5. Apply pattern matching algorithms to find exact pattern.
6. Differentiate polynomial and non-polynomial problems.

You might also like