WEEK 3 CODING ASSIGNMENT

Name: Priyanka Indra Roll No.: 84 Dept: CSE1 Sem: 6th

Problem 1: C program to convert a binary number to octal number.
Input:
101
Output:
5
Input:
11010
Output:
32
Test Case:
-------------
1. Valid Input:
a) Only number consisting of 0s and 1s will be given as input
2. Invalid inputs:
a) Decimal
b) Fraction
c) String
d) Two or more command line arguments
e) Negative number
3. You should generate output as follows:
a) For right output print just the actual Octal Value to STDOUT without any other
text.
b) If any error: print 'ERROR' to the STDOUT without any other text.
Source Code:
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
int main()
{
int binary,decimal=0,octal=0,i=0,rem;
scanf("%d",&binary);
if(binary<0)
{
printf("ERROR");
exit(0);
}
else{
while(binary!=0){
rem=binary%10;
if(rem==0 || rem==1){
decimal=decimal+rem*pow(2,i);
++i;
binary=binary/10;
}
else{
printf("ERROR");
exit(0);
}
}
i=1,rem=0;
while(decimal!=0){
rem=decimal%8;
octal=octal+(rem*i);
decimal=decimal/8;
i=i*10;
}
printf("%d",octal);
}
return 0;
}
Output:
11010
32
101
5
1050
ERROR
-110
ERROR

Program 2:
Given an array of integers, sort the first half of the array in ascending order and
second half in descending order. Take input from STDIN by scanf().
Examples:
Input : arr[] = {5, 2, 4, 7, 9, 3, 1, 6, 8}
Output : arr[] = {1, 2, 3, 4, 9, 8, 7, 6, 5}
Input : arr[] = {1, 2, 3, 4, 5, 6}
Output : arr[] = {1, 2, 3, 6, 5, 4}
Source Code:
#include<stdio.h>
#include<stdlib.h>
int main()
{
int n,i,j,temp;
printf("Enter size of array:");
scanf("%d",&n);
int arr[n];
printf("Enter elements of array:");
for(i=0;i<n;i++)
scanf("%d",&arr[i]);
printf("Input:\n");
for(i=0;i<n;i++)
printf("%d ",arr[i]);
 for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(arr[i]<arr[j]){
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
for(i=n/2;i<n;i++)
for(j=n/2;j<n;j++)
if(arr[i]>arr[j]){
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
printf("\nOutput:\n");
for(i=0;i<n;i++)
printf("%d ",arr[i]);
return 0;
}

Output:
Enter size of array:9
Enter elements of array:5 2 4 7 9 3 1 6 8
Input:
524793168
Output:
123498765

Program 3:
A prime number is a whole number greater than 1, whose only two whole-number
factors are 1 and itself. The first few prime numbers are 2, 3, 5, 7, 11 and 13.
Given two integers, print the sum of all prime numbers between n1 and n2 (both
inclusive).
Input:
The first line of the input contains an integer t, number of test cases next t lines
follow with each
line containing two integers n1 and n2
Output:
For each test case print the answer in a new line.
Example
Input:
2
16
66
Output:
10
0
Test Cases:
---------------
1. Valid Input:
a) Only integer will be given as input.
Constraints:
1 < t <= 10
0 < n1 <= n2 <= 100
2. Invalid inputs:
a) Negative number (t, n1, or n2)
b) Fraction
c) String
3. You should generate output as follows:
a) For right output print just the sum to STDOUT without any other text.
b) If any error: print 'ERROR' to the STDOUT without any other text.
Source Code:
#include<stdio.h>
#include<stdlib.h>
int prime(int a,int b)
{
int i,flag=0,sum=0;
if(a==1)
sum=sum-1;
while(a<b)
{
flag=0;
for(i=2;i<=a/2;++i){
if(a%i==0){
flag=1;
break;
}
}
if(flag==0)
sum=sum+a;
++a;
}
return sum;
}
int main()
{
int t,n1,n2,sum=0;
scanf("%d",&t);
if(t>1 && t<=10){
for(int i=1;i<=t;i++){
scanf("%d %d",&n1,&n2);
if(n1>0 && n2>0 && n1<=100 && n2<=100 && n1<=n2){
printf("%d\n",prime(n1,n2));
}
else{
printf("ERROR");
exit(0);
 }
}
}
else{
printf("ERROR");
exit(0);
}
return 0;
}

Output:
2
16
10
66
0

Program 4:
Remove duplicates character from a given string.
Input String:
engineering
Output String:
engir
Test Cases:
---------------
1. Valid Input:
a) Only string of character will be given as input.
2. Invalid inputs:
a) No command line arguments
b) Two or more command line arguments
c) Integer
d) Fraction
3. You should generate output as follows:
a) For right output print just the string to STDOUT without any other text.
b) If any error: print 'ERROR' to the STDOUT without any other text.
Source Code:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main()
{
char str[20];
printf("Input String:\n");
scanf("%s",str);
for(int i=0;i<strlen(str);i++){
for(int j=i+1;str[j]!='\0';j++){
if(str[j]==str[i]){
for(int k=j;str[k]!='\0';k++)
str[k]=str[k+1];
}
}
}
printf("Output String:\n%s",str);
return 0;
}

Output:
Input String:
engineering
Output String:
engier

Program 5:
C Program to find sum of series 1 + 1/2 + 1/3 + 1/4 +... + 1/n. The value n is positive
integer passed to the program as the first command line parameter. Write the
output to stdout formatted as a floating point number rounded to EXACTLY 2
decimal precision WITHOUT any other additional text. Scientific format (such as
1.00E+5) should NOT be used while printing the output. You may assume that the
inputs will be such that the output will not exceed the largest possible real number
that can be stored in a float type variable.
Example
Input
1
Output
1
Input
2
Output
1.5
Test Cases:
--------------
1. VALID INPUTS:
a) Only positive integer will be given as input through command line argument.
2. INVALID INPUTS:
a) No command line argument.
b) More than 1 command line arguments
c) String
d) Fraction
e) Negative number as input argument
3. OUTPUT:
a) Write the output to stdout formatted as a floating point number rounded to
EXACTLY 2
decimal precision WITHOUT any other additional text.
For example
[./a.out 2] => 1.5
b) In case of invalid input print 'ERROR' to the STDOUT without any other additional
text and
terminate.
Source Code:
#include<stdio.h>
#include<stdlib.h>
int main(){
int n;
double i,sum=0.0;
printf("Input:\n");
scanf("%d",&n);
if(n>0){
for(i=1;i<=n;i++){
sum=sum+1/i;
}
printf("Output:\n%.1f",sum);
}
else{
printf("ERROR");
exit(0);
}
return 0;
}

Output:
Input:
-2
ERROR
Input:
1
Output:
1.0
Input:
2
Output:
1.5