| Course Name | Data Structures & Algorithms |
| Course Code | 23AID112 |
| Program | B.Tech in Artificial Intelligence and Data Science |
| Semester | 2 |
| Credits | 3 |
| Campus | Coimbatore , Amritapuri ,Faridabad , Bangaluru, Amaravati |
Data Structure – primitive and non-primitive, Array data structure, properties and functions, single and multi-dimensional arrays, simple problems, Basics of Algorithm Analysis, big-Oh notation, notion of time and space complexity, dynamic arrays
Linked List – singly linked list, doubly linked list, circular linked list- properties and functions, implementations, Sorting algorithms – selection, bubble, insertion, quick sort, merge sort, comparison of sorting algorithms, implementation using arrays.
Stack data structure, properties and functions, recursion, expression evaluation, Queue data structure – circular queue, double ended queue, properties, and functions
Binary Tree– arrays and linked list representation, tree traversals-preorder, postorder, inorder, level order.Graphs- directed and undirected graphs, adjacency list and matrices, Incidence matrices, path, graph traversals – breadth-first and depth-first, Shortest path- Dijkstra’s algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm –
Course Objectives
Course Outcomes
After completing this course, students will be able to
|
CO1 |
Choose an appropriate data structure as applied to a specified problem |
|
CO2 |
Use various techniques for representation of the data in the real world |
|
CO3 |
Develop applications using data structures. |
|
CO4 |
Test the logical ability for solving problems |
CO-PO Mapping
|
PO/PSO |
PO1 |
PO2 |
PO3 |
PO4 |
PO5 |
PO6 |
PO7 |
PO8 |
PO9 |
PO10 |
PO11 |
PO12 |
PSO1 |
PSO2 |
PSO3 |
|
CO |
|||||||||||||||
|
CO1 |
3 |
3 |
2 |
2 |
3 |
– |
– |
– |
3 |
2 |
3 |
3 |
2 |
1 |
– |
|
CO2 |
3 |
3 |
3 |
3 |
3 |
– |
– |
– |
3 |
2 |
3 |
3 |
3 |
2 |
– |
|
CO3 |
3 |
2 |
3 |
3 |
3 |
– |
– |
– |
3 |
2 |
3 |
3 |
2 |
2 |
– |
|
CO4 |
3 |
3 |
3 |
2 |
3 |
– |
– |
– |
3 |
2 |
3 |
3 |
2 |
3 |
2 |
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 |
Text Books / References
Alfred V Aho, John E Hopcroft, Jeffrey D Ullman. Data Structures & Algorithms, Pearson Publishers, 2002.
‘Maria Rukadikar S. Data Structures & Algorithms, SPD Publishers, 2011.
Michael T. Goodrich & Roberto Tamassia, Data Structures and Algorithms in Java,Wiley India Edition, Third Edition
Narasimha Karumanchi, Data Structures and Algorithms Made Easy in Java, CarrerMonk, 2011
Lipschutz Seymour, Data Structures with C (Schaum’s Outline Series), McGraw Hill Education India, 2004
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.
