The class covers topics related to C, C++, Datastructures which are taught in BCA/MCA courses. C, C++ Data Structures

Topics Covered

1. Introduction to C language * Constants, variables and keywords, types and rules. * Data types * Some simple programs 2hrs. 2. Decision control structures * If statement * If-else statement * Nested if-else statement * Use of logical/conditional operators 4hrs. 3. Loop control structures * The while loop * The for loop * Do-while loop 3hrs. 4. Case control structures * Switch-case statement * Goto statement 1hr. 5. Functions * Standard library functions * User defined functions 3hrs 6. Arrays 1hr. 7. Structure, union, pointers 1hr. C++ and Object Oriented Programming 1. Introduction * Objects, constants, variables * Input/output operators * Some simple programs 2hrs. 2. Data types * Numeric, Boolean * Enumeration * Character, integer * Arithmetic operator * Increment/decrement operator * Composite assignment operator * Data type conversion 2hrs. 3. Selection * The if statement * If-else statement * Nested selection statement * Switch-case statement 4hrs. 4. Iteration * While statement, Do-while statement * For statement, Goto statement * Break statement, Continue statement 6hrs. 5. Functions * Standard C++ library functions * User defined functions * Function overloading 2hrs. 6. Arrays and pointers * Single dimensional * Multi dimensional 2hrs. 7. Classes * Public/private/protected * Constructors * Destructors 2hrs. 8. Operators Overloading 1hr. 9. Data File Handling 4hrs. 10. Composition and Inheritance * Single and multiple inheritance * Virtual functions * Polymorphism 6hrs. 11. Templates 1hr. 12. Vectors 1hr. 13. This pointer, friends and static functions 2hrs. 14. Exception handling 1hr. Data Structure using C 1. Array, Pointers, Structures 2hrs. 2. Introduction to data structures 1hr. 3. Recursion 1hr. 4. Linked List * Building a linked list * Traversing, Insertion, Deletion * Searching, Sorting * Doubly linked list 6hrs. 5. Stacks * Array implementation * Push, Pop, Peep * Update * Linked list implementation 4hrs. 6. Queue * Array implementation * Double ended queue (deque) * Circular queue * Linked list implementation 6hrs. 7. Tree * Binary tree * B-tree * Minimum spanning tree * Splay tree * Red Black tree * Avl tree 6hrs. 8. Graphs 6hrs. 9. Sorting and searching 8 hrs.

Who should attend

* BCA/MCA Students. * Programmers.

Pre-requisites

Basic knowledge of computers

What you need to bring

1. Photo-Id. 2. Passport Photograph.

Key Takeaways

Learnings to help get good marks in exams. Understanding the concept to ensure a solid foundation.