Dhaka International University

Assignment
On

Structured Programming
Course No: Structured Programming 104

Submitted To: Submitted By:

Md. Nur-A-Alam Sanjay Chandro Sarker

Lecturer Roll: 07

Department of CSE Reg No: CS-E-88-21-115208

Dhaka International University Batch : 88th

Semester: 2nd

Department of CSE

Dhaka International University

Date of Submission: 20-11-2021

Lab No : 01

Lab Name : C Program to Swap Two Numbers

Source Code:
#include<stdio.h>

int main(){
int temp, num1, num2;
printf("Enter The Value Of: Num1 & Num2 \n");
scanf("%d %d", &num1, &num2);

temp = num1;
num1 = num2;
num2 = temp;
printf("%d \n%d", num1, num2);
}

Output :
Lab No : 02

Lab Name : C Program to Check Whether a Number is Even Or Odd

Source Code:
#include<stdio.h>

int main(){
int n;
printf("Enter The Value Of: N \n");
scanf("%d", &n);

if(n%2 == 0){
printf("Even Number");
}
else{
printf("Odd Number");
}
}

Output :
Lab No : 03

Lab Name : C Program to Check Find Factorial of a Number

Source Code:
#include<stdio.h>

int main(){
int i=1, fact=1, n;
printf("Enter The Value Of N : \n");
scanf("%d",&n);

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

fact = fact * i;
}
printf("%d\n", fact );
}

Output :
Lab No : 04

Lab Name : C Program to Check Whether a Number is Prime or Not

Source Code:
#include<stdio.h>

int main(){
int i=2, n, count=0;
printf("Enter The Value Of N: ");
scanf("%d", &n);

while(i<n){
if(n%i == 0){
count++;
break;
}
i++;
}
if(n == 1){
printf("%d is neither prime nor composite", n);
}
else{
if(count == 1){
printf("%d is a not Prime Number", n);
}
else{
printf("%d is a Prime Number",n);
}
}
}
Output :
Lab No : 05

Lab Name : C Program to print Fibonacci Sequence using recursion

Source Code:
#include<stdio.h>

int fibo(int);
int main(){
int i,n;
printf("Enter The Value Of N: ");
scanf("%d", &n);

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

printf("%d \n",fibo(i));
}
}
int fibo(int x){
if ( x == 0 )
return 0;
else if ( x == 1 )
return 1;
else
return fibo(x-1) + fibo(x-2) ;
}

Output :
Lab No : 06

Lab Name : C Program for GCD of two numbers using recursion

Source Code:
#include <stdio.h>

int gcd(int n1, int n2);

int main() {
int n1, n2;
printf("Enter two positive integers: ");
scanf("%d %d", &n1, &n2);
printf("G.C.D of %d and %d is %d.", n1, n2, gcd (n1, n2));
return 0;
}

int gcd (int n1, int n2) {

if (n1 == 0)
return n2;
else if(n2==0)
return n1;
else
return gcd (n2, n1 % n2);
}

Output :
Lab No : 07

Lab Name : C program to count digits of number using recursion

Source Code:
#include<stdio.h>

int func(int n);

int main(){
int n;
printf("Enter The Value: ");
scanf("%d",&n);

printf("Number of digits is : %d",func(n));

}
int func(int n){
static int count=0;
if(n!=0){
count++;
return func(n/10);
}
else{
return count;
}
}

Output :
Lab No : 08

Lab Name : C Program to calculate the sum n natural number using recursion

Source Code:
#include<stdio.h>

int summation(int n);

int main(){
int n;
printf("Enter The Value Of N:");
scanf("%d",&n);
printf("Summation= %d",summation(n));
}
int summation(int n){
if(n == 0)
return n;
else
return n+summation(n-1);
}

Output :
Lab No : 09

Lab Name :  C Program to print Palindrome or not Palindrome

Source Code:
#include<stdio.h>

int main(){
int num,sum=0,original,r;
printf("Palindrome of Number :");
scanf("%d",&num);
original=num;

while (num>0){
r=num%10;
sum=(sum*10)+r;
num=num/10;
}
if(original==sum){
printf(" This is Number of Palindrome");
}
else {
printf(" This is Not Number of Palindrome");
}
}

Output :
Lab No : 10

Lab Name :  C program to print pyramid

Source Code : (i)

#include<stdio.h>

int main(){
int i,n,j;
printf("Enter The Value Of n: ");
scanf("%d",&n);

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

for(j=0; j<=i; j++){
printf("*");
}
printf("\n");
}
}
Output : (i)

Source Code : (ii)

#include<stdio.h>
int main(){
int i,n,j;
printf("Enter The Value Of n: ");
scanf("%d",&n);
for(i=0; i<n; i++){
for(j=0; j<=i; j++){
printf("%d",j);
}
printf("\n");
}
}
Output : (ii)

Source Code : (iii)

#include<stdio.h>

int main (){

int i,j,k,num;
printf("Piramit of Number:");
scanf("%d",&num);
for(i=0; i<num; i++){
for(k=0; k<num-i-1; k++){
printf(" ");
}
for(j=0; j<2*i+1; j++){
printf("*");
}
printf("\n");
}
}
Output : (iii)