Advanced data structure

Course Description

The Advanced Data Structures course focuses on the design, analysis, and implementation of efficient data organization techniques used to solve complex computational problems. Building upon fundamental concepts such as arrays, linked lists, stacks, and queues, this course introduces advanced structures like trees, graphs, heaps, hash tables, and self-balancing trees.Apply Data Structures to Real-World Problems

Course Fee Seats Limited

₹2000.00

Course Details

Duration
Duration
50 HRS
Duration
Course Label
SDC
Course Language
English
Duration
Course Mode
Online
Duration
Timings
8 PM - 9 PM
Days
Monday to Saturday
Registration Till
12 Jun 2026
Duration
Tentative ClassStart Date
2nd Week of June
Duration
Eligible Schools:
1.School of Computer Applications 2.School of Electronics and Electrical Engineering
Certificate Criteria
Certificate Criteria
75% attendance, 50% score in all Exams/CA

Curriculum Snapshot

Explore the comprehensive course modules

1 Week 1: Binary Tree

Introduction to Binary Tree Properties of Binary Tree Types of Binary Tree Efficient searching algorithms-I Efficient searching algorithms-II Efficient sorting algorithms-I Efficient sorting algorithms-II and use cases of Binary Tree

2 Week 2: Binary Search Tree

Definition and Structure of a BST BST Properties Real-world Applications of BST Searching in BST Insertion in BST Deletion in BST Traversal in BST

3 Week 3: Red Black Tree

Definition and Structure of a Red Black Tree Rotations in RBT Searching in RBT Insertion in RBT Deletion in RBT Real-world Applications of RBT Traversal in RBT

4 Week 4:AVL Tree

Introduction and AVL vs Red-Black Tree Rotations: LL, RR, LR, RL Insertion with rebalancing Deletion with rebalancing Search operation Real-world use cases Evaluation 2

5 Week 5: Multiway Search Trees

Introduction to multiway trees (B-Tree, B+ Tree, etc.) Structure: nodes with multiple keys and children B-Tree properties Insertion in B-Trees Deletion in B-Tree Search in B-Tree Difference between B-Tree and B+ Tree with use cases

6 Week 6 Trie (Prefix Tree)

Introduction and basic structure Insertion operations Search operations Deletion in Trie Applications, Trie vs HashMap Compressed Trie (Radix Tree), Ternary Search Trie Evaluation 3

Instructor Spotlight

Learn from leading experts in stem cell research

Dr. Sarneet Kaur

Dr. Sarneet Kaur

Assistant Professor

Dr.Sarneet Kaur