Department of Information Technology

Size: px

Start display at page:

Download "Department of Information Technology"

Lesley Skinner
5 years ago
Views:

1 COURSE DELIVERY PLAN - THEORY Page 1 of 6 Department of Information Technology B.Tech : Information Technology Regulation : 2013 Sub. Code / Sub. Name : CS6301 / Programming and Data Structures II Unit : I LP: CS6301 Rev. No: 00 Date: Object Oriented Programming Fundamentals C++ Programming features - Data Abstraction - Encapsulation - class - object - constructors - static members constant members member functions pointers references - Role of this pointer Storage classes function as arguments This Unit emphasizes on the C++ concepts of abstraction, encapsulation, constructor, polymorphism, overloading and Inheritance. Topics to be covered Ref Teaching 1 C++ Programming features - Data Abstraction - Encapsulation 1 Ch.2; Pg Class - object 1-Ch.10; Pg Constructors 1-Ch.10; Pg Static members constant members 1-Ch.10; Pg Member functions 1-Ch.10;Pg , Pointers 1-Ch.5; Pg References- Role of this pointer 1-Ch.5; Pg Storage classes Internet 9 Function as arguments, Objects as functions argument. Objects as functions argument. 1-Ch.7; Pg Course Outcome 1: The C++ concepts of abstraction, encapsulation, constructor, polymorphism, overloading and Inheritance will be known. * duration: 50 minutes

2 COURSE DELIVERY PLAN - THEORY Page 2 of 6 Unit : II Object Oriented Programming Concepts String Handling Copy Constructor - Polymorphism compile time and run time polymorphisms function overloading operators overloading dynamic memory allocation - Nested classes - Inheritance virtual functions. This Unit emphasizes on the C++ concepts of polymorphism, overloading and Inheritance String Handling Copy Constructor Topics to be covered Polymorphism compile time and run time polymorphisms Function overloading Operators overloading Dynamic memory allocation Nested classes Inheritance Virtual functions 18 Friend function Friend Function Ref 1-Ch.3; Pg.48-49, Ch.3; Pg Ch.12;Pg. 312, 1-Ch.13;Pg Ch.7; Pg Ch.11; Pg Ch.6; Pg Ch.11; Pg Ch.2;Pg.38-40, 1-Ch.15;Pg Ch.2; Pg Teaching Course Outcome 2: Students will design solution using Object Oriented Techniques * duration: 50 mins

3 COURSE DELIVERY PLAN - THEORY Page 3 of 6 Unit : III C++ Programming Advanced Features Abstract class Exception handling - Standard libraries - Generic Programming - templates class template - function template STL containers iterators function adaptors allocators - Parameterizing the class - File handling concepts. This Unit enables the students to gain knowledge about the advanced features of C Abstract class Exception handling Standard libraries Generic Programming Topics to be covered templates class template - function template STL containers iterators function adaptors Allocators- Parameterizing the class File handling concepts. Ref 1-Ch.12; Pg Ch.14; Pg Ch.3; Pg Ch.2; Pg Ch.13; Pg Ch.16;Pg , 1-Ch.19;Pg Ch.18; Pg Ch.19; Pg Ch.21; Pg Teaching Course Outcome 3: Students will be able to use the control structures of C++ appropriately. * duration: 50 minutes

4 COURSE DELIVERY PLAN - THEORY Page 4 of 6 Unit : IV Advanced non-linear Data Structures AVL trees B-Trees Red-Black trees Splay trees - Binomial Heaps Fibonacci Heaps Disjoint Sets Amortized Analysis accounting method potential method aggregate analysis. This unit enables students to Learn advanced nonlinear data structures Topics to be covered AVL trees- Single Rotation, Double Rotation B-Trees Definition, Basic operations Red-Black trees -Properties, Rotations, Insertion, Deletion Splay trees - operation Binomial Heaps - Operations Fibonacci Heaps -Structure- Mergeable heap operations- Deleting a node- Bounding the maximum edge Disjoint Sets- dynmaic equivalence problembasic data stucture smart union algorithms Amortized Analysis -Aggregate analysis Accounting method - Potential method Ref 2-Ch.4; Pg Ch.4; Pg Ch.12; Pg Ch.4; Pg Ch.6; Pg Ch.11; Pg Ch.8; Pg Ch.11; Pg Ch.11; Pg Teaching Course Outcome 4: Students will be known to apply the different data structures to problem solutions. * duration: 50 minutes

5 COURSE DELIVERY PLAN - THEORY Page 5 of 6 Unit : V Graphs Representation of Graphs Breadth-first search Depth-first search Topological sort Minimum Spanning Trees Kruskal and Prim algorithm Shortest path algorithm Dijkstra s algorithm Bellman-Ford algorithm Floyd-Warshall algorithm. This unit provides an explanation to students about graphs, graph traversals and helps them to apply the Graph structures. Topics to be covered Ref Teaching 37 Representation of Graphs 2-Ch.9; Pg Breadth-first search Depth first search 2-Ch.9;Pg ,Internet 39 Topological sort 2-Ch.9; Pg Minimum Spanning Trees - Prims algorithm 2-Ch.9; Pg Kruskal algorithm 2-Ch.9; Pg Shortest path algorithm 2-Ch.9; Pg Dijkstra s algorithm 2-Ch.9; Pg Bellman-Ford algorithm 3-Ch.9; Pg Floyd-Warshall algorithm. 3-Ch.9; Pg Course Outcome 5: Students will be get known to analyze various algorithm by comparing * duration: 50 minutes

6 COURSE DELIVERY PLAN - THEORY Page 6 of 6 Sub Code / Sub Name: CS6301 /Programming and Data Structures II Mapping CO PO: PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 A C A A A A C CO2 A A A B A CO3 A B A B C CO4 A A A B B B B CO5 A A A B C B B B A Excellent ; B Good ; C Average REFERENCES: TEXT BOOKS: 1. Bjarne Stroustrup, The C++ Programming Language, 3rd Edition, Pearson Education, Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, 2nd Edition, Pearson Education, REFERENCES: 3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, "Introduction to Algorithms", Second Edition, Mc Graw Hill, Michael T Goodrich, Roberto Tamassia, David Mount, Data Structures and Algorithms in C++, 7th Edition, Wiley Publishers, Signature Name Prepared by Ms.G.Sangeetha AP/IT Ms.U.Pooranima AP/IT Approved by Dr.D.Balasubramanian Designation Assistant Professor HoD/IT Date Remarks *: Remarks *: * If the same lesson plan is followed in the subsequent semester/year it should be mentioned and signed by the Faculty and the HOD

SRI VENKATESWARA COLLEGE OF ENGINEERING. COURSE DELIVERY PLAN - THEORY Page 1 of 6

SRI VENKATESWARA COLLEGE OF ENGINEERING. COURSE DELIVERY PLAN - THEORY Page 1 of 6 COURSE DELIVERY PLAN - THEORY Page 1 of 6 Department of Computer Science and Engineering B.E/B.Tech/M.E/M.Tech : B.E(CSE) & B.Tech (IT) Regulation:2016 PG Specialisation : -- : I LP: CS16301 Rev. No: 00