Scribd Logo
Upload

Welcome to Scribd!

  • 204 views

    Kathir College of Engineering, Neelambur Lesson Plan

    Uploaded by

    vkthik
    The document contains the lesson plan for the subject "Data Structures and Algorithms" taught to second year Computer Science and Engineering students in Kathir College of Engineering, Neelambur. It outlines the topics to be covered in 5 units over 45 hours across 3 semesters. The units cover linear structures, tree structures, hashing and sets, graphs and algorithm design techniques. It lists the chapter references from the textbooks and references to be used for each topic.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLS, PDF, TXT or read online from Scribd

    Kathir College of Engineering, Neelambur Lesson Plan

    Uploaded by

    vkthik
    204 views15 pages
    The document contains the lesson plan for the subject "Data Structures and Algorithms" taught to second year Computer Science and Engineering students in Kathir College of Engineering, Neelambur. It outlines the topics to be covered in 5 units over 45 hours across 3 semesters. The units cover linear structures, tree structures, hashing and sets, graphs and algorithm design techniques. It lists the chapter references from the textbooks and references to be used for each topic.

    Original Title

    Course EEE

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    XLS, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains the lesson plan for the subject "Data Structures and Algorithms" taught to second year Computer Science and Engineering students in Kathir College of Engineering, Neelambur. It outlines the topics to be covered in 5 units over 45 hours across 3 semesters. The units cover linear structures, tree structures, hashing and sets, graphs and algorithm design techniques. It lists the chapter references from the textbooks and references to be used for each topic.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLS, PDF, TXT or read online from Scribd
    Download as xls, pdf, or txt
    204 views15 pages

    Kathir College of Engineering, Neelambur Lesson Plan

    Uploaded by

    vkthik
    The document contains the lesson plan for the subject "Data Structures and Algorithms" taught to second year Computer Science and Engineering students in Kathir College of Engineering, Neelambur. It outlines the topics to be covered in 5 units over 45 hours across 3 semesters. The units cover linear structures, tree structures, hashing and sets, graphs and algorithm design techniques. It lists the chapter references from the textbooks and references to be used for each topic.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLS, PDF, TXT or read online from Scribd
    Download as xls, pdf, or txt
    You are on page 1of 15

    KATHIR COLLEGE OF ENGINEERING, NEELAMBUR

    Department of Computer Science and Engineering

    LESSON PLAN
    SUB CODE : IT 2201 SUBJECT : Data Structures and Algorithms CLASS : II IT SEM : III

    S.NO

    TITLE UNIT-1 LINEAR STRUCTURES

    NO.OF. HOURS 1 2 1 1 2 1 1 1 1 2 1 1 2 1 1 1 1 1 1 2 1 1

    TEXT BOOK (PAGE.NO) 57 58 73 67 78, 95 70(R1) 87, 100 106 107 111 113 116 126 195 165 168, 173 181 184 279, 280 285 287 295

    1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

    Abstract Data Types(ADT) List ADT(Array,Linked List) Cursor based linked List Doubly Linked List Stack ADT & Queue ADT Circular Queue Implementation Applications of List , Stack, Queue UNIT-2 TREE STRUCTURES Tree ADT,Tree Traversals Left child right sibiling data structures for general trees Binary Tree ADT Expression Trees, Applications of Trees Binary Search Tree ADT AVL Tree Binary Heaps UNIT-3 HASHING AND SETS Hashing Separate chaining, Open addressing Rehashing Extendible Hashing Disjoint set ADT, Dynamic equivalence Problem Smart Union Algorithm Path Compression Applications of sets

    UNIT-4 GRAPHS 23 24 25 26 27 Definition, Topological Sort Breadth - First Traversal, Shortest Path Algorithm Minimum Spanning Tree(Prim's, Kruskal's algorithms) Depth-First Traversal, Bicnnectivity Euler Circuits, Applications of Graphs UNIT-5 ALGORITHM DESIGN AND ANALYSIS 29 30 31 32 33 34 Introduction to Algorithm Design Techniques Greedy , Divide and Conquer Algorithm Dynamic Programming,backtracking Branch and bound, Randomized Algorithms Introduction to Algorithms(Asymptotic notations, Recurrences) Introduction to NP-Complete Problems Total 1 3 2 1 1 1 45 Hrs 363 363, 381 396, 417 408 R4 348 1 2 3 2 1 299, 302 306 329 335, 338 342

    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. 2. R. F. Gillberg, B.A. Forouzan," Data Structures: A Pseudocode approach with C", Second Edition, Thomson India Edition,2005. 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 6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to algorithms", Second Edition,Prentice Hall of India Ltd, 2001

    HOD

    PRINCIPAL

    KATHIR COLLEGE OF ENGINEERING, NEELAMBUR


    Department of Information Technology

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

    S.NO

    TITLE UNIT-1 LINEAR STRUCTURES

    NO.OF. HOURS 1 2 1 1 3 1 1 1 1 2 1 2

    TEXT BOOK (PAGE.NO) 57 58 73 67 78, 95 70(R1) 87, 100

    1 2 3 4 5 6 7 8 9 10 11 12

    Abstract Data Types(ADT) List ADT(Array, Linked List) Cursor based linked List Doubly Linked List Stack ADT & Queue ADT Circular Queue Implementation Applications of List , Stack, Queue UNIT-2 TREE STRUCTURES Need for Non-Linear Structures, Tree ADT, Tree Traversals Left child right sibiling data structures for general trees Binary Tree ADT Expression Trees, Applications of Trees Binary Search Tree ADT UNIT-3 BALANCED SEARCH TREES & INDEXING

    106 107 111 113 116

    13 14 15 16 17 18

    AVL Trees Binary Heaps B - Tree Hashing Separate chaining, Open addressing Linear Probing

    2 2 2 1 1 1

    126 195 149 165 168,173 173

    UNIT-4 GRAPHS 19 20 21 22 23 24 25 26 27 28 29 Definition,Topological Sort Breadth - First Traversal, Shortest Path Algorithm Minimum Spanning Tree(Prim's, Kruskal's algorithms) Depth-First Traversal,Bicnnectivity Euler Circuits, Applications of Graphs UNIT-5 ALGORITHM DESIGN AND ANALYSIS Introduction to Algorithm Design Techniques Greedy , Divide and Conquer Algorithm Dynamic Programming, backtracking Branch and bound, Randomized Algorithms Introduction to Algorithms(Asymptotic notations,Recurrences) Introduction to NP-Complete Problems Total 1 3 2 1 1 1 45 Hrs 363 363, 381 396, 417 408 R4 348 1 2 3 2 1 299, 302 306 329 335, 338 342

    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. 2. R. F. Gillberg, B.A. Forouzan," Data Structures: A Pseudocode approach with C", Second Edition, Thomson India Edition,2005. 3. Sara Baase and A. Van Geider,"Computer Algorithms", Third Edition, Pearson Education,2000 4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to algorithms", Second Edition,Prentice Hall of India Ltd, 2001

    HOD

    PRINCIPAL

    KATHIR COLLEGE OF ENGINEERING, NEELAMBUR


    Department of Computer Science and Engineering

    LESSON PLAN
    SUB CODE : CS 2201 SUBJECT : Data Structures CLASS : II CSE SEM : III

    S.NO

    TITLE UNIT-1 LINEAR STRUCTURES

    NO.OF. HOURS

    TEXT BOOK (PAGE.NO)

    1 2 3 4 5 6 7

    Abstract Data Types(ADT) List ADT(Array,Linked List) Cursor based linked List Doubly Linked List Stack ADT & Queue ADT Circular Queue Implementation Applications of List , Stack, Queue UNIT-2 TREE STRUCTURES

    1 2 1 1 2 1 1

    57 58 73 67 78, 95 70(R1) 87, 100

    8 9 10 11 12 13

    Tree ADT,Tree Traversals Left child right sibiling data structures for general trees Binary Tree ADT Expression Trees, Applications of Trees Binary Search Tree ADT Threaded Binary Trees UNIT-3 BALANCED TREES

    1 1 2 1 1 2

    106 107 111 113 116

    14 15 16 17 18

    AVL Trees Splay Trees B-Tree Heaps Binary Heaps and Applications

    2 2 1 2 2

    126 139 149 193 195

    UNIT-4 HASHING AND SET 19 20 21 22 23 24 25 26 Hashing Separate chaining, Open addressing Rehashing Extendible Hashing Disjoint set ADT, Dynamic equivalence Problem Smart Union Algorithm Path Compression Applications of set UNIT-5 GRAPHS 23 24 25 26 27 Definition, Topological Sort Breadth - First Traversal, Shortest Path Algorithm Minimum Spanning Tree(Prim's, Kruskal's algorithms) Depth-First Traversal, Bicnnectivity Euler Circuits, Applications of Graphs Total 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. 2. R. F. Gillberg, B.A. Forouzan," Data Structures: A Pseudocode approach with C", Second Edition, Thomson India Edition,2005. 1 2 3 2 1 45 Hrs 299, 302 306 329 335, 338 342 1 1 1 1 1 2 1 1 165 168, 173 181 184 279, 280 285 287 295

    HOD

    PRINCIPAL

    You might also like