Skip to main content

C programs QnA

Q. If sum of two integer is 14 and if one of them is 8 then find other integer. Ans: Well, this is very simple. Simply, one integer is 8 and sum of two integers is 14. So, we need to subtract the number 8 from their sum of 14 to get the second number. So, the second number is: 14 - 8 = 6 C-Program of this task Code---> #include<stdio.h> int main () { int num1 = 8 , num2 , sum = 14 ; num2 = sum - num1 ; printf ( "The second number is: %d" , num2 ); return 0 ; }

Division in C++ Language(integer division) without and with Class



In this C++ program we will calculate the division between two numbers and print the result, in the screen. The two numbers will be taken from the user.

input:

Two numbers. (i.e. 15,05 etc.)

output:

Devision between the given numbers will be printed on the screen.

CODE---->


#include<iostream>
using namespace std;
main()
{
int a,b,div;
cout<< " \nEnter a Number : " ;
cin>>a;
cout<< "\nEnter another Number : " ;
cin>>b;
div=a/b;
cout<< "\nThe result is : " <<a <<"/" <<b <<"=" <<div <<endl ;
system("pause") ;
}



Don't just read, write it, run it.....

RESULT:


With Class

#include<iostream>
using namespace std;
class div
{
 private:
  int x,y;
 public:
  void get()
  {
   cout<<"Enter two numbers : ";
   cin>>x>>y;
  }
  void disp()
  {
   int c;
   c=x/y;
   cout<<"\nThe division of "<<x<<"/"<<y;
   cout<<" is : "<<c;
  }
};
int main()
{
 div s;
 s.get();
 s.disp();
 return 0;
}


Download the C++ Program file of this Program.

Don't just read, run on your pc !!!


RESULT :


Enter two numbers : 99
3

The division of 99/3 is : 33
--------------------------------
Process exited after 5.507 seconds with return value 0
Press any key to continue . . .


Images for better understanding :

Comments

Post a Comment

Popular posts from this blog

Linear Queue Program in C-Language

In this C program we will perform operations over Linear Queue ( i.e: Data insert Operation, Data remove Operation and display Operation ). The Choice( i.e: data insert,remove or display ) will be made by the user and The Number will be taken from the user( i.e: For Data insert Operation ). input: The Choice(i.e Data insert, remove or display) & The Number (integers) (i.e. for Data insert Operations) (15,10,128 etc.) output: The Operations will be excecuted as choosen by the user. CODE----> #include<stdio.h> #include<stdlib.h> #define MAXSIZE 10 int Q [ MAXSIZE ], front =- 1 , rear =- 1 ; void qinsert ( int x ) { if ( rear == MAXSIZE - 1 ) printf ( "\n Queue is Full." ); else if ( front ==- 1 ) { front = 0 ; rear = 0 ; Q [ front ]= x ; } else { rear ++; Q [ rear ]= x ; } } void qdelete () { if ( front ==- 1 ) printf ( "\n Queue is Empty." ); else if ( front == rear ) { printf ( "

Calculate sum of 5 numbers using Array in C-language

In this C -program we will scan the numbers using array and then we will calculate the sum of the given numbers, also using array. The numbers will be taken from the user. input: 5 numbers.(i.e : 5,6,9,56,548) output: The sum of the given numbers will be printed on the screen. CODE----> #include<stdio.h> #include<stdlib.h> main() { int arr[5],i,sum=0; printf ("       Enter Five numbers : "); for ( i=0 ; i<5 ; i++ ) {       scanf (" %d ",&arr[i]); } for ( i=0 ; i<5 ; i++ ) {      sum=sum+arr[i]; } printf (" \n      The sum of the given 5 numbers is : %d\n ",sum); system (" pause "); } Don't just read, write it, run it..... RESULT :

C-program of printing "Hello World", 10 times on the screen.

In this C program we will print "Hello World", 10 times on the screen. We will use "body-less-loop" for this C-Program. "Body-less-loop" : it means that the inner part(code block to be executed) of the loop will be empty and the loop will have a semi-colon(;) in it's end. i.e: for ( .....  ; .....  ; .....  ) ; input: Null. output: "Hello World" will be printed on the screen, 10 times. CODE----> #include<stdio.h> int main() {      int i;      for( i=1 ; i<=10 ;printf( "   Hello World ! \n ", i++ )) ;      return 0 ; } Don't just read, write it, run it..... RESULT :