TCS Coding Model Paper
TCS Coding Model Paper
CODING
#include <stdio.h>
#include <string.h>
int main(){
char string1[20];
int i, length;
int flag = 0;
scanf("%s", string1);
length = strlen(string1);
if(string1[i] != string1[length-i-1]){
flag = 1;
break;
if (flag) {
else {
return 0;
______________________________________________________________________________________________________
Page 1 of 1
TCS Ninja - Coding_3
CODING
CODING
#include <stdio.h>
int main()
{
long int fact=1;
int i,num;
//printf("\nPlease enter a number to find factorial : ");
scanf("%d",&num);
if (num<0)
{
//printf("\nPlease enter a positive number to");
return 1;
}
for(i=1;i<=num;i++)
{
fact=fact*i;
}
printf("%ld\n",fact);
return 0;
}
______________________________________________________________________________________________________
Page 1 of 1
TCS Ninja - Coding_5
CODING
#include<stdio.h>
#define PI 3.14
int main()
{
float d, area;
scanf("%f",&d);
area=PI*(d/2)*(d/2);
printf("%0.2f", area);
return 0;
}
______________________________________________________________________________________________________
Page 1 of 1
TCS Ninja - Coding_6
CODING
Given two lines, write Program for finding its intersection point
#include <stdio.h>
int main()
{
float x1, y1, x2, y2;
scanf("%f,%f\n%f,%f", &x1, &y1, &x2, &y2);
float x3,y3,x4,y4;
scanf("%f,%f\n%f,%f", &x3, &y3, &x4, &y4);
float m1 = (y2-y1)/(x2-x1);
float m2 = (y4-y3)/(x4-x3);
// Line 1
// y = y1 + m * (x - x1);
// y = y1 + m * (x - x1);
// y = m1*x + y1 - m1 * x1
// Line 2
// y = y1 + m * (x - x1);
// y = y3 + m2 * (x - x3);
// y = m2*x + y3 - m2 * x3
return 0;
}
______________________________________________________________________________________________________
Page 1 of 1