C and C++ and Data Structures


  • Batch Timings :
  • Starting Date :

Course Overview

C is a powerful general purpose programming language used for creating a wide variety of system programs and applications. C++, developed as an extended version of C programming language, is one of the most preferred programming languages amongst software programmers. It can be used on a broad range of hardware and operating system platforms. This intermediate-level language offers imperative, object-oriented and generic programming features.

Data structure is a specific method of storing and organizing system data in order to use it efficiently. Large amounts of data including internet indexing services and large databases can be efficiently managed with the implementation of data structures. It also has a major role to play in designing efficient algorithms and system software programs.

COURSE FEATURES

  • Resume & Interviews Preparation Support
  • Hands on Experience on One Live Project.
  • Resume Preparation
  • Interview Preparation
  • Multiple Flexible Batches

At the end of C and C++ and Data Structure Training Course, Participants will be able to:

  • Write programs with the help of basic elements including control statements, arrays and strings.
  • Edit, compile, execute and get hard copy of a simple program.
  • Write a program using C++ arithmetic operators, input/output methods and appropriate manipulators for formatting.
  • Implement user defined functions to understand the code reusability.
  • Gain complete understanding of bit fields and bit wise operations.
  • Use pointers to overcome the memory access problems.
  • Learn inheritance and its types for code reuse.
  • Implement sorting and searching techniques in data structure.
  • Use character data and string processing, and create their own data type.
  • Understand the uses of both one dimensional and multi-dimensional arrays.
  • Use exception handling to avoid exceptions during program executions.
  • Get on over view of common data structures such as linked lists, stacks, queues, & tree.
  • Develop sophisticated applications using enumerated data types, function pointers and nested structures.

Course Duration

  • Weekdays:30 Days- 45 Days

Prerequisites :

  • There are no pre-requisite for learning C, C++ and Data Structures. Anybody having interest in programming can pick up this language. C and C++ is considered as the most fundamental programming language for people entering in the world of software programming.

Who Should Attend?

  • Students / Fresher’s
  • Testing Engineers
  • Web Developers

Course

1.1 Introduction

  • The C Language and its Advantages
  • The Structure of a C Program
  • Writing C Programs
  • Building an Executable Version of a C Program
  • Debugging a C Program
  • Examining and Running a C Application Program

1.2 Data Types and Variables

  • Data Types
  • Operands, Operators, and Arithmetic Expressions

1.3 Input/Output Management

  • The Input/Output Concept
  • Formatted Input Function

1.4 Control-Flow Statements

  • The Control-Flow Program Statements
  • Looping Statements
  • The Data-checking process

1.5 Modular Programming with Functions

  • The C Function
  • Passing Data to Functions
  • Passing an Address to Modify a Value in Memory
  • Using Functions in the Checkbook Program
  • C Standard Library Functions

1.6 Arrays, Pointers, and Strings

  • Arrays , Pointers , Strings
  • Using Arrays, Strings, and Pointers in the Checkbook Program
  • Structures
  • Arrays of Structures
  • Passing Structures to Functions
  • Nesting Structures

1.7 File Input/Output

  • Command-line Arguments
  • Combining Command-line

2.1 Introduction to C++

  • Creating a project
  • Writing, compiling and running a program

2.2 Variables and data types

  • Expressions
  • Constants
  • Operators
  • Type conversions

2.3 Looping constructs: while, do…while, for loops

  • If…else statements
  • Switch/case construct

2.4 Functions

  • Passing arguments
  • Function prototyping
  • Default argument initializers
  • Inline functions

2.5 Arrays

  • Array initialisation
  • Multi-dimensional arrays
  • Character arrays
  • Working with character strings

2.6 Storage Classes

  • Global variables

2.7 Pointers

  • Pointer and arrays
  • Pointers to character strings
  • Arrays of pointers
  • Memory slicing
  • Pointers to functions

2.8 C++ classes

  • Data members and member functions
  • Creating objects
  • The new and delete operators
  • Friends to a class
  • Class initialisation

2.9 Reference types

  • Reference type arguments

2.10 Function overloading

  • Operator overloading

2.11 Copy constructor

  • Assignment operator

2.12 Template classes

  • Static class members
  • File streams

2.13 Inheritance

  • Base classes and derived classes
  • Inherited member access
  • Base class initialisation
  • Protected members of a class

2.14 Virtual functions

  • Virtual destructors

2.15 Virtual base classes

  • Virtual base class member access
  • Constructor and destructor ordering

2.16 Exception handling

  • try…throw…catch block
  • Nested catch handlers

3.1 Introduction

  • What is Data Structure?
  • What is Algorithm?
  • Types of Data Structure
  • Introduction to an array and linked list

3.2 Array

  • What is array?
  • Why Array?
  • Operations in an array

3.3 Linked list

  • Why linked list
  • How to create linked list
  • Operation on Linked list
  • Doubly linked list
  • Operation on doubly linked list
  • Programming approach to linked list

3.4 Stack as Data Structure

  • Implementation of stack in array and linked list
  • Operation on Stack
  • Polish notation

3.5 Queue as Data Structure

  • Implementation of Queue in array and linked list
  • Operation on Queue
  • Double Ended Queue (DeQue)
  • Priority Queue

3.6 Tree

  • Introduction
  • Binary tree
  • Binary tree representation in memory
  • Tree traversal
  • Binary search tree
  • Balanced binary tree
  • Tree rotation
  • M-WAY search tree
  • B-tree

3.7 Graphs

  • Introduction
  • Representation of graphs
  • Graph traversal
  • Shortest path algorithm
  • Warshall’s algorithm for finding path matrix
  • Warshal’s algorithm for finding the shortest path matrix
  • Dijkestra’s technique
  • Floyed’s technique

3.8 Searching and sorting

  • Various searching technique
  • Various sorting technique
  • Hashing

FAQ

  • C++ is a kind of superset of C.
  • C is a procedural programming language, but C++ supports both procedural and Object Oriented programming.
  • C++ supports exception handling at language level, in C exception handling is done in traditional if-else style.

Classes are held on weekdays and weekends. You can check available schedules and choose the batch timings which are convenient for you.

Towards the end of the course, all participants will be required to work on a project to get hands on familiarity with the concepts learnt. This project will be reviewed by our instructors and industry experts. On successful completion, you will be awarded a certificate.

  • Linear: A data structure is said to be linear if its elements form a sequence or a linear list. Examples: Array. Linked List, Stacks and Queues
  • Non-Linear: A data structure is said to be non-linear if traversal of nodes is nonlinear in nature. Example: Graph and Tree
Quick Enquiry