P. 1
Lesson Plan

Lesson Plan

|Views: 115|Likes:

More info:

Published by: Santhosh Kumar Ramasamy on Jul 04, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less

07/04/2011

pdf

text

original

DOC/LP/01/28.02.

02 LP – EC2202 LESSON PLAN
Sub Code & Name: EC2202 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++

LP Rev. No: 00 Date: 30/06/09 Page 01 of 06

Unit : I
UNIT – I SYLLABUS:

Branch : EC

Semester:III

PRINCIPLES OF OBJECT ORIENTED PROGRAMMING

9

Introduction- Tokens-Expressions-contour Structures –Functions in C++, classes and objects, constructors and destructors, operator overloading and type conversions.
Objective: To learn to program in C++ and basic OOPS concepts.

LP – EC2202 Session Topics to be covered Time Ref Teaching LESSON PLAN No. Method LP Rev. No: 00 Basic introduction EC2202 DATA files, 50m 2,8,9 BB 1. Sub Code & Name: to c++- header STRUCTURES AND 2. 3. 4. 5. 6. 7. 8. 9. 10.
input, output statements, formatted Date: 30/06/09 OBJECT ORIENTED PROGRAMMING IN C++ output Tokens, native data types and derived 50m 2,8,9 BB Page 02 of 06 types Unit : II Branch : EC Semester: III Types of expressions and operators 50m 2,8,9 involved, types of statements BB Functions- inbuilt and user defined, oops 50m 2,8,9 –basics, difference in POP and OOPS BB Class and objects-simple examples, 50m 2,8,9 inline functions BB Constructors, types -default, 50m 2,8,9 BB parameterized, copy constructors, destructors Operator overloading-overloading of 50m 2,8,9 arithmetic operators, comparison BB operators Operator overloading-overloading of 50m 2,8,9 equality operators, assignment BB operators Overloading of shift operators, type 50m 2,8,9 BB conversions-automatic, explicit,templates-basics CAT- I 60 m -

7 1.3.02.4 . Linked list – DLL . DATA STRUCTURES & ALGORITHMS 9 Session Topics to be covered No.6.7 1.CLL 14.3.6.4 .7 1. Heaps–hashing-hash tables without linked lists Objective: To learn how various data structures can be implemented and also to analyze the efficiency of algorithms.4 . 11.4 .types of hashing 19.7 1. Priority queues-Binary Heap-Application.02 UNIT – III SYLLABUS: Algorithm. Priority Queues.7 1.6.3. Stacks and queues.3.6.6.7 1. hash table without linked list LP – EC2202 LESSON PLAN Sub Code & Name: EC2202 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ LP Rev. Stacks – array and pointer implementation 15. Queues – array and pointer implementation 16.3.operations 17.7 1.7 1.3. Heaps.4 . Types of hashing.6.3.3. Asymptotic Time 50m 50m 50m 50m 50m 50m 50m 50m 50m Ref 1. Lists.DOC/LP/01/28.4 . Analysis.6.6. Analysis of algorithms-run time efficiency 12. Hashing .7 Teaching Method BB BB BB BB BB BB BB BB BB notations.4 . List .operations 18. Framing algorithms.linked list 13.6. No: 00 Date: 30/06/09 Page 03 of 06 Unit : III Branch : EC Semester: III .3.4 .4 .

3. No: 00 1. 20. .02 UNIT – IV SYLLABUS: Trees-Binary trees. Topics to be covered LESSON PLAN Time Trees – array and pointer 50m Sub Code & Name: EC2202 DATA STRUCTURES AND representation. NONLINEAR DATA STRUCTURES 9 Session No. 26. binary trees.3. Objective: To implement various types of trees and also to learn about graphs and their applications. Graph AlgorithmsTopological sort. 24. 22.4 . NP complete problems CAT II 50m 50m 60m 1. 50m 1.7 traversals ORIENTED PROGRAMMING IN C++ Date: 30/06/09 OBJECT BST-operations.4 BB algorithm.4 BB .Introduction to NP .7 Topological sort 50m 1. AVL trees.3.4 BB .3.7 BB BB - – EC2202 Ref LPTeaching Method LP Rev. 23.3. 28.3.3.6.6. 21. 29.7 Shortest path algorithm-dijkstra’s 50m 1.6.3.7 DFS.completeness.7 Page 04 of 06 Unit : trees-typesBranch : EC Semester: III AVL IV of rotations 50m 1. shortest path algorithm network flow problems-minimum spanning tree . types of . search tree ADT.7 1.6.BFS 50m 1.DOC/LP/01/28.7 Minimum spanning tree – prim’s algorithm and kruskal’s algorithm Network flow problems.4 BB .4 BB .6.6.6.3.7 Graphs –terminologies and 50m 1.02.6.6. 27. 25.4 BB representations .4 .4 BB UNIT – V SYLLABUS: SORTING AND SEARCHING 9 .

