Lesson Plan

L T P C
Course Code: Advanced Data Structures through C++ 3 - - 3
A63K2
Pre-requisites: Basic knowledge in Programming.
Name of the S. Vahini
Faculty
Designation Assistant Professor
Department csbs
Academic year 2023-24 Class: II B.Tech I Sem Section: 1

Learning Content & Plan

Unit Title Name of No. Date Teachi Text book
the Topic of ng
Perio aids
ds
The Fundamentals of 1 LCD/ T1,T2,T3,T4
Object-Oriented BB
Programming
Necessity for OOP 1 LCD/
BB T1,T2,T3,T4
Data Hiding 1 LCD/ T1,T2,T3,T4
BB
Data Abstraction 1 LCD/BB T1,T2,T3,T4
Encapsulation, 1 LCD/BB T1,T2,T3,T4
UNIT-I Procedural Abstraction 1 LCD/BB T1,T2,T3,T4
Class and Object 2 LCD/BB T1,T2,T3,T4
Scope of Class and Scope 2 LCD/BB T1,T2,T3,T4
Resolution Operator
Member Function of a 1 LCD/BB T1,T2,T3,T4
Class
private Access Specifier 1 LCD/
BB
Protected Access 1 LCD/
Specifier BB
Public Access Specifier 1 LCD/
BB
Unit Assessment 1 Test/ Interactive
Session
Priority Queues: 1 LCD/ T1,T2,T3,T4
Definition BB
realizing a Priority 2 LCD/ T1,T2,T3,T4
Queue using Heaps BB
Insertion, Deletion 2 LCD/ T1,T2,T3,T4
BB
 Heap sort 2 LCD/BB T1,T2,T3,T4
UNIT-II External Sorting 2 LCD/ T1,T2,T3,T4
BB
Dictionaries 1 LCD/ T1,T2,T3,T4
BB
Linear List 1 LCD/BB
Representation
Skip List 1
Representation,
Operations- Insertion, 2
Deletion and
Searching
Unit Assessment 1 Test/ Interactive
Session

Hashing: Hash Table 1 LCD/BB T1,T2

Representation
Hash Functions 2 LCD/BB T1,T2
Collision Resolution 1 LCD/BB T1,T2
Separate Chaining
Open Addressing- 1 LCD/BB T1,T2
UNIT-III Linear Probing
Quadratic Probing 1 LCD/ T1,T2
BB
Double Hashing 2 LCD/ T1,T2
BB
Rehashing 2 LCD/ T1,T2
BB
Extendible Hashing 2
Comparison of Hashing 1
and Skip Lists

Unit Assessment 1 Test/ Interactive

Session
UNIT-IV Trees: Basic 1 LCD/ T1,T2
Terminology, Binary BB
Tree
Array and Linked List 1 LCD/ T1,T2
Representations BB
Traversals 1 LCD/ T1,T2
BB
Threaded Binary Trees 1 LCD/ T1,T2
BB
Binary Search Trees- 1 LCD/ T1,T2
 Definition(ADT) BB
Implementation 1 LCD/ T1,T2
BB
Operations- Searching, 1 LCD/ T1,T2
Insertion and Deletion BB
AVL Trees, Definition 1
Operations – Insertion 2
and Searching
B-Trees- Definition, B- 1
Tree of Order m
Insertion, Deletion and 2
Searching
Red black Trees and 2
Splay Trees
Unit Assessment 1 Test/ Interactive
Session
Graphs: Basic 1 LCD/ T1,T2
Terminology BB
Representations of 1 LCD/ T1,T2
Graphs BB

Graph Search Methods: 1 LCD/ T1,T2

DFS BB
UNIT-V
BFS 1 LCD/ T1,T2
BB
Text Processing Pattern 1 LCD/ T1,T2
Matching Algorithms: BB
Brute Force
The Knuth-Morris- 2 LCD/ T1,T2
Pratt Algorithm BB
Tries: Standard Tries 2 LCD/BB T1,T2
Compressed Tries 1
Suffix Tries. 1
Unit Assessment 1 Test/ Interactive
Session

Learning Resources

2
 3

Head of Department
Signature of Faculty