• 04:37:11 Hours On demand videos
  • 18 Lessons
  • Full lifetime access
  • Access on mobile and tv

C++ tutorial in hindi

Every Topic is Explained with Real life Examples This course is designed by IITians and those peoples who cleared top companies interviews like Google, amazon, Microsoft

Advanced 0(0 Ratings) 0 Students enrolled
Created by Aman Dhattarwal Last updated Wed, 21-Oct-2020 English
What will i learn?
  • Learn Basic concepts of C++ Programming, OOPs Concept
  • Learn Object-Oriented Programming Design Concept in C++ Perfectly Animation with Examples

Curriculum for this course
18 Lessons 04:37:11 Hours
Introduction to C++ tutorial in hindi
1 Lessons 00:01:38 Hours
  • Introduction of C++ Tutorial courses 00:01:38
  • Understanding to Computer Program 00:24:23
  • Data Types & Its Type , Modifiers Data Structures & Algorithms Course in C++ 00:11:09
  • Coding of Input and Output in C++ 00:08:42
  • If - Else conditional Statement in C++ 00:07:50
  • Loop in C++ 00:09:37
  • Advanced Pattern Questions in C++ 00:28:00
  • Break and Continue statement in C++ Programming 00:09:38
  • Switch-Case statement in C++ Programming 00:06:57
  • Operators in C++ Programming Language 00:29:58
  • Awesome Pattern Questions for this Section 00:23:37
  • Binary Number System 00:08:44
  • How to reverse a number Check if a number is Prime or Armstrong in C++ 00:10:45
  • Functions in C++ 00:08:00
  • Functions Challenges Part 2 00:13:00
  • Advanced Placement Questions on Functions in C++ 00:32:00
  • Time Complexity in C++ 00:30:41
  • Introduction to Arrays in C++ 00:12:32
  • Basic computer Skill and C Language knowledge
+ View more

In this course we have covered C++ from  beginners to advanced fundamentals. Concepts of C++ programming are made very simple and easy using best animated visual. Every topic is covered in greater detail.  Programs and Bullet points are provided as resource.

Every Topic is Explained with Real life Examples This course is designed by IITians and those peoples who cleared top companies interviews like Google, amazon, Microsoft

Course Summary :

Understanding Computer programs in C++ :

  • What is computer program and algorithms.
  • What is flowchart in C++.
  • What is pseudocode.
  • Setting up C++ Environment.
  • Hello world Program.
  • Brain Teasers

C++ Programming Fundamentals I :

  • Data-types and Ranges.
  • Type modifiers.
  • Input/Output in C++
  • If-Else in C++
  • Loop - While , do-while , for.

C++ Programming Fundamentals II :

  • Break and Continue.
  • Switch
  • Operators - Arithmetics Relations , Logical , Bitwise assignment.

Basics of number system in C++ :

  • Binary number system
  • Reverse a number
  • Armstrong number
  • Prime numbers

Functions in C++ :

  • Introduction to Functions.
  • Difficulties and Examples

Space and Time Complexity :

  • Definition and Basics.
  • Polynomial Execution
  • Master Theorem

Arrays in C++ :

  • Introduction to Arrays
  • Linear Search and Binary Search.
  • Sorting Algorithms.
  • STL sort
  • Max subarray sum
  • Pair sum problem

2D Arrays in C++ :

  • Introduction and searching in 2D arrays.
  • Questions and Examples for 2D arrays.

Character Arrays :

  • Introduction and Input .
  • Palindrome Arrays
  • Largest word in a string

String in C++:

  • Sorting a string
  • STL Function on string

Pointers in C++ :

  • & operators
  • Introduction to pointers 
  • Dereference operator in c++
  • Pass by reference and pass by value.

Dynamic Memory Allocation in C++ :

  • Compile time and runtime.
  • Heap and Stack
  • New , Delete 

Bit Manipulation in C++ :

  • Get , Set , Clear , Update
  • Is Power of 2
  • Number of one
  • Generate Subsets

Number Theory Basics in C++:

  • Prime Sieve
  • Counting divisors
  • Euclid's algo for GCD
  • Inclusion Exclusion Principle.

Introduction to Recursion in C++:

  • Call Stack
  • Fibonacci numbers
  • Factorial
  • Fast Power
  • First Occurrence and Last Occurrence 
  • Increasing , Decreasing , Order.

Recursion II in C++ :

  • Tower of Hanoi
  • Reverse string
  • Replace pi
  • Remove duplicates
  • Move all X
  • Subsequence Generation
  • Generate Permutations

Recursion III :

  • Permutation 
  • Count path
  • 0-1 Knapsack
  • Tiling Problem
  • Friends Paring Problem.

Back Tracking in C++:

  • Rat in Maze Problem
  • N-Queen Problem

Divide and Conquer in C++ :

  • Merge Sort
  • Quick sort

More Sorting Techniques in C++ :

  • Counting Sort
  • DNF Algorithms
  • Wave Sort

STL in C++ : 

  • Sort Function 
  • Pair Class
  • Other STL Functions

