18IT0YB DATA STRUCTURES AND ALGORITHMS 3003

Course Objectives
To understand node creation and perform linked lists operations like insertion, deletion and displaying
the linked list data.
To apply insertion and deletion operations of Stack and Queue data structures
To apply Tree data structure and hashing techniques to accelerate data searching
To apply graph traversals and algorithms to solve real world problems
To analyze the algorithmic complexity of simple and non-recursive problems

Programme Outcomes (POs)

Course Outcomes (COs)
Apply linked list linear data structures operations using dynamic memory allocation
Apply stack and Queue data structure operations to solve computational problems
Design tree data structures and hashing techniques for effective searching of data
Build algorithms for solving real world problems using Graph data structure
Analyze the performances of the sorting algorithms using divide and conquer techniques

Articulation Matrix

CO No PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
1
2
3
4
5

UNIT I 9 Hours
LINEAR DATA STRUCTURES: LIST
Abstract Data Types - List ADT - Array-based implementation - Linked list implementation - Singly linked
lists - Circularly linked lists - Doubly-linked lists - Applications of lists - Polynomial Manipulation using linked
list.

UNIT II 9 Hours
LINEAR DATA STRUCTURES: STACKS, QUEUES
Stack ADT Operations - Applications of Stack - Evaluating arithmetic expressions - Conversion of Infix to
postfix expression - Queue ADT Operations - Circular Queue - Priority Queue - Applications of queues.

UNIT III 9 Hours

NON LINEAR DATA STRUCTURES: TREES
Tree ADT - tree traversals - Binary Tree ADT - Expression trees - Applications of trees - Binary Search tree
ADT - AVL Trees - Hashing - Separate chaining - Open addressing - Linear probing.
UNIT IV 9 Hours
NON LINEAR DATA STRUCTURES - GRAPHS
Graphs : Definitions, Topological sort, Graph Traversals: Breadth-first traversal, Depth-first traversal,
Shortest-path algorithms, Minimum spanning tree, Prim's and Kruskal's algorithms, Applications of graphs.

UNIT V 9 Hours
ALGORITHM DESIGN AND ANALYSIS
Algorithm Design: Greedy algorithm - Divide and conquer - Dynamic programming - Backtracking - Branch
and bound - Algorithm Analysis: Asymptotic notations - Recurrences - NP complete problems.

Total: 45 Hours
Text Book(s)
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Second Edition, Pearson Education,
2015.

Reference(s)
Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein, Introduction to Algorithms,
Second Edition, MIT Press, 2014.
AA Puntambekar, Data Structures And Algorithms, Technical Publications, 2009.
R F Gilberg, B A Forouzan, Data Structures, Second Edition, Thomson India Edition, 2005.
Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, "Introduction to
Algorithms", Second Edition, Mcgraw Hill, 2002.
Aho, Hopcroft and Ullman, "Data Structures and Algorithms", Pearson Education, 1983