Download The List ADT

DOC/LP/01/28.02.02
LESSON PLAN
LP-
IT2201
LP Rev. No: 01
Sub Code & Name : IT2201 Data
Unit: I
Branch: IT
Structures and Algorithms
Semester: III
Date: 23-06-10
Page 01 of 06
Unit syllabus:
Abstract Data Types (ADT) – List ADT – array-based implementation – linked list implementation –
cursor-based linked lists – doubly-linked lists – applications of lists – Stack ADT – Queue ADT –
circular queue implementation – Applications of stacks and queues
Objective:
This Unit emphasizes on various implementations of Abstract Data Type (ADT)
Session
No
Topics to be covered
Time
Ref / Pg.No
Teaching
Method
1
Introduction to Data Structures and Abstract Data
Types
The List ADT
Array based implementation
50m
1 (57-59)
4(187-194)
BB
2
The List ADT
Linked list based implementation
50m
1(59)
4(170-185)
BB
3
The List ADT
Cursor based implementation
50m
1(73-78)
BB
4
Doubly Linked list
Circular Linked list
50m
1(67-68)
4(213-228)
BB
50m
1(68-73)
3(110-113)
BB
50m
1(78-87)
4(65-81)
BB
50m
1(87-95)
4(83-97)
BB
50m
1(95-100)
3(252-260)
BB
50m
1(100)
3(230-238)
BB
5
6
7
8
9
Application of list
Polynomial ADT
Multi List
The Stack ADT
Linked List Implementation Of Stacks
Applications of Stack
Balancing symbols
Infix to postfix conversion
The Queue ADT
Queue Model
Array Implementation Of Queues
The Queue ADT
Circular Queues
Applications Of Queues
DOC/LP/01/28.02.02
LESSON PLAN
LP- IT2201
LP Rev. No: 01
Sub Code & Name IT2201 Data Structures and Algorithms
Unit: II
Branch: IT
Semester: III
Date: 23-06-10
Page 02 of 06
Unit syllabus:
Tree ADT – tree traversals – left child right sibling data structures for general trees – Binary Tree ADT
– expression trees – applications of trees – binary search tree ADT – AVL trees – binary heaps
Objective:
This unit provides knowledge to students about tree algorithms.
Session
No
10
11
12
13
14
15
16
17
18
Topics to be covered
Tree ADT
Tree Traversals
Application of trees – directory structure
Tree ADT
Implementation of trees
Left child Right sibling data structures for general trees
Binary Tree ADT
Implementation of binary tree
Binary Tree ADT
Expression trees
Binary Search Tree ADT
Implementation
AVL Trees
Single Rotation
Double Rotation
AVL Trees
Implementation
Binary Heaps
Structure property
Heap order property
Operations
Binary Heaps
Operations
CAT I
Teaching
Method
Time
Ref / Pg.No
50m
1(105-107)
3(273-278)
BB
50m
2(84-93)
BB
50m
50m
50m
1(111-113)
3(272-273)
1(113-116)
3(280-282)
1(116-126)
3(309-323)
BB
BB
BB
50m
1(126-139)
BB
50m
1(126-139)
BB
50m
1(195-205)
BB
50m
1(195-205)
BB
DOC/LP/01/28.02.02
LESSON PLAN
LP-
IT2201
LP Rev. No: 01
Sub Code & Name :
Unit: III
IT2201 Data Structures and Algorithms
Branch: IT
Semester: III
Date: 23-06-10
Page 03 of 06
Unit syllabus:
Hashing – Separate chaining – open addressing – rehashing – extendible hashing – Disjoint Set ADT
– dynamic equivalence problem – smart union algorithms – path compression – applications of Sets
Objective:
To impart knowledge to students on Hashing and Disjoint Set ADT
Session
No
19
20
21
22
23
24
25
26
27
Topics to be covered
Hashing
Introduction,
Hash function
Hashing
Separate chaining
Open Addressing
Linear Probing
Quadratic Probing
Double Hashing
Re-Hashing
Double Hashing
Extendible Hashing
The Disjoint Set ADT
Equivalence Relations
Dynamic Equivalence Problem
The Disjoint Set ADT
Basic Data Structure
Smart union algorithms
The Disjoint Set ADT
Path compression
The Disjoint Set ADT
Applications
Time
Ref / Pg.No
Teaching
Method
50m
1(165-168)
BB
50m
1(168-173)
BB
50m
1(173-181)
BB
50m
1(181-188)
BB
50m
1(181-188)
BB
50m
1(279-281)
BB
50m
1(285-287)
BB
50m
1(287-295)
BB
50m
1(287-295)
BB
DOC/LP/01/28.02.02
LESSON PLAN
LP-
IT2201
LP Rev. No: 01
Sub Code & Name :
Unit: IV
IT2201 Data Structures And Algorithms
Branch: IT
Semester: III
Date: 23-06-10
Page 04 of 06
Unit syllabus:
Definitions – Topological sort – breadth-first traversal - shortest-path algorithms – minimum spanning
tree – Prim's and Kruskal's algorithms – Depth-first traversal – biconnectivity – Euler circuits –
applications of graphs
Objective:
This unit provides an explanation to students about graphs and graph traversals.
Session
No
28
29
30
31
32
33
34
35
36
37
Topics to be covered
Introduction to Graph
Definitions
Representations Of Graphs
Applications of Graph
Topological Sort
Implementation
Breadth – first Traversal
Implementation
Shortest-Path Algorithms
Unweighted Shortest Paths
Shortest-Path Algorithms
Dijkstra’s Algorithm
Minimum Spanning Tree
Prim’s Algorithm
Minimum Spanning Tree
Kruskal’s Algorithm
Depth-First Traversal
Implementation
Applications of Depth-First Traversal
Undirected Graphs
Biconnectivity
Applications of Depth-First Search
Euler Circuits
Directed graphs
Finding Strong Components
CAT II
Teachin
g
Method
Time
Ref / Pg.No
50m
1(299-302)
2(198-199)
BB
50m
1(302-306)
BB/OHP
50m
2(215-219)
3(487-488)
1(306-324)
4(514-516)
50m
50m
50m
50m
50m
1(295-303)
3(518-522)
1(329-332)
2(233-239)
1(332-335)
2(233-239)
1(335-338)
3(485-487)
BB
BB/OHP
BB/OHP
BB/OHP
BB
BB/OHP
50m
1(338-342)
4(556-558)
BB/OHP
50m
1(342-345)
4(559-561)
BB/OHP
DOC/LP/01/28.02.02
LESSON PLAN
LP-
IT2201
LP Rev. No: 01
Sub Code & Name : IT2201 Data
Unit: V
Branch: IT
Structures And Algorithms
Semester: III
Date: 23-06-10
Page 05 of 06
Unit syllabus:
Introduction to algorithm design techniques: Greedy algorithms, Divide and conquer, Dynamic
programming, backtracking, branch and bound, Randomized algorithms – Introduction to algorithm
analysis: asymptotic notations, recurrences – Introduction to NP-complete problems
Objective:
This unit provides knowledge to students about various algorithm design techniques
Session
No
38
39
40
41
Topics to be covered
Introduction to Algorithm Analysis
Asymptotic notations
Time complexity
Recurrences
Greedy Algorithm
Simple Scheduling Problem
Bin Packing
Divide and Conquer
Closest –Points Problem
Integer Multiplication
Dynamic Programming
Fibonacci series
All pairs shortest paths
Teaching
Method
Time
Ref /
Pg.No.
50m
2(17-27)
2(293-298)
BB
50m
1(347-364)
2(321-323)
BB
50m
1(365-374)
2(306-310)
BB
50m
1(380-391)
2(311-320)
BB
42
Randomized Algorithms
Random Number Generators
50m
43
BackTracking Algorithms
Games – Tic Tac Toe , 8 Queens Problem
50m
1(401-412)
2(324-335)
BB
50m
4(548-570)
BB
44
45
Intoduction to Branch and Bound
Introduction to NP completeness
CAT III
50m
1(399-400)
1(348-353)
BB
BB
DOC/LP/01/28.02.02
LESSON PLAN
LP-
IT2201
LP Rev. No: 01
Sub Code & Name :
Branch: IT
IT2201 Data Structures and Algorithms
Semester: III
Date: 23-06-10
Page 06 of 06
Course Delivery Plan:
1
Week
2
3
4
5
6
7
8
9
10
11
12
13
14
15
I II I II I II I II I II I II I II I II I II I II I II I II I II I II I II
1
2
3
4
5
Units
Books Referred:
CAT-I
CAT-II
CAT-III
TEXT BOOK:
1. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition,
Pearson Education, 1997.
REFERENCES:
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”, Pearson Education, 1983.
3. R. F. Gilberg, B. A. Forouzan, “Data Structures”, Second Edition, Thomson India Edition, 2005.
4. Sara Baase and A. Van Gelder, “Computer Algorithms”, Third Edition, Pearson Education, 2000.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to algorithms", Second Edition,
Prentice Hall of India Ltd, 2001.
Prepared by
Approved by
Signature
Name
Date
M.Jayasudha L/IT
U.Pooranima L/IT
23/06/10
Prof. G.Sumathi
HOD / IT
23/06/10