We know you have been searching for programs which will help you crack the TCS coding round. Well here they are! Learn well 🙂
rnQ1. Finding area of Circle.
rn#include <stdio.h>
rnint main(int argc, char *argv[])
rn{
rnint radius;
rnfloat area;
rnradius = atol(argv[1]);
rnarea = 3.14 * radius * radius;
rnprintf(“%f”,area);
rn}
rnQ2. Area of Triangle.
rn#include <stdio.h>
rnint main(int argc, char *argv[])
rn{
rnint base, height;
rnfloat area;
rnbase = atol(argv[1]);
rnheight = atol(argv[2]);
rnarea = base*height/2;
rnprintf(“%f”,area);
rn}
rnQ3. Checking Palindrome.
rn#include <stdio.h>
rnint main(int argc, char *argv[])
rn{
rnint num, reverse_num=0,remainder,temp;
rnnum = atol(argv[1]);
rntemp=num;
rnwhile(temp!=0)
rn{
rnremainder=temp%10;
rnreverse_num=reverse_num*10+remainder;
rntemp/=10;
rn}
rnif(reverse_num==num)
rnprintf(“%d is a palindrome number”,num);
rnelse
rnprintf(“%d is not a palindrome number”,num);
rnreturn 0;
rn}
rnQ4. Checking prime number.
rn#include <stdio.h>
rnint main(int argc, char *argv[])
rn{
rnint n, i, flag = 0;
rnn = atol(argv[1]);
rnfor(i=2; i<=n/2; ++i)
rn{
rnif(n%i==0)
rn{
rnflag=1;
rnbreak;
rn}
rn}
rnif (flag==0)
rnprintf(“%d is a prime number.”,n);
rnelse
rnprintf(“%d is not a prime number.”,n);
rnreturn 0;
rn}
rnQ5. Checking string Palindrome.
rn#include <stdio.h>
rn#include <string.h>
rnvoid isPalindrome(char str[])
rn{
rnint l = 0;
rnint h = strlen(str) – 1;
rnwhile (h > l)
rn{
rnif (str[l++] != str[h–])
rn{
rnprintf(“%s is Not Palindromen”, str);
rnreturn;
rn}
rn}
rnprintf(“%s is palindromen”, str);
rn}
rnrn
int main(int argc, char *argv[])
rn{
rnint i,k;
rnint strsize = 0;
rnfor (i=1; i<argc; i++) {
rnstrsize += strlen(argv[i]);
rnif (argc > i+1)
rnstrsize++;
rn}
rnchar *cmdstring;
rncmdstring = malloc(strsize);
rncmdstring[0] = ‘