Scribd
Upload
72 views3 pages

T7909 - Design and Analysis of Algorithms

Design and analysis of advancements

Uploaded by

hrithikrayapati
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
72 views3 pages

T7909 - Design and Analysis of Algorithms

Design and analysis of advancements

Uploaded by

hrithikrayapati
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/ 3

Course Name: Design and Analysis of Algorithms

Course Code: T7909


Faculty: Engineering
Course Credit: 3
Course Level: 4
Sub-Committee (Specialization): Computer Science
Learning Objectives:
1. Analyze the complexity of an algorithm and explain algorithm analysis concepts like
asymptotic, amortized analysis etc to provide a rough classification of an algorithm.
2. Devise, validate and analyze algorithms using Divide and Conquer and greedy strategy.
3. Develop, design and analyze algorithms using Dynamic Programming strategy.
4. Develop, design and analyze backtracking and branch and bound algorithms etc.
5. Explain solvability of algorithms and categorize NP-Hard and NP-Complete Problems.

Pre-requisites:

Knowledge of programming languages like C, C++.


Course Outline:

Unit No. Details Hours


1 Introduction: Analysis of algorithm efficiency: - analysis framework 10
asymptotic notations analysis of non-recursive and recursive
algorithms, amortized analysis, writing characteristic polynomial
equations, solving recurrence equations, proof techniques: by
contradiction, by mathematical induction
2 Divide and Conquer and Greedy Method Characteristics, analysis 14
methodology, merge sort, quick sort, binary search, large integer
multiplication. General characteristics of greedy algorithms, Prim’s
algorithm, Kruskal’s algorithm, Dijkstra algorithm, Heap Sort, job
sequencing with deadlines/activity selection problem, optimal merge
patterns, Knapsack problem
3 Dynamic Programming General strategy, principle of optimality, 13
Warshall’s and Floyd’s algorithm, optimal binary search trees,
Knapsack problem, Traveling Salesperson problem, flow shop
scheduling
4 Backtracking and Branch- BoundGeneral strategy, generic recursive 5
backtracking algorithm, iterative backtracking method, 8-queens
problem, graph coloring, Hamiltonian cycle, Knapsack Problem.0/1
knapsack problem LC branch and bound and FIFO branch bound
solution
5 NP-Hard And NP-Complete ProblemsAlgorithms, Non-Deterministic 3
Polynomial time (NP) decision problems, Cooks theorem,
NP-complete problems-satisfiability problem.

Recommended Books:
Sr . Book title Authors Publishers
No.
1 Object Oriented Data Structures using K.S. Easwarakumar, Vikas Publishing
C++ House pvt. Ltd.

2 Introduction to Algorithms T. H. Cormen, C. E. Prentice Hall of


Leiserson, R.L.Rivest, and India Pvt. Ltd.
C. Stein,
3 The Design and Analysis of Computer Alfred V. Aho, John E. Pearson Education
Algorithms
Hopcroft and Jeffrey D.
Ullman,
4 Design and Analysis of an MST-Based Li N., Jennifer C. , and Sha IEEE INFOCOM
Topology Control Algorithm
L. 2003
5 Computer Algorithms/C++ Ellis Horowitz, Sartaj Sahni Universities Press
and Sanguthevar Rajasekaran

Pedagogy:
1. Interactive classroom teaching and discussions
2. Practical’s using software tools like C++, Java etc
3. Brainstorming sessions
4. Seminars
5. Project based learning
Evaluation:
A. Continuous Assessment
Essential
Assignment
Seminars
Test-Optional a) Quizzes b)Viva-voce c)Mini Project
Tutorials
B. End Semester Examination
Written Exam
Course Outcomes:
CO1 Analyze complexity of an algorithm and explain algorithm analysis concepts like asymptotic,
amortized analysis etc to provide a rough classification of an algorithm
CO2 Devise, validate and analyze algorithms using Divide and Conquer and greedy strategy
CO3 Develop, design and analyze algorithms using Dynamic Programming strategy
CO4 Develop, design and analyze backtracking and branch and bound algorithms
CO5 Explain solvability of algorithms and categorize NP-Hard and NP-Complete Problems
CO6 Differentiate and compare various algorithmic design strategies

Articulation Matrix:

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
1 2 1 1 2 1 1
2 2 1 1 2 1 1
3 2 1 1 2 1 1
4 2 1 1 2 1 1
5 2 1 1 2 1 1
6 2 1 1 2 1 1

Name of the experts designing the course

Sr. No. Name Designation Organization/ Institute


1 Dr. Anupkumar Bongale Associate Professor SIT
2 Dr. Rahul Joshi Associate Professor SIT

You might also like