Scribd
Upload
105 views2 pages

DAA Content Preparation Format

This document outlines a course on design analysis and algorithms. The course aims to help students understand fundamental algorithm analysis concepts like time and space complexity. It will teach common algorithm design techniques like greedy methods, dynamic programming, and divide and conquer. Students will learn about P and NP problems and NP-complete problems. The course is divided into 4 units that cover topics like asymptotic analysis, sorting algorithms, algorithm design techniques, and complexity classes. Assessment includes internal marks for lectures and tutorials and external marks for practical exams. Upon completing the course, students should be able to analyze algorithms, apply design techniques, and identify appropriate algorithms to solve problems.

Uploaded by

Sowmya Koneru
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
105 views2 pages

DAA Content Preparation Format

This document outlines a course on design analysis and algorithms. The course aims to help students understand fundamental algorithm analysis concepts like time and space complexity. It will teach common algorithm design techniques like greedy methods, dynamic programming, and divide and conquer. Students will learn about P and NP problems and NP-complete problems. The course is divided into 4 units that cover topics like asymptotic analysis, sorting algorithms, algorithm design techniques, and complexity classes. Assessment includes internal marks for lectures and tutorials and external marks for practical exams. Upon completing the course, students should be able to analyze algorithms, apply design techniques, and identify appropriate algorithms to solve problems.

Uploaded by

Sowmya Koneru
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

Course Code- Design Analysis and Algorithms

Lecture – Tutorial- 3-0-0 40


Internal Marks:
Practical::
Credits: 3 External Marks: 60
Prerequisites: Data Structures
Design and Analysis of Algorithms
Course Objectives:
Course Outcomes:
Upon successful completion of the course, the student will be able to:
CO1 Understand the fundamentals of time and space complexity of algorithms and their analysis.
CO2 Understand the basic principles of various algorithms and design techniques
CO3 Apply appropriate algorithm design technique to solve real time application
CO4 Identify suitable method to solve optimization problem
CO5 Understand P and NP problems
CO6 Analyze the performance of algorithm designed for real time application
Contribution of Course Outcomes towards achievement of Program Outcomes (1 – Low,
2- Medium, 3 – High)
PO PO PO PO PO PO PO PO PO PO PO PO
1 2 3 4 5 6 7 8 9 10 11 12
CO1
CO2
CO3
CO4
CO5
CO6

UNIT I :
Introduction to Algorithms
Fundamentals of algorithmic problem solving – Analysis framework - Performance Analysis: - Space
complexity, Time complexity - Growth of Functions: Asymptotic Notation- Big oh notation, Omega notation,
Theta notation, little oh, little omega. Mathematical Analysis of Non-recursive algorithms – Mathematical
Analysis of Recursive algorithms - Brute Force: Bubble sort – Sequential search - String matching
UNIT II:
Algorithm Design Techniques - I
Decrease and Conquer: General method, Insertion sort, Topological sorting – Divide and Conquer: General
method, Merge sort, Quick sort, Fibonacci search – Transform and conquer: General method, Heapsort –
Disjoint sets: Operations, Simple Union and simple find, Weighted Union, Collapse Find.
UNIT III:
Algorithm Design Techniques - II
Greedy method: General method, applications:-Job sequencing with deadlines, Minimum cost spanning trees
(Prim’s and Kruskal’s Algorithms), Single source shortest path problem (Dijkstra’s Algorithm), Optimal
Merge Patterns (two way merge pattern) - Dynamic Programming: General method, applications:-Matrix chain
multiplication, 0/1 knapsack problem, all pairs shortest path problem.

UNIT IV:
P, NP and NP-Complete Problems
P and NP problems, NP-Complete problems. Backtracking: General method, applications:-n-queen problem,
sum of subsets problem, Hamiltonian Circuit problem. Branch and Bound: General method, Applications: -
Traveling sales person problem, Assignment Problem
TEXT BOOKS:
Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekaran, University press
REFERENCE BOOKS:
1. Introduction to The Design and Analysis of Algorithms, 3rd Edition, Anany Levitin, Pearson Education,
2017.
2. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L. Rivest, and C.Stein, PHI
Pvt. Ltd./ Pearson Education
3. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education.
4. Algorithms – Richard Johnson Baugh and Marcus Schaefer, Pearson Education.
E-RESOURCES:
Lecture Videos from University of Florida: https://www.cise.ufl.edu/class/cot5405sp18/index
Lecture Videos from NPTEL: https://nptel.ac.in/courses/106106131/

You might also like