Non-Linear Data Structure
Uploaded by
raja shawNon-Linear Data Structure
Uploaded by
raja shawNon-linear Data Structures & Scalable Algorithms (TIU-PC-UCS-T21101)
Program: B. Tech in CSE & CSE-AI Year, Semester: 2nd Yr., 3rd Sem.
Course Title: Non-linear Data Structures & Scalable Subject Code: TIU-PC-UCS-T21101
Algorithms
Contact Hours/Week: 3–0–0 (L–T–P) Credit: 3
COURSE OBJECTIVE:
Enable the student to:
1. Understand and apply advanced data structures for efficient problem-solving in computing
domains.
2. Analyze and implement optimized algorithms for trees, graphs, heaps, and memory-efficient
data structures.
3. Develop scalable solutions using advanced searching, sorting, and dynamic data structures
in real-world applications.
COURSE OUTCOME:
On completion of the course, the student will be able to:
CO-1 Understand and explain advanced tree structures and their applications K2
Apply heap and priority queue techniques to solve real-world scheduling and
CO-2 K3
optimization problems
Analyze and implement advanced graph algorithms for network and traversal
CO-3 K4
problems
Evaluate and utilize efficient hashing techniques for memory optimization and
CO-4 K4
fast retrieval
Implement and optimize advanced searching and sorting algorithms for
CO-5 K3
large-scale data processing
Apply dynamic data structures and disjoint set techniques in distributed and
CO-6 K3
AI-based systems
COURSE CONTENT:
MODULE-1: LINEAR DATA STRUCTURE - RECAP 9 Hours
Array: Definition, properties, types, operations (insert, delete, search, sort, append etc.), array and
pointer, application.
Linked list: Definition, property, types, operations (insert, delete, append etc.), application.
Stack and Queue: Definition, properties with basic operations, application.
MODULE 2: TREE and HEAP 9 Hours
Binary Tree, Binary Search Tree (Definition, properties, operations-insert, delete, search,
advantage and disadvantage), Threaded Binary Tree (Definition, usefulness, Types-One-way, Two-
way),
AVL trees (Definition, properties-balance factor, rotation in insertion and deletion), Red-Black
trees,
Multiway Search trees (B-Trees, B+ Trees): (Definition, properties, operations-insert, delete,
search, usefulness)
Binary Heaps (Min-Heap, Max-Heap, Heapify operations)
MODULE 3: GRAPH DATA STRUCTURES & ALGORITHMS 9 Hours
Graph: Definitions, representations (Adjacency List, Adjacency Matrix), Graph traversals (BFS,
DFS), Spanning Tree: Minimal Spanning Tree (Prims, Kruskal)
MODULE 4: HASHING TECHNIQUES & MEMORY OPTIMIZATION 9 Hours
Hashing: Definition, Different Hash functions (Division, Multiplication method etc.), Collision,
Resolution techniques - Open Addressing (linear probing, Quadratic Probing, Double Hashing, Re-
hashing), and Chaining, Application
MODULE 5: SEARCHING & SORTING 9 Hours
Searching: Interpolation, Hashing; Sorting: Merge, Quick, Radix, Shell, Heap, Topological sorting
