Skip to main content

C++ Programming


How to run C++ program on your computer

To run any programming language on your local machine or computer you need a compiler first. The compiler reads each and every line of your program. It interprets line by line actually. If there is no error in the program, they only go ahead to run your particular program. In our case, we are using the "DEV C++" compiler to run our programs. You can easily download and install the "DEV C++ application file" or .exe file from the internet.


How to save C++ files on your computer

You simply go to your "DEV C++" and then click on "new" in the file section in the upper tabs. Then save the file adding the ".cpp" extension. For example, if your program name is "myfirstprogram" then save it as "myfirstprogram. cpp". 


Hello World program in C++

#include <iostream> 
using namespace std;           // it calls the library
int main() {                         // it defines the method main()
cout << "Hello World!";  // 'cout' is used for printing
return 0;                             // it returns only one value
}


Result

Hello World!


In the above program, "using namespace std;" calls a library that has a set of signs that are used to identify and refer to objects of various kinds. Here in the 3rd line main() is a method. 



How To Add Comments in C++ Programming

To add comments in C++ Programming you need to write "//", then write your comment. 

For Example

#include <iostream>

using namespace std;

int main() {

int x = 22; //declaring of variable x

if (x >= 10) {

cout << "It is true";

}

else {

cout << "It is false";

}

/* 

It is a comment on multiple lines

If...else is used for adding conditions in C programming

*/

return 0;

}


Here, in the above code single line comment is written after "//". But if comments contain multiple lines then we use "/* Your Comment of multiple lines */" as shown in the above code.



Declaring of Variable in C++

In all programming languages, we declare some variable for specific purposes.


#include <iostream>

using namespace std;

int main() {

  int x = 5;

  int y = 10;

  int sum = x + y;

  cout << "Value of x + y = " << sum;

}


Result

Value of x + y = 15


Here in the above code, we've declared two variables x = 5, and y=10.



'Else If' Condition in C++ Programming

#include <iostream>

using namespace std;

int main() {

  int product;

  cout << "Enter the number of product: ";

  cin >> product; 

  if (product < 500) {

    cout << "Total price = " << product*20;

  } else if (product >= 500 && product < 1000) {

    cout << "Total price = " << product*18;

  } else {

    cout << "Total price = " << product*15;

  }

  return 0;

}


Result

Enter the number of products: 400

Total price = 8000


We implemented three different conditions for an e-commerce application for the wholesale market in the code above. If you buy less than 500 items, you'll have to pay $20 for each one. If you buy more than 500 but fewer than 1000 units, you pay 18 dollars for each unit. The third condition is that if you purchase more than 1000 items, you will be charged $15 for each item.

 

While For - Loop in C++ Programming


We often need to run a loop inside a program to run several iterations and impose many logics, conditions, etc. 


Example

In a school sport, a group of three pupils will compete in a three-round running race. After each round, you must record the time taken by each student. Calculate the average time taken by each student over the three rounds once they have completed all of the rounds, and choose the student with the lowest average timing as the best runner. If more than one student meets the minimum average timing criteria, they must all be chosen. Show the fastest runner's name and average timing.


Solution in C++

Inputs:

The time taken by three students over three rounds to complete a 100-meter run is as follows

Student A: 8, 9, 9 (in second)

Student B: 9, 8, 12 (in second)

Student C: 7, 11, 9 (in second)

Condition:

All students will be judged unfit if they fail to maintain an average timing of 12 seconds over the three rounds, or if the time average taken by all students is greater than 12 seconds.

The input of the code is below:

8

9

7

9

8

11

9

12

9

Code:

#include <iostream>

#include <cmath>

using namespace std;

int main() {

int x, T1=0, T2=0, T3=0, count=1;

double A1, A2, A3;

while (count <=9)

{

cin >> x;

if(count%3==1)

T1=T1+x;

else if(count%3==2)

T2=T2+x;

else

T3=T3+x;

count++;

}

A1= (T1/3);

A2= (T2/3);

A3= (T3/3); 

if(A1>=12 && A2>=12 && A3>=12) {

cout<<"All trainees are unfit";

return 0;

}

if(A1<=A2 && A1<=A3){

cout<<"Student A"<<endl;

}

if(A2<=A1 && A2<=A3){

cout<<"Student B"<<endl;

}

if(A3<=A1 && A3<=A2){

cout<<"Student C"<<endl;

}

return 0;

}

Result:

Student A


We can say Student A takes less average time to cover 3 rounds of 100 meters runs.


 

Solve the following C Programs

#include<stdio.h>
int main() {
int a=2,b=2;
a=b<<a;
printf("%d", a);
return 0;
}


Output: 8


Explanation:

Operator "<<" denotes the left shifting of bits and operator ">>" denotes the right shifting of bits.

So, here operation occurs in bit level

b = 2 = binary 10; If we shift bits in the left direction by 2 places then it will be 1000 which is equal to decimal 8

So, the output will be 8 in the above code.



Contact Us

Name

Email *

Message *

Popular Posts

CMOS Logic Gates: Inverter, NAND, and NOR

CMOS Logic Gates: Inverter, NAND, and NOR Complementary metal–oxide–semiconductor (CMOS) technology forms the backbone of modern digital IC design. Patented by Frank Wanlass in 1963 ( US patent 3,356,858 ), CMOS enables low-power, high-speed, and noise-immune logic circuits. CMOS gates, including inverters, NAND, and NOR, are widely used in both large-scale and small-scale integrated circuits due to their efficiency and versatility. CMOS Inverter A CMOS inverter consists of a complementary pair of PMOS and NMOS transistors. The PMOS transistor connects to the supply voltage V DD , while the NMOS connects to ground. The input voltage V IN controls both gates, and the output voltage V OUT is taken from the connected drains. CMOS inverters are highly energy-efficient and produce minimal heat due to their comple...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ ๐Ÿ“Š Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) ๐Ÿ“ฅ Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading ๐Ÿ“‚ View All Question Papers June 2026 - Question Paper Download PDF June 202...

