X

Data Structures

By Dr. M. Deivamani, Assistant Professor   |   College of Engineering, Guindy, (CEG), Anna University
Learners enrolled: 398
This course provides an in-depth introduction to essential data structures, including stacks, queues, linked lists, and graphs, along with core concepts like sorting algorithms, heaps, and hashing. Students will explore advanced structures such as B-trees, B+ trees, and AVL trees. Through hands-on case studies and discussions, participants will develop practical skills in implementing these techniques, making it ideal for those looking to strengthen their knowledge in data structures.
Summary
Course Status : Upcoming
Course Type : Core
Language for course content : English
Duration : 12 weeks
Category :
  • Computer Science
Credit Points : 4
Level : Undergraduate
Start Date : 13 Jan 2025
End Date : 30 Apr 2025
Enrollment Ends : 28 Feb 2025
Exam Date : 18 May 2025 IST
Translation Languages : Tamil
NCrF Level   : 5.0
Industry Details : Software Development
Exam Shift :

Shift-II

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


Page Visits



Course layout

Week 1
  • Introduction of Data Structures, Arrays, Stacks and Its Application
Week 2
  • Queues, Implementation of Queues, Trees, and Tree Traversals
Week 3
  • Binary Tree Representation & Binary Tree Traversal
  • Binary Search Trees - Searching & Insertion, and Deletion
Week 4
  • Balanced Trees, Balanced Trees - Insertion, and AVL Trees
Week 5
  • Graphs, Graph Traversals, and Shortest Path
Week 6
  • Types of Sorting, Heap Sort and Hashing
Week 7
  • Sorting, Selection Sort and Bubble Sort
Week 8
  • Insertion Sort, Quick Sort Algorithm, and Kruskal's MST Algorithm
Week 9
  • Bucket Sort, Radix Sort, and Merge Sort
Week 10
  • File Organisation
Week 11
  • External Sorting
Week 12
  • B Tree and B+ Tree - Insertion & Deletion

Books and references

1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++” (2007), Second Edition, Pearson Education.
2. Cormen, Leiserson and Rivest, “Introduction to Algorithms” (2022), Fourth Edition, MIT Press.
3. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms” (1983), Pearson Education.
4. Ellis Horowitz, Sartaj Sahni and Susan Anderson, “Fundamentals of Data Structures in C++ ” (1993).

Instructor bio

Dr. M. Deivamani, Assistant Professor

College of Engineering, Guindy, (CEG), Anna University
Dr. M. Deivamani is an Assistant Professor in the Department of Information Science and Technology at the College of Engineering Guindy, Anna University, Chennai. With over 16 years of teaching experience, he has made significant contributions to research and academia. His primary research interests include Information Retrieval, Recommender Systems, Machine Learning, and Mobile Robotics, with a strong commitment to advancing these fields. He is actively involved in administrative responsibilities and demonstrates enthusiastic engagement in research initiatives.

Course certificate

30% for in course Assessment & 70% of end-term Proctored Exam
Securing 40% separately is mandatory to pass the exam and get the certificate


MHRD logo Swayam logo

DOWNLOAD APP

Goto google play store

FOLLOW US