Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
1. To teach efficient storage mechanisms of data for an easy access.2. To design and implementation of various basic and advanced data structures.3. To introduce various techniques for representation of the data in the real world.4. To develop application using data structures.5. To teach the concept of protection and management of data.6. To improve the efficiency of algorithm by using suitable data structure.
Syllabus
Week 1
Introduction to ListArray and Linked List - Stack Implementation using array and linked list - Applications of Stack
Week 2
Queue Implementation - Application of QueuesTrees and Terminologies - Tree Traversals
Week 3
In order Traversal-Binary Search Tree - Implementation of Search Algorithm
Week 4
AVL Tree Insertion, Deletion
Week 5
Graph representation, Shortest Path Algorithm
Week 6
Sorting, Heap Techniques, Hashing
Week 7
Sorting Algorithms, Divide and Conquer algorithmsSelection Sort, Brute force sort, Bubble Sort
Week 8
Insertion Sort, Quick sort applications
Prim's Algorithm, Kruskal's Algorithm
Week 9
Bucket Sorting, Radix Sort, Merge Sort
Week 10
Directories and Contiguous allocation, File maintenance
Week 11
External Sorting, Cascade Merge Sort
Week 12
B + Tree maintenance and efficiency, Construction of B-tree, B+tree insertion and deletion
Introduction to ListArray and Linked List - Stack Implementation using array and linked list - Applications of Stack
Week 2
Queue Implementation - Application of QueuesTrees and Terminologies - Tree Traversals
Week 3
In order Traversal-Binary Search Tree - Implementation of Search Algorithm
Week 4
AVL Tree Insertion, Deletion
Week 5
Graph representation, Shortest Path Algorithm
Week 6
Sorting, Heap Techniques, Hashing
Week 7
Sorting Algorithms, Divide and Conquer algorithmsSelection Sort, Brute force sort, Bubble Sort
Week 8
Insertion Sort, Quick sort applications
Prim's Algorithm, Kruskal's Algorithm
Week 9
Bucket Sorting, Radix Sort, Merge Sort
Week 10
Directories and Contiguous allocation, File maintenance
Week 11
External Sorting, Cascade Merge Sort
Week 12
B + Tree maintenance and efficiency, Construction of B-tree, B+tree insertion and deletion
Taught by
Dr.S.Sasikala, Assistant Professor of Computer Science, Institute of distance Education University