KARPAGAM ACADEMY OF HIGHER EDUCATION

(Deemed to be University)
(Established Under Section 3 of UGC Act, 1956)
Accredited with A+ Grade by NAAC in the Second Cycle
Pollachi Main Road, Eachanari Post,
Coimbatore - 641 021

LECTURE PLAN
DEPARTMENT OF COMPUTER APPLICATIONS
NAME : Mr. C. BALAKUMAR CLASS & : I MCA & A
SEMESTER
COURSE : ADVANCED DATA STRUCTURES COURSE CODE : 24CAP103
NAME AND ALGORITHMS

Lecture
S. No. Duration Topics to be Covered Support Materials
(Hr)
UNIT-I: LINKED LISTS, STACKS AND QUEUES

1 1 Introduction - Representation and Operations SR1: 131-132

2 1 Linear Linked List SR1: 133-142

3 1 Doubly Linked List SR1: 147-149

4 1 Circular Linked List SR1: 160

5 1 Header Linked Lists SR1: 161

6 1 Applications of Linked list SR1: 162-167

7 1 Stacks: Operations on stacks SR1: 181-183

8 1 Representation of a stack in memory SR1: 183- 187

9 1 Applications of stack SR1: 196-213

10 1 Queues: Operations SR1: 223-225

11 1 Representation of Queues in memory SR1: 226-243

12 1 Applications of Queues SR1: 249-250

Total No. of Hours Planned for Unit I = 12 Hours

UNIT-II: TREES

1 1 Introduction – Tree terminology SR1: 251

2 1 Binary trees SR1: 254-255

3 1 Tournament trees SR1: 257

4 1 Binary search trees SR1:258

5 1 Representation of a binary and Binary search tree SR1:258-259

6 1 Operations on binary and Binary search tree SR1:261

7 1 Creation SR1:262

8 1 Traversal SR1:262-266

9 1 AVL Trees SR1:281-282

10 1 Threaded binary trees- B Tree SR1:294-296

11 1 B+ Trees SR1:309

12 1 Heaps SR1:313-317

Total No. of Hours Planned for Unit II = 12 Hours

1 1 Introduction – Graph terminology SR2: 383-384

2 1 Representation of Graphs SR2: 388-391

3 1 Operations on Graphs SR1: 334-336

4 1 Applications of Graph SR2: 419-420

5 1 Topological Sort SR2: 400-403

6 1 Minimum Spanning Tree SR2: 405-407

7 1 Finding Shortest paths SR1:367-382

8 1 Articulation Points, Bridges SR1:383

9 1 Biconnected Components SR1:383

10 1 Strongly connected components SR1: 384

11 1 Eulerian Tour SR1: 384

12 1 Hamiltonian Tour SR1:384

Total No. of Hours Planned for Unit III = 12 Hours

UNIT-IV: HASH TABLES AND HASHING

1 1 Introduction – Direct Address table SR1: 387-388

2 1 Hash Table SR2: 464-465

3 1 Hash Table SR2: 464-465

4 1 Hash Function SR1: 392-394, SR2: 466

5 1 Hash Function SR1: 392-394, SR2: 466

6 1 Resolving collisions SR2:469-481

7 1 Resolving collisions SR2:469-481

8 1 Synonyms Chaining SR1: 396-397

9 1 Synonyms Chaining SR1: 396-397

10 1 Open Addressing SR1: 401-409

11 1 Open Addressing SR1:401-409

12 1 Rehashing SR1:413

Total No. of Hours Planned for Unit IV = 12 Hours

UNIT-V: SORTING, SEARCHING AND MERGING

1 1 Introduction – Bubble sort SR3: 279-281

2 1 Selection sort SR3: 261-263

3 1 Insertion Sort Sr1: 427-428

4 1 Bucket / Radix Sort SR3: 662-664

5 1 Merge Sort SR3: 273-275

6 1 Quick Sort SR3: 608-612

7 1 Heap Sort SR3: 763-764

8 1 Tree sort SR3: 757-759

9 1 Shell Sort SR1: 455, W1

10 1 Searching: Linear SR1: 458-459, W1

11 1 Binary search SR1: 459-461, W1

12 1 Merging SR1: 463-464, W1

Total No. of Hours Planned for Unit V = 12 Hours

Total Planned Hours :60 Hours

1. R.S.Salaria, “Data structures & Algorithms Using C”, 5th Edition, Khanna Book Publishing
Co.Pvt. Ltd., SRS Enterprises, New Delhi, 2022.
2. Reema Thareja.,“Data Structures using C”, 2ndEdition, Oxford University Press, New Delhi, 2018.
3. Jean Paul Tremblay and Paul G. Sorensen, “An Introduction to Data Structures with Applications”,
2nd Edition, Tata McGraw Hill, New Delhi, 2017.

WEB LINKS
1. https://www.gatevidyalay.com/algorithms/
2. http://www.vssut.ac.in/lecture_notes/lecture1428551222
3. https://lecturenotes.in/notes/17784-note-for-design-and-analysis-of-algorithm-daa-by-
shekharesh-barik
4. https://aunotes.in/t/cs8451-design-and-analysis-of-algorithms-notes/939
5. https://www2.cs.duke.edu/courses/fall08/cps230/Book

NPTEL
1. https://nptel.ac.in/courses/106/105/106105184/

Subject Faculty HoD