Course
Introduction
C "Hello, World!" ProgramPrint an Integer (Entered by the User)Add Two IntegersMultiply Two Floating-Point NumbersFind ASCII Value of a CharacterCompute Quotient and RemainderFind the Size of int, float, double and charSwap Two NumbersDecision Making and Loops
Check Whether a Number is Even or OddCheck Whether a Character is a Vowel or ConsonantFind the Largest Number Among Three NumbersFind the Roots of a Quadratic EquationCheck Leap YearCheck Whether a Number is Positive or NegativeCheck Whether a Character is an Alphabet or notCalculate the Sum of Natural NumbersFind Factorial of a NumberGenerate Multiplication TableDisplay Fibonacci SequenceFind GCD of two NumbersFind LCM of two NumbersDisplay Characters from A to Z Using LoopCount Number of Digits in an IntegerReverse a NumberCalculate the Power of a NumberCheck Whether a Number is Palindrome or NotCheck Whether a Number is Prime or NotDisplay Prime Numbers Between Two IntervalsCheck Armstrong NumberDisplay Armstrong Number Between Two IntervalsDisplay Factors of a NumberMake a Simple Calculator Using switch...casePrint Pyramids and PatternsFunctions
Demonstrate the Working of Keyword longDisplay Prime Numbers Between Intervals Using FunctionCheck Prime or Armstrong Number Using User-defined FunctionCheck Whether a Number can be Expressed as Sum of Two Prime NumbersFind the Sum of Natural Numbers using RecursionFind Factorial of a Number Using RecursionFind G.C.D Using RecursionConvert Binary Number to Decimal and vice-versaConvert Octal Number to Decimal and vice-versaConvert Binary Number to Octal and vice-versaReverse a Sentence Using Recursioncalculate the power using recursionArrays and Pointers
Calculate Average Using ArraysFind Largest Element in an ArrayCalculate Standard DeviationAdd Two Matrices Using Multi-dimensional ArraysMultiply Two Matrices Using Multi-dimensional ArraysFind Transpose of a MatrixMultiply two Matrices by Passing Matrix to a FunctionAccess Array Elements Using PointerC Program Swap Numbers in Cyclic Order Using Call by ReferenceFind Largest Number Using Dynamic Memory AllocationStrings
Find the Frequency of Characters in a StringCount the Number of Vowels, Consonants and so onRemove all Characters in a String Except AlphabetsFind the Length of a StringConcatenate Two StringsCopy String Without Using strcpy()Sort Elements in Lexicographical Order (Dictionary Order)Structures and Unions
Store Information of a Student Using StructureAdd Two Distances (in inch-feet system) using StructuresAdd Two Complex Numbers by Passing Structure to a FunctionCalculate Difference Between Two Time PeriodsStore Information of Students Using StructureStore Data in Structures DynamicallyC++ Program to Store and Display Information Using Structure
To understand this example, you should have the knowledge of the following C++ programming topics:
In this program, a structure, student is created.
This structure has three members: name (string), roll (integer) and marks (float).
Then, we created a structure array of size 10 to store information of 10 students.
Using for loop, the program takes the information of 10 students from the user and displays it on the screen.
Example: Store Information in Structure and Display it
#include <iostream>
using namespace std;
struct student
{
char name[50];
int roll;
float marks;
} s[10];
int main()
{
cout << "Enter information of students: " << endl;
// storing information
for(int i = 0; i < 10; ++i)
{
s[i].roll = i+1;
cout << "For roll number" << s[i].roll << "," << endl;
cout << "Enter name: ";
cin >> s[i].name;
cout << "Enter marks: ";
cin >> s[i].marks;
cout << endl;
}
cout << "Displaying Information: " << endl;
// Displaying information
for(int i = 0; i < 10; ++i)
{
cout << "\nRoll number: " << i+1 << endl;
cout << "Name: " << s[i].name << endl;
cout << "Marks: " << s[i].marks << endl;
}
return 0;
}
Output
Enter information of students:
For roll number1,
Enter name: Tom
Enter marks: 98
For roll number2,
Enter name: Jerry
Enter marks: 89
.
.
.
Displaying Information:
Roll number: 1
Name: Tom
Marks: 98
.
.
.
Also Read: