You are on page 1of 1

VASAVI VIDYA TRUST GROUP OF INSTITUITION, FACULTY OF MCA, SALEM-103 STAFF: P.

AROCKIARAJ ANDREWS CLASS: I MCA SUBJECT: DATA STRUCTURES UNITS: 5 UNIVERSITY NORMS: 60 Hrs ACTUAL HOURS: 58 Hrs SEPTEMBER UNIT I FROM:02.09.10 TO:24.09.10 LISTS, STACKS AND QUEUES Abstract data typesList ADT-Stack ADT-recursionQueue ADT UNIT AV THEATRE(PPT) Hours Taken: 10 UNIT-II FROM:25.09.10 TO:28.09.10 TREES Trees - General, Binary trees - Search tree ADT OCTOBER UNIT-II (Cont) FROM:01.10.10 TO:18.10.10 Binary Search TreesAVL trees, Threaded trees- Splay Trees- BTrees. AV THEATRE(PPT) AV THEATRE(PPT) Hours Taken:12 Hours Taken: 12 UNIT III UNIT IV FROM:19.10.10 TO:30.10.10 SORTING AND SEARCHING Sorting - Internal Sorting - Quick Sort - Heap Sort, Radix Sort - External Sorting - Merge Sort, FROM:13.11.10 TO:30.11.10 GRAPHS AND THEIR APPLICATIONS Graphs - Definitions Topological sort Shortest Path Algorithms - Network flow problemsUNIT V FROM:07.12.10 TO:31.12.10 STORAGE MANAGEMENT Automatic list Management- Garbage Collection - Algorithms for Garbage collection and CompactionDynamic memory management- Buddy Systems. AV THEATRE(PPT) Hours Taken: 12 Hours Taken: 12 AV THEATRE(PPT) NOVEMBER UNIT-III (Cont) FROM:01.11.10 TO:12.11.10 Multi-way Merge Sort, Polyphase Sorting- Basic Search Techniques - Tree Searching General Search Trees - Hashing DECEMBER UNIT IV (Cont.) FROM:03.12.10 TO:06.12.10 Minimum Spanning Tree - Applications of Depth First search Introduction to NPcompleteness.

You might also like