1. DATA STRUCTURES Prepared by, K.ABINAYA L/IT

2. Aim: To present the concepts of arrays, structures, stack, queue, linked list, graphs, trees and storage management. Objective:  To introduce the concepts of Algorithms and various complexities.  To give the students an idea about various types of Data Structures and train them in linked lists, stacks and queues with applications.  To study trees, representation of trees, tree traversal and basic operations on trees.  To train the students in the concepts of sorting and searching techniques.  To study the concept of graphs, finding the shortest path and minimum spanning tree.  To familiarize the students with the ideas of storage management. AIM AND OBJECTIVES

3. SYLLABUS L T P C 3 0 0 3 UNIT I FUNDAMENTALS OF ALGORITHMS 8 Algorithm – Analysis of Algorithm – Best Case and Worst Case Complexities –Analysis of Algorithm using Data Structures – Performance Analysis – Time Complexity– Space Complexity – Amortized Time Complexity – Asymptotic Notation UNIT II FUNDAMENTALS OF DATA STRUCTURES 9 Arrays – Structures – Stacks – Definition and examples – Representing Stacks – Queues and Lists – Queue and its Representation – Applications of Stack – Queue and Linked Lists. UNIT III TREES 10 Binary Trees – Operations on Binary Tree Representations – Node Representation –Internal and External Nodes – Implicit Array Representation – Binary Tree Traversal –Huffman Algorithm – Representing Lists as Binary Trees – Sorting and Searching Techniques – Tree Searching – Hashing

4. SYLLABUS UNIT IV GRAPHS AND THEIR APPLICATIONS9 Graphs – An Application of Graphs – Representation – Transitive Closure – Warshall’s Algorithm – Shortest path Algorithm – A Flow Problem – Dijikstra’s Algorithm –Minimum Spanning Trees – Kruskal and Prim’s Algorithm – An Application of Scheduling – Linked Representation of Graphs – Graph Traversals UNIT V STORAGE MANAGEMENT 9 General Lists – Operations – Linked List Representation – Using Lists – Freeing List Nodes – Automatic List Management : Reference Count Method – Garbage Collection –Collection and Compaction Total: 45

5. TEXT BOOKS 1. Cormen T. H.., Leiserson C. E, and Rivest R.L., “Introduction to Algorithms”, Prentice Hall of India, New Delhi, 2007. 2. M.A.Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition, Pearson Education, 2005. REFERENCES 1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, “Computer Algorthims/C++”, Universities Press (India) Private Limited, Second Edition, 2007. 2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”,First Edition, Pearson Education, 2003. 3. R. F. Gilberg and B. A. Forouzan, “Data Structures”, Second Edition, ThomsonIndia Edition, 2005. 4. Robert L Kruse, Bruce P Leung and Clovin L Tondo, “Data Structures andProgram Design in C”, Pearson Education, 2004. 5. Tanaenbaum A. S. Langram, Y. Augestein M.J, “Data Structures using C”,Pearson Education, 2004.

6. INTRODUCTION

7. UNIT-1 Fundamentals of Algorithm  Analysis of Algorithm  Performance Analysis Time complexity Space complexity  Asymptotic Notations

8. UNIT-2 Fundamentals of Data Structure  Arrays  Structures  Stacks and its Application  Queue and its Representation  Linked List

9. STACKSQUEUES

10. UNIT-3 Trees  Binary Search Trees  Binary Tree Traversal Post-Order Pre-Order In-Order  Sorting Techniques Bubble Sort Merge Sort Quick Sort Heap Sort Radix Sort  Searching Techniques  Hashing

11. UNIT-4 Graphs  Graph and its Application  Shortest path Algorithm ( Dijkstra’sAlgorithm)  Warshall’s Algorithm  Minimum Spanning Tree

12. Dijkstra algorithm

13. UNIT-5 Storage management  General Lists Linked List Representation Freeing Nodes  Automatic List Management Garbage Collection and Compaction

14. Seminar topics  Stacks & queues  Linked list  Double linked list and circular linked list  Binary trees  Tree traversal  Sorting techniques  Hashing techniques  Short path algorithm  Nodes  Reference count method

15. Assignment topics  Applications of stack  Spanning Tree  Garbage collection

16. URL http://engineeringppt.blogspot.com/data-structures? http://ebooks9.com/data-stuctures-ppt.html/ http://www.sourcecodesworld.com/source/BrowseCategory.asp? CatId=2 http://datastructures.itgo.com/