X

Data Structures

By Dr. J. Kokila   |   IIIT, Tiruchirappalli
Learners enrolled: 475


      Introduces core concepts, terminologies, and the classification of data structures, forming the foundation for problem-solving and programming.

      Covers stacks, queues, and their variants, with practical applications like expression evaluation and scheduling algorithms.

      Explores singly, circular, and doubly linked lists, along with their use in implementing stacks and queues efficiently.

      Focuses on trees and graphs, their representations, operations, and traversals, enabling advanced problem-solving techniques.


Summary
Course Status : Upcoming
Course Type :
Language for course content : English
Duration : 4 weeks
Category :
  • Teacher Education
Credit Points : 2
Level : Diploma
Start Date : 26 Jan 2026
End Date : 30 Apr 2026
Enrollment Ends : 28 Feb 2026
Exam Date :
Translation Languages : English
NCrF Level   : 4.5 — 5.5
Industry Details : Education and Training

Contact NC Support


Page Visits



Course layout

Course Layout:

Week 1 – Foundations & Linear Data Structures

UNIT 1: Introduction to Data Structures

  • Basic Terminology: Data, Information, ADT, Data Structure
  • Classification: Primitive vs. Non-primitive, Linear vs. Non-linear
  • Operations on Data Structures: Traversal, Insertion, Deletion, Searching, Sorting, Merging

UNIT 2: Stacks

  • Introduction to Stacks & Need
  • Array Representation of Stacks
  • Stack Operations: PUSH, POP, PEEK
  • Applications of Stacks: Expression conversion (Infix Postfix)

Week 2 – Linear Data Structures

UNIT 2: Stacks (contd.)

  • Evaluation of Postfix Expressions

UNIT 2: Queues

  • Introduction to Queues & their Need
  • Array Representation of Queues
  • Operations on a Queue (ENQUEUE, DEQUEUE)
  • Types of Queues: DeQueue, Circular Queue
  • Applications: Round Robin Algorithm

Week 3 – Linked Lists

UNIT 3: Linked Lists

  • Singly Linked List: Structure, Representation in Memory
  • Operations: Traversal, Insertion, Deletion, Searching
  • Circular Linked Lists: Representation & Operations
  • Doubly Linked Lists: Representation & Operations
  • Linked List Implementation of Stack & Queue

Week 4 – Non-Linear Data Structures

UNIT 4: Trees

  • Basic Terminologies (root, degree, height, level, etc.)
  • Concepts of Binary Trees
  • Representations: Array-based, Linked List-based
  • Operations on Binary Trees: Insertion, Deletion, Traversals (Inorder, Preorder, Postorder)
  • Types of Binary Trees: Full, Complete, Binary Search Trees

UNIT 4: Graphs

  • Graph Terminologies (vertices, edges, degree, etc.)
  • Graph Representations: Set, Linked, Matrix forms
  • Graph Traversals: BFS, DFS

Books and references

1. Data Structures, R.S. Salaria, Khanna Book Publishing, New Delhi

2. Data Structures Using C, Reema Thareja, Oxford University Press India.

3. Classic Data Structures, Samanta Debasis, Prentice Hall of India.

4. Fundamentals of Data Structure in C, Horowitz, Ellis, Sahni, Sartaj, Anderson-Freed, Susan, University Press, India.

5. Data Structures: A Pseudo code approach with C, Richard F. Gilberg, Behrouz A. Forouzan, CENGAGE Learning, India.

6. Data Structures and Algorithms: Concepts, Techniques and Applications, G. A. V. Pai, McGraw-

Hill Education, India.


Instructor bio

Dr. J. Kokila

IIIT, Tiruchirappalli

Dr. J. Kokila is currently an Assistant Professor in the Department of Computer Science and Engineering at the Indian Institute of Information Technology (IIIT), Tiruchirappalli, India. She earned her Ph.D. under the Visvesvaraya PhD Scheme from the Department of CSE at the National Institute of Technology (NIT), Tiruchirappalli, India. She has ten years of teaching experience at reputed engineering institutions, including IIIT Allahabad and NIT Tiruchirappalli, where she has taught courses such as Information Security, Principles of Cryptography, Theory of Computation, Advanced Data Structures and Algorithms, Advanced Digital Design, and Computer Architecture. Her research interests span Hardware Security, Physical Unclonable Functions (PUFs), System-on-Chip Design, FPGA, Security in IoT Edge Computing, and Computer Architecture. She has published Ten research articles in high-quality international journals, including a paper in the IEEE Transactions on VLSI Systems, and 11 reputed international conference papers, with most of her work focusing on Edge Computing and hardware security.

Course certificate

"The SWAYAM Course Enrolment and learning is free. However, to obtain a certificate, the learner must register and take the proctored exam in person at one of the designated exam centres. The registration URL will be announced by NTA once the registration form becomes available. To receive the certification, you need to complete the online registration form and pay the examination fee. Additional details, including any updates, will be provided upon the publication of the exam registration form. For more information about the exam locations and the terms associated with completing the form, please refer to the form itself."

Grading Policy:

- Internal Assignment Score: This accounts for 30% of the final grade and is calculated based on the average of the best three assignments out of all the assignments given in the course.

- Final Proctored Exam Score: This makes up 70% of the final grade and is derived from the proctored exam score out of 100.

- Final Score: The final score is the sum of the average assignment score and the exam score.

Eligibility for Certification:

- To qualify for a certificate, you must achieve an average assignment score of at least 10 out of 30, and an exam score of at least 30 out of 70. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >=40/100.
Certificate Details:

- The certificate will include your name, photograph, roll number, and the percentage score from the final exam. It will also feature the logos of the Ministry of Education, SWAYAM, and NITTTR.

- Certificate Format: Only electronic certificates (e-certificates) will be issued; hard copies will not be dispatched.

Once again, thanks for your interest in our online courses and certification. Happy Learning.
*********
MHRD logo Swayam logo

DOWNLOAD APP

Goto google play store

FOLLOW US