Format No. : LP-01 Issue No. : 01 Issue Date : 05.05.

2006

EASWARI ENGINEERING COLLEGE

DEPARTMENT OF INFORMATION TECHNOLOGY

LESSON PLAN Subject code : IT 2201 Degree/Branch:BTech/IT Subject Name: Data structures and Algorithms (IT2201) Faculty : Mrs.R.Radha (AP/IT)

Year/Sem : II / III Lecture :45 Tutorial :0 Practical :0 Total :45 Hours

Aim: To master the design and applications of linear, tree, and graph structures. To understand various algorithm design and analysis techniques. No.of Periods UNIT I Objective: To Understand the need for data structures and to learn about the linear data structures, its types and various ways of implementation and their applications 1 2 3 4 5 6 7 8 9 ADT, List ADT , Array-based implementation Linked list implementation Doubly-linked lists (implementation) & Circular linked list (concept) Cursor-based linked lists (implementaion) Applications of lists -Polynomial ADT(array & LL implementation), Radix sort & Multi-lists Stack ADT -Array & LL implementation of stack Applications of stacks - Balancing parenthesis, function call & infix, postfix and prefix expression Applications of stacks - Infix to postfix conversion Queue ADT, Array based Circular queue implementation, Applications of queues Total UNIT II Objective: To study aboutTree data structures, various operations that can be performed on them and being able to choose appropriate tree structure for various applications. 10 11 12 Tree ADT, tree traversals , Left child right sibling data structures for general trees Binary Tree ADT, Expression trees Applications of trees - tree traversal with an application 1 1 1 T1 T1 T1 105-110 111-113 107-111 1 1 1 1 1 1 1 1 1 9 T1 T1 T1 T1 T1 T1 T1 T1 T1 57-59 59-65 67-68 73-78 68-73 78-86 87-90 90-95 95-100 Refer ence Page No Books

Sl.No

Topic

Sl.No 13 14 15 16 17 18

Topic Binary search tree ADT - Operations on BST :find, findmin, findmax,insert Operation on BST - delete AVL trees -Single rotation AVL trees -Double rotation Binary heaps- Properties of heap Binary heaps-Operations on heap Total UNIT III

No.of Periods 1 1 1 1 1 1 9

Refer ence Page No Books T1 T1 T1 T1 T1 T1 116-120 121 126-130 131-138 193-197 198-204

Objective: To Study about Hashing and Sets and understand their applications. 19 20 21 22 23 24 25 26 27 Hashing Separate chaining Open addressing - Linear probing Quadratic probing Rehashing & Extendible hashing Disjoint Set ADT Dynamic equivalence problem Smart union algorithms Path compression , Applications of Sets Total 1 1 1 1 1 1 1 1 1 9 T1 T1 T1 T1 T1 T1 T1 T1 T1 165-168 168-172 173-175 176-180 181-187 279-280 281-285 285-287 287-289

UNIT IV Objective: To learn about Graph data structures, traversal algorithms and understand their applications to various fields. 28 29 30 31 32 33 34 35 36 Definitions, Topological sort Breadth-first traversal Shortest-path algorithms -unweighted Shortest-path algorithms-weighted (Dijkstra's algorithm) Minimum spanning tree ,Prim's algorithms Minimum spanning tree - Kruskal's algorithms Depth-first traversal biconnectivity Euler circuits, Applications of graphs Total 1 1 1 1 1 1 1 1 1 9 T1 T1 T1 T1 T1 T1 T1 T1 T1 299-306 306-307 307-310 311-320 329-332 332-335 335-338 338-342 342-345

Sl.No

Topic UNIT V

No.of Periods

Refer ence Page No Books

Objective: To learn various techniques of designing Algorithms and analysing them for optimisation Introduction to algorithm design techniques: 37 38 39 40 41 42 Greedy algorithms Divide and conquer Dynamic programming Backtracking Branch and bound Randomized algorithms Introduction to algorithm analysis: 43 44 45 Asymptotic notations Recurrences Introduction to NP-complete problems Total 1 1 1 9 T2 T2 T1 307 310 348-353 1 1 1 1 1 1 T1 T1 T1 T1 T2 T1 363-381 382-395 396-416 417-423 344 408-415

Text books and Reference books M. A. Weiss, Data Structures and Algorithm Analysis in C, Second Edition, Pearson T1 Education, 1997. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms, Pearson Education, 1983.

T2

Prepared By

Approved By

R.Radha

HOD