• Home
  • Course
  • Advance C/C++ & Data Structures Kolkata

Advance C/C++ & Data Structures

10000 Learners

Course Objective:

Prerequisite:No expertise is required

Course Content:

TOPICS TO BE COVERED:

Introduction to C
  • Introduction to program and programming language
  • Algorithm and flow chart
  • History and features of C Language
  • Flow of C program
  • Compiler and interpreter
  • Printf(), scanf(), main() of C
  • Structure of C program
Variable, data type and operators
  • Concepts of variable and constants
  • Data types in C
  • Primary, secondary and user defined data type
  • Keywords in C
  • Operators in C
Control statements and Loops
  • If, else, else-if
  • Break and continue
  • Switch statment
  • For , while and do –while loop
C functions
  • Introduction to function
  • Declaration, definition and calling of functions
  • Arguments and parameters
  • Call : by value and by reference
  • Recursion
Array and String
  • What is array
  • 1D and 2D array
  • Examples of both arrays
  • Character array and Strings
  • Library functions of strings
Introduction to C++
  • What is Object oriented Programming language
  • Difference between procedure oriented programming
  • Input/ output like cin , cout
  • Basic syntax including header files
  • A small example in C++
Object Class
  • OOPS concept
  • Object class
  • Constructor
  • Destructor
  • this Pointer
  • friend function
Polymorphism- function & operator overloading
  • Concepts of polymorphism
  • Compile and run time polymorphism
  • Function and operator overloading
  • Example showing function overloading
  • Working with overloaded methods
Data Structure Introduction
  • Introduction to data structure and algorithm
  • Basic types of data structure
  • Array revisited
  • Operations on array
  • Insert, update, delete, search and sort on array
  • Dynamic memory allocation in C
Linked list representation
  • Linked list introduction
  • Types of linked list
  • Basic operations on single linked list (insert, delete, search, display)
  • Doubly linked list and its representation
  • Operations on doubly linked list
  • Circular single linked list and circular doubly linked list
Storage classes in C
  • What is storage class
  • Different type of storage class
  • Auto , static , register and extern storage classes
Pointers and dynamic memory allocation
  • Pointers and its advantages
  • Declaring and accessing pointer
  • Pointer arithmetic
  • Pointers and array
  • Passing pointers to functions
  • Dynamic memory allocation
  • Malloc(), calloc() and free()
Structure and union
  • What is structure
  • Creating and accessing structure
  • Variable of structure
  • Members of structure
  • Union and typedef
  • Arrays of structure
  • Pointer to structure
File
  • File handling
  • Text and binary file
  • Create and open a file
  • Reading and writing to a file
  • File copy
  • Accessing file
Inheritance and Polymorphism in C++
  • What is inheritance
  • Types of inheritance
  • Polymorphism overview
  • Overloading and overriding
  • Virtual functions
  • The diamond problem
  • Multiple inheritance using virtual functions
Exceptions
  • Runtime error or exceptions
  • Exceptions keywords
  • Try, catch, finally
  • exception hierarchy
Input output in C++
  • Standard streams
  • Manipulator
  • Unformatted input output
  • File input output
Stack and Queue data structure
  • stack and its representation
  • basic operations on stack
  • example showing PUSH and POP on stack
  • queue and its representation
  • basic operations on queue
  • difference between stack and queue
Searching and sorting algorithm
  • linear and binary search
  • both array and linked list representation for searching algorithm
  • sorting algorithm in C
  • bubble sort, quick sort, merge sort, selection sort
  • examples with both arrays and linked for all sorting algorithm
Tree and Graph
  • tree and its representation
  • post order, pre order, in order traversal on binary tree
  • binary search tree and its representation
  • introduction to graph
  • basic operations on graph
  • BFS and DFS

Key Features

  • Gain skills and competencies required in Industry by Experts.
  • Work on Real-time Projects depending upon the course you select.
  • Students work in a professional corporate environment.
  • Get a globally recognized Certificate form WebTek with our partner logos.
  • Global Brand recognition for Placements.

Includes

  • Course Duration: 3 Months
  • Suitable For: 2nd/ 3rd / 4th Yr B.Tech. / Diploma students

Enquire / Demo

View More
Copyright © 2019 webteklabs.com
Webteklabs
Webteklabs
Webteklabs
Webteklabs
Toll-Free 18002124700
Free Demo
Call now