CS1401 DATA STRUCTURES AND ALGORITHMS L T P C

4003

OBJECTIVES:

 Acquire basic knowledge of linear and non-linear data structures.

 Design and implement arrays, stacks, queues.

 Understand the complex data structures such as trees and graphs.

 Understand the various techniques of sorting and searching.

 Design and implement various programming paradigms and its complexity.

UNIT I ALGORITHM ANALYSIS 9

Mathematical background - Run time calculations - Logarithms in running time – List ADT- Linked lists–

Doubly Linked Lists- Circularly Linked Lists – Operations-Applications.

UNIT II STACK ADT AND QUEUE ADT 9

Stack model-Implementation of Stacks– Applications – Queue model-Implementation ofQueue–

Applications

of Queues.

UNIT III TREES 9

Binary trees – Tree Traversal with an application- Implementation-Expression trees - The Search Tree
ADTBinary Search Trees-AVL trees-Single Rotation-Double Rotation- B trees.

UNIT IV SORTING AND SEARCHING 9

Sorting – Insertion sort- Quick sort - Selection sort- Merge sorts - Radix sorts-Searching - Basic search

techniques - Sequential searching - Binary search –Hashing- Hash Functions- Separate Chaining-Open

Addressing - Rehashing.

UNIT V GRAPHS ALGORITHMS 9

Definitions- Representation of Graphs- Graph Traversal-Topological Sort - Shortest path algorithm-

Dijkstra‟s

algorithm - Minimum spanning tree -Prim‟s and Kruskal‟s algorithms-Applications of Depth-First search.

TOTAL PERIODS: 45

COURSE OUTCOMES:

Upon completion of the course, students will be able to:

CO1: comprehend the basics in algorithms and data structures.

CO2: apply the knowledge of linear data structures to Engineering problems.

CO3: Gain the knowledge about Tree ADT and its Applications.

CO4: Technical knowhow on the implementation of sorting searching algorithms

CO5: Implement graphs in real world scenarios

TEXT BOOKS:

1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, PearsonEducation,1997.

2. Reema Thareja, “Data Structures Using C”, Second Edition , Oxford University Press,2011

REFERENCES:

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, “Introduction to Algorithms",

Second Edition, Mcgraw Hill, 2002.

2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education,1983.

3. Stephen G. Kochan, “Programming in C”, 3rd edition, Pearson Education.

4. Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, “Fundamentals of Data Structures in C”, Second

Edition, University Press, 2008.