DATA STRUCTURES & ALGORITHMS
23AID112
Data Structures & Algorithms 1 / 75
About the Course
Course Outcomes
1 Choose an appropriate data structure as applied to a specified problem
2 Use various techniques for representation of the data in the real world
3 Develop applications using data structures.
4 Test the logical ability for solving problems
Data Structures & Algorithms 2 / 75
Pre-requisites
• Python programming
Data Structures & Algorithms 4 / 75
Syllabus I
Unit 1: Primitive and non-primitive data structures, Array, 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
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.
Data Structures & Algorithms 5 / 75
Syllabus II
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
Data Structures & Algorithms 6 / 75
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 Y. Langsam, M. Augenstin and A. Tannenbaum, Data Structures
using C and C++, Pearson Education, 2002.
4 Lipschutz Seymour, Data Structures with C (Schaum’s Outline
Series), McGraw Hill Education India, 2004.
Data Structures & Algorithms 7 / 75