Indirect sorting. 37. Quick sort.3.6.6. Merge sort.7 3. Objective: To implement various types of sorting algorithms and to learn about techniques to design various algorithms Session No.02 Sorting – Insertion sort. bucket sort Bucket sort.3.6.problems.7 1.problems Merge sort . 32.problems Quick sort .4 . Divide and Conquer (Merge Sort).3.7 3. Introduction to Algorithm Design Techniques –Greedy algorithm (Minimum Spanning Tree). Heap sort.02.6.7 1.3. 38.7 1. Shell sort. 33.7 3. Dynamic Programming (All pairs Shortest Path Problem). Bucket sort.3.4 .DOC/LP/01/28. shell sort Heap sort . 36.4 .problems Indirect sort.6. 35. 34.7 Teaching Method BB BB BB BB BB BB BB BB BB .4 .6.6.6.4 .7 1.6. 31.7 1. Topics to be covered Sorting methods – insertion sort . external sorting methods Greedy algorithm -examples Divide and Conquer -examples Dynamic Programming -examples Time 50m 50m 50m 50m 50m 50m 50m 50m 50m Ref 1. 30.3.4 .

Session No.DOC/LP/01/28. Pointers. virtual base class. 48.9 2.Exception handling. 41.9 2.02 LP – EC2202 LESSON PLAN Sub Code & Name: EC2202 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ LP Rev.8.02.8. 46.8. 42.9 2. Virtual functions and polymorphism.9 2. strings.9 2. 39.8.8.8. pointer to objects Polymorphism – function overloading File Handling .9 2. Abstract classes Virtual functions. templates Exceptions. Topics to be covered Inheritance – types Nested classes pointers Friend functions. 40. 44. 47.9 - Teaching Method BB BB BB BB BB BB BB BB BB - . rethrowing exceptions String manipulations CAT III Time 50m 50m 50m 50m 50m 50m 50m 50m 50m 60m Ref 2.8. unspecified exceptions. 45. Branch : EC Semester: III ADVANCED OBJECT ORIENTED PROGRAMMING Extending classes.9 2. File Handling Templates .9 2. No: 00 Date: 30/06/09 Page 05 of 06 9 Unit : V UNIT – II SYLLABUS: Inheritance. Manipulating Objective: To learn advanced features of OOPS. 43.8.8.

Balagurusamy.06. Goodrich. 4. John R. 2006. Bjarne Stroustrup. Seymour. Addison Wesley. Schaum’s outline of theory and problem of data structure with C++.Hubbard.Sorenson. McGraw-Hill. Tata McGraw Hill edition. Galgotia Publication Name Designation Date Prepared by Ms. Jean – Paul Tremblay & Paul G. Michael T. McGraw Hill Company Ltd. Wiley student edition. Object oriented programming in C++.Sasikala Lecturer / EC 30. The McGraw-Hill. “ Object Oriented Programming with C++”. “Data Structures and Algorithm Analysis in C”. E.DOC/LP/01/28. No: 00 Date: 30/06/09 Page 06 of 06 Branch : EC Course Delivery Plan: Semester: III 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Week 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 Units TEXT BOOK 1. An Introduction to data structures with applications. “Data Structures Using C++”. 2007. 7.06. II Edition.02 LP – EC2202 LESSON PLAN Sub Code & Name: EC2202 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ LP Rev. New Delhi. Robert Lafore. 2000. 6. 2007. The C++ Programming Language. Pearson Education Asia. “Data Structures and Algorithm Analysis in C++”.02. The McGraw-Hill. Department of ECE 30. 3rd ed.Amutha HOD. 2007. 2007.R.2009 . 8. 5. 2000 9. REFERENCES 3.. Mark Allen Weiss.P. 2002. 2. “Data Structures”. Sahni.2009 Approved by Dr.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->