Scribd
Upload
31 views3 pages

Data Structures and Object Oriented Programming in C++: RMKCET/COM/F-15

Uploaded by

myfriend06

This lesson plan outlines topics for a Data Structures and Object Oriented Programming in C++ course over 5 units and 45 class periods. Unit I introduces principles of object oriented programming including classes, objects, constructors and destructors. Unit II covers advanced OOP concepts like inheritance, polymorphism and file handling. Unit III focuses on data structures like lists, stacks, queues, heaps and hashing. Unit IV presents nonlinear data structures and trees. Unit V covers sorting and searching algorithms as well as algorithm design techniques.

Copyright:

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

Data Structures and Object Oriented Programming in C++: RMKCET/COM/F-15

Uploaded by

myfriend06
31 views3 pages
This lesson plan outlines topics for a Data Structures and Object Oriented Programming in C++ course over 5 units and 45 class periods. Unit I introduces principles of object oriented programming including classes, objects, constructors and destructors. Unit II covers advanced OOP concepts like inheritance, polymorphism and file handling. Unit III focuses on data structures like lists, stacks, queues, heaps and hashing. Unit IV presents nonlinear data structures and trees. Unit V covers sorting and searching algorithms as well as algorithm design techniques.

Original Title

ece oops

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 lesson plan outlines topics for a Data Structures and Object Oriented Programming in C++ course over 5 units and 45 class periods. Unit I introduces principles of object oriented programming including classes, objects, constructors and destructors. Unit II covers advanced OOP concepts like inheritance, polymorphism and file handling. Unit III focuses on data structures like lists, stacks, queues, heaps and hashing. Unit IV presents nonlinear data structures and trees. Unit V covers sorting and searching algorithms as well as algorithm design techniques.

Copyright:

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

Data Structures and Object Oriented Programming in C++: RMKCET/COM/F-15

Uploaded by

myfriend06
This lesson plan outlines topics for a Data Structures and Object Oriented Programming in C++ course over 5 units and 45 class periods. Unit I introduces principles of object oriented programming including classes, objects, constructors and destructors. Unit II covers advanced OOP concepts like inheritance, polymorphism and file handling. Unit III focuses on data structures like lists, stacks, queues, heaps and hashing. Unit IV presents nonlinear data structures and trees. Unit V covers sorting and searching algorithms as well as algorithm design techniques.

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

R.M.K COLLEGE OF ENGINEERING AND TECHNOLOGY R.S.M.

NAGAR, PUDUVOYAL 601 206 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING Subject Name / Code : EC2202-Data structures and object Oriented Programming in C++ Name of the Faculty : R.SARANYA Department Branch LESSON PLAN S. No. Unit Topics to do PRINCIPLES OF OBJECT ORIENTED PROGRAMMING Introduction Tokens-Expressions-contour Structures Functions in C++ Functions in C++ Classes and objects Constructors and destructors Periods Required 9 : CSE

Year / Semester : II / III

: B.E. E.C.E.

I 1 2 3 4 5 6

1 1 1 1 1 2

7 8 II

Operators overloading Type conversions ADVANCED OBJECT ORIENTED PROGRAMMING

1 1 9

RMKCET/COM/F-15

Inheritance

10 11 12 13 14 15 III 16 17 18 19 20

Extending classes, Pointers

1 2 1 1 1 2 9 1 2 2 1 1

Virtual functions and polymorphism File Handling Templates Exception handling Manipulating strings DATA STRUCTURES & ALGORITHMS Algorithm, Analysis

Lists Stacks Queues Priority queues

21 22

Binary Heap-Application, Heaps Hashing-hash tables without linked lists NONLINEAR DATA STRUCTURES IV

1 1 9 1
RMKCET/COM/F-15

23

Trees

24 25 26 27 28 29 V 30 31 32 33 34 35 36 37 38

Binary trees, Search Tree ADT AVL trees Graph Algorithms Topological sort Shortest path algorithm network flow problems Minimum spanning tree. SORTING AND SEARCHING 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

2 2 1 1 1 1 9 1 1 1 1 1 1 1 1 1

Total Hours =45 Periods

Staff Incharge

HOD

RMKCET/COM/F-15

You might also like