وب سایت تخصصی شرکت فرین
دسته بندی دوره ها

C++ Programming for Beginners (2023)

سرفصل های دوره

Enter the world of computer science, learn to code and solve problems using C++


01 - Course Introduction
  • 001 Introduction to Course
  • 002 Course Logistics

  • 02 - Logical Thinking-I Flowcharts
  • 001 Building Blocks of Flowchart
  • 002 Flowchart - Simple Interest
  • 003 Flowchart - Largest Number
  • 004 Flowchart - Sum of First N Numbers
  • 005 Flowchart - Sum of Multiple Inputs
  • 006 Flowchart - Prime Number
  • 007 Flowchart - GCD
  • 008 Flowchart - Bank Employee
  • 009 Flowchart - Bank Guard
  • 010 Assignment - Flowcharts.html

  • 03 - Logical Thinking-II Pseudocode
  • 001 Pseudocode - Notation
  • 002 Pseudocode - SImple Interest
  • 003 Pseudocode - Sum 1 to N
  • 004 Pseudocode - Sum of N Numbers
  • 005 Pseudocode - Prime or Not
  • 006 Pseudocode - GCD
  • 007 Pseudocode - Star Pattern
  • 008 Pseudocode - Star Pyramid
  • 009 Pseducode Assignment.html

  • 04 - C++ Getting started
  • 001 C++ Boilerplate
  • 002 Sublime Text + Compiler Setup.html
  • 003 Building & Running Code
  • 004 Solution Hello, World!
  • 005 Input & Output
  • 006 Solution Square of Number

  • 05 - C++ Diving Deeper
  • 001 Preprocessor Directive
  • 002 Identifiers
  • 003 Keywords
  • 004 Main
  • 005 Namespaces
  • 006 Comments
  • 007 Summary
  • 008 Solution - Hello You!

  • 06 - Variables, Datatypes & Storage
  • 001 Variables
  • 002 Datatypes
  • 003 Using sizeOf Operator
  • 004 Binary Number System
  • 005 Storage of Integers
  • 006 Data type Modifiers
  • 007 Storage of Negatives Numbers
  • 008 Range of Signed vs Unsigned Integers
  • 009 Storage of Floats & Doubles
  • 010 Storage of Characters
  • 011 Storage of Booleans
  • 012 Constants
  • 013 Typecasting
  • 014 Explicit Typecasting
  • 015 Typecasting Challenge
  • 016 Solution - Find the sum
  • 017 Solution - Find the Average Marks
  • 018 Ceil, Floor & Round Functions
  • 019 Solution - Simple Interest Calculator

  • 07 - Operators & Expressions
  • 001 Arithmetic Operators
  • 002 Assignment Operators
  • 003 Increment Decrement Operators
  • 004 Relational Operators
  • 005 Logical Operators
  • 006 Bitwise Operators - I
  • 007 Bitwise Operators - II

  • 08 - Flow Control - Conditional Statements
  • 001 If Statement
  • 002 If-Else
  • 003 If Else-if Else
  • 004 Multiple If Blocks
  • 005 Problem - Electricity Bill Calculator
  • 006 Ternary Operator
  • 007 Switch Case
  • 008 Problem - Calculator

  • 09 - Flow Control - Loops
  • 001 While Loop
  • 002 While Example - Sum of N Inputs
  • 003 For Loop
  • 004 For - While Equivalence
  • 005 Problem - Sum of Digits of a Number
  • 006 Problem - Star Pattern
  • 007 Problem - For ABCD Pattern
  • 008 Problem - Print Reverse of a Number
  • 009 Problem - Reverse the Actual Number
  • 010 Break
  • 010 break-demo.zip
  • 011 Continue
  • 011 continue-demo.zip
  • 012 Problem - Prime Number Check
  • 012 prime-no-check.zip
  • 013 Do While
  • 013 do-while-loop.zip
  • 014 Nested Loops
  • 015 Problem - Number Pyramid

  • 10 - Pattern Problems

    11 - Functions
  • 001 Introduction to Functions
  • 002 Functions Code Demo
  • 002 functions-intro.zip
  • 003 Default Parameters
  • 003 default-values.zip
  • 004 Forward Declaration
  • 004 forward-decl.zip
  • 005 Problem - Find Factorial
  • 006 Problem - Find Binomial Coefficient
  • 007 Call Stack
  • 008 Call Stack Example
  • 009 Function Overloading
  • 010 Overloading using variable parameters
  • 011 Overloading - using different datatypes
  • 012 Problem - Check Prime (Linear)
  • 013 Problem - Check Prime (Sqrt N Optimisation)
  • 014 Prime Number Optimised Code
  • 015 Problem - Primes in Range
  • 016 Practice - Call Stack Analysis !.html
  • 017 Problem - Binary to Decimal
  • 018 Problem - Decimal to Binary

  • 12 - Pointers
  • 001 Address Of Operator
  • 002 Pointer Variables
  • 003 Dereference Operator
  • 004 Pass by References - using Pointers
  • 005 Reference Variables
  • 006 Pass by Reference - Reference Variables

  • 13 - Arrays
  • 001 Arrays Introduction
  • 002 Array Creation
  • 003 Array Input
  • 004 Passing Arrays to Functions
  • 005 Print Reverse on Array
  • 006 Reverse an Array - Two Pointer
  • 007 Print all Subarrays
  • 008 Sorting Basics
  • 009 Sorting using Comparator

  • 14 - Sorting & Searching Basics
  • 001 Linear Search
  • 002 Binary Search
  • 003 Binary Search Code
  • 004 Bubble Sort
  • 005 Bubble Sort Code
  • 006 Selection Sort
  • 007 Selection Sort Code
  • 008 Insertion Sort
  • 009 Insertion Sort Code

  • 15 - 2D Arrays
  • 001 2D Array
  • 002 2D Array Storage
  • 003 Wave Print
  • 004 Spiral Print
  • 004 spiral-print.zip
  • 005 Staircase Search
  • 006 Staircase Search Code

  • 16 - Pointers vs Arrays
  • 001 Pointers vs Arrays
  • 002 Pointer Airthmetic
  • 003 Pointer to an Array
  • 004 Dereferencing Pointers to an Array
  • 005 2D Arrays & Pointers
  • 006 2D Arrays & Pointers - Deep Dive

  • 17 - Character Data Type
  • 001 Introduction
  • 002 ASCII Encoding
  • 003 Input using cin.get()
  • 004 cctype Header
  • 005 Challenge - Shortest Path
  • 006 Solution - Shortest Path
  • 007 Challenge - ABCD Pattern
  • 008 Guess the Output

  • 18 - Character Arrays C-Style Strings
  • 001 Character Array Basics
  • 002 Inputing Char Arrays - cin.getline()
  • 003 Problem - Create ReadLine function
  • 004 Problem - Finding Length
  • 005 Library Functions in cstring
  • 006 Challenge - Largest String
  • 007 Challenge - Password Checker
  • 008 String Comparison
  • 009 String Methods Demo
  • 010 Challenge - Count Letter Types
  • 011 2D Character Arrays

  • 19 - C++ Strings
  • 001 [Pre-requisite]
  • 002 Strings Introduction
  • 003 Strings Initialisation
  • 004 Input using getline()
  • 005 String Operators
  • 006 String Traversal
  • 007 Looking up String Methods - Documentation
  • 008 Find Method
  • 009 Challenge - Uncomment String

  • 20 - Dynamic Memory Allocation
  • 001 Dynamic Memory Allocation Introduction
  • 002 Dynamic Memory Allocation - 1D Array
  • 003 Dynamic Memory Allocation - 2D Array

  • 21 - Vectors
  • 001 Vectors Introduction
  • 002 Vectors - Behind the Scenes
  • 003 Vector Demo
  • 004 2D Vectors

  • 22 - Bitmasking Techniques
  • 001 Check OddEven Number
  • 002 Get ith Bit
  • 003 Set ith Bit
  • 004 Clear ith Bit
  • 005 Update ith Bit
  • 006 Clear last i bits
  • 007 Clear Bits in Range
  • 008 Challenge - Replace Bits
  • 009 Challenge - Power of 2
  • 010 Counting Set Bits
  • 011 Fast Exponentiation
  • 012 Decimal to Binary

  • 23 - Recursion Introduction
  • 001 Recursion Introduction
  • 002 Factorial
  • 003 Fibonacci
  • 004 Sorted Array
  • 005 Increasing Decreasing Number

  • 24 - Object Oriented Programming Introduction
  • 001 Introduction to OOPS
  • 002 Classes & Objects
  • 003 Product Class Demo
  • 004 Getters & Setters
  • 005 Constructors
  • 006 Copy Constructor
  • 007 Shallow & Deep Copy
  • 008 Copy Assignment Operator
  • 009 Destructor
  • 45,900 تومان
    بیش از یک محصول به صورت دانلودی میخواهید؟ محصول را به سبد خرید اضافه کنید.
    خرید دانلودی فوری

    در این روش نیاز به افزودن محصول به سبد خرید و تکمیل اطلاعات نیست و شما پس از وارد کردن ایمیل خود و طی کردن مراحل پرداخت لینک های دریافت محصولات را در ایمیل خود دریافت خواهید کرد.

    ایمیل شما:
    تولید کننده:
    شناسه: 23852
    حجم: 4347 مگابایت
    مدت زمان: 1177 دقیقه
    تاریخ انتشار: 12 آذر 1402
    طراحی سایت و خدمات سئو

    45,900 تومان
    افزودن به سبد خرید