Generic Programming in C++:

  • Templates
  • Interators , Comparators

Vectors in C++:

  • Introduction to vectors in c++
  • Methods 
  • Sorting
  • Template

OOPS Concepts in C++: 

  • Class and objects
  • Data members and functions
  • Getters , Setters
  • Constructor & its type
  • Shallow and Deep Copy
  • Copy Assignment
  • Overlapping

Linked List in C++:

  • Introduction and Implements 
  • Insertion in linked list
  • Searching in Linked List
  • Deletion in linked list
  • Reverse a linked List
  • Iterative and Recursive Solutions
  • K Reverse Problem
  • Floyd's Cycle detective and removal
  • Doubly linked list
  • Circular linked list

Challenges in C++:

  • K append
  • Even after odd
  • Intersection Point 
  • Merge 2 Sort linked list

Stacks in C++ :

  • Introduction to Stacks
  • Implement using arrays
  • Implement using Linked List
  • Reverse a stack
  • Balance parenthesis
  • Infix , Prefix and Postfix Expression evolution
  • Infix to Prefix using stack
  • Infix to Post fix using stack
  • Infix to Prefix using Stack

Queries in C++:

  • Introduction to Queries.
  • Implement using Arrays 
  • Implement using linked list
  • Implement stack using Queue 
  • Implement Queue using stack

Deque in C++:

  • Introduction to Deque
  • Maximum Element
  • Max length unique characters substring.

Binary Trees in C++ :

  • Introduction to Binary Trees
  • Pre-order , In-order , Post-order
  • Level Order
  • Sum at Level K
  • Height and Diameter of BT
  • BFS Traversal
  • DFS Traversal
  • Count and Sum Nodes
  • Height Balance Tree
  • Build Balanced Tree from Array
  • Different views of Binary Tree
  • Nodes at Common Ancestors

Binary Search Tree in C++:

  • Introduction to Binary Search Tree
  • Implementation and Insertion
  • Searching 
  • Deletion
  • Check for Binary Search Tree
  • Find Min and Max Element
  • Flattern a tree
  • Construct from Pre-order
  • Catalan No concept
  • Set STL
  • Structural all Identical Binary Search Tree
  • Zig-Zag Order
  • Largest Binary Search tree in Binary Tree

Heaps in C++:

  • Introduction to Priority Queue
  • Heaps 
  • Remove min and Max Elements
  • Heap Sort
  • Running Media
  • Kth Smallest 
  • Top K most frequent No. in stream
  • Merge K Sort Arrays

Introduction to Programming Languages

A program is a set of instructions that tells a computer what to do in order to come up with a solution to a particular problem. Programs are written using a programming language. A programming language is a formal language designed to communicate instructions to a computer. 

Low-Level Languages :

Low-level languages are referred to as 'low' because they are very close to how different hardware elements of a computer actually communicate with each other. Low-level languages are machine oriented and require extensive knowledge of computer hardware and its configuration. There are two categories of low-level languages: machine language and assembly language.

High-Level Languages :

A high-level language is a programming language that uses English and mathematical symbols, like +, -, % and many others, in its instructions. When using the term 'programming languages,' most people are actually referring to high-level languages. High-level languages are the languages most often used by programmers to write programs. Examples of highlevel languages are C++, Fortran, Java and Python.

Compiler vs Interpreter  :

A compiler is a computer program that translates a program written in a high-level language to the machine language of a computer. The high-level program is referred to as 'the source code.' The compiler is used to translate source code into machine code or compiled code. This does not yet use any of the input data. When the compiled code is executed, referred to as 'running the program,' the program processes the input data to produce the desired output.

How to Start Programmings :

Algorithm :

Algorithm is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output. Algorithms are generally created independent of underlying languages, i.e. an algorithm can be implemented in more than one programming language.

Flowcharts : 

Flowcharts are written with program flow from the top of a page to the bottom. Each command is placed in a box of the appropriate shape, and arrows are used to direct program flow.

Pseudocode :

Pseudocode is a method of describing computer algorithms using a combination of natural language and programming language. It is essentially an intermittent step towards the development of the actual code. It allows the programmer to formulate their thoughts on the organization and sequence of a computer algorithm without the need for actually following the exact coding syntax

+ View more
Other related courses
02:19:21 Hours
Updated Wed, 28-Oct-2020
0 0 Free
About the instructor
  • 0 Reviews
  • 0 Students
  • 1 Courses
+ View more

I was born on 4th March 1997 in a small village of Rajasthan. Later on, his family shifted to Delhi. I completed my schooling from Delhi Public School, R.K. Puram, New Delhi. In his 12th standard, I appeared in JEE- Main and got about 6000 all India rank and finally started his B.Tech. from NSIT Delhi which is well known for its highest packages.

Student feedback
Average rating
  • 0%
  • 0%
  • 0%
  • 0%
  • 0%
  • 04:37:11 Hours On demand videos
  • 18 Lessons
  • Full lifetime access
  • Access on mobile and tv