Skip to main content

Practice Question on Functions in C++

 Coding questions on functions

Ques1. Write a program to print all prime numbers between 2 given numbers.

#include<iostream>

#include<math.h>

using namespace std;

bool isPrime(int num){

for(int i=2;i<=sqrt(num);i++){

if(num%i==0){

return false;

}

}

return true;

}

int main(){

int a,b;

cin>>a>>b;

for(int i=a;i<=b;i++){

if(isPrime(i)){

cout<<i<<endl;

}

}

return 0;

}

Ques2. Write a program to print Fibonacci sequence.

#include<iostream>

using namespace std;

void fib(int n){

int t1=0;

int t2=1;

int nextTerm;

for(int i=1;i<=n;i++){

cout<<t1<<endl;

nextTerm=t1+t2;

t1=t2;

t2=nextTerm;

}

return;

}

int main(){

int n;

cin>>n;

fib(n);

return 0;

}

Ques3. Write a program to find the factorial of a given number.

#include<iostream>

using namespace std;

int fact(int n){

int factorial=1;

for(int i=2;i<=n;i++){

factorial*=i;

}

return factorial;

}

int main(){

int n;

cin>>n;

int ans = fact(n);

cout<<ans<<endl;

return 0;

}

Ques4. Write a program to find the binary coefficient (nCr)

#include<iostream>

using namespace std;

int fact(int n){

int factorial=1;

for(int i=2;i<=n;i++){

factorial*=i;

}

return factorial;

}

int main(){

int n,r;

cin>>n>>r;

int ans = fact(n)/(fact(r)*fact(n-r));

cout<<ans<<endl;

return 0;

}

Ques5. Write a program to print the Pascal triangle.

#include<iostream>

using namespace std;

int fact(int n){

int factorial=1;

for(int i=2;i<=n;i++){

factorial*=i;

}

return factorial;

}

int main(){

int n;

cin>>n;

for(int i=0;i<n;i++){

for(int j=0;j<=i;j++){

cout<<fact(i)/(fact(j)*fact(i-j))<<" ";

}

cout<<endl;

}

return 0;

}

Practice questions

Ques6. Write a program to find out whether a given number is even or odd using functions.

Ques7. Write a program to find out whether a given character is an alphabet or not using functions.

Ques8. Write a program with two functions to print the maximum and the minimum number respectively among three numbers entered by user.



Instagram 👇 

For more Queries

Comments

Post a Comment

Popular posts from this blog

Sorting Techniques : Selection Sort , Bubble Sort , Insertion Sort

Sorting Techniques 1. Selection Sort: Idea: The inner loop selects the minimum element in the unsorted array  and places the elements in increasing order. Time complexity: O(N 2 ) #include <iostream> using namespace std; int main() {     int n;     cin>>n;   int arr[n];    for(int i=0;i<n;i++){          cin>>arr[i];   }  for(int i=0;i<n-1;i++){       for(int j=i+1;j<n;j++){            if(arr[j]<arr[i]){                 int temp =arr[j];                  arr[j]=arr[i];             arr[i]=temp;           }           }      }for(int i=0;i<n;i++){       cout<<arr[i]<<" ";    }   return 0; } 2. Bubble Sort: Idea: ...

Time and Space complexity : What does time and space complexity mean?

 Time and Space complexity                                  Time Complexity Time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the input. Types of notations 1. O-notation: It is used to denote asymptotic upper bound. For a given function g(n), we denote it by O(g(n)). Pronounced as “big-oh of g of n”. It also known as worst case time complexity as it denotes the upper bound in which algorithm terminates. 2. Ω-notation: It is used to denote asymptotic lower bound. For a given function g(n), we denote it by Ω(g(n)). Pronounced as “big-omega of g of n”. It also known as best case time complexity as it denotes the lower bound in which algorithm terminates. 3. !-notation: It is used to denote the average time of a program. Comparison of functions on the basis of time complexity It follows the following order in case of time complexit...