Scribd
Upload
8 views7 pages

Static Question Unit2

fg

Uploaded by

sagardhoke2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views7 pages

Static Question Unit2

fg

Uploaded by

sagardhoke2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

1.

#include<stdio.h>
int main()
{
int marks;
char grade;
scanf("%d",&marks);
if(marks>100 || marks<0)
{
printf("Invalid input");
}
else
{
if(marks>=90 && marks<=100)
printf("Grade: A");
else if(marks>=80 && marks<=89)
printf("Grade: B");
else if(marks>=70 && marks<=79)
printf("Grade: C");
else if(marks>=60 && marks<=69)
printf("Grade: D");
else if(marks>=45 && marks<=59)
printf("Grade: E");
else
printf("Grade: F");
}
}
2.
#include<stdio.h>
int main()
{
int n1,n2;
char opr;
scanf("%d%d %c",&n1,&n2,&opr);
switch(opr)
{
case '+':
printf("%d",n1+n2);
break;
case '-':
printf("%d",n1-n2);
break;
case '*':
printf("%d",n1*n2);
break;
default:
printf("INVALID");
break;
}
}
3.
#include<stdio.h>
int main()
{
int num,n1=0,n2=1,sum;
scanf("%d",&num);
if(num==1)
printf("%d",n1);
else if(num==2)
printf("%d %d",n1,n2);
else if(num>2)
{
printf("%d %d",n1,n2);
num=num-2;
while(num>0)
{
sum = n1 + n2;
printf(" %d",sum);
n1=n2;
n2=sum;
num--;
}
}
}
4.
#include<stdio.h>
#include<math.h>
int main()
{
int num,result=0,digit=0,Onum1,Onum2,Lastdig;
scanf("%d",&num);
Onum1 = num;
Onum2 = num;
while(num>0)
{
digit++;
num = num/10;
}
digit= digit-1;
while(Onum1>0)
{
Lastdig = Onum1%10;
result = result + Lastdig*((int)pow(10,digit));
digit--;
Onum1 = Onum1/10;
}
if(Onum2==result)
printf("Palindrome");
else
printf("Not a Palindrome"); }
5.
#include<stdio.h>
int main()
{
int num,result=0,digit;
scanf("%d",&num);
do
{
digit = num%10;
result = result + (digit*digit) ;
num = num/10;
}
//printf("%d",result);
while(num>0);
printf("%d",result);
}
6.
#include<stdio.h>
int main()
{
int range1, range2,sum=0;
scanf("%d%d",&range1,&range2);
for(int i = range1; i<=range2; i++)
{
if(i%2==0)
continue;
else
sum = sum+i;
}
printf("%d",sum);
}
7.
#include<stdio.h>
int main()
{
long long int rem,num,Onum,result,rev=0;
scanf("%lld",&num);
Onum = num;
while(num>0)
{
rem = num%10;
result=1;
while(rem>0)
{
result = result*rem;
rem=rem-1;
}
rev = rev + result;
num = (long long int)(num/10);
}
if(rev == Onum)
printf("Strong number");
else
printf("Not a strong number");
}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy