Professional Documents
Culture Documents
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
int main(int argc, char *argv[])
{
if(argc<2)
{
printf("please use \"prg_name value1 value2 ... \"\n");
return -1;
}
int a,b,side1,side2,side3;
a=atoi(argv[1]);
b=atoi(argv[2]);
side1=pow(a,2);
side2=pow(b,2);
side3=sqrt((side1+side2));
printf("the hypotenuse is %d",side3);
return 0;
return 0;
}
Example:
#include <stdio.h>
int main(int argc, char *argv[])
int n,i;
n = atol(argv[1]);
factorial *= i;
return 0;
}
int isPalindrome(int n)
{
int m=n;
int rev=0;
while(m!=0)
{
rev=(rev*10) + (m%10);
m=m/10;
}
if(rev==n)
return 1;
else
return 0;
}
6. Write a C program that will find the sum of all prime numbers in a given range.The
range will be specified as command line parameters. The first command line parameter,
N1 which is a positive integer, will contain the lower bound of the range. The second
command line parameter N2, which is also a positive integer will the upper bound of the
range. The program should consider all the prime numbers within the range, excluding
the upper and lower bound. Print the output in integer format to stdout. Other than the
integer number, no other extra information should be printed to stdout.
#include<stdio.h>
int main(int argc,char *argv[])
{
int N1,N2,i,j,sum=0,count,lower,upper;
if(argc!=3)
exit(0);
N1=atoi(argv[1]);
lower=N1+1;
N2=atoi(argv[2]);
upper=N2;
for(i=lower;i<upper;i++)
{
count=1;
for(j=2;j<=i/2;j++)
{
if(i%j==0)
{
count++;
}
}
if(count==1)
{
sum=sum+i;
}
}
printf("%d",sum);
return 0;
}
FACE Practice Material on TCS Ninja TCSN18-14
Q1. Write a Program to print whether the given alphabet is vowel or #include <stdio.h> }
consonant int main() { printf("No perfect couple found!");
Solution: char c; }
scanf("%c", &c);
#include<stdio.h>
// Upper to lower case Q5. Write a program to find the most occurring character in the
int main()
if('A' <= c && c <= 'Z') string.
{
{ Solution:
// Get the character
printf("%c", 'a' + (c - 'A')); #include <stdio.h>
char ch;
} #define MAX_SIZE 100
scanf("%c", &ch);
// Lower to upper case #define MAX_CHARS 26
if(ch >= 'A' && ch <= 'Z')
if('a' <= c && c <= 'z') int main()
{
{ {
ch = 'a' + (ch - 'A');
printf("%c", 'A' + (c - 'a')); int i;
}
} //Get a sentence
if(ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u')
return 0; char str[MAX_SIZE];
{
} scanf("%[^\n]s", str);
printf("Vowel");
Q4. Given an array and a number (say s), find whether any two // Init Freq stoting array
}
elements in the array whose sum is “s”. int freq[MAX_CHARS];
else
Solution: for(i=0; i<MAX_CHARS; i++)
{
#include<stdio.h> {
printf("Consonant");
#include<stdlib.h> freq[i] = 0;
}
void check_sum_and_diplay(int arr[], int size, int sum); }
return 0;
int main() // Frequency of each character is counted
}
{ for(i = 0; str[i] != '\0'; i++)
// Get the size of an array {
Q2. Write a program to Check whether a given number is a prime
int size; int isAlphabet = 0, offset;
number or not
scanf("%d", &size); if(str[i] >= 'a' && str[i] <= 'z')
Solution:
// Get the array elements {
#include <stdio.h>
int arr[50], i; isAlphabet = 1;
#include<math.h>
for(i=0; i<size; i++) offset = str[i] - 'a';
int main()
{ }
{
scanf("%d", &arr[i]); else if(str[i] >= 'A' && str[i] <= 'Z')
int n, i, flag = 0;
} {
//printf("Enter a positive integer: ");
// Get the sum value (to check with an array elements) isAlphabet = 1;
scanf("%d",&n);
int sum; offset = str[i] - 'A';
for(i=2; i<=sqrt(n); ++i)
scanf("%d", &sum); }
{
// Function call to check the sum of any two elements in an array if(isAlphabet == 1)
// condition for nonprime number
equal to given sum {
if(n%i==0)
// and display the same freq[offset] += 1;
{
check_sum_and_diplay(arr, size, sum); }
flag=1;
return 0; }
break;
} // If two characters occurred the same number of time then
}
void check_sum_and_diplay(int arr[], int size, int sum) // print lowest ASCII value character.
}
{ int max_index = 0;
int i,j; for(i=0; i<MAX_CHARS; i++)
if (flag==0)
for(i=0; i<size-1; i++) {
printf("%d is a prime number.",n);
{ if(freq[i] > freq[max_index])
else
for(j=i+1; j<size; j++) {
printf("%d is not a prime number.",n);
{ max_index = i;
return 0;
if(sum == (arr[i] + arr[j])) }
}
{ }
printf("Perfect couple: %d %d", arr[i], arr[j]); int max_repeated_char = 'a' + max_index;
Q3. Write a program to change the case of the given alphabet and
exit(0); printf("%c", max_repeated_char);
print.
} return 0;
Solution:
} }
6
Focus Academy for Career Enhancement
TCS NQT Model Programming/ Coding Questions Paper
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
int main(int argc, char *argv[])
{
if(argc<2)
{
printf("please use \"prg_name value1 value2 ... \"\n");
return -1;
}
int a,b,side1,side2,side3;
a=atoi(argv[1]);
b=atoi(argv[2]);
side1=pow(a,2);
side2=pow(b,2);
side3=sqrt((side1+side2));
printf("the hypotenuse is %d",side3);
return 0;
return 0;
}
Example:
#include <stdio.h>
int main(int argc, char *argv[])
int n,i;
n = atol(argv[1]);
factorial *= i;
return 0;
}
int isPalindrome(int n)
{
int m=n;
int rev=0;
while(m!=0)
{
rev=(rev*10) + (m%10);
m=m/10;
}
if(rev==n)
return 1;
else
return 0;
}
6. Write a C program that will find the sum of all prime numbers in a given range.The
range will be specified as command line parameters. The first command line parameter,
N1 which is a positive integer, will contain the lower bound of the range. The second
command line parameter N2, which is also a positive integer will the upper bound of the
range. The program should consider all the prime numbers within the range, excluding
the upper and lower bound. Print the output in integer format to stdout. Other than the
integer number, no other extra information should be printed to stdout.
#include<stdio.h>
int main(int argc,char *argv[])
{
int N1,N2,i,j,sum=0,count,lower,upper;
if(argc!=3)
exit(0);
N1=atoi(argv[1]);
lower=N1+1;
N2=atoi(argv[2]);
upper=N2;
for(i=lower;i<upper;i++)
{
count=1;
for(j=2;j<=i/2;j++)
{
if(i%j==0)
{
count++;
}
}
if(count==1)
{
sum=sum+i;
}
}
printf("%d",sum);
return 0;
}