L T PC

18CAT32 ADVANCED DATA STRUCTURES AND ALGORITHMS

3 0 0 3
Preamble:
Advanced Data structures and algorithms are amongst the most fundamental ingredients in the recipe for
creating efficient algorithms and good software design. Algorithm analysis is an important part of
computational complexity theory, which provides theoretical estimation for the required resources of an
algorithm to solve a specific computational problem. Knowledge of how to create and design good data
structures is an essential skill required in becoming an exemplary programmer. This course will make the
students to master the concepts of data structures and make them to grasp the essential concepts involved
in algorithm design.
Course Outcomes: Upon completion of the course, students will be able to:
1. To revive the basic concepts of data structures, data types and how basic data structure like arrays,
stack, queue and linked list are implemented.
2. Masters the implementation of non linear data structure tree and their applications.
3. Understand the graph data structure and implement it in solving the problems.
4. Have the basic ability to analyze algorithms and to determine algorithm correctness and time
efficiencies.
5. Comprehend and select algorithm design approaches in a problem specific manner.
UNIT 1 INTRODUCTION 9
Introduction – Abstract Data Type – Running Time of a Program - Stack ADT – Applications of Stack –
Queue ADT – – Implementation of Lists – Linked Stack and Linked Queues.
UNIT 2 NON LINEAR TREE STRUCTURES 9
Basic Terminology of Trees - Binary Tree – Binary Tree Traversals – Preorder – Inorder – Postorder –
Labeled Trees – Expression Trees – Binary Search Tree – The ADT Tree – Implementation of Trees.
UNIT 3 GRAPHS 9
Directed Graphs – Definitions – Representations - Graph ADT – Single Source Shortest Path Algorithm –
Traversals of Directed Graphs – Undirected Graphs – Definitions – Representations - Minimum Cost
Spanning Trees – Krushal’s and Prim’s Algorithm – Traversals.
UNIT 4 INTERNAL SORTING MODELS & ALGORITHM ANALYSIS TECHNIQUES 9
Sorting Schemes – Bubble Sort – Insertion Sort – Selection Sort – Quick Sort – Heap Sort – Efficiency of
Algorithms – Analysis of Recursive Programs.
UNIT 5 ADVANCED ALGORITHM DESIGN TECHNIQUES 9
Divide-and-Conquer Algorithms – Dynamic Programming – Triangulation Problem – Greedy Algorithms
- Backtracking – Branch and Bound Search – Local Search Algorithm – Traveling Salesman Problem.
TOTAL : 45 PERIODS
TEXT BOOKS:
1. Alfred V.Aho, John E.Hopcroft and Jeffrey D. Ullman, “Data Strutures and Algorithms”, Pearson
Education, 2012.
REFERENCES:
1. M. A. Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson Education Asia, 2016
2. Anany Levitin “Introduction to the Design and Analysis of Algorithms” Pearson Education, 2015
3. TanaenbaumA.S.,Langram Y. Augestein M.J, “Data Structures using C” Pearson Education , 2004.
E-Resources:
1. https://nptel.ac.in/courses/106101060/, “Design and analysis of Algorithm”, Prof. Abhiram G
Ranade, Prof. Ajit A Diwan, Prof. SundarViswanathan, IIT Bombay,
2. https://onlinecourses.nptel.ac.in/noc16_cs04, “Design and analysis of
Algorithm”,MadhavanMukund, Chennai Mathematical Institute, Chennai.

VCET / MCA / R2018/ Curriculum Page 1

 LT PC
18CAL33 PYTHON PROGRAMMING LAB
0 0 4 2
Course Objectives :
1 Revive the basic data structures like Stack and Queue.
2 Design and implement List, Tree, and Graph structures and its applications.
3 Solves various problems using appropriate problem-solving strategies.
List of Exercises :
1 Implementation of Stack using List.
2 Implementation of Queue using List.
3 Applications of Stack - Infix expression into Postfix expression.
4 Applications of Stack - Postfix Expression Evaluation
5 Implementation of Single Linked List.
6 Implementation of Circular Linked List.
7 Implementation Double Linked List.
8 Binary Tree Traversals.
9 Graph Traversal Techniques.
10 Sorting Techniques – Bubble Sort, Selection Sort and Quick Sort
TOTAL : 45 Periods

VCET / MCA / R2018/ Curriculum Page 2