Decision Feedback Equalizer (DFE) in MATLAB

  MATLAB Code M = 4; % QPSK numSymbols = 10000; numTrainingSymbols = 5000; chtaps = [1 0.5*exp(1i*pi/6) 0.1*exp(-1i*pi/8)]; % Generate QPSK symbols data = randi([0 M-1], numSymbols, 1); tx = pskmod(data, M, pi/4); % DFE setup eq = comm.DecisionFeedbackEqualizer; eq.ReferenceTap = 1; eq.NumForwardTaps = 5; eq.NumFeedbackTaps = 3; % SNR sweep snrVec = 0:5:25; % 0,5,10,...25 dB berBefore = zeros(size(snrVec)); berAfter = zeros(size(snrVec)); for k = 1:length(snrVec) % Apply channel and AWGN rx = awgn(filter(chtaps,1,tx), snrVec(k), 'measured' ); % BER before equalization rxDataNoEq = pskdemod(rx, M, pi/4); [~, berBefore(k)] = biterr(data, rxDataNoEq); % Equalize [y,~,~] = eq(rx, tx(1:numTrainingSymbols)); % Phase correction phaseOffset = angle(mean(conj(tx(1:numTrainingSymbols)) .* y(1:numTrainingSymbols))); yCorrected = y * exp(-1i*phaseOffset); % BER after equalization rxDataEq = pskdemod(yCorrected, M, pi/4); [...

Online Simulator for Frequency Modulatiuon and Demodulation

FM Modulation Simulator Frequency Modulation (FM) In Frequency Modulation, the frequency of the carrier signal varies in accordance with the message signal's amplitude. s FM (t) = A c cos(ฯ‰ c t + k f ∫m(t)dt) where ฯ‰ = 2ฯ€f & k f = Frequency Sensitivity Modulation index, ฮฒ = (k f * A m ) / f m Change the parameter values to see the effect. Message Freq (Hz) 1 Carrier Freq (Hz) Message Amplitude (Am) Kf (sensitivity): 50 Perform FM Demodulation ๐Ÿงช Experiment for Students: ...

Filter & Q-Factor Online Simulation

Unified Filter & Q-Factor Analyzer Exploring Gain, Selectivity, ripples, and Side-Lobes Design Relationship Q = f c / BW BW = -- Hz Transfer Function Characteristic |H(f)| ≈ 1 / √(1 + ฮต 2 C n 2 ) Control Panel Filter Type: Butterworth (Flat / No Lobes) Chebyshev (Equiripple / Side-Lobes) Center Frequency: 1000 Hz Quality Factor (Q): 5.0 Ripple/Lobe Intensity: 0.5 Recommended Design Multiple Feedba...

Superheterodyne Receiver Online Simulator

Superheterodyne Receiver Simulator Simulation Controls Message Frequency (Hz): Carrier Frequency (Hz): Intermediate Frequency (Hz): Sampling Frequency (Hz): Simulation Duration (s): Run Simulation Signal Plots Numerical Values (first 10 samples) Superheterodyne Receiver Workflow The superheterodyne receiver converts a received RF signal to an intermediate frequency (IF) to simplify filtering and amplification, and finally recovers the original message signal. Steps: Input Message Signal: A low-frequency signal m(t) (e.g., sine wave). RF Modulation (AM): The message modulates the carrier with amplitude modulation: RF(t) = [1 + K_a * m(t)] * cos(2ฯ€ f_c t) Mixing with Local Oscillator (LO): The RF signal is multiplied by a local oscillator LO(t) = cos(2ฯ€ f_LO t) to produce: IF(t) = RF(t) * LO(t) Intermediate Frequency Filtering: A low-pass filter extracts t...

Online Simulator for ASK, FSK, and PSK Signal Generation

Interactive Digital Signal Processing (DSP) Tutorial and Simulator for ASK, FSK, and BPSK modulation techniques. Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Digital Modulation Visualizer: ASK, FSK, & BPSK Simulator Learn and visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. Perfect for DSP students and engineers. ๐Ÿ“ก ASK Simulator ๐Ÿ“ถ FSK Simulator ๐ŸŽš️ BPSK Simulator ๐Ÿ“š More Topics ASK Modulator FSK Modulator BPSK Modulator Demodulation More Topics 1. ASK (Ampli...

Consider a discrete memoryless source with an alphabet of four source symbols. s(t) is a multi-level (-1, 0, +1, +2) ...

  Q. Consider a discrete memoryless source with an alphabet of four source symbols. The signal s(t) has four levels (-1, 0, +1, +2) and generates 10 4 symbols per second. Find the equivalent Nyquist bandwidth. (A) 10 kHz (B) 64 kHz (C) 5 kHz (D) 20 kHz  Given Number of signal levels: M = 4 Symbol rate: R s = 10 4 symbols/s Signal levels: -1, 0, +1, +2 Calculate Nyquist bandwidth For ideal Nyquist signaling, the minimum bandwidth can be expressed in terms of the symbol rate: B = R s / 2 B = 10,000 / 2 = 5,000 Hz Correct answer Option (C) — 5 kHz Using the symbol-rate definition of Nyquist bandwidth, B = R s /2 gives 5 kHz. Don't confuse symbol rate with ...