FREE
AKTU Design and Analysis of Algorithm (BCS503H) Syllabus PDF – B.Tech 3rd Year
Design and Analysis of Algorithm BCS503H
All syllabus, notes, question bank & PYQ for this subject
Free
Download now
- English
- Semester 5
- 0 downloads
- 0 views
Official AKTU syllabus of Design and Analysis of Algorithm (BCS503H) for B.Tech 3rd Year – 4 credits, L-T-P 3-1-0. Read the unit-wise course content, course outcomes, evaluation pattern and recommended books online, or download the PDF.
Syllabus — Design and Analysis of Algorithm
Download PDFBCS503H · 4 credits · L-T-P 3-1-0
Course Outcomes
At the end of course , the student will be able to:
| CO 1 | Design new algorithms, prove them correct, and analyze their asymptotic and absolute runtime and memory demands. | K , K 4 6 |
| CO 2 | Find an algorithm to solve the problem (create) and prove that the algorithm solves the problem correctly (validate). | K , K 5 6 |
| CO 3 | Understand the mathematical criterion for deciding whether an algorithm is efficient, and know many practically important problems that do not admit any efficient algorithms. | K , K 2 5 |
| CO 4 | Apply classical sorting, searching, optimization and graph algorithms. | K , K 2 4 |
| CO 5 | Understand basic techniques for designing algorithms, including the techniques of recursion, divide-and-conquer, and greedy. | K , K 2 3 |
Course Content
L-T-P: 3-1-0
| Unit | Topic | Proposed Lecture |
|---|---|---|
| I | Introduction: Algorithms, Analyzing Algorithms, Complexity of Algorithms, Growth of Functions, Performance Measurements, Sorting and Order Statistics - Shell Sort, Quick Sort, Merge Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in Linear Time. | 08 |
| II | Advanced Data Structures: Red-Black Trees, B – Trees, Binomial Heaps, Fibonacci Heaps, Tries, Skip List | 08 |
| III | Divide and Conquer with Examples Such as Sorting, Matrix Multiplication, Convex Hull and Searching. Greedy Methods with Examples Such as Optimal Reliability Allocation, Knapsack, Minimum Spanning Trees – Prim’s and Kruskal’s Algorithms, Single Source Shortest Paths - Dijkstra’s and Bellman Ford Algorithms. | 08 |
| IV | Dynamic Programming with Examples Such as Knapsack. All Pair Shortest Paths – Warshal’s and Floyd’s Algorithms, Resource Allocation Problem. Backtracking, Branch and Bound with Examples Such as Travelling Salesman Problem, Graph Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of Subsets. | 08 |
| V | Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching, Theory of NP- Completeness, Approximation Algorithms and Randomized Algorithms | 08 |
Text Books
- Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of India.
- E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms",
- Aho, Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson Education, 2008.
- LEE "Design & Analysis of Algorithms (POD)",McGraw Hill
- Richard E.Neapolitan "Foundations of Algorithms" Jones & Bartlett Learning
- Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005.
- Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis, and Internet Examples, Second Edition, Wiley, 2006.
- Harry R. Lewis and Larry Denenberg, Data Structures and Their Algorithms, Harper Collins, 1997
- Robert Sedgewick and Kevin Wayne, Algorithms, fourth edition, Addison Wesley, 2011.
- Harsh Bhasin,”Algorithm Design and Analysis”,First Edition,Oxford University Press.
- Gilles Brassard and Paul Bratley,Algorithmics:Theory and Practice,Prentice Hall,1995.
Ratings & Reviews
No reviews yet — share your experience with this item.