Unit 1
Full binary tree, complete binary tree, perfect binary tree, balanced binary tree, binary search tree, properties and functions
| Course Name | Advanced Data Structures & Algorithm Analysis |
| Course Code | 23AID204 |
| Program | B.Tech in Artificial Intelligence and Data Science |
| Semester | 3 |
| Credits | 3 |
| Campus | Coimbatore , Amritapuri ,Faridabad , Bangaluru, Amaravati |
Full binary tree, complete binary tree, perfect binary tree, balanced binary tree, binary search tree, properties and functions
Binary Heap Data Structure-Heap property, properties and functions, Heapsort, AVL Tree – balance factor, rotating the subtrees in an AVL tree –right rotation, left rotations, left-right and right-left rotate, operations on AVL trees- insertion and deletion
Trie data structure- basic operations, simple problems, Hashing and Hash Tables –?hash functions, collision, collision avoidance methods, Merkel trees
Fundamentals of the Analysis of Algorithmic Efficiency –Asymptotic Notations and growth rate- Empirical Analysis – Divide and Conquer Methodology – Dynamic programming – Knapsack Problem and Memory functions. Greedy Technique – Iterative methods – Backtracking – Branch and Bound
Course Objectives
Course Outcomes
After completing this course student will be able to,
|
CO1 |
Develop skills for analyzing algorithmic strategies |
|
CO2 |
Analyse and apply appropriate algorithmic technique for a given problem |
|
CO3 |
Implementing standard algorithms on arrays, strings, trees and graphs |
|
CO4 |
Visualize multidimensional geometry of data structure and concurrency. |
CO-PO Mapping
|
PO/PSO |
PO1 |
PO2 |
PO3 |
PO4 |
PO5 |
PO6 |
PO7 |
PO8 |
PO9 |
PO10 |
PO11 |
PO12 |
PSO1 |
PSO2 |
PSO3 |
|
CO |
|||||||||||||||
|
CO1 |
3 |
3 |
3 |
3 |
3 |
3 |
1 |
– |
3 |
3 |
2 |
3 |
3 |
1 |
1 |
|
CO2 |
3 |
3 |
3 |
2 |
3 |
2 |
– |
– |
3 |
3 |
2 |
3 |
3 |
2 |
2 |
|
CO3 |
3 |
3 |
3 |
3 |
2 |
1 |
– |
– |
3 |
3 |
3 |
3 |
3 |
3 |
3 |
|
CO4 |
3 |
3 |
3 |
3 |
2 |
1 |
– |
– |
3 |
3 |
3 |
3 |
2 |
3 |
3 |
Evaluation Pattern
|
Assessment |
Internal/External |
Weightage (%) |
|
Assignments (minimum 2) |
Internal |
30 |
|
Quizzes (minimum 2) |
Internal |
20 |
|
Mid-Term Examination |
Internal |
20 |
|
Term Project/ End Semester Examination |
External |
30 |
|
23AID112 Data Structures & Algorithms L-T-P-C: 2- 0- 2- 3 |
Text Books / References
Mehlhorn, Kurt, Peter Sanders, and Peter Sanders. Algorithms and data structures: The basic toolbox. Vol. 55. Berlin: Springer, 2008.
Bhim P Upadhyaya, Data Structures and Algorithms with Scala. Springer International Publishing, 2019.
Aho, Alfred V. “Data Structures and Algorithms, Addison-Wesley.” Reading, Mass. (1983).
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, Third Edition (3rd ed.). The MIT Press
Jeffrey McConnell, Analysis of algorithms. Jones & Bartlett Publishers, 2nd Revised edition, 2007
Anany Levitin, Introduction to the Design and Analysis of Algorithms, Third Edition, Pearson Education, 2012
Harsh Bhasin, Algorithms Design and Analysis, Oxford university press, 2016
DISCLAIMER: The appearance of external links on this web site does not constitute endorsement by the School of Biotechnology/Amrita Vishwa Vidyapeetham or the information, products or services contained therein. For other than authorized activities, the Amrita Vishwa Vidyapeetham does not exercise any editorial control over the information you may find at these locations. These links are provided consistent with the stated purpose of this web site.