Beruflich Dokumente
Kultur Dokumente
#include<stdio.h>>
using namespace std;
void prime( int *,int * );
int main()
{
int start, end;
cout <<"enter starrt of range "<<endl;
cin>>start;
cout<<"enter end of range"<<endl;
cin>>end;
cout<<endl;
prime( &start,&end );
return 0;
system ("pause");
}
void prime( int *start, int *end )
{
int flag;
for(int i=*start;i<=*end;i++)
{
if(i>1)
{
flag=true;
for(int j=2;j<=i/2;j++)
{
if(i%j==0)
{
flag=0;
break;
}
}
if(flag==true)
{
cout<<i<<" is a prime
number"<<endl;
}
}
}
}
#include<iostream>
#include<stdio.h>>
using namespace std;
void prime( int *,int * );
void sort(int[],int);
int main()
{
int start, end;
cout <<"enter starrt of range "<<endl;
cin>>start;
cout<<"enter end of range"<<endl;
cin>>end;
cout<<endl;
prime( &start,&end );
return 0;
system ("pause");
}
void prime( int *start, int *end )
{
int flag, index=0, array1[1000], sum=0;
for(int i=*start;i<=*end;i++)
{
if(i>1)
{
flag=true;
for(int j=2;j<=i/2;j++)
{
if(i%j==0)
{
flag=0;
break;
}
}
if(flag==true)
{
array1[index]=i;
index=index+1;
sum=sum+1;
cout<<i<<" is a prime number"<<endl;
}
}
}
cout<<endl;
sort(array1,sum);
}
void sort (int array1[] , int sum)
{
int temp, startarray=0,endarray=sum-1;
cout<<"prime numbers in descending order"<<endl;
do
{
temp=array1[endarray];
array1[endarray]=array1[startarray];
array1[startarray]=temp;
startarray=startarray+1;
endarray=endarray-1;
}
while(startarray<endarray);
for(int i=0;i<sum; i++)
{
cout<<array1[i]<<endl;
}
}
#include<iostream>
using namespace std;
void prime( int *,int * );
void sort(int[],int);
void factorialrange( int *,int * );
void factorial(int);
int main()
{
int start, end;
cout <<"enter starrt of range "<<endl;
cin>>start;
cout<<"enter end of range"<<endl;
cin>>end;
cout<<endl;
prime( &start,&end );
factorialrange(&start,&end) ;
return 0;
system ("pause");
}
void prime( int *start, int *end )
{
int flag, index=0, array1[1000], sum=0;
for(int i=*start;i<=*end;i++)
{
if(i>1)
{
flag=true;
for(int j=2;j<=i/2;j++)
{
if(i%j==0)
{
flag=0;
break;
}
}
if(flag==true)
{
array1[index]=i;
index=index+1;
sum=sum+1;
cout<<i<<" is a prime number"<<endl;
}
}
}
cout<<endl;
sort(array1,sum);
}
void sort (int array1[] , int sum)
{
int temp, startarray=0,endarray=sum-1;
cout<<"prime numbers in descending order"<<endl;
do
{
temp=array1[endarray];
array1[endarray]=array1[startarray];
array1[startarray]=temp;
startarray=startarray+1;
endarray=endarray-1;
}
while(startarray<endarray);
for(int i=0;i<sum; i++)
{
cout<<array1[i]<<endl;
}
cout<<endl;
}
void factorialrange( int *start, int *end )
{
for(int i=*start; i<=*end;i+
+)
{
factorial(i);
}
}
void factorial(int i)
{
long double factorial=1;
cout<<"factorial of
"<<i<<" is ";
for(int j=i;j>0;j--)
{
cout<<j;
if(j>1)
{
cout<<"*";
}
factorial=factorial*j;
}
cout<<" =
"<<factorial<<endl;
}
#include<iostream>
#include<stdio.h>
using namespace std;
void sum(int,int);
int main()
{
int num1, num2;
cout <<"enter first number "<<endl;
cin>>num1;
cout<<"enter second number"<<endl;
cin>>num2;
sum(num1,num2) ;
return 0;
system ("pause");
}
void sum(int num1, int num2)
{
int sum=0,carry=0, digit=0, rank=1 ;
while(carry>0||num1>0 || num2>0)
{
digit=carry+(num1%10)+(num2%10);
if(digit>7)
{
carry=1;
digit=digit%8;
}
else
{
carry=0;
}
sum=sum+(digit*rank);
rank=rank*10;
num1/=10;num2/=10;
}
cout<<endl<<sum<<endl;
}
Decimal Binary Octal Hexadecimal
0 0 0 0
1 1 1 1
2 10 2 2
3 11 3 3
4 100 4 4
5 101 5 5
6 110 6 6
7 111 7 7
8 1000 10 8
9 1001 11 9
10 1010 12 A
11 1011 13 B
12 1100 14 C
13 1101 15 D
14 1110 16 E
15 1111 17 F
16 10000 20 10
17 10001 21 11
18 10010 22 12
19 10011 23 13
20 10100 24 14
21 10101 25 15
22 10110 26 16
23 10111 27 17
24 11000 30 18
25 11001 31 19
26 11010 32 1A
27 11011 33 1B
28 11100 34 1C
29 11101 35 1D
30 11110 36 1E
31 11111 37 1F
32 100000 40 20
Decimal to binary
#include<iostream>
#include<stdio.h>
using namespace std;
void binaryconvert(int);
int main()
{
int num;
cout <<"enter first number "<<endl;
cin>>num;
binaryconvert(num1) ;
return 0;
system ("pause");
}
void binaryconvert(int num)
{
int rem,sum=0,i=1;
do
{
rem=num%2;
sum=sum + (i*rem);
num=num/2;
i=i*10;
} while(num>0);
cout<<"The binary of the given number is:"<<sum<<endl;
}
Lab1 task 1
#include<iostream>
using namespace std;
class calc
{
public:
int add(int a, int b)
{
c=a+b;
return c;
}
int sub(int a, int b)
{
c=a-b;
return c;
}
int mult(int a, int b)
{
c=a*b;
return c;
}
void div(int a, int b)
{
int d=a/b;
cout<<"\nQuotient: "<< d <<"\t\tRemainder: "<<remainder(a,b)<<"\n\n";
}
private:
int c;
int remainder(int a, int b)
{
c=a%b;
return c;
}
};
long double factorial (int a);
int main()
{
calc myCalc;
int x,y;
char choice;
cout<<"THIS IS A SIMPLE CALCULATOR\n\n";
cout<<"Enter choice of operation\n + for addition\n - for subtraction\n * for
multiplication\n /for division\n f for factorial\n" ;
cin>>choice;
cout<<"\nEnter First Number: ";
cin>>x;
cout<<"\nEnter Second Number: ";
cin>>y;
switch(choice)
{
case'+':
cout<<"\nSum: "<<myCalc.add(x,y)<<"\n\n";
break;
case'-':
cout<<"\nDiffernce: "<<myCalc.sub(x,y)<<"\n\n";
break;
case'*':
cout<<"\nProduct: "<<myCalc.mult(x,y)<<"\n\n";
break;
case'/':
myCalc.div(x,y);
break;
case'f':
cout<<"\nFactorial of first number : "<<factorial(x)<<"\n\n";
cout<<"Factorial of second number : "<<factorial(y)<<"\n\n";
break;
default:
cout<<"\ninvalid choice";
}
return 0;
}
long double factorial(int i)
{
long double factorial=1;
if ( i <= 1 )
return 1;
else
{
for(int j=i;j>0;j--)
{
factorial=factorial*j;
}
}
return factorial;
}
Lab1 task 2
#include<iostream>
using namespace std;
class calc
{
public:
int add(int a, int b)
{
c=a+b;
return c;
}
int sub(int a, int b)
{
c=a-b;
return c;
}
int mult(int a, int b)
{
c=a*b;
return c;
}
void div(int a, int b)
{
int d=a/b;
cout<<"\nQuotient: "<< d <<"\t\tRemainder: "<<remainder(a,b)<<"\n\n";
}
private:
int c;
int remainder(int a, int b)
{
c=a%b;
return c;
}
};
long double factorial (int a);
int main()
{
calc myCalc;
int x,y;
char choice;
cout<<"THIS IS A SIMPLE CALCULATOR\n\n";
cout<<"Enter choice of operation\n + for addition\n - for subtraction\n * for
multiplication\n /for division\n f for factorial\n" ;
cin>>choice;
cout<<"\nEnter First Number: ";
cin>>x;
cout<<"\nEnter Second Number: ";
cin>>y;
if (choice=='+')
{
cout<<"\nSum: "<<myCalc.add(x,y)<<"\n\n";
}
else if (choice=='-')
{
cout<<"\nDiffernce: "<<myCalc.sub(x,y)<<"\n\n";
}
else if (choice=='*')
{
cout<<"\nProduct: "<<myCalc.mult(x,y)<<"\n\n";
}
else if (choice=='/')
{
myCalc.div(x,y);
}
else if (choice=='f')
{
cout<<"\nFactorial of first number : "<<factorial(x)<<"\n\n";
cout<<"Factorial of second number : "<<factorial(y)<<"\n\n";
}
else
{
cout<<"\ninvalid choice";
}
return 0;
}
long double factorial(int i)
{
long double factorial=1;
if ( i <= 1 )
return 1;
else
{
for(int j=i;j>0;j--)
{
factorial=factorial*j;
}
}
return factorial;
}
Lab 6 task 1
#include<iostream>
#include<stdio.h>
#include<string>
using namespace std;
void func1(string);
int main()
{
string sentence1;
cout<<"enter sentence"<<endl;
getline(cin,sentence1);
cout<<"you entered "<<sentence1<<endl;
func1(sentence1);
return 0;
system("pause");
}
void func1(string sentence1)
{
for(int i=0;i<sentence1.length();i++)
{
sentence1[i]=sentence1[i]-32;
}
cout<<"your string in uppercase "<<sentence1<<endl;
}
Lab 5 task 1
#include<iostream>
#include<stdlib.h>
#include<math.h>
#include<cmath>
using namespace std;
void octalsum(int [], int);
void dectooct(int, int);
void dectohexa(int , int );
unsigned long convtodecnum(char[],int);
int main()
{
long int decnum1, decnum2 ;
int octnum1,octnum2;
cout<<"Enter first decimal number : "<<endl;
cin>>decnum1;
cout<<"Enter second decimal number : "<<endl;
cin>>decnum2;
dectooct(decnum1,decnum2);
dectohexa(decnum1,decnum2);
return 0;
system("pause");
}
void dectooct(int a,int b)
{
long int decnum[2], rem, quot;
decnum[0]=a;
decnum[1]=b;
int c=0,d=0,e=0,p=10, product=0, sumnum[2]={0,0};
sumnum[d]={0};
int octnum[2][100]={0};
for(int k=0;k<2;k++)
{
int i=1, j;
quot=decnum[k];
while(quot!=0)
{
octnum[c][i++]=quot%8;
quot=quot/8;
}
cout<<"Equivalent octal value of "<<decnum[k]<<" is ";
for(j=i-1;j>0;j--)
{
product=pow(p,j-1);
sumnum[d]=sumnum[d]+octnum[c][j]*product;
}
cout<<sumnum[d]<<endl;
c=c+1;
d=d+1;
}
octalsum(sumnum, 2);
}
void dectohexa(int decnum1,int decnum2)
{
long int decnum[2],rem,quot;
decnum[0]=decnum1;
decnum[1]=decnum2;
char hexdecnum[100];
unsigned long sumnum[2]={0};
int b=0,sum=0;
for(int a=0;a<2;a++)
{
int i=1, j, temp;
quot=decnum[a];
while(quot!=0)
{
temp=quot%16;
if(temp<10)
{
temp=temp+48;
}
else
{
temp=temp+55;
}
hexdecnum[i++]=temp;
quot=quot/16;
}
cout<<"Equivalent hexadecimal value of
"<<decnum[a]<<" is : ";
for(int j=i-1; j>0; j--)
{
cout<<hexdecnum[j];
}
cout<<endl;
sumnum[a]=convtodecnum(hexdecnum,i);
sum=sum+sumnum[a];
}
cout<<"sum of hexa value "<<hex<<decnum1<<" and "<<hex<<decnum2<<" is
"<<sum<<endl;
}
unsigned long convtodecnum(char hexdecnum[],int b)
{
const int base = 16;
unsigned long decnum = 0;
for (int i = 0; i < b; i++)
{
if (hexdecnum[i] >= 48 && hexdecnum[i] <= 57)
{
decnum += (((int)(hexdecnum[i])) - 48) * pow(base, b - i -
1);
}
else if ((hexdecnum[i] >= 65 && hexdecnum[i] <= 70))
{
decnum += (((int)(hexdecnum[i])) - 55) * pow(base, b - i -
1);
}
else if (hexdecnum[i] >= 97 && hexdecnum[i] <= 102)
{
decnum += (((int)(hexdecnum[i])) - 87) * pow(base, b - i -
1);
}
}
return decnum;
}
void octalsum(int sumnum[], int size )
{
int a=sumnum[0];
int b=sumnum[1];
int sum=0,carry=0,d=0,m=1;
while(a||b||carry)
{
d=0;
d=carry+(a%10)+(b%10);
a/=10;b/=10;
if(d>7)
{
carry=1;
d=d%8;
}
else
{
carry = 0;
}
sum += d*m;
m *= 10;
}
cout<<"sum of octal value "<<sumnum[0]<<" and "<<sumnum[1]<<" is "<<
sum<<endl;
}
Lab 5 task 1
#include<iostream>
#include<iomanip>
#include <conio.h>
int main()
int a, b;
cin >> a;
cin >> b;
add(a,b);
diff(a,b);
getch();
return 0;
cout << "\n\n1st entered number in HexaDecimal is: " << hex << x << endl;
cout << "2nd entered number in HexaDecimal is: " << hex << y << endl;
cout << "\nSum in Hexadecimal is: " << x + y << endl << endl;
cout << "1st entered number in OctaDecimal is: " << oct << x << endl;
cout << "2nd entered number in OctaDecimal is: " << oct << y << endl;
cout << "\nSum in Octadecimal is: " << x + y << endl << endl;
{
cout << "1st entered number in HexaDecimal is: " << hex << x << endl;
cout << "2nd entered number in HexaDecimal is: " << hex << y << endl;
cout << "\nDifference in Hexadecimal is: " << x - y << endl << endl;
cout << "1st entered number in OctaDecimal is: " << oct << x << endl;
cout << "2nd entered number in OctaDecimal is: " << oct << y << endl;
cout << "\nDifference in Octadecimal is: " << x - y << endl << endl;
}
Lab 6 task 2
#include <iostream>
#include<stdio.h>
#include <conio.h>
using namespace std;
void func1(string);
void func2(string,string);
int main()
{
string sentence1,sentence2;
cout<<"Enter first string: ";
getline(cin,sentence1);
cout<<"you entered "<<sentence1<<endl;
func1(sentence1);
cout<<"Enter Second string: ";
getline(cin,sentence2);
func2(sentence1,sentence2);
return 0;
system("pause");
}
void func1(string sentence1)
{
for(int i=0;i<sentence1.length();i++)
{
sentence1[i]=sentence1[i]-32;
}
cout<<"your string in uppercase "<<sentence1<<endl;
}
void func2(string sentence1,string sentence2)
{
char i,j,flag=0;
i=0;
j=0;
while(sentence1[i]!='\0')
{
i++;
}
while(sentence2[j]!='\0')
{
j++;
}
if(i!=j)
{
flag=0;
}
else
{
for(i=0,j=0;sentence1[i]!='\0',sentence2[j]!='\0';i++,j++)
{
if(sentence1[i]==sentence2[j])
{
flag=1;
}
}
}
if(flag==0)
{
cout<<"Strings are not equal";
}
else
{
cout<<"Strings are equal";
}
}
Lab 7 task 1
#include<iostream>
#include<iomanip>
#define LEN 20
char * msgs[5] = { " Thank you for the wonderful evening, ", "You certainly prove that a ", "is
aspecial kind of guy. We must get together", "over a delicious ", " and have a few laughs" };
struct names
char first[LEN];
char last[LEN];
};
struct guy
char favfood[LEN];
char job[LEN];
float income;
};
int main()
cout<<endl;
cout<<endl<<endl;
cout<<endl<<endl;
return 0;
system("pause");
}
Lab 7 task 2
#include<iostream>
void binaryconvert(int);
int main()
cin>>number1;
cin>>number2;
result=number1&number2;
// demonstrate bitwise |
result=number1|number2;
result=number1^number2;
result=number1>>1;
cin>>num;
binaryconvert(num);
return 0;
int rem,sum=0,i=1;
do
rem=num%2;
sum=sum + (i*rem);
num=num/2;
i=i*10;
} while(num>0);
}
#include<iostream>
int main()
char *arr2[3][15]={"asdasd","asdasd","asdasd"};
for(int i=0;i<=2;i++)
for(int j=0;j<15;j++)
cin>>arr2[i][j];
func1(arr2);
return 0;
for(int i=0;i<=2;i++)
for(int j=0;j<=15;j++)
cout<<arr2[i][j];
}
1 // Fig. 8.28: fig08_28.cpp
2 // Multipurpose sorting program using function pointers.
3 #include <iostream>
4 using std::cout;
5 using std::cin;
6 using std::endl;
7
8 #include <iomanip>
9 using std::setw;
10
11 // prototypes
12 void selectionSort( int [], const int, bool (*)( int, int ) );
13 void swap( int * const, int * const );
14 bool ascending( int, int ); // implements ascending order
15 bool descending( int, int ); // implements descending order
16
17 int main()
18 {
19 const int arraySize = 10;
20 int order; // 1 = ascending, 2 = descending
21 int counter; // array index
22 int a[ arraySize ] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 };
23
24 cout << "Enter 1 to sort in ascending order,\n"
25 << "Enter 2 to sort in descending order: ";
26 cin >> order;
27 cout << "\nData items in original order\n";
28
29 // output original array
30 for ( counter = 0; counter < arraySize; counter++ )
31 cout << setw( 4 ) << a[ counter ];
32
33 // sort array in ascending order; pass function ascending
34 // as an argument to specify ascending sorting order
35 if ( order == 1 )
36 {
37 selectionSort( a, arraySize, ascending );
38 cout << "\nData items in ascending order\n";
39 } // end if
40
41 // sort array in descending order; pass function descending
42 // as an argument to specify descending sorting order
43 else
44 {
45 selectionSort( a, arraySize, descending );
46 cout << "\nData items in descending order\n";
47 } // end else part of if...else
48
49 // output sorted array
50 for ( counter = 0; counter < arraySize; counter++ )
51 cout << setw( 4 ) << a[ counter ];
52
53 cout << endl;
54 return 0; // indicates successful termination
55 } // end main
56
57 // multipurpose selection sort; the parameter compare is a pointer to
58 // the comparison function that determines the sorting order
59 void selectionSort( int work[], const int size,
60 bool (*compare)( int, int ) )
61 {
62 int smallestOrLargest; // index of smallest (or largest) element
63
64 // loop over size - 1 elements
65 for ( int i = 0; i < size - 1; i++ )
66 {
67 smallestOrLargest = i; // first index of remaining vector
68
69 // loop to find index of smallest (or largest) element
70 for ( int index = i + 1; index < size; index++ )
71 if ( !(*compare)( work[ smallestOrLargest ], work[ index ] ) )
72 smallestOrLargest = index;
73
74 swap( &work[ smallestOrLargest ], &work[ i ] );
75 } // end if
76 } // end function selectionSort
77
78 // swap values at memory locations to which
79 // element1Ptr and element2Ptr point
80 void swap( int * const element1Ptr, int * const element2Ptr )
81 {
82 int hold = *element1Ptr;
83 *element1Ptr = *element2Ptr;
84 *element2Ptr = hold;
85 } // end function swap
86
87 // determine whether element a is less than
88 // element b for an ascending order sort
89 bool ascending( int a, int b )
90 {
91 return a < b; // returns true if a is less than b
92 } // end function ascending
93
94 // determine whether element a is greater than
95 // element b for a descending order sort
96 bool descending( int a, int b )
97 {
98 return a > b; // returns true if a is greater than b
99 } // end function descending
string1: cat
string2: cat
string3: cat
After concatenation:
string1: catacomb
string2: rat
string3: carpet
string4: catapult
string5: comb
#include <iostream>
#include<stdio.h>
#include<cstring>
int main()
char temp;
string sentence;
getline(cin,sentence);
cout<<sentence<<endl;
for(int i=0;i<sentence.length();i++)
for(int j=0;j<(sentence.length()-i-1);j++)
if (sentence[j]>sentence[j+1])
temp=sentence[j+1];
sentence[j+1]=sentence[j];
sentence[j]=temp;
cout<<"after "<<sentence<<endl;
return 0;
}
#include <iostream>
#include <iomanip>
#include <string>
#include<stdio.h>
using std::cout;
using std::endl;
using std::fixed;
using std::string;
using std::setprecision;
#ifndef COMMISSION_H
#define COMMISSION_H
class CommissionEmployee
public:
CommissionEmployee( const string &, const string &, const string &,
private:
string firstName;
string lastName;
string socialSecurityNumber;
#endif
#ifndef BASEPLUS_H
#define BASEPLUS_H
public:
BasePlusCommissionEmployee( const string &, const string &,
private:
#endif
int main()
CommissionEmployee commissionEmployee(
CommissionEmployee *commissionEmployeePtr = 0;
BasePlusCommissionEmployee basePlusCommissionEmployee(
BasePlusCommissionEmployee *basePlusCommissionEmployeePtr = 0;
// set floating-point output formatting
commissionEmployeePtr = &basePlusCommissionEmployee;
} // end main
CommissionEmployee::CommissionEmployee(
return firstName;
return lastName;
return socialSecurityNumber;
return grossSales;
commissionRate = ( rate > 0.0 && rate < 1.0 ) ? rate : 0.0;
return commissionRate;
// calculate earnings
BasePlusCommissionEmployee::BasePlusCommissionEmployee(
return baseSalary;
// calculate earnings
CommissionEmployee::print();
#include<stdio.h>
#include<conio.h>
#include <ctime>
#include <stdlib.h>
#include <string>
int main()
char choice;
cout<<"-----------------------------------------------------------------------------"<<endl;
cout<<"-----------------------------------------------------------------------------"<<endl;
string name;
getline(cin,name);
system ("CLS");
cout<<"-----------------------------------------------------------------------------"<<endl;
cout<<"------------------------------------------------------------------------------"<<endl;
cout<<" 3. On winning you will get double the amount you have bet"<<endl;
cout<<" 4. On losing you will lose the money you have bet"<<endl;
cout<<" 4. You can play untill you bankrupt or you win $100000"<<endl;
cout<<"------------------------------------------------------------------------------"<<endl;
getche();
int balance=100;
int bet;
do
system ("cls");
cin>>bet;
cout<<endl<<endl;
if ( bet<1)
cin>>bet;
getche();
while (balance<bet) {
cin>>bet;
system ("cls");
int d;
cout<<"Enter Any Number Between 1 and 10"<<endl<<endl;
cin>>d;
cout<<endl<<endl;
int e;
e= 1 + rand()%10;
if ( d==e)
balance=balance+bet;
else
cout<<"You Lose"<<endl<<endl;
cout<< "Hard luck! Winning number was "<<e<<endl<<endl;
balance= balance-bet;
if (balance==0){
cout<<"Game Over"<<endl;
system("pause");
return (0);
cout<<"y/n"<<endl;
cin>>choice;
while (choice=='y');
if (choice=='n'){
cout<<"Goodbye"<<endl;
}
system ("pause");
return 0;