MC9214-Data Structures |
UNIT I DATA STRUCTURES |
Introduction Arrays Structures Stack: Definition and examples, Representing
Stacks - Queues and lists: Queue and its Representation, lists Applications of Stack,
Queue and Linked Lists. |
UNIT II TREES |
Binary Trees Operations on binary trees - Binary Tree Representations node
representation, internal and external nodes, implicit array representation Binary tree
Traversals - Huffman Algorithm Representing Lists as Binary Trees. |
UNIT III SORTING AND SEARCHING |
General Background Exchange sorts Selection and Tree Sorting Insertion Sorts
Merge and Radix Sorts Basic Search Techniques Tree Searching General Search
Trees Hashing. |
UNIT IV GRAPHS AND THEIR APPLICATIONS |
Graphs An application of graphs Representation transitive closure - Warshalls
algorithm Shortest path algorithm - a flow Problem Dijkstras algorithm An
application of scheduling - Linked representation of Graphs Graph Traversals |
UNIT V STORAGE MANAGEMENT |
General Lists: Operations, linked list representation, using lists, Freeing list nodes -
Automatic list Management: Reference count method, Garbage Collection, Algorithms,
Collection and compaction |
Text Books |
1. Tanaenbaum A.S.,Langram Y. Augestein M.J Data Structures using C
Pearson Education , 2004 |
Reference Books |
1. Robert Kruse & Clovis L. Tondo Data Structures and Program Design in
C,Prentice Hall , 2nd edition.,1991.
2. Weiss Data Structures and Algorithm Analysis in C ,Addison Wesley , Second
Edition, 1997. |