Scribd
Upload
155 views1 page

DAA Syllabus (BCS-503)

Uploaded by

ayush19november
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
155 views1 page

DAA Syllabus (BCS-503)

Uploaded by

ayush19november
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

Design and Analysis of Algorithm (BCS-503)

Course Outcome ( CO) Bloom’s Knowledge Level (KL)


At the end of course , the student will be able to:
Design new algorithms, prove them correct, and analyze their asymptotic and absolute runtime K4, K6
CO 1
and memory demands.
Find an algorithm to solve the problem (create) and prove that the algorithm solves the problem K5, K6
CO 2
correctly (validate).
Understand the mathematical criterion for deciding whether an algorithm is efficient, and know K2, K5
CO 3
many practically important problems that do not admit any efficient algorithms.
CO 4 Apply classical sorting, searching, optimization and graph algorithms. K2, K4

Understand basic techniques for designing algorithms, including the techniques of recursion, K2, K3
CO 5
divide-and-conquer, and greedy.
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction: Algorithms, Analyzing Algorithms, Complexity of Algorithms, Growth of
I Functions, Performance Measurements, Sorting and Order Statistics - Shell Sort, Quick Sort, Merge 08
Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in Linear Time.
Advanced Data Structures: Red-Black Trees, B – Trees, Binomial Heaps, Fibonacci Heaps,
II 08
Tries, Skip List
Divide and Conquer with Examples Such as Sorting, Matrix Multiplication, Convex Hull and
Searching.
III Greedy Methods with Examples Such as Optimal Reliability Allocation, Knapsack, Minimum 08
Spanning Trees – Prim’s and Kruskal’s Algorithms, Single Source Shortest Paths - Dijkstra’s and
Bellman Ford Algorithms.
Dynamic Programming with Examples Such as Knapsack. All Pair Shortest Paths – Warshal’s and
Floyd’s Algorithms, Resource Allocation Problem.
IV 08
Backtracking, Branch and Bound with Examples Such as Travelling Salesman Problem, Graph
Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of Subsets.
Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching, Theory of NP-
V 08
Completeness, Approximation Algorithms and Randomized Algorithms
Text books:
1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of
India.
2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms",
3. Aho, Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson Education, 2008.
4. LEE "Design & Analysis of Algorithms (POD)",McGraw Hill
5. Richard E.Neapolitan "Foundations of Algorithms" Jones & Bartlett Learning
6. Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005.
7. Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis, and Internet Examples,
Second Edition, Wiley, 2006.
8. Harry R. Lewis and Larry Denenberg, Data Structures and Their Algorithms, Harper Collins, 1997
9. Robert Sedgewick and Kevin Wayne, Algorithms, fourth edition, Addison Wesley, 2011.
10. Harsh Bhasin,”Algorithm Design and Analysis”,First Edition,Oxford University Press.
11. Gilles Brassard and Paul Bratley,Algorithmics:Theory and Practice,Prentice Hall,1995.

Curriculum & Evaluation Scheme IT & CSI (V & VI semester) 7

You might also like