KATHIR COLLEGE OF ENGINEERING, NEELAMBUR Department of Computer Science and Engineering

LESSON PLAN

SUB CODE : IT 2201 CLASS : II IT

SUBJECT : Data Structures and Algorithms SEM : III

S.NO TITLE

UNIT-1 LINEAR STRUCTURES

1 Abstract Data Types(ADT) 1 57

2 List ADT(Array,Linked List) 2 58

3 Cursor based linked List 1 73

4 Doubly Linked List 1 67

5 Stack ADT & Queue ADT 2 78, 95

6 Circular Queue Implementation 1 70(R1)

7 Applications of List , Stack, Queue 1 87, 100

UNIT-2 TREE STRUCTURES

8 Tree ADT,Tree Traversals 1 106

9 Left child right sibiling data structures for general trees 1 107

10 Binary Tree ADT 2 111

11 Expression Trees, Applications of Trees 1 113

12 Binary Search Tree ADT 1 116

13 AVL Tree 2 126

14 Binary Heaps 1 195

UNIT-3 HASHING AND SETS

15 Hashing 1 165

16 Separate chaining, Open addressing 1 168, 173

17 Rehashing 1 181

18 Extendible Hashing 1 184

19 Disjoint set ADT, Dynamic equivalence Problem 1 279, 280

20 Smart Union Algorithm 2 285

21 Path Compression 1 287

22 Applications of sets 1 295

NO.OF. HOURS

TEXT BOOK (PAGE.NO)

UNIT-4 GRAPHS

23 Definition, Topological Sort 1 299, 302

24 Breadth - First Traversal, Shortest Path Algorithm 2 306

25 Minimum Spanning Tree(Prim's, Kruskal's algorithms) 3 329

26 Depth-First Traversal, Bicnnectivity 2 335, 338

27 Euler Circuits, Applications of Graphs 1 342

UNIT-5 ALGORITHM DESIGN AND ANALYSIS

29 Introduction to Algorithm Design Techniques 1 363

30 Greedy , Divide and Conquer Algorithm 3 363, 381

31 Dynamic Programming,backtracking 2 396, 417

32 Branch and bound, Randomized Algorithms 1 408

33 Introduction to Algorithms(Asymptotic notations, Recurrences) 1 R4

34 Introduction to NP-Complete Problems 1 348

Total 45 Hrs

TEXT BOOK :

1. M. A.Weiss,"Data Structures And Algorithm Analysis in C",Second Edtion,Pearson Education,1997.

REFERENCES:

1. A. V. Aho, J. E. Hopcroft,and J. D. Ullman," Data Structures and Algorithms", Pearson Education,1983.

3. A. M. Tenenbaum, Y. Langsam, and M. J. Augenstein,"Data structures using C",Pearson Education,1998

4. K.S.Easwarakumar,"Object Oriented Data Structures using C++", Vikas Publishing House Pvt.Ltd.,2000

5. Sara Baase and A. Van Geider,"Computer Algorithms", Third Edition, Pearson Education,2000

HOD PRINCIPAL

2. R. F. Gillberg, B.A. Forouzan," Data Structures: A Pseudocode approach with C", Second Edition, Thomson India Edition,2005.

6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to algorithms", Second

Edition,Prentice Hall of India Ltd, 2001

KATHIR COLLEGE OF ENGINEERING, NEELAMBUR Department of Information Technology

LESSON PLAN

SUB CODE : EE 2204 CLASS : II EEE SUBJECT : Data Structures and Algorithms SEM : III

S.NO TITLE

UNIT-1 LINEAR STRUCTURES

1 Abstract Data Types(ADT) 1 57

2 List ADT(Array, Linked List) 2 58

3 Cursor based linked List 1 73

4 Doubly Linked List 1 67

5 Stack ADT & Queue ADT 3 78, 95

6 Circular Queue Implementation 1 70(R1)

7 Applications of List , Stack, Queue 1 87, 100

UNIT-2 TREE STRUCTURES

8 Need for Non-Linear Structures, Tree ADT, Tree Traversals 1 106

9 Left child right sibiling data structures for general trees 1 107

10 Binary Tree ADT 2 111

11 Expression Trees, Applications of Trees 1 113

12 Binary Search Tree ADT 2 116

UNIT-3 BALANCED SEARCH TREES & INDEXING

13 AVL Trees 2 126

14 Binary Heaps 2 195

15 2 149

