UNIT 1
INTRODUCTION: Basic
concepts of OOPs – Templates – Algorithm Analysis – ADT -
List (Singly, Doubly and
Circular) Implementation - Array, Pointer, Cursor
Implementation
UNIT 2
BASIC DATA STRUCTURES:
Stacks and Queues – ADT, Implementation and
Applications - Trees –
General, Binary, Binary Search, Expression Search, AVL,
Splay, B-Trees –
Implementations - Tree Traversals.
UNIT 3
ADVANCED DATA STRUCTURES:
Set – Implementation – Basic operations on set –
Priority Queue –
Implementation - Graphs – Directed Graphs – Shortest Path Problem
- Undirected Graph -
Spanning Trees – Graph Traversals
UNIT 4
MEMORY MANAGEMENT ; Issues
- Managing Equal Sized Blocks - Garbage
Collection Algorithms for
Equal Sized Blocks - Storage Allocation for Objects with
Mixed Sizes - Buddy
Systems - Storage Compaction
UNIT 5
SEARCHING, SORTING AND
DESIGN TECHNIQUES: Searching Techniques,
Sorting – Internal Sorting
– Bubble Sort, Insertion Sort, Quick Sort, Heap Sort, Bin
Sort, Radix Sort –
External Sorting – Merge Sort, Multi-way Merge Sort, Polyphase
Sorting - Design
Techniques - Divide and Conquer - Dynamic Programming - Greedy
Algorithm – Backtracking -
Local Search Algorithms
Reference
Books :
1. Mark Allen Weiss, “Data
Structures and Algorithm Analysis in C++”, Pearson P
2. Aho, Hopcroft, Ullman, “Data
Structures and Algorithms”, Pearson Education P
3. Drozdek, Data
Structures and algorithm in Jawa, Cengage (Thomson)
4. Gilberg, Data
structures Using C++, Cengage
3. Horowitz, Sahni,
Rajasekaran, “Computer Algorithms”, Galgotia,
4. Tanenbaum A.S., Langram
Y, Augestien M.J., ”Data Structures using C & C++”,Prentice
Hall of India, 2002
No comments:
Post a Comment