Code by KVSP
Code by KVSP
Code by KVSP
THAT ARE CONTAINING ALL BASICS AND THOSE ARE REQUIRED FOR
INTERVIEW THIS MIGHT BE HELPFUL IN MANY WAYS TO CRACK
CODING TEST OR TECHNICAL ROUND INTERVIEW . ~K V S NAIDU
1 | C-PROGRAMMING BY K V S N
C program with numbers
3 | C-PROGRAMMING BY K V S N
12. Write a c program to convert binary number to hexadecimal
number.
13. C program for addition of binary numbers .
14. C program for multiplication of two binary numbers.
15. C program fractional binary conversion from decimal.
16. C program for fractional decimal to binary fraction
conversion.
17. C program to convert decimal number to roman.
18. C program to convert roman number to decimal number.
19. C program to convert each digits of a number in words
20. C program to convert currency or number in word.
Conversion ( Unit )
1. C program for unit conversion.
String
1. Write a c program to convert the string from upper case to
lower case.
2. Write a c program to convert the string from lower case to
upper case.
3. Write a c program to delete the all consonants from given
string.
4. Write a c program to count the different types of characters in
given string.
5. Write a c program to sort the characters of a string.
6. Write a c program for concatenation two strings without using
string.h header file.
7. Write a c program to find the length of a string using pointer.
8. Write a c program which prints initial of any name.
4 | C-PROGRAMMING BY K V S N
9. Write a c program to print the string from given character.
10. Write a c program to reverse a string
11. Reverse a string using recursion in c
12. String concatenation in c without using strcat
13. How to compare two strings in c without using strcmp
14. String copy without using strcpy in c
15. Convert a string to ASCII in c
Matrix
1. Write a c program for addition of two matrices.
2. Write a c program for subtraction of two matrices
3. Write a c program for multiplication of two matrices.
4. Write a c program to find out sum of diagonal element of a
matrix.
5. Write a c program to find out transport of a matrix.
6. Write a c program for scalar multiplication of matrix.
7. C program to find inverse of a matrix
8. Lower triangular matrix in c
9. Upper triangular matrix in c
10. Strassen's matrix multiplication program in c
11. C program to find determinant of a matrix
File
1. Write a c program to open a file and write some text and close
its.
2. Write a c program to delete a file.
3. Write a c program to copy a file from one location to other
location.
4. Write a c program to copy a data of file to other file.
5. Write a c program which display source code as a output.
5 | C-PROGRAMMING BY K V S N
6. Write a c program which writes string in the file.
7. Write a c program which reads string from file.
8. Write a c program which writes array in the file.
9. Write a c program which concatenate two file and write it
third file.
10. Write a c program to find out size of any file.
11. Write a c program to know type of file.
12. Write a c program to know permission of any file.
13. Write a c program to know last date of modification of any
file.
14. Write a c program to find size and drive of any file.
Complex number
7 | C-PROGRAMMING BY K V S N
2. Write a c program to find GCD of a two numbers using
recursion.
3. Write a c program to find out sum digits of a number using
recursion.
4. Write a c program to find power of a number using function
recursion.
5. Write a c program to reverse any number using recursion.
Size of data type
1. Write a c program to find the size of int without using sizeof
operator.
2. Write a c program to find the size of double without using
sizeof operator.
3. Write a c program to find the size of structure without using
sizeof operator.
4. Write a c program to find the size of union without using
sizeof operator.
Using pointer
1. Write a c program for concatenation two string using pointer.
Searching
1. Write a c program for linear search.
2. Write a c program for binary search.
3. Write a c program for binary search using recursion.
Area and volume
1. Write a c program to find the area of circle.
8 | C-PROGRAMMING BY K V S N
2. Write a c program to find the area of any triangle.
3. Write a c program to find the area of equilateral triangle.
4. Write a c program to find the area of right angled triangle.
5. Write a c program to find the area of rectangle.
6. Write a c program to find the area of trapezium.
7. Write a c program to find the area of rhombus.
8. Write a c program to find the area of parallelogram.
9. Write a c program to find the volume and surface area of
cube.
10. Write a c program to find the volume and surface area of
cuboids.
11. Write a c program to find the volume and surface area
of cylinder.
12. Write a c program to find the surface area and volume of a
cone.
13. Write a c program to find the volume and surface area of
sphere.
14. Write a c program to find the perimeter of a circle, rectangle
and triangle.
10 | C-PROGRAMMING BY K V S N
///////**********************PROGRAMS BY K V SUBBA NAIDU*********************////////////
PERFECT NUMBER
Code 1:
1. C program to check perfect number
#include<stdio.h>
int main(){
int n,i=1,sum=0;
while(i<n){
if(n%i==0)
sum=sum+i;
i++;
}
if(sum==n)
printf("%d is a perfect number",i);
else
printf("%d is not a perfect number",i);
return 0;
}
11 | C-PROGRAMMING BY K V S N
Code 2:
#include<stdio.h>
int main(){
int n,i,sum;
int min,max;
while(i<n){
if(n%i==0)
sum=sum+i;
i++;
}
if(sum==n)
printf("%d ",n);
}
return 0;
}
12 | C-PROGRAMMING BY K V S N
Code 3:
3. C program to print perfect numbers from 1 to 100
#include<stdio.h>
int main(){
int n,i,sum;
while(i<n){
if(n%i==0)
sum=sum+i;
i++;
}
if(sum==n)
printf("%d ",n);
}
return 0;
}
Output:
Perfect numbers are: 6 28
13 | C-PROGRAMMING BY K V S N
*************************************************************************************
ARMSTRONG NUMBER
14 | C-PROGRAMMING BY K V S N
Code 1:
#include<stdio.h>
int main(){
int num,r,sum=0,temp;
temp=num;
while(num!=0){
r=num%10;
num=num/10;
sum=sum+(r*r*r);
}
if(sum==temp)
printf("%d is an Armstrong number",temp);
else
printf("%d is not an Armstrong number",temp);
return 0;
}
15 | C-PROGRAMMING BY K V S N
Code 2:
#include<stdio.h>
int main(){
int num,r,sum,temp;
int min,max;
printf("Enter the minimum range: ");
scanf("%d",&min);
return 0;
}
16 | C-PROGRAMMING BY K V S N
Code 3:
#include<stdio.h>
int main(){
int num,r,sum=0,temp;
for(temp=num;num!=0;num=num/10){
r=num%10;
sum=sum+(r*r*r);
}
if(sum==temp)
printf("%d is an Armstrong number",temp);
else
printf("%d is not an Armstrong number",temp);
return 0;
}
17 | C-PROGRAMMING BY K V S N
Code 4:
#include<stdio.h>
int main(){
int num,r,sum,temp;
for(num=1;num<=500;num++){
temp=num;
sum = 0;
while(temp!=0){
r=temp%10;
temp=temp/10;
sum=sum+(r*r*r);
}
if(sum==num)
printf("%d ",num);
}
return 0;
}
18 | C-PROGRAMMING BY K V S N
*************************************************************************************
19 | C-PROGRAMMING BY K V S N
Code 1:
#include<stdio.h>
int main(){
int num,i,count=0;
printf("Enter a number: ");
scanf("%d",&num);
for(i=2;i<=num/2;i++){
if(num%i==0){
count++;
break;
}
}
if(count==0 && num!= 1)
printf("%d is a prime number",num);
else
printf("%d is not a prime number",num);
return 0;
}
Sample output:
Enter a number: 5
5 is a prime number
20 | C-PROGRAMMING BY K V S N
Code 2:
#include<stdio.h>
int main(){
int num,i,count;
for(num = 1;num<=100;num++){
count = 0;
for(i=2;i<=num/2;i++){
if(num%i==0){
count++;
break;
}
}
return 0;
}
Output:
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71
73 79 83 89 97
21 | C-PROGRAMMING BY K V S N
Code 3:
#include<stdio.h>
int main(){
int num,i,count,n;
printf("Enter max range: ");
scanf("%d",&n);
for(num = 1;num<=n;num++){
count = 0;
for(i=2;i<=num/2;i++){
if(num%i==0){
count++;
break;
}
}
return 0;
}
Sample output:
Enter max range: 50
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47
22 | C-PROGRAMMING BY K V S N
Code 4:
#include<stdio.h>
int main(){
int num,i,count,min,max;
num = min;
while(num<=max){
count = 0;
i=2;
while(i<=num/2){
if(num%i==0){
count++;
break;
}
i++;
}
num++;
}
return 0;
}
Sample output:
Enter min range: 50
Enter max range: 100
53 59 61 67 71 73 79 83 89 97
23 | C-PROGRAMMING BY K V S N
Code 5:
#include<stdio.h>
int main(){
int num,i,count,min,max;
for(num = min;num<=max;num++){
count = 0;
for(i=2;i<=num/2;i++){
if(num%i==0){
count++;
break;
}
}
return 0;
}
Sample output:
Enter min range: 10
Enter max range: 50
11 13 17 19 23 29 31 37 41 43 47
24 | C-PROGRAMMING BY K V S N
Code 6:
#include<stdio.h>
int main(){
int num,i,count,sum=0;
for(num = 1;num<=100;num++){
count = 0;
for(i=2;i<=num/2;i++){
if(num%i==0){
count++;
break;
}
}
return 0;
}
Output:
Sum of prime numbers is: 1060
25 | C-PROGRAMMING BY K V S N
Code 7:
#include<stdio.h>
int main(){
int num,i,count,min,max,sum=0;
for(num = min;num<=max;num++){
count = 0;
for(i=2;i<=num/2;i++){
if(num%i==0){
count++;
break;
}
}
return 0;
}
26 | C-PROGRAMMING BY K V S N
*******************************************************
STRONG NUMBER OR NOT
Code 1:
#include<stdio.h>
int main(){
int num,i,f,r,sum=0,temp;
temp=num;
while(num){
i=1,f=1;
r=num%10;
while(i<=r){
f=f*i;
i++;
}
sum=sum+f;
num=num/10;
}
if(sum==temp)
printf("%d is a strong number",temp);
else
printf("%d is not a strong number",temp);
return 0;
}
27 | C-PROGRAMMING BY K V S N
Code 2:
#include<stdio.h>
int main(){
int num,i,f,r,sum,temp;
int min,max;
while(temp){
i=1;
f=1;
r=temp%10;
while(i<=r){
f=f*i;
i++;
}
sum=sum+f;
temp=temp/10;
}
if(sum==num)
printf("%d ",num);
}
return 0;
}
Sample output:
Enter minimum range: 100
Enter maximum range: 100000
Strong numbers in given range are: 145 40585
28 | C-PROGRAMMING BY K V S N
******************************************************************************
EVEN OR ODD NUMBER
Code 1:
#include<stdio.h>
int main(){
int number;
if(number % 2 ==0)
printf("%d is even number.",number);
else
printf("%d is odd number.",number);
return 0;
Sample output:
Enter any integer: 5
5 is odd number.
29 | C-PROGRAMMING BY K V S N
Code 2:
#include<stdio.h>
int main(){
int number;
int min,max;
if(number % 2 !=0)
printf("%d ",number);
return 0;
Sample output:
Enter the minimum range: 1
Enter the maximum range: 20
Odd numbers in given ranges are: 1 3 5 7 9 11 13 15 17
19
30 | C-PROGRAMMING BY K V S N
Code 3:
#include<stdio.h>
int main(){
int number;
int min,max;
if(number % 2 !=0)
printf("%d ",number);
if(number % 2 ==0)
printf("%d ",number);
return 0;
}
Sample output:
Enter the minimum range: 1
Enter the maximum range: 20
Odd numbers in given ranges are: 1 3 5 7 9 11 13 15 17
19
Even numbers in given ranges are: 2 4 6 8 10 12 14 16
18 20
31 | C-PROGRAMMING BY K V S N
Code 4:
#include<stdio.h>
int main(){
int number;
int min,max;
long sum =0;
return 0;
Sample output:
Enter the minimum range: 1
Enter the maximum range: 100
Sum of odd numbers in given range is: 2500
32 | C-PROGRAMMING BY K V S N
Code 5:
#include<stdio.h>
int main(){
int number;
int min,max;
long odd_sum =0,even_sum = 0;
return 0;
Sample output:
Enter the minimum range: 1
Enter the maximum range: 10
Sum of even numbers in given range is: 30
Sum of odd numbers in given range is: 25
33 | C-PROGRAMMING BY K V S N
******************************************************************************
PALINDROME OR NOT (NUMBER)
Code 1:
#include<stdio.h>
int main(){
int num,r,sum=0,temp;
temp=num;
while(num){
r=num%10;
num=num/10;
sum=sum*10+r;
}
if(temp==sum)
printf("%d is a palindrome",temp);
else
printf("%d is not a palindrome",temp);
return 0;
}
Sample output:
Enter a number: 131
131 is a palindrome
34 | C-PROGRAMMING BY K V S N
Code 2:
#include<stdio.h>
int main(){
int num,r,sum,temp;
int min,max;
while(temp){
r=temp%10;
temp=temp/10;
sum=sum*10+r;
}
if(num==sum)
printf("%d ",num);
}
return 0;
}
Sample output:
Enter the minimum range: 1
Enter the maximum range: 50
Palindrome numbers in given range are: 1 2 3 4 5 6 7 8
9 11 22 33 44
35 | C-PROGRAMMING BY K V S N
Code 3:
#include<stdio.h>
int main(){
int num,r,sum=0,temp;
for(temp=num;num!=0;num=num/10){
r=num%10;
sum=sum*10+r;
}
if(temp==sum)
printf("%d is a palindrome",temp);
else
printf("%d is not a palindrome",temp);
return 0;
}
Sample output:
Enter a number: 1221
1221 is a palindrome
36 | C-PROGRAMMING BY K V S N
Code 4:
#include<stdio.h>
int checkPalindrome(int);
int main(){
int num,sum;
sum = checkPalindrome(num);
if(num==sum)
printf("%d is a palindrome",num);
else
printf("%d is not a palindrome",num);
return 0;
}
if(num!=0){
r=num%10;
sum=sum*10+r;
checkPalindrome(num/10);
}
return sum;
}
Sample output:
Enter a number: 25
25 is not a palindrome
37 | C-PROGRAMMING BY K V S N
******************************************************************************
PALINDROME OR NOT (NUMBER)
Code 1
#include<string.h>
#include<stdio.h>
int main(){
char *str,*rev;
int i,j;
printf("\nEnter a string:");
scanf("%s",str);
for(i=strlen(str)-1,j=0;i>=0;i--,j++)
rev[j]=str[i];
rev[j]='\0';
if(strcmp(rev,str))
printf("\nThe string is not a palindrome");
else
printf("\nThe string is a palindrome");
return 0;
}
******************************************************************************
// TO BE WRITTEN
Code 1
#include<stdio.h>
#include<math.h>
int main(){
float a,b,c;
38 | C-PROGRAMMING BY K V S N
float d,root1,root2;
d = b * b - 4 * a * c;
return 0;
}
else if(d==0){
printf("Both roots are equal.\n");
return 0;
}
else{
printf("Roots are real numbers.\n");
return 0;
}
Sample output:
Enter a, b and c of quadratic equation: 2 4 1
Roots are real numbers.
Roots of quadratic equation are: -0.293, -1.707
39 | C-PROGRAMMING BY K V S N
Code 2
#include<stdio.h>
#include<math.h>
int main(){
float a,b,c;
float d,root1,root2;
d = b * b - 4 * a * c;
return 0;
}
return 0;
}
Sample output:
Enter quadratic equation in the format ax^2+bx+c:
2x^2+4x+-1
Roots of quadratic equation are: 0.000, -2.000
40 | C-PROGRAMMING BY K V S N
******************************************************************************
FIBONACCI SERIES
Fn = Fn-2 + Fn-1
Code 1:
#include<stdio.h>
int main(){
int k,r;
long int i=0l,j=1,f;
for(k=2;k<r;k++){
f=i+j;
i=j;
j=f;
printf(" %ld",j);
}
return 0;
}
41 | C-PROGRAMMING BY K V S N
Code 2:
1. Fibonacci series using array in c
2. Fibonacci series program in c language
3. Source code of Fibonacci series in c
4. Wap to print Fibonacci series in c
#include<stdio.h>
int main(){
int i,range;
long int arr[40];
arr[0]=0;
arr[1]=1;
for(i=2;i<range;i++){
arr[i] = arr[i-1] + arr[i-2];
}
return 0;
}
Sample output:
Enter the number range: 20
Fibonacci series is: 0 1 1 2 3 5 8 13 21 34 55 89 144
233 377 610 987 1597 2584 4181
42 | C-PROGRAMMING BY K V S N
Code 3:
#include<stdio.h>
int main(){
int k=2,r;
long int i=0l,j=1,f;
while(k<r){
f=i+j;
i=j;
j=f;
printf(" %ld",j);
k++;
}
return 0;
}
Sample output:
Enter the number range: 10
Fibonacci series is: 0 1 1 2 3 5 8 13 21 34
43 | C-PROGRAMMING BY K V S N
Code 4:
#include<stdio.h>
int main(){
int k,r;
long int i=0,j=1,f;
long int sum = 1;
for(k=2;k<r;k++){
f=i+j;
i=j;
j=f;
sum = sum + j;
}
return 0;
}
Sample output:
Enter the number range: 4
Sum of Fibonacci series is: 4
44 | C-PROGRAMMING BY K V S N
******************************************************************************
FACTORIAL OF A NUMBER
Definition / Algoritham
Code 1:
#include<stdio.h>
int main(){
int i=1,f=1,num;
while(i<=num){
f=f*i;
i++;
}
Sample output:
Enter a number: 5
Factorial of 5 is: 120
45 | C-PROGRAMMING BY K V S N
Code 2:
#include<stdio.h>
int main(){
int i,f=1,num;
for(i=1;i<=num;i++)
f=f*i;
Code 3:
#include<stdio.h>
findFactorial(num,&factorial);
printf("Factorial of %d is: %d",num,*factorial);
return 0;
}
*factorial =1;
for(i=1;i<=num;i++)
*factorial=*factorial*i;
}
46 | C-PROGRAMMING BY K V S N
Code 4:
1. Factorial program in c using function
2. C program to find factorial of a number
#include<stdio.h>
int findFactorial(int);
int main(){
int i,factorial,num;
factorial = findFactorial(num);
printf("Factorial of %d is: %d",num,factorial);
return 0;
}
for(i=1;i<=num;i++)
f=f*i;
return f;
}
Sample output:
Enter a number: 8
Factorial of 8 is: 40320
47 | C-PROGRAMMING BY K V S N
Code 5:
1. Factorial series in c
#include<stdio.h>
int main(){
long f=1;
int i,num,min,max;
for(i=1;i<=num;i++)
f=f*i;
printf("%ld ",f);
}
return 0;
}
Sample output:
Enter the minimum range: 1
Enter the maximum range: 10
Factorial series in given range: 1 2 6 24 120 720 5040
40320 362880 3628800
48 | C-PROGRAMMING BY K V S N
******************************************************************************
FLOYD’S TRIANGLE
Example 1:
1
2 3
4 5 6
7 8 9 10
Example 2:
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
16 17 18 19 20 21
49 | C-PROGRAMMING BY K V S N
1. Write a c program to print Floyd’s triangle
#include<stdio.h>
int main(){
int i,j,r,k=1;
printf("FLOYD'S TRIANGLE\n\n");
for(i=1;i<=r;i++){
for(j=1;j<=i;j++,k++)
printf(" %d",k);
printf("\n");
}
return 0;
}
Sample output:
Enter the range: 10
FLOYD'S TRIANGLE
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 31 32 33 34 35 36
37 38 39 40 41 42 43 44 45
46 47 48 49 50 51 52 53 54 55
50 | C-PROGRAMMING BY K V S N
******************************************************************************
PASCAL’S TRIANGLE
51 | C-PROGRAMMING BY K V S N
#include<stdio.h>
long fact(int);
int main(){
int line,i,j;
for(i=0;i<line;i++){
for(j=0;j<line-i-1;j++)
printf(" ");
for(j=0;j<=i;j++)
printf("%ld ",fact(i)/(fact(j)*fact(i-
j)));
printf("\n");
}
return 0;
}
52 | C-PROGRAMMING BY K V S N
******************************************************************************
MULTIPLICATION TABLE
// WAITLISTED
#include<stdio.h>
int main(){
int r,i,j,k;
printf("Enter the number range: ");
scanf("%d",&r);
for(i=1;i<=r;i++){
for(j=1;j<=10;j++)
printf("%d*%d=%d ",i,j,i*j);
printf("\n");
}
return 0;
}
Sample Output:
1*1=1 1*2=2 1*3=3 1*4=4 1*5=5 1*6=6 1*7=7 1*8=8 1*9=9 1*10=10
2*1=2 2*2=4 2*3=6 2*4=8 2*5=10 2*6=12 2*7=14 2*8=16 2*9=18 2*10=20
3*1=3 3*2=6 3*3=9 3*4=12 3*5=15 3*6=18 3*7=21 3*8=24 3*9=27 3*10=30
4*1=4 4*2=8 4*3=12 4*4=16 4*5=20 4*6=24 4*7=28 4*8=32 4*9=36
4*10=40
5*1=5 5*2=10 5*3=15 5*4=20 5*5=25 5*6=30 5*7=35 5*8=40 5*9=45
5*10=50
53 | C-PROGRAMMING BY K V S N
******************************************************************************
PRINTING ASCII VALUES’ USING C-PROGRAM
#include<stdio.h>
int main(){
int i;
for(i=0;i<=255;i++)
printf("ASCII value of character %c:
%d\n",i,i);
return 0;
}
54 | C-PROGRAMMING BY K V S N
******************************************************************************
print hello world without using semicolon
LOGICS TO PRINT HELLO WORLD
#include<stdio.h>
void main(){
if(printf("Hello world")){
}
}
Solution: 2
#include<stdio.h>
void main(){
while(!printf("Hello world")){
}
}
Solution: 3
#include<stdio.h>
void main(){
switch(printf("Hello world")){
}
}
55 | C-PROGRAMMING BY K V S N
******************************************************************************
own source code as its output
#include<stdio.h>
int main(){
FILE *fp;
char c;
fp = fopen(__FILE__,"r");
do{
c= getc(fp);
putchar(c);
}
while(c!=EOF);
fclose(fp);
return 0;
}
Output:
#include<stdio.h>
int main(){
FILE *fp;
char c;
fp = fopen(__FILE__,"r");
do{
c= getc(fp);
putchar(c);
}
while(c!=EOF);
fclose(fp);
return 0;
}
56 | C-PROGRAMMING BY K V S N
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
57 | C-PROGRAMMING BY K V S N
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
58 | C-PROGRAMMING BY K V S N
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
59 | C-PROGRAMMING BY K V S N
60 | C-PROGRAMMING BY K V S N
61 | C-PROGRAMMING BY K V S N