Object-oriented programming:
Concept of object oriented programming- Data hiding, Data encapsulation, Class and Object, Abstract class and concrete, Polymorphism (Implementation of polymorphism using Function overloading as an example in C++) ; Inheritance, Advantages of object oriented programming over earlier programming methodologies,Implementaion of object oriented programming concepts in C++
Defination of a class, Members of a class -Data Members and member Functions ( methods), Using private and public visibility modes, default visibility mode (private); Member Function definition : inside class definition and outside class definition using scope resolution operator (::); Declaration of objects as instance of a class ; accessing members from object (s), Objects as function arguments-pass by value and pass by reference;
Pointers :
Introduction to pointers, Declaration and initialisation of pointers ; Dynamic memory allocation/deallocation operators : new, delete; Pointers and Arrays : Array of pointers, Pointer to an array (1 dimensional array), Function returning a pointer, Reference variables and use of alias ; Function call by reference. Pointer to structures : De-reference operator : * , - > ; self referencial structures ;
Constructor and Destructor :
Constructor :- Special characteristics, Declaration and definition of a Constructor, Default Constructor, Overloaded constructor, Copy constructor, Constructor with a default arguments;
Destructor :-Special characteristics, Declaration and definition of destructor ;
Inheritance (extension Classes) :
Concept of inheritance, Base Class, Derived Class, Defining derived classes, Protected visibility mode ; Single level inheritance, Multilevel inheritance and Multiple inheritance, privately derived, publicly derived and Protected derived class, accessibility of members from objects and within derived class(es) ;
Data File Handling :
Need for a data file, Types of data files -- Text file and Binary file;
Text file : Basic file operation on text file : Creating/Writing text into file, Reading and manipulation of text from an already existing text file (accessing sequentially) ;
Binary File : Creation of file, Writing data into file, searching for required data from file, Appending data to a file, Insertion of data in sorted file, Deletion of data from file, modification of data in a file;
Implementation of above mentioned data file handling in C++ ;
Components of C++ to be used with file handling :
Header file : fstream.h ; ifstream, ofstream, fstream classes ;
Opening a text file in in, out, and app modes ;
Using cascading operators ( >><< ) for writing text to the file and reading text from the file ; open ( ), get ( ), read ( ), write ( ), getline ( ) and close ( ) function ; Detecting end-of-file (with or without using eof ( ) function), tellg ( ), tellp ( ), seekg ( ), seekp ( )
Data Structures
Introduction to data structure-arrays, stacks, queues, primitive and non-primitive data structure, linear and non linear structure, static and dynamic data structure.
Arrays :
One and two Dimensional arrays: sequential allocation and address calculation;
One Dimensional array : travesal, Searching (linear, Binary search), Insertion of an element in an array, deletion of an element from an array, Sorting ( insertion, selection, bubble ).
Two-Dimensional arrays : traversal, Finding sum/different of two NxM arrays containing numeric values, Interchanging Row and Column elements in a two dimensional array;
Stack (Array and Linked implementation of stack) :
Introduction to Stack (LIFO- Last in Fast Out Operations) ; Operations on stack (PUSH and POP) and its implementation in C++ Converting expressions from INFIX to POSTFIX notation and evaluation of Postfix expression ;
Queue (Circular Array and Linked implementation) :
Introduction to queue (FIFO- First in First out Operations) ; Operations on queue (Insert and Delete) and its implementation in C++, circular queue using array.
Arrays :
One and two Dimensional arrays: sequential allocation and address calculation;
One Dimensional array : travesal, Searching (linear, Binary search), Insertion of an element in an array, deletion of an element from an array, Sorting ( insertion, selection, bubble ).
Two-Dimensional arrays : traversal, Finding sum/different of two NxM arrays containing numeric values, Interchanging Row and Column elements in a two dimensional array;
Stack (Array and Linked implementation of stack) :
Introduction to Stack (LIFO- Last in Fast Out Operations) ; Operations on stack (PUSH and POP) and its implementation in C++ Converting expressions from INFIX to POSTFIX notation and evaluation of Postfix expression ;
Queue (Circular Array and Linked implementation) :
Introduction to queue (FIFO- First in First out Operations) ; Operations on queue (Insert and Delete) and its implementation in C++, circular queue using array.
Comments
Post a Comment