CONTENTS

  1. C SYLLABUS
    • Introduction to the C Language
      1. The C Language and its Advantages
      2. The Structure of a C Program
      3. Writing C Programs
      4. Building an Executable Version of a C Program
      5. Debugging a C Program
      6. Examining and Running a C Application Program

    • Data Types and Variables
      1. Data Types
      2. Operands, Operators, and Arithmetic Expressions
    • Input/Output Management
      1. Input/Output Management
      2. The getchar() and putchar() Functions and Single-character I/O
      3. Formatted Input and the scanf() Function
    • The Control-flow Program Statements
      1. The Control-flow Program Statements
      2. Looping Statements
      3. The Data-checking Process

    • Modular Programming with Functions
      1. The C Function
      2. Passing Data to Functions
      3. Passing an Address to Modify a Value in Memory
      4. Using Functions in the Checkbook Program
      5. The C Standard Library Functions

    • The C Standard Library Functions
      1. Arrays
      2. Pointers
      3. Strings
      4. Using Arrays, Strings, and Pointers in the Checkbook Program

    • Structures and Dynamic Memory Allocation
      1. Structures
      2. Arrays of Structures
      3. Passing Structures to Functions
      4. Nested Structures
      5. Dynamic Memory Allocation
    • The Preprocessor and Multiple-file Compilation
      1. The C Preprocessor and the #include and #define Directives
      2. The Conditional Compilation Directives
      3. Global Variables and Variable Storage Classes
      4. Program Organization and Multi-file Compilation
    • File Input/Output
      1. Command-line arguments
      2. File Input and Output
      3. Combining Command-line Arguments and File I/O
  1. Data Structures SYLLABUS
    • Introduction on Data Structure
      1. Concepts of C language
      2. go through Arrays
      3. pointers
      4. Recursive functions
      5. understand the concept of Data Structure
    • Sorting techniques
      1. Space & time complexity
      2. cover following algorithms of Sorting in data structure
        1. Selection
        2. , Bubble
        3. Insertion
        4. Quick and Radix/li>
    • Link List
      1. Implementation of Singly linked list
      2. , Doubly linked list
      3. Circular linked list
      4. Operations on link list - insertion
      5. deletion
      6. traversal and reverse
      7. Applications of link list
    • Abstract Data Type (ADT)
      1. Concept of Stack
      2. Operations on stack
      3. Applications of stack
      4. Concept of Queues
      5. Operations on queue
      6. Priority queue
      7. Applications on queue and Heap
    • Trees in Data Structure
      1. Concept of tree
      2. Binary search tree
      3. AVL Tree
      4. Multi way trees (B-Tree, B*Tree)
      5. Red-Black tree
      6. Operations on tree and Applications of tree.
    • Graphs
      1. Depth First Search (DFS)
      2. Breadth First Search (BFS)
      3. Features of C++
      4. Minimal spanning tree (Kruskal's and Prim's Algorithm)
      5. Shortest path (Dijkstra's algorithm)
      6. Topological sorting
    • Miscellaneous features
      1. Conversion of expression
      2. and evaluation of infix, postfix, prefix expressions.
      3. Linear Queue
      4. Circular Queue
      5. Sparse matrix and Polynomial representation
    • Standard Template Library (STL)
      1. Template classes
      2. vector
      3. list
      4. Map Hash Tables
      5. Hash function
      6. Collision resolution
      7. Huffman's algorithm
  1. C++ SYLLABUS
    • Introduction to C++
      1. Starting with C++
      2. How C++ evolved from C?
      3. Features of C++
      4. Procedure-oriented programming C++
      5. OOP vs. procedure-oriented programming
      6. The basic anatomy of a C++ program
      7. Starting with a simple “Hello World” program
      8. Compiling, linking and running a C++ program
    • Object-Oriented Programming Concepts
      1. Abstraction
      2. Inheritance
      3. Polymorphism
      4. Data Binding
      5. Encapsulation
      6. Classes, subclasses and Objects
    • The Basics of C++
      1. Base Data Types and sizes
      2. User-defined Data Types
      3. Variable Declarations, Variable Names
      4. Base Data Types and sizes
      5. Dynamic initialization of variables
      6. Constants and its types
        • Character Constants
        • String Constants
      7. Standard input and standard output
      8. Formatted input –cin
      9. Formatted output – cout
      10. Use of << and >> operators
    • Working with Operators and Expressions
      1. Operators
        • Arithmetic Operators
        • Relational Operators
        • Assignment Operator
        • Logical Operators
        • Increment and Decrement Operators (++ and --)
        • Operate-Assign' Operators (+=, *=, ...)
      2. Expressions
        • What are Expressions?
        • Operator Precedence
        • Precedence and Order of Evaluation
        • Conditional Expression
        • Casting and type conversion
    • Controlling the Program Flow
      1. Decision control
        • if
        • if – else
        • if - else if
      2. Loop Control
        • while
        • do – while
        • for
        • break
        • continue
      3. Case Control
        • switch
        • goto
    • Using Functions/Procedures
      1. Why Functions?
      2. Anatomy of a Function
      3. Returning values from functions
      4. Arguments Passed by Value
      5. Passing Addresses of Arguments
      6. Concept of variable scope and scope rules
      7. Static and automatic variables
      8. Global variables
    • Pointers and Arrays
      1. Pointers
        • What is a Pointer?
        • Pointer Initialization
        • Pointer Operators
        • The & Operator
        • Pointer Arithmetica>
        • Functions and pointers
      2. Understanding Arrays
        • Arrays
        • Initializing Arrays
        • Passing Arrays to Functions
      3. Pointers and Arrays
      4. Pointer to an Array
      5. Array of pointers
      6. Strings
        • String I/O
        • cin and cout member functions
        • Standard C String functions
        • Arrays of Strings
    • Binding data and functions
      1. Abstraction
      2. Inheritance
      3. Polymorphism
      4. Data Binding
      5. Encapsulation
      6. Classes, subclasses and Objects
    • Function and Operator Overloading
      1. Function Overloading
        • Using overloaded functions
        • Rules for overloading
      2. Operator overloading and its uses
        • Overloading unary and binary operators
        • Overloading the assignment operator
        • Overloading the << Operator
        • Overloading the increment and decrement operator
      3. Dealing with strings using operators
      4. Converting data types
        • Basic to class type
        • Class to basic type
        • Class to another class type
    • Reusing classes
      1. Inheritance-Base and Derived classes
      2. Inheritance types
      3. Scope Resolution operator
      4. Access Modifiers
      5. Access and Inheritance
      6. Constructors and Inheritance
      7. Multiple & Multilevel Inheritance
      8. Calling base class constructor
      9. Overriding base class memberse
    • Virtual functions and Polymorphism
      1. Virtual & non-virtual Overriding
      2. Virtual functions
      3. Rules for virtual functions
      4. Pure virtual functions
      5. Static and Dynamic Binding
      6. Virtual base classes
    • Virtual functions and Polymorphism
      1. Templates
      2. Function templates
      3. Class templates
      4. Exception handling

Benefits of C and C++ course

      1. students will be getting government authorized certificate and will be valid worldwide
      2. Sharp Mind Info Train provides excellent coaching for the students who are looking to build high career goals.

      3. Sharp Mind not only provides professional teachers but also the necessary material required for the students and takes them to the next level of knowledge.

      4. The institute helps to gain fresh perspectives on your personal challenges and opportunities.

      5. In the era of cut-throat competition, there is huge competition in all the fields. Our institute makes the way for you easy by teaching all the new technologies to be a good competitor and ease your way to reach your goals.

      6. We provide competitive environment to you to make you more and more stable technically with all the best skills.

      7. We have company environment.

      8. All the courses available here are cost effective. The institute also provides 100% career assistance.

  • <