Вы находитесь на странице: 1из 6

DOC/LP/01/28.02.

02
LP – EC2202
LESSON PLAN
LP Rev. No: 00
Sub Code & Name: EC2202 DATA STRUCTURES AND
OBJECT ORIENTED PROGRAMMING IN C++ Date: 30/06/09

Page 01 of 06
Unit : I Branch : EC Semester:III

UNIT – I PRINCIPLES OF OBJECT ORIENTED PROGRAMMING 9

SYLLABUS:

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

SYLLABUS:

Algorithm, Analysis, Lists, Stacks and queues, Priority queues-Binary


Heap-Application, 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.

Session Topics to be covered Time Ref Teaching


No. Method
11. Framing algorithms, Asymptotic 50m 1,3,4 BB
notations, Analysis of algorithms-run ,6,7
time efficiency
12. List ,linked list 50m 1,3,4 BB
,6,7
13. Linked list – DLL ,CLL 50m 1,3,4 BB
,6,7
14. Stacks – array and pointer 50m 1,3,4 BB
implementation ,6,7
15. Queues – array and pointer 50m 1,3,4 BB
implementation ,6,7
16. Priority Queues- operations 50m 1,3,4 BB
,6,7
17. Heaps- operations 50m 1,3,4 BB
,6,7
18. Hashing ,types of hashing 50m 1,3,4 BB
,6,7
19. Types of hashing, hash table without 50m 1,3,4 BB
linked list ,6,7

LP – EC2202
LESSON PLAN
LP Rev. No: 00
Sub Code & Name: EC2202 DATA STRUCTURES AND
OBJECT ORIENTED PROGRAMMING IN C++ Date: 30/06/09

Page 03 of 06
Unit : III Branch : EC Semester: III
DOC/LP/01/28.02.02

UNIT – IV NONLINEAR DATA STRUCTURES 9

SYLLABUS:

Trees-Binary trees, search tree ADT, AVL trees, Graph Algorithms-


Topological sort, shortest path algorithm network flow problems-minimum
spanning tree - Introduction to NP - completeness.

Objective: To implement various types of trees and also to learn about


graphs and their applications.

Session Topics to be covered Time Ref LPTeaching


– EC2202
No. LESSON PLAN Method
20. Trees – array and pointer 50m 1,3,4LP Rev.
BB No: 00
Sub Code & Name:
representation, EC2202
binary DATA
trees, typesSTRUCTURES
of AND
,6,7
traversals
OBJECT ORIENTED PROGRAMMING IN C++ Date: 30/06/09
21. BST-operations. 50m 1,3,4 BB
,6,7 Page 04 of 06
22. Unit
AVL: trees-types
IV Branch : EC
of rotations Semester:
50m III1,3,4 BB
,6,7
23. Graphs –terminologies and 50m 1,3,4 BB
representations ,6,7
24. Topological sort 50m 1,3,4 BB
,6,7
25. DFS,BFS 50m 1,3,4 BB
,6,7
26. Shortest path algorithm-dijkstra’s 50m 1,3,4 BB
algorithm, ,6,7
27. Minimum spanning tree – prim’s 50m 1,3,4 BB
algorithm and kruskal’s algorithm ,6,7
28. Network flow problems, NP complete 50m 1,3,4 BB
problems ,6,7
29. CAT II 60m - -

UNIT – V SORTING AND SEARCHING 9

SYLLABUS:
DOC/LP/01/28.02.02
Sorting – Insertion sort, Shell sort, Heap sort, Merge sort, Quick sort,
Indirect sorting, Bucket sort, Introduction to Algorithm Design
Techniques –Greedy algorithm (Minimum Spanning Tree),
Divide and Conquer (Merge Sort), Dynamic Programming (All
pairs Shortest Path Problem).

Objective: To implement various types of sorting algorithms and to


learn about techniques to design various algorithms

Session Topics to be covered Time Ref Teaching


No. Method
30. Sorting methods – insertion sort , shell 50m 1,3,4 BB
sort ,6,7
31. Heap sort - problems 50m 1,3,4 BB
,6,7
32. Merge sort - problems 50m 1,3,4 BB
,6,7
33. Quick sort - problems 50m 1,3,4 BB
,6,7
34. Indirect sort, bucket sort 50m 1,3,4 BB
,6,7
35. Bucket sort- problems, 50m 1,3,4 BB
external sorting methods ,6,7
36. Greedy algorithm -examples 50m 3,6,7 BB

37. Divide and Conquer -examples 50m 3,6,7 BB

38. Dynamic Programming -examples 50m 3,6,7 BB


DOC/LP/01/28.02.02

LP – EC2202
LESSON PLAN
LP Rev. No: 00
Sub Code & Name: EC2202 DATA STRUCTURES AND
OBJECT ORIENTED PROGRAMMING IN C++ Date: 30/06/09

Page 05 of 06
Unit : V Branch : EC Semester: III

UNIT – II ADVANCED OBJECT ORIENTED PROGRAMMING 9

SYLLABUS:

Inheritance, Extending classes, Pointers, Virtual functions and


polymorphism, File Handling Templates ,Exception handling, Manipulating
strings.

Objective: To learn advanced features of OOPS.

Session Topics to be covered Time Ref Teaching


No. Method
39. Inheritance – types 50m 2,8,9 BB

40. Nested classes 50m 2,8,9 BB


41. pointers 50m 2,8,9 BB

42. Friend functions, Abstract classes 50m 2,8,9 BB

43. Virtual functions, virtual base class, 50m 2,8,9 BB


pointer to objects
44. Polymorphism – function overloading 50m 2,8,9 BB

45. File Handling , templates 50m 2,8,9 BB

46. Exceptions, unspecified exceptions, 50m 2,8,9 BB


rethrowing exceptions
47. String manipulations 50m 2,8,9 BB

48. CAT III 60m - -


DOC/LP/01/28.02.02
LP – EC2202
LESSON PLAN
LP Rev. No: 00
Sub Code & Name: EC2202 DATA STRUCTURES AND
OBJECT ORIENTED PROGRAMMING IN C++ Date: 30/06/09

Page 06 of 06
Branch : EC Semester: III

Course Delivery Plan:


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. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 3rd
ed, Pearson Education Asia, 2007.
2. E. Balagurusamy, “ Object Oriented Programming with C++”, McGraw
Hill Company Ltd., 2007.

REFERENCES
3. Michael T. Goodrich, “Data Structures and Algorithm Analysis in C++”,
Wiley student edition, 2007.
4. Sahni, “Data Structures Using C++”, The McGraw-Hill, 2006.
5. Seymour, “Data Structures”, The McGraw-Hill, 2007.
6. Jean – Paul Tremblay & Paul G.Sorenson, An Introduction to data
structures with applications, Tata McGraw Hill edition, II Edition, 2002.
7. John R.Hubbard, Schaum’s outline of theory and problem of data
structure with C++, McGraw-Hill, New Delhi, 2000.
8. Bjarne Stroustrup, The C++ Programming Language, Addison Wesley,
2000
9. Robert Lafore, Object oriented programming in C++, Galgotia
Publication

Prepared by Approved by
Name Ms.P.Sasikala Dr.R.Amutha
Designation Lecturer / EC HOD, Department of ECE
Date 30.06.2009 30.06.2009