Scribd
Upload
43 views2 pages

Srinivasa Institute of Engineering and Technology

Uploaded by

Micheal Vincent

This document contains a lesson plan for a Data Structures and Object Oriented Programming in C++ course. The lesson plan spans 5 units over 45 class periods. Unit I introduces principles of object oriented programming. Unit II covers advanced OOP concepts like inheritance and polymorphism. Unit III focuses on data structures like lists, stacks, queues, trees, and hashing. Unit IV examines nonlinear data structures and tree traversal algorithms. Finally, Unit V reviews sorting and searching algorithms like heap sort, merge sort, and dynamic programming. The faculty member creating the plan is Malarvizhi A.

Copyright:

Attribution Non-Commercial (BY-NC)
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt

Srinivasa Institute of Engineering and Technology

Uploaded by

Micheal Vincent
43 views2 pages
This document contains a lesson plan for a Data Structures and Object Oriented Programming in C++ course. The lesson plan spans 5 units over 45 class periods. Unit I introduces principles of object oriented programming. Unit II covers advanced OOP concepts like inheritance and polymorphism. Unit III focuses on data structures like lists, stacks, queues, trees, and hashing. Unit IV examines nonlinear data structures and tree traversal algorithms. Finally, Unit V reviews sorting and searching algorithms like heap sort, merge sort, and dynamic programming. The faculty member creating the plan is Malarvizhi A.

Original Title

Dss

Copyright

© Attribution Non-Commercial (BY-NC)

Available Formats

DOCX, PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

This document contains a lesson plan for a Data Structures and Object Oriented Programming in C++ course. The lesson plan spans 5 units over 45 class periods. Unit I introduces principles of object oriented programming. Unit II covers advanced OOP concepts like inheritance and polymorphism. Unit III focuses on data structures like lists, stacks, queues, trees, and hashing. Unit IV examines nonlinear data structures and tree traversal algorithms. Finally, Unit V reviews sorting and searching algorithms like heap sort, merge sort, and dynamic programming. The faculty member creating the plan is Malarvizhi A.

Copyright:

Attribution Non-Commercial (BY-NC)
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
43 views2 pages

Srinivasa Institute of Engineering and Technology

Uploaded by

Micheal Vincent
This document contains a lesson plan for a Data Structures and Object Oriented Programming in C++ course. The lesson plan spans 5 units over 45 class periods. Unit I introduces principles of object oriented programming. Unit II covers advanced OOP concepts like inheritance and polymorphism. Unit III focuses on data structures like lists, stacks, queues, trees, and hashing. Unit IV examines nonlinear data structures and tree traversal algorithms. Finally, Unit V reviews sorting and searching algorithms like heap sort, merge sort, and dynamic programming. The faculty member creating the plan is Malarvizhi A.

Copyright:

Attribution Non-Commercial (BY-NC)
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 2

SRINIVASA INSTITUTE OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF COMPUTERSCIENCE AND ENGINEERING

LESSON PLAN
SUB CODE/NAME:ECF2202/DATASTRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ SEM/YEAR/SEC:III/II/B NAME OF THE FACULTY:MALARVIZHI.A

Sl.NO

DATE

TOPIC(S)

No. of Hours

CUM. No. of Hours

Text/ Reference book


T2 T2 T2 T2 T2 T2 T2

1 2 3 4 5 6 7

UNIT I PRINCIPLES OF OBJECT ORIENTED PROGRAMMING Introduction 1 1 Tokens-Expressions 2 3 control Structures 2 5 Functions in C++ 2 7 classes and 1 8 objects constructors and destructors , 1 9 operators overloading type conversions 1 10 Revision UNIT II ADVANCED OBJECT ORIENTED PROGRAMMING Inheritance, Extending classes, 3 13 Pointers, 1 14 Virtual functions ,polymorphism, 2 16 File Handling Templates ,Exception 2 18 handling Manipulating strings, Inheritance, 1 19 Pointers, Extending classes, Revision UNIT III DATA STRUCTURES & ALGORITHMS Algorithm, Analysis, Lists, 2 21 Stacks and queues 3 24 Priority queues 2 26 Binary Heap, Application 1 27 hashing1 28 Revision UNIT IV NONLINEAR DATA STRUCTURES Trees-Binary trees, ADT 2 30 AVL trees and Tree traversal 2 32

8 9 10 11 12

T2 T2 T2 T2 T2

13 14 15 16 17

T1 T1 T1 T1 T1

18 19

T1 T1

20 21

22 23 24 25 26 27 28 29

Graph Algorithms2 Topological sort shortest path algorithm network flow 2 problemsminimum spanning tree 1 Revision UNIT V SORTING AND SEARCHING Sorting ,Insertion ,Bubble 1 Heap sort 1 Merge sort 1 Quick sort 1 Algorithm Design Techniques 1 Greedy algorithm 1 Divide and Conquer 1 Dynamic Programming 1 Revision

34 36 37

T1 T1 T1

38 39 40 41 42 43 44 45

T1 T1 T1 T1 T1 T1 T1 T1

STAFF INCHARGE

HOD

PRINCIPAL

You might also like