## Course Detail

 Course Name Introduction to data structure and algorithms Course Code 24AIM111 Program B.Tech. in Artificial Intelligence (AI) and Data Science (Medical Engineering) Semester II Credits 3 Campus Coimbatore

### Syllabus

##### Unit 1

Data Structure – primitive and non-primitive, Array data structure, properties and functions, single and multiidimensional arrays, simple problems, Basics of Algorithm Analysis, big-Oh notation, notion of time and space complexity, dynamic arrays

##### Unit 2

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.

##### Unit 3

Stack data structure, properties and functions, recursion, expression evaluation, Queue data structure – circular queue, double ended queue, properties, and functions

##### Unit 4

Binary Tree– arrays and linked list representation, tree traversals-preorder, postorder, inorder, level order. Graphsdirected and undirected graphs, adjacency list and matrices, Incidence matrices, path, graph traversals – breadthfirst and depth-first, Shortest path- Dijkstra’s algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm.

### Course Objectives and Outcomes

Course Objectives

• This course aims to introduce students to the concept of data structures, and demonstrate how the use of appropriate data structures will improve the efficiency of algorithms.
• Students will implement various simple data structures and apply them to solve real world scenarios.
• Along the way, students will learn to think about problems recursively and use modular programming.

Course Outcomes

After completing this course, the student should be able to
CO1: Apply modular design to write simple, correct and recursive programs.
CO2: Apply elementary mathematical concepts to prove the correctness and analyze the complexity of algorithms.
CO3: Design and implement simple augmented data structures to model various real world scenarios.
CO4: Use appropriate data structures to write efficient algorithms.

CO-PO Mapping

 PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 CO CO1 3 3 3 3 1 – – – 2 2 – 2 2 1 2 CO2 3 3 3 2 1 – – – 2 2 – 2 2 1 2 CO3 3 3 3 2 1 – – – 2 2 – 2 2 1 2 CO4 3 3 3 2 1 – – – 2 2 – 2 2 1 2

### Text Books / References

1. Alfred V Aho, John E Hopcroft, Jeffrey D Ullman. Data Structures & Algorithms, Pearson Publishers, 2002.
2. Maria Rukadikar S. Data Structures & Algorithms, SPD Publishers, 2011.
3. Michael T. Goodrich & Roberto Tamassia, Data Structures and Algorithms in Java,Wiley India Edition, Third Edition
4. Narasimha Karumanchi, Data Structures and Algorithms Made Easy in Java, CarrerMonk, 2011 Y. Langsam, M. Augenstin and A. Tannenbaum, Data Structures using C and C++, Pearson Education, 2002.

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.