Data Structures

By Dr. J. Indumathi, Professor   |   Anna University, Chennai
Learners enrolled: 13620

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.
Course Status : Completed
Course Type : Core
Duration : 12 weeks
Category :
  • Computer Science and Engineering
Credit Points : 4
Level : Undergraduate/Postgraduate
Start Date : 23 Jan 2023
End Date : 30 Apr 2023
Enrollment Ends : 15 Mar 2023
Exam Date : 15 May 2023 IST

Note: This exam date is subjected to change based on seat availability. You can check final exam date on your hall ticket.

Page Visits

Course layout

Week 1

Introduction to List 
Array and Linked List - Stack Implementation using array and linked list - Applications of Stack

Week 2

Queue Implementation - Application of Queues
Trees 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 algorithms
Selection 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

Books and references

1. Data Structures and Algorithm Analysis in C++ M.A.Weiss. 
2. Fundamentals of Data Structures in C++ by Ellis Horowitz, Sartaj Sahni, Dinesh Mehta. 
3. Introduction to Algorithms, by Cormen, Leiserson and Rivest. 
4. Data Structures and Algorithms, by Aho, Hopcroft and Ullman. 
5. http://www.dave-reed.com/csc427.F04/ 
6. http://www.cse.unt.edu/~rada/CSCE3110/ 

7. http://www.math.tau.ac.il/~matias/ds03.html 

Instructor bio

Dr. J. Indumathi, Professor

Anna University, Chennai
She  has  a teaching  and  research  experience  for  more  than  three  decades;  her interdisciplinary, expertise is outstanding, spanning diverse subject areas including the latest cutting-edge technologies. She has a zeal for investigation, research and has innovated and improvised expansively projects which have made a mile stone in the perfection of life style of the human kind. Being a privacy researcher and activist, she has received many awards and accolades from the various organizations, varsities and institutions quantifying to more than 65 awards. She has published more than 200 scientific papers published in reputed publications, 4 granted patents and authored 7 books. Most of her journal publications are indexed in Scopus and Web of Science. She has  delivered  several  technical  invited  talks,  keynote/plenary  speeches  and  has chaired  several  sessions  in  conferences  worldwide. She  is  a  good  integrator, multitasker, and possessing exceptional leadership capability, with proven strength, more visible in the areas of technical expertise, professional expertise, and strategic perspective. She has created an atmosphere of continual improvement and have done everything possible to achieve the goals; get others to go yonder what they initially thought impossible; energize others to take on perplexing goals.

Course certificate

30% for in course Assessment & 70% of end-term Proctored Exam

MHRD logo Swayam logo


Goto google play store