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/10

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

UNIT – I PRINCIPLES OF OBJECT ORIENTED PROGRAMMING

SYLLABUS:
Introduction- Tokens-Expressions-control 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.
Session Topics to be covered Time Ref Teaching
No. Method
1. Procedure-Oriented programming, Object- 50m 2(4-13) BB
oriented programming, Benefits and
Application of OOP
2. Simple C++ program, Tokens, Keywords, 50m 2(19-42) BB
constants, Basic data types, User defined
data types and Derived data types
3. Scope resolution operators, expression 50m 2(45-58) BB
and their types
4. Function prototyping, Call by reference 50m 2(78-81) BB
5. Inline functions, Default arguments, 50m 2(82-87) BB
Constant arguments
6. Class, Member functions, Nesting of 50m 2(96- BB
member functions 107)
7. Array of objects, Constant member 50m 2(115- BB
functions, Pointers to members 132)
8. Constructors, Copy Constructors, 50m 2(144- BB
Destructors 162)
9. Function overloading, Overloading unary 50m 2(172- BB
operators 176)
10. Overloading Binary operators, Type 50m 2(176- BB
conversion 187)
11. Programs using pointers, class 50m 2 BB

12. Friend and virtual functions, Math library 50m 2(85-89) BB

functions
13. CAT- I 75 m - -
 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/10

Page 02 of 06
Unit : II Branch : EC Semester: III

UNIT – III DATA STRUCTURES & ALGORITHMS

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
14. Framing algorithms, Asymptotic notations, 50m 1(44-47) BB
Analysis of algorithms-run time efficiency
15. Running Time calculations- Analysis 50m 1(47-59) BB
16. Arrray implementation of List 50m 1(70-71) BB
17. Pointer implementation of List 50m 1(71-73) BB
18. Linked list – Double Linked List ,Circular 50m 1(78-80) BB
Linked List
19. Application – cursor implementation of List 50m 1(80-86) BB
20. Stacks – array and pointer implementation 50m 1(93-99) BB
21. Stacks – Applications 50m 1(100- BB
119)
22. Queues – array and pointer 50m 1(110- BB
implementation 114)
23. Application of Queue 50m 1(114- BB
120)
24. Priority Queues- operations 50m 1(211- BB
215)
25. Hashing , Hash function, Separate 50m 1(181- BB
chaining 184)
26. Types of hashing, hash table without 50m 1(184- BB
linked list 200)
 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/10

Page 03 of 06
Unit : III Branch : EC Semester: III

UNIT – IV NONLINEAR DATA STRUCTURES

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 Teaching
No. Method
27. Trees – array and pointer representation, 50m 1(121- BB
binary trees, types of traversals 123)
28. BST-operations. 50m 1(127- BB
130)
29. AVL trees-types of rotations- Single rotation 50m 1(143- BB
145)
30 AVL trees – double rotation 50m 1(145- BB
148)
31. Graphs –terminologies and representations 50m 1(327- BB
330)
32. Topological sort 50m 1(330- BB
333)
33. Depth first search 50m 1(362- BB
374)
34 Breadth first search 50m 1(335- BB
339)
35. Shortest path algorithm-dijkstra’s algorithm, 50m 1(330- BB
348)
36. Minimum spanning tree – prim’s algorithm 50m 1(356- BB
and kruskal’s algorithm 360)
37. Network flow problems, NP complete 50m 1(374- BB
problems 377)
38. CAT II 75m - -
 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/10

Page 04 of 06
Unit : IV Branch : EC Semester: III

UNIT – V SORTING AND SEARCHING

SYLLABUS:

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
39. Sorting methods – insertion sort , shell 50m 1(253- BB
sort 257)
40. Heap sort - problems 50m 1(260- BB
264)
41. Merge sort - problems 50m 1(264- BB
269)
42. Quick sort - problems 50m 1(269- BB
275)
43. Indirect sort, bucket sort 50m 1(281- BB
284)
44. Bucket sort- problems, 50m 1(288- BB
external sorting methods 290)
45. Greedy algorithm -examples 50m 1(390- BB
400)
46. Divide and Conquer -examples 50m 1(408- BB
418)
47. Dynamic Programming -examples 50m 1(423- BB
430)
 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/10

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
48. Inheritance – types 50m 2(200- BB
232)
49. Nested classes,Pointers 50m 2(250- BB
270)
50. Friend functions, Abstract classes 50m 2(230- BB
280)
51. Virtual functions, virtual base class, 50m 2(275- BB
pointer to objects 280)
52. Polymorphism – function overloading 50m 2(87- BB
90)
53. File Handling , templates 50m 2(325- BB
360)
54. Exceptions, unspecified exceptions, 50m 2(380- BB
rethrowing exceptions 390)
55. String manipulations 50m 2(430- BB
440)
56. 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/10

Page 06 of 06
Branch : EC 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
Course Delivery Plan:

TEXT BOOK
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 3 rd
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.L.Vanitha Prof. E.G.Govindan
Designation SeniorLecturer / EC HOD, Department of ECE
Date 30.06.2010 30.06.2010