Basics of C++ | C++ Tutorial

This is our first tutorial on C++. and there are a lot of features in C++. but we will focus on those part which is beneficial for competitive programming. and after learning new concept we will solve some questions related to those concepts, so that we can use these concepts to solve bigger problems.

First of all let's get some theoritical knowledge about C++:

1.C++ is an Object Oriented Programming language(we will explain this point later).

2.It is developed by Bjarne Stroustrup in 1979.

3.C++ is high level language.

What is High level language?

->they are those language which is machine independent, that means we can compile or run it on any machine.

->Easy to debug and maintain.

->Portable. so if any language has these features then we can consider it as a High level language.

eg:C++, Java etc..

4.C++ provides data security.

5.Main features of C++ is Polymorphism, Inheritance, Encapsulation and Data Abstraction.

This is little bit theoritical concept of C++. so just do one thing install code block or dev c++ in your system or any code editor, so that you can easily write programs and run it on your PC.

In the next tutorial we will start learning in depth.

Next tutorial:

https://codingshading.blogspot.com/2020/07/basic-structure-of-c-program-c-tutorial.html

best of luck.

Comments

Disjiont Set Union-Find Data Structure | Code In C++

Introduction: In this tutorial we are going to write full program of disjoint set union find advance data structure in c++. Problem Description: Disjoint Set Union (DSU) is an advance data structure, which basically uses in graph algorithms to find cycles. Codes: Method1: Brute Force #include<bits/stdc++.h> using namespace std; int find(int f,vector<int>&dsuf){ if(dsuf[f]==-1) return f; return find(dsuf[f],dsuf); } void union_op(int from, int to, vector<int>& dsuf){ dsuf[from]=to; } bool isCycle(vector<pair<int,int> >&edge_list, vector<int>&dsuf){ for(int i=0;i<edge_list.size();i++){ int parent1=find(edge_list[i].first,dsuf); int parent2=find(edge_list[i].second,dsuf); if(parent1==pare...

Linked List Data Structure | Add Two Number Explanation

Introduction: In this tutorial, we are going to solve a very famous problem on Linked List. It is also an important question for coding interview. so let's see the problem and understand it in detail. Problem Statement: There are two numbers and each digit of number is represented by a node of linked list.and we have to add these two numbers, which is given in the form of linked list. Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8 eg: num1 = 2354; num2 = 875; see the image below: Solution: Now let's solve it. In this problem there may be three possibilities. First: Number of Nodes in the first linked list is greater than second linked list. Second: Number of Nodes in first linked list is less than second list. Third: Number of Nodes in the both linked list is equal. Here number of nodes means number of digits in both number. Another thing we have to keep in mind is that if we add two digits then there may be possibility of gen...

Integrating Frontend to Backend | MERN stack(100% working)

How to Integrate frontend to backend in MERN stack? For integrating the frontend to backend just do two things. Step1: Go and install cors on both side (front end as well as backend) To install cors simply open the folder into terminal and type npm install cors--save. step 2: just go to your front end section(react app) open package.json file. and just add one line into package.json file. "proxy":"http://localhost:4000" here i am using 4000, so what is 4000 ?. this is the port on which our backend is listening. so it may be possible that u may have other port number on which your server is listening. so put yours port number on which your backend server is listening. and this proxy thing we have to add in frontend part not in backend part. Now it may be possible that you want to know ...

programming for beginners

Search This Blog