Enter the world of computer science, learn to code and solve problems using C++
Note: Course Free for limited time and limited users(500 limit) so Enroll ASAP. If not free it means you are late. Scroll Down and click Enroll Now button to get enrolled
Scroll Down and click Enroll Now Button to get enrolled into the Free Course
Apply Coupon Code: SST_JUNE24
What you’ll learn
- Programming Fundamentals & Concepts
- Converting Logic into C++ Code
- Complete Modern C++ Syntax
- Object Oriented Programming
- C++ Standard Template Library
- Problem Solving
This course includes:
- 19.5 hours on-demand video
- 114 coding exercises
- 5 articles
- 8 downloadable resources
- Access on mobile and TV
- Full lifetime access
- Certificate of completion
Coding Exercises
This course includes our updated coding exercises so you can practice your skills as you learn.See a demo
Course content
24 sections • 200 lectures • 19h 37m total lengthCollapse all sections
Course Introduction
- Introduction to Course
- Course Logistics
- Code Repository
Logical Thinking-I Flowcharts
- Building Blocks of Flowchart
- Flowchart – Simple Interest
- Flowchart – Largest Number
- Flowchart – Sum of First N Numbers
- Flowchart – Sum of Multiple Inputs
- Flowchart – Prime Number
- Flowchart – GCD
- Flowchart – Bank Employee
- Flowchart – Bank Guard
- Assignment – Flowcharts
Logical Thinking-II Pseudocode
- Pseudocode – Notation
- Pseudocode – SImple Interest
- Pseudocode – Sum 1 to N
- Pseudocode – Sum of N Numbers
- Pseudocode – Prime or Not
- Pseudocode – GCD
- Pseudocode – Star Pattern
- Pseudocode – Star Pyramid
- Pseducode Assignment
C++ Getting started
- C++ Boilerplate
- Sublime Text + Compiler Setup
- Building & Running Code
- Hello, World!
- Solution : Hello, World!
- Input & Output
- Square of Number
- Solution : Square of Number
C++ Diving Deeper
- Preprocessor Directive
- Identifiers
- Keywords
- Main
- Namespaces
- Comments
- Summary
- Hello You!
- Solution – Hello You!
Variables, Datatypes & Storage
- Variables
- Datatypes
- Using sizeOf Operator
- Binary Number System
- Storage of Integers
- Data type Modifiers
- Storage of Negatives Numbers
- Range of Signed vs Unsigned Integers
- Storage of Floats & Doubles
- Storage of Characters
- Storage of Booleans
- Constants
- Typecasting
- Explicit Typecasting
- Typecasting Challenge
- Find the sum
- Solution – Find the sum
- Find the Average Marks
- Solution – Find the Average Marks
- Find the Ceil
- Ceil, Floor & Round Functions
- Find the Floor
- Simple Interest Calculator
- Solution – Simple Interest Calculator
Operators & Expressions
- Arithmetic Operators
- Assignment Operators
- Increment Decrement Operators
- Relational Operators
- Logical Operators
- Bitwise Operators – I
- Bitwise Operators – II
Flow Control – Conditional Statements
- If Statement
- If-Else
- If Else-if Else
- Multiple If Blocks
- Problem – Electricity Bill Calculator
- Ternary Operator
- Switch Case
- Problem – Calculator
- Odd or Even Number
- Cash Withdrawal
- Predict the Grade
- Electricity Bill Calculator
- Fixed Deposit Interest
- Simple Calculator
Flow Control – Loops
- While Loop
- While Example – Sum of N Inputs
- For Loop
- For – While Equivalence
- Problem – Sum of Digits of a Number
- Problem – Star Pattern
- Problem – For ABCD Pattern
- Problem – Print Reverse of a Number
- Problem – Reverse the Actual Number
- Break
- Continue
- Problem – Prime Number Check
- Find Largest
- Do While
- Nested Loops
- Problem – Number Pyramid
- Loops
- Sum of digits
- Sum of odd digits
- Sum of digits at odd position
- Fizz Buzz Problem
- Check Prime Number
- Armstrong Number
- Factorial of a Number
- Fibonacci Series
- Prime Numbers Till N
Pattern Problems
- Pattern 1
- Pattern 2
- Pattern 3
- Pattern 4
- Pattern 5
- Pattern 6
- Pattern 7
- Pattern 8
Functions
- Introduction to Functions
- Functions Code Demo
- Default Parameters
- Forward Declaration
- Problem – Find Factorial
- Problem – Find Binomial Coefficient
- Call Stack
- Call Stack Example
- Function Overloading
- Overloading using variable parameters
- Overloading – using different datatypes
- Problem – Check Prime (Linear)
- Problem – Check Prime (Sqrt N Optimisation)
- Prime Number Optimised Code
- Problem – Primes in Range
- Practice – Call Stack Analysis !
- Problem – Binary to Decimal
- Problem – Decimal to Binary
- Sum of Digits
- Binary To Decimal
- Check Prime Number
- Find the Factorial of a given Number N.
- Find Area of given shape
- Power function.
- Multiply two Numbers without using *
- Greatest common divisor.
- Prime numbers.
- Find nCr.
- Fibonacci Number
- Trailing Zeroes in N
- Trailing Zeroes in N!
- Functions Quiz
Pointers
- Address Of Operator
- Pointer Variables
- Dereference Operator
- Pass by References – using Pointers
- Reference Variables
- Pass by Reference – Reference Variables
- Pointers
Arrays
- Arrays Introduction
- Array Creation
- Array Input
- Passing Arrays to Functions
- Print Reverse on Array
- Reverse an Array – Two Pointer
- Print all Subarrays
- Sorting Basics
- Sorting using Comparator
- Largest and Smallest Number.
- Median of sorted Array.
- Kth smallest element in the array.
- Move all negative elements to one side of the array
- Find intersection of the two arrays
- Find the frequency of the given element
- Pair Sum
- Three Sum
- Rotate an array by K
- find Missing number.
- Arrays Quiz
Sorting & Searching Basics
- Linear Search
- Binary Search
- Binary Search Code
- Searching
- Find the element in the array.
- Frequency of largest element.
- Count of one.
- Square root
- Bubble Sort
- Bubble Sort Code
- Selection Sort
- Selection Sort Code
- Insertion Sort
- Insertion Sort Code
- Count of one in an array.
- Sort an array !
- Search element in sorted array
- Find first and last occurrence of an element in a sorted array
- Find the total number of occurrence of an element in an array
- Sort an array of 0, 1 2
- Sum of each row and column
2D Arrays
- 2D Array
- 2D Array Storage
- Wave Print
- Spiral Print
- Staircase Search
- Staircase Search Code
- Number of zeros.
- Check whether product of elements are positive or negative.
- Sum of even numbers.
- Sum of all diagonal elements
- Search a 2D Matrix
- Mirror Image
- Spiral Print
Pointers vs Arrays
- Pointers vs Arrays
- Pointer Airthmetic
- Pointer to an Array
- Dereferencing Pointers to an Array
- 2D Arrays & Pointers
- 2D Arrays & Pointers – Deep Dive
Character Data Type
- Introduction
- ASCII Encoding
- Input using cin.get()
- ‘cctype’ Header
- Challenge – Shortest Path
- Solution – Shortest Path
- Challenge – ABCD Pattern
- Guess the Output
Character Arrays/ C-Style Strings
- Character Array Basics
- Inputing Char Arrays – cin.getline()
- Problem – Create ReadLine function
- Problem – Finding Length
- Library Functions in <cstring>
- Challenge – Largest String
- Challenge – Password Checker
- String Comparison
- String Methods Demo
- Challenge – Count Letter Types
- 2D Character Arrays
- Largest character.
- Largest frequency character
- Is character array sorted ?
- Count of unique characters
- Rotate the matrix.
C++ Strings
- [Pre-requisite]
- Strings Introduction
- Strings Initialisation
- Input using getline()
- String Operators
- String Traversal
- Looking up String Methods – Documentation
- Find Method
- Challenge – Uncomment String
- Valid Anagram
- Is String a palindrome?
- Upper to Lower
- Largest Frequency character
- All Alphabets present or not ?
- Given string can be formed or not ?
- Sum of all elements below main diagonal.
- Roman to Integer
- Number of words
- Longest Common Prefix
- Remove All Adjacent Duplicates
- Check for Subsequence
- Binary String to Decimal
Dynamic Memory Allocation
- Dynamic Memory Allocation Introduction
- Dynamic Memory Allocation – 1D Array
- Dynamic Memory Allocation – 2D Array
- Dynamic Memory Allocation
Vectors
- Vectors Introduction
- Vectors – Behind the Scenes
- Vector Demo
- 2D Vectors
- Sort a vector of integers
- Merge two vectors
- Sort a vector of strings
- Maximum element
- Set Matrix Zeroes
Bitmasking Techniques
- Check Odd/Even Number
- Get ith Bit
- Set ith Bit
- Clear ith Bit
- Update ith Bit
- Clear last i bits
- Clear Bits in Range
- Challenge – Replace Bits
- Challenge – Power of 2
- Counting Set Bits
- Fast Exponentiation
- Decimal to Binary
- Count of set bit.
- Power of two.
- Divide a integer without Division operator
- Find square of a number without multiplication or divisor.
- Find a number which is singly present.
- Bitmasking
Recursion Introduction
- Recursion Introduction
- Factorial
- Fibonacci
- Sorted Array
- Increasing Decreasing Number
- Increment Decrement
- Factorial using recursion
- Fibonacci number
- Sum of digits
- Fibonacci series 2
- Binomial Coefficient
- Tiling Problem
- Pallindrome
- First Occurence
- Last Occurence
- Frequency of element
- Implement Power Function
- Count Binary Strings
Object Oriented Programming Introduction
- Introduction to OOPS
- Classes & Objects
- Product Class Demo
- Getters & Setters
- Constructors
- Copy Constructor
- Shallow & Deep Copy
- Copy Assignment Operator
- Destructor
- OOPs C++
Requirements
- No Pre-requisites
- Passion to learn coding
Description
Are you an absolute beginner looking forward to kickstart your journey in the programming domain. Coding can be hard skill learn to learn for many but no more. Welcome to C++ Programming Essentials, the most fundamental course that every aspiring programmer should take to kickstart their journey in the world of programming. The course teaches you the fundamental building blocks of programming and builds a logical thinking mindset using C++ as our programming language. Many concepts taught in the course are also relevant to other languages like Java, Python, JavaScript etc with few changes in the coding syntax
You will understand the basic concepts and techniques to break down a given problem into smaller parts by drawing flowcharts, write pseudocode, and then diving deep into C++ topics like –
variables, datatypes, flow control using branching & loops, functions, arrays, character arrays & strings, recursion, bitmasking & OOPs concepts.
Course Features
HD Videos
Intuitive Explanations
Beginner Friendly Teaching
Tested Industry vetted curriculum
Assignments & Q-A Support
Certificate of Completion
The course is your first step towards problem solving, and will help you to get your basics right. After this course, you can easily pursue a course on learning a programming language of your choice, followed by Data Structures, Algorithms & Competitive Programming. Many top companies like Google, Facebook, Amazon, Directi, CodeNation, Goldman Sachs etc encourage algorithmic programming and conduct coding competitions to hire smart people who can solve problems.
This course is taught by Prateek Narang, who is not just a software engineer but a teacher by heart and many bestseller courses on Udemy in Algorithms category! He has worked with companies like Google, and has co-founded two startups including Coding Minutes, which is now a part of Scaler Academy.
Who this course is for:
- Beginners looking forward to start learning programming
- Developers who want to learn C++ Syntax
- Students who want to learn data structures & algorithms in C++ later
Show less
Note: The course is free for a limited time and limited to 500 users. Enroll as soon as possible. If it is no longer free, it means you are late, and it has already exceeded its limits.
🎫 After adding the course into Cart at Checkout page, Apply Coupon Code➛. SST_JUNE24 Note:- After applying coupon, if it says ”This coupon has exceeded its maximum possible redemptions…”, then it means you’re Late, and first 500 coupons already redeemed.
