Exercises to solve
Write a program which generates the first 15 Fibonacci numbers.
int main ()
{
int num[15], i;
num[0] = 0;
num[1] = 1;
for(i = 2; i <15;++i)
{
num[i] = num[i-2] + num[i-1];
}
for(i = 0;i <15;++i)
{
cout<<num[i];
}
}
===============================================================================================
Write a program to convert a positive number to another base.
int main()
{
static char hex[16] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F' };
int num[64]
long int numtoconv;
int base,index = 0,nextnum;
cout<<"Enter the number to be converted";
cin>>numtoconv;
cout<<"Enter the base";
cin>>base;
do
{
num[index] = numtoconv %base;
++index;
numtoconv = numtoconv / base;
}
while(numtoconv != 0);
cout<<"Result is";
for(--index; index >= 0; --index)
{
nextnum = num[index];
cout<<hex[nextnum];
}
}
===============================================================================================
Write a program to find square root of a number
float findabs(float num)
{
if(num < 0){x = -x;}
return x;
}
float squareroot(float num)
{
float epsilon = 0.0001;
float guess = 1.0;
while(findabs(guess * guess -num) >= epsilon)
guess = (num / guess + guess) / 2.0;
return guess;
}
int main ()
{
float num;
cout<<Enter a number";
cin>>num;
cout<<"Square root of teh number is"<<squareroot(num);
}
===============================================================================================
Go back to Part 1
int main ()
{
int num[15], i;
num[0] = 0;
num[1] = 1;
for(i = 2; i <15;++i)
{
num[i] = num[i-2] + num[i-1];
}
for(i = 0;i <15;++i)
{
cout<<num[i];
}
}
===============================================================================================
Write a program to convert a positive number to another base.
int main()
{
static char hex[16] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F' };
int num[64]
long int numtoconv;
int base,index = 0,nextnum;
cout<<"Enter the number to be converted";
cin>>numtoconv;
cout<<"Enter the base";
cin>>base;
do
{
num[index] = numtoconv %base;
++index;
numtoconv = numtoconv / base;
}
while(numtoconv != 0);
cout<<"Result is";
for(--index; index >= 0; --index)
{
nextnum = num[index];
cout<<hex[nextnum];
}
}
===============================================================================================
Write a program to find square root of a number
float findabs(float num)
{
if(num < 0){x = -x;}
return x;
}
float squareroot(float num)
{
float epsilon = 0.0001;
float guess = 1.0;
while(findabs(guess * guess -num) >= epsilon)
guess = (num / guess + guess) / 2.0;
return guess;
}
int main ()
{
float num;
cout<<Enter a number";
cin>>num;
cout<<"Square root of teh number is"<<squareroot(num);
}
===============================================================================================
Go back to Part 1