1.6 DATA STRUCTURES & ALGORITHM
UNIT - I
Introduction of data Structures, algorithms, Complexity of algorithms.
Ordered lists: Operations on ordered lists, Arrays representations of symmetric matrices.
UNIT - II
Stacks and queues: Implementations of stacks and queues using arrays, circular queues, Dqueue, applications of stacks and queues, Recursive procedures.
Linked Lists: Simply liked lists, Doubly linked lists, Circular lists, application of linked lists, Implementations of stacks and queues using linked lists.
UNIT - III
Non - linear data structures: Trees, Binary tree traversal, application of trees, Graphs, implementations of Graphs.
UNIT - IV
Sorting & searching: Sorting algorithms - selection, bubble, quick, merge, heap, radix, Binary search, binary search trees, Balancing and Hashing.
UNIT - V
Analysis of Algorithms: Divide and conquer, Branch and Bound and Dynamic Programming.
Suggested Readings:
1.Introduction to Data Structures Horowitz & sahani.
2.Data Structures Schaum series.
|