EE 9305 Data Structures and algorithms syllabus download

EE9305 DATA STRUCTURES AND ALGORITHMS L T P C
3 0 0 3
AIM
The aim of this course is to provide an introduction to computer algorithms and data
structures, with an emphasis on foundational material.
OBJECTIVES
At the end of the course students should
 Have a good understanding of the fundamental data structures used in computer
science
 Have a good understanding of how several fundamental algorithms work, particularly
those concerned with sorting, searching and graph manipulation
 Be able to analyze the space and time efficiency of most algorithms
 Be able to design new algorithms or modify existing ones for new applications and
reason about the efficiency of the result26
UNIT I INTRODUCTION AND BASIC DATA STRUCTURES 9
Problem solving Techniques and Examples - Abstract Data Type (ADT) - The List ADT -
Arrays - Stacks and Queues: Implementation and Applications.
UNIT II ADVANCED DATA STRUCTURES 9
Trees: Preliminaries - Binary Tree - Tree Traversals - Binary Search Trees - AVL Trees.
UNIT III SORTING AND HASHING 9
Sorting by Selection - Sorting by Insertion - Sorting by Exchange - Sorting by
Diminishing Increment - Heap Sort - Heaps - Maintaining the Heap Property - Building a
Heap - Heap Sort Algorithm - Quick Sort - Description - Performance of quick sort -
Analysis of Quick Sort.. Hashing - General Idea - Hash Functions - Separate Chaining -
Open Addressing - Rehashing - Extendible Hashing.
UNIT IV ALGORITHM DESIGN TECHNIQUES 9
The role of Algorithms in computing - Getting Started - Growth of functions. Divide and
Conquer - Dynamic Programming - Greedy Algorithm - Backtracking - Branch and
Bound - Randomized Algorithms
UNIT V GRAPHS ALGORITHMS 9
Elementary Graph Algorithms - Minimum Spanning Trees - Single-source Shortest Paths
- All Pairs Shortest Paths.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. M A Weiss, “Data Structures and Algorithm Analysis in C++”, 3rdEdition, Pearson
Education, 2007.
2. Thomas H Cormen, Charles E Leiserson and Ronald L Rivest, “Introduction to
Algorithms”, 2ndEdition, Prentice Hall of India, 2002.
REFERENCES:
1. R G Dromey, “How to Solve it by Computers”, Pearson Education Asia, 2005.
2. Robert L Kruse, Clovis L Tando and Bruce P Leung, “Data Structures and
Program Design in C”, 2ndEdition, Prentice Hall of India.
3. Jean Paul Trembley, Paul G Sorenson, “An Introduction to Data Structures with
Applications”, 2ndEdition, Tata McGraw Hill, 2007.

Tweet