DATA STRUCTURES AND ALGORITHMS

L T P C
3 1 0 4
Objectives
To teach various efficient algorithms for solving fundamental problems.
To impart techniques for designing algorithms using appropriate data structures.
To analyze the correctness and performance of algorithms.

Expected Outcome
The students will be able to
Perform algorithm analysis.
Acquire knowledge of various algorithmic strategies.
Understand and implement the solution for different types of problem using suitable algorithm and data
structures.

Prerequisites/Exposure
Programming Fundamentals

Contents
BASIC ALGORITHMIC ANALYSIS
Asymptotic analysis of upper and average complexity bounds; Identifying differences among best, average, and
worst case behaviors; Big O, little o, omega, and theta notation; Standard complexity classes; Empirical
measurements of performance; Time and space tradeoffs in algorithms; Using recurrence relations to analyze
recursive algorithms.

ALGORITHMIC STRATEGIES
Brute-force algorithms; Greedy algorithms; Divide-and-conquer; Backtracking; Branch-and-bound; Heuristics;
Pattern matching and string/text algorithms; Numerical approximation algorithms.

FUNDAMENTAL COMPUTING ALGORITHMS

Simple numerical algorithms, Sorting and Searching Algorithm: Sequential and binary search algorithms; Quadratic
sorting algorithms (bubble, selection, insertion); O (N log N) sorting algorithms (Quick sort, heap sort); Hashing:
Hash tables, including collision-avoidance strategies;

DATA STRUCTURES & ALGORITHMS

Non-Linear Data Structures: Binary trees; Binary Search Trees; General Tree;

GRAPHS
Representations of graphs (adjacency list, adjacency matrix, Sparse Matrix); Topological Sorting; Shortest-path
algorithms (Single source shortest path; Dijkstra‟s and Floyd‟s algorithms); Minimum spanning tree (Prim‟s and
Kruskal‟s algorithms);

Text / Reference Books

1. S. Sahni, Data structures, algorithms, & applications in Java, McGraw-Hill,2005
2. J. P. Trembly et al, An introduction to data structures with applications,2007
3. D. E. Knuth, Art of computer programming, Volume 1: Fundamental algorithms, Addison-Wesley.2004
4. Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , Clifford Stein, Introduction to Algorithms,
2nd Edition, PHI, 2006

Mode of Evaluation
Written examinations, Assignments, Surprise tests and Quizzes

36