1) What is the first step in problem-solving? A) Writing code B) Debugging C) Understanding the problem D) Optimizing the solution Answer: C 2) Which of these is not a step in the problem-solving process? A) Algorithm development B) Problem analysis C) Random guessing D) Testing and debugging Answer: C 3) What is an algorithm? A) A high-level programming language B) A step-by-step procedure to solve a problem C) A flowchart D) A data structure Answer: B 4) Which of these is the simplest data structure for representing a sequence of elements? A) Dictionary B) List C) Set D) Tuple Answer: B 5) What does a flowchart represent? A) Errors in a program B) A graphical representation of an algorithm C) The final solution to a problem D) A set of Python modules Answer: B 6) What is pseudocode? A) Code written in Python B) Fake code written for fun C) An informal high-level description of an algorithm D) A tool for testing code Answer: C 7) Which of the following tools is NOT commonly used in pr...
1) Hello World Program:
#include<stdio.h>
int main()
{
printf("Hello, World!");
return 0;
}
2) Program to Add Two Numbers:
#include<stdio.h>
int main()
{
int num1, num2, sum;
printf("Enter two numbers: ");
scanf("%d %d", &num1, &num2);
sum = num1 + num2;
printf("Sum = %d", sum);
return 0;
}
3) Program to Find Factorial of a Number:
#include<stdio.h>
int main()
{
int num, i, fact=1;
printf("Enter a number: ");
scanf("%d", &num);
for(i=1; i<=num; i++)
{
fact *= i;
}
printf("Factorial of %d = %d", num, fact);
return 0;
}
4) Program to Check Whether a Number is Prime or Not:
#include<stdio.h>
int main()
{
int num, i, flag=0;
printf("Enter a number: ");
scanf("%d", &num);
for(i=2; i<=num/2; i++)
{
if(num%i == 0)
{
flag = 1;
break;
}
}
if(flag == 0)
printf("%d is a prime number", num);
else
printf("%d is not a prime number", num);
return 0;
}
5) Program to Find the Largest Number Among Three Numbers:
#include<stdio.h>
int main()
{
int num1, num2, num3;
printf("Enter three numbers: ");
scanf("%d %d %d", &num1, &num2, &num3);
if(num1 > num2 && num1 > num3)
printf("%d is the largest number", num1);
else if(num2 > num1 && num2 > num3)
printf("%d is the largest number", num2);
else
printf("%d is the largest number", num3);
return 0;
}
6) Program to Find the Factorial of a Number Using Recursion:
#include<stdio.h>
int factorial(int num);
int main()
{
int num;
printf("Enter a number: ");
scanf("%d", &num);
printf("Factorial of %d = %d", num, factorial(num));
return 0;
}
int factorial(int num)
{
if(num == 0)
return 1;
else
return num * factorial(num-1);
}
7) Program to Print Fibonacci Series:
#include<stdio.h>
int main()
{
int num, i, t1=0, t2=1, nextTerm;
printf("Enter the number of terms: ");
scanf("%d", &num);
printf("Fibonacci Series: ");
for(i=1; i<=num; i++)
{
printf("%d, ", t1);
nextTerm = t1 + t2;
t1 = t2;
t2 = nextTerm;
}
return 0;
}
8) Program to Convert Celsius to Fahrenheit
#include <stdio.h>
int main() {
float celsius, fahrenheit;
printf("Enter temperature in Celsius: ");
scanf("%f", &celsius);
fahrenheit = (celsius * 1.8) + 32;
printf("%.2f Celsius = %.2f Fahrenheit", celsius, fahrenheit);
return 0;
}
9) Program to Check Whether a Number is Armstrong or Not:
#include<stdio.h>
#include<math.h>
int main()
{
int num, originalNum, remainder, n=0;
float result=0.0;
printf("Enter an integer: ");
scanf("%d", &num);
originalNum = num;
while(originalNum != 0)
{
originalNum /= 10;
++n;
}
originalNum = num;
while(originalNum != 0)
{
remainder = originalNum % 10;
result += pow(remainder, n);
originalNum /= 10;
}
if((int)result == num)
printf("%d is an Armstrong number.", num);
else
printf("%d is not an Armstrong number.", num);
return 0;
}
10) Program to Find the Reverse of a Number:
#include<stdio.h>
int main()
{
int num, reverse=0, remainder;
printf("Enter an integer: ");
scanf("%d", &num);
while(num != 0)
{
remainder = num % 10;
reverse = reverse * 10 + remainder;
num /= 10;
}
printf("Reverse of the number = %d", reverse);
return 0;
}