EE2204 DATA STRUCTURES AND ALGORITHMS lecture notes (DSA lecture notes) | (Common to EEE, EIE & ICE) |by R.Anirudhan

EE2204 DATA STRUCTURES AND ALGORITHMS lecture notes (DSA lecture notes) | (Common to EEE, EIE & ICE) |by R.Anirudhan


syllabus :
UNIT I LINEAR STRUCTURES 
Abstract Data Types (ADT) – List ADT – array-based implementation – linked list implementation –
cursor-based linked lists – doubly-linked lists – applications of lists – Stack ADT – Queue ADT –
circular queue implementation – Applications of stacks and queues

UNIT II TREE STRUCTURES 
Need for non-linear structures – Tree ADT – tree traversals – left child right sibling data structures for
general trees – Binary Tree ADT – expression trees – applications of trees – binary search tree ADT

UNIT III BALANCED SEARCH TREES AND INDEXING 
AVL trees – Binary Heaps – B-Tree – Hashing – Separate chaining – open addressing – Linear
probing

UNIT IV GRAPHS 
Definitions – Topological sort – breadth-first traversal - shortest-path algorithms – minimum spanning
tree – Prim's and Kruskal's algorithms – Depth-first traversal – biconnectivity – euler circuits –
applications of graphs

UNIT V ALGORITHM DESIGN AND ANALYSIS 
Greedy algorithms – Divide and conquer – Dynamic programming – backtracking – branch and
bound – Randomized algorithms – algorithm analysis – asymptotic notations – recurrences – NPcomplete
problems



All Rights Reserved Anna University Revaluation Results 2014 May/June 2014 - iAnnauniversity |
| My Google+ Profile | Find us on Google+