16 Hashing 1 165

17 Separate chaining, Open addressing 1 168,173

18 Linear Probing 1 173

NO.OF. HOURS

TEXT BOOK (PAGE.NO)

B - Tree

UNIT-4 GRAPHS

19 Definition,Topological Sort 1 299, 302

20 Breadth - First Traversal, Shortest Path Algorithm 2 306

21 Minimum Spanning Tree(Prim's, Kruskal's algorithms) 3 329

22 Depth-First Traversal,Bicnnectivity 2 335, 338

23 Euler Circuits, Applications of Graphs 1 342

UNIT-5 ALGORITHM DESIGN AND ANALYSIS

24 Introduction to Algorithm Design Techniques 1 363

25 Greedy , Divide and Conquer Algorithm 3 363, 381

26 Dynamic Programming, backtracking 2 396, 417

27 Branch and bound, Randomized Algorithms 1 408

28 Introduction to Algorithms(Asymptotic notations,Recurrences) 1 R4

29 Introduction to NP-Complete Problems 1 348

Total

TEXT BOOK :

1. M.A.Weiss,"Data Structures And Algorithm Analysis in C",Second Edtion,Pearson Education,Asia,2002

2. ISRD Group,"Data Structures Using C",Tata McGraw-Hill Publishing Company LTD.,2006.

REFERENCES :

1. A. V. Aho, J. E. Hopcroft,and J. D. Ullman," Data Structures and Algorithms", Pearson Education,1983.

3. Sara Baase and A. Van Geider,"Computer Algorithms", Third Edition, Pearson Education,2000

HOD PRINCIPAL

45 Hrs

2. R. F. Gillberg, B.A. Forouzan," Data Structures: A Pseudocode approach with C", Second Edition, Thomson India Edition,2005.

4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to algorithms", Second Edition,Prentice Hall of India Ltd, 2001

TEXT BOOK :

KATHIR COLLEGE OF ENGINEERING, NEELAMBUR Department of Computer Science and Engineering

LESSON PLAN

SUB CODE : CS 2201 CLASS : II CSESUBJECT : Data Structures SEM : III

S.NO TITLE

UNIT-1 LINEAR STRUCTURES

1 Abstract Data Types(ADT) 1 57

2 List ADT(Array,Linked List) 2 58

3 Cursor based linked List 1 73

4 Doubly Linked List 1 67

5 Stack ADT & Queue ADT 2 78, 95

6 Circular Queue Implementation 1 70(R1)

7 Applications of List , Stack, Queue 1 87, 100

UNIT-2 TREE STRUCTURES

8 Tree ADT,Tree Traversals 1 106

9 Left child right sibiling data structures for general trees 1 107

10 Binary Tree ADT 2 111

11 Expression Trees, Applications of Trees 1 113

12 Binary Search Tree ADT 1 116

13 Threaded Binary Trees 2

UNIT-3 BALANCED TREES

14 AVL Trees 2 126

15 Splay Trees 2 139

16 B-Tree 1 149

17 Heaps 2 193

18 Binary Heaps and Applications 2 195

NO.OF.

HOURS

TEXT BOOK

(PAGE.NO)

UNIT-4 HASHING AND SET

19 Hashing 1 165

20 Separate chaining, Open addressing 1 168, 173

21 Rehashing 1 181

22 Extendible Hashing 1 184

23 Disjoint set ADT, Dynamic equivalence Problem 1 279, 280

24 Smart Union Algorithm 2 285

25 Path Compression 1 287

26 Applications of set 1 295

UNIT-5 GRAPHS

23 Definition, Topological Sort 1 299, 302

24 Breadth - First Traversal, Shortest Path Algorithm 2 306

25 Minimum Spanning Tree(Prim's, Kruskal's algorithms) 3 329

26 Depth-First Traversal, Bicnnectivity 2 335, 338

27 Euler Circuits, Applications of Graphs 1 342

Total 45 Hrs

TEXT BOOK :

1. M. A.Weiss,"Data Structures And Algorithm Analysis in C",Second Edtion,Pearson Education, 2005.

REFERENCES:

1. A. V. Aho, J. E. Hopcroft,and J. D. Ullman," Data Structures and Algorithms", Pearson Education, 2003.

HOD PRINCIPAL

2. R. F. Gillberg, B.A. Forouzan," Data Structures: A Pseudocode approach with C", Second Edition,

Thomson India Edition,2005.