Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
C program to Print Fibonacci series upto n using recursion:
int fibo(long int);
void main()
{
long int a=0,n;
printf ("how many terms");
scanf("%d",&n);
for(int i=1;i<=n;i++)
{a=fibo(i);
printf("%d ",a);
}
fibo(long int m)
long int x;
if(m>2)
x=fibo(m-1)+fibo(m-2);
return x;
else if(m==2)
return 1;
else if(m==1)
{return 0;}
OUTPUT
program and solution for the above question
calculate skewness and kurtosis
Create Complex number using constructor: class complex { private:
Smugglers are becoming very smart day by day. Now they have developed a new technique of sending their messages from one smuggler to another. In their new technology, they are send
Virtual Base Classes This ambiguity can be resolved if the class derived have only one copy of the class base. This can be done by making the base class a virtual class. This k
Damjibhai and Shamjibhai are two jeweler friends. They decide to play a simple game. The game comprises of removing the jewels for polishing, turn by turn. Once a jewel is removed
exemples of many to many
Defines the entry point for the console application. // #include "stdafx.h" #include #include #include"conio.h" using namespace std; double Determinant(double a[][3],int forde
Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.
evolutio of object oriented programing
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd