#1
9th September 2015, 08:09 AM
| |||
| |||
Anna University Chennai OOPs Syllabus
Hello sir I am Atul student of Anna University, Chennai ,can you provide me the syllabus of OOPs as the syllabus which I was carrying is misplace somewhere by me??
|
#2
9th September 2015, 11:37 AM
| |||
| |||
Re: Anna University Chennai OOPs Syllabus
Anna University is a technical university in Tamil Nadu, India. The main university campus in located in Guindy, Chennai. It was named after former C. N. Annadurai, former Chief Minister of Tamil Nadu on 4 September 1978. Here as per your demand I am providing you the syllabus of Object Oriented Programming and Data Structures of this University: UNIT I DATA ABSTRACTION & OVERLOADING Overview of C++ – Structures – Class Scope and Accessing Class Members – Reference Variables – Initialization – Constructors – Destructors – Member Functions and Classes – Friend Function – Dynamic Memory Allocation – Static Class Members – Container Classes and Integrators – Proxy Classes – Overloading: Function overloading and Operator Overloading. UNIT II INHERITANCE & POLYMORPHISM Base Classes and Derived Classes – Protected Members – Casting Class pointers and Member Functions – Overriding – Public, Protected and Private Inheritance – Constructors and Destructors in derived Classes – Implicit Derived – Class Object To Base – Class Object Conversion – Composition Vs. Inheritance – Virtual functions – This Pointer – Abstract Base Classes and Concrete Classes – Virtual Destructors – Dynamic Binding. UNIT III LINEAR DATA STRUCTURES Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation –– singly linked lists –Polynomial Manipulation - Stack ADT – Queue ADT - Evaluating arithmetic expressions UNIT IV NON-LINEAR DATA STRUCTURES Trees – Binary Trees – Binary tree representation and traversals – Application of trees: Set representation and Union-Find operations – Graph and its representations – Graph Traversals – Representation of Graphs – Breadth-first search – Depth-first search - Connected components. UNIT V SORTING and SEARCHING Sorting algorithms: Insertion sort - Quick sort - Merge sort - Searching: Linear search –Binary Search Address: Anna University Guindy Chennai, Tamil Nadu 600025 Telephone: 044 2235 8268 Map: [MAP]Anna University[/MAP] |