MC7104 DATA STRUCTURES & ALGORITHMS NOTES ANNA UNIVERSITY

Data Structures & Algorithms Notes MC7104 For Anna University

MC7104 DATA STRUCTURES AND ALGORITHMS

UNIT I LINEAR DATA STRUCTURES

Introduction
Abstract Data Types (ADT)
Arrays and its representation
Structures
Stack
Queue
Circular Queue
Applications of stack
Infix to postfix conversion
Evaluation of expression
Applications of Queue
Linked Lists
Doubly Linked lists
Applications of linked list
Polynomial addition

UNIT II TREE STRUCTURES

Need for non-linear structures
Trees and its representation
Binary Tree
Expression trees
Binary tree traversals
Left child right sibling data structures for general trees
Applications of trees
Huffman Algorithm
Binary search tree

UNIT III BALANCED SEARCH TREES, SORTING AND INDEXING

AVL trees
B-Trees
Sorting
Bubble sort
Quick Sort
Insertion Sort
Heap sort
Hashing
Hashing functions
Collision Resolution Techniques
Separate chaining
Open addressing
Multiple

UNIT IV GRAPHS

Definitions
Representation of graph
Graph Traversals
Depth-first traversal
breadth-first traversal
Applications of graphs
Topological sort
Shortest-path algorithms
Minimum spanning tree
Prim's and Kruskal's algorithms
Biconnectivity
Euler circuits

UNIT V ALGORITHM DESIGN AND ANALYSIS

Algorithm Analysis
Asymptotic Notations
Divide and Conquer
Merge Sort
Binary Search
Greedy Algorithms
Knapsack Problem
Dynamic Programming
Warshall’s Algorithm for Finding Transitive Closure
Backtracking
Sum of Subset Problem
Branch and Bound
Travelling Salesman Problem

Download Data Structures & Algorithms