KCS151/KCS251 PPS Lab Exercise Program: 07
KCS151P/KCS251P
LAB 1
LAB 2
LAB 3
Write a program to print the entire prime no between 1 and 300.
Write a program to print out all the Armstrong numbers between 100 and 500.
Write a program to draw the following figures:
3 2 1
2 1
1
*
**
***
Write a program to receive a five-digit no and display as like 24689:
2
4
6
8
9
LAB 4
Write a function that returns the sum of all the odd digits of a given positive no entered through the keyboard.
Write a program to print the area of the rectangle using function & return its value to the main function.
Write a program to calculate the factorial for the given number using a function.
Write a program to find the sum of the Fibonacci series using a function.
Write factorial function & use the function to find the sum of series S = 1! + 2! + … + n!
LAB 5
Write a program to find the factorial of the given number using recursion.
Write a program to find the sum of digits of a 5 digit number using recursion.
Write a program to calculate the GCD of given numbers using recursion.
Write a program to convert a decimal number into a binary number.
Write a program to convert a binary number into a decimal number.
LAB 6
Write a program to delete duplicate element in a list of 10 elements & display it on screen.
Write a program to merge two sorted arrays & no element is repeated during merging.
Write a program to evaluate the addition of diagonal elements of two square matrixes.
Write a program to find the transpose of a given matrix & check whether it is symmetric or not.
Write a program to print the multiplication of two N*N (Square) matrix.
LAB 7
Write a program in C to check whether the given string is a palindrome or not.
Write a program to sort the array of characters (String) in alphabetical order like STRING in GINRST.
Write a program to remove all the blank space from the string & print it, also count the no of characters.
Write a program to store the following string “zero”, “one”, … “five”.
Print the no in words, given in figure as 3205.
LAB 8
Write a program to compare two given dates. To store a date uses a structure that contains three members namely day, month, and year. If the dates are equal then display message equal otherwise unequal.
Define a structure that can describe a hotel. It should have the member that includes the name, address, grade, room charge, and the number of rooms.
Write a function to print out the hotel of given grade in order of room charges.
Define a structure called cricket with player name, team name, batting average, for 55 players & 5 teams. Print team-wise list contains names of players with their batting average.
LAB 9
Write a C program to copy & count the character content of one file, says a.txt to another file b.txt.
Write a program to take 10 integers from a file and write the square of these integers in another file.
Write a program to read numbers from a file and then write all ‘odd’ numbers to file ODD.txt & all ‘even’ to file EVEN.txt.
Write a program to print all the prime numbers, between 1 to 100 in file prime.txt.
Write the following C program using pointer:
a) To sort the list of numbers through the pointer.
b) To reverse the string through the pointer.
LAB 10
Write a program to find the largest no among 20 integers array using dynamic memory allocation.
Using Dynamic Memory Allocation, Write a program to find the transpose of the given matrix.
Write a program to find the factorial of the given number using the command line argument.
Write a program to find the sum of digits of a 5 digit number using the command line argument.
7. Write a program to construct a Fibonacci series upto n terms.
/*
File: Prgrm07.c
Author: Aditya Saini
Date: Jan 16, 2021
Description: Program to construct a Fibonacci series up to n terms.
*/
#include <stdio.h>
int main (void)
{
int n;
int previous, current, next;
int i;
//Input number of terms
printf ("Input number of terms: ");
scanf ("%d", &n);
//Printing the Fibonacci Series.
previous = 0;
current = 1;
printf ("%d terms of Fibonacci Series: %d %d ", n, previous, current);
//Finding the next term to print
for (i = 3; i <= n; i++)
{
next = previous + current;
printf ("%d ", next);
previous = current;
current = next;
}
return 0;
};
Try it yourself
Sample Input and Output
Stdin Inputs:
10
Sample Result:
Input number of terms: 10
10 terms of Fibonacci Series: 0 1 1 2 3 5 8 13 21 34
