Placement Papers - TCS

Why TCS Placement Papers?

Learn and practice the placement papers of TCS and find out how much you score before you appear for your next interview and written test.

Where can I get TCS Placement Papers with Answers?

IndiaBIX provides you lots of fully solved TCS Placement Papers with answers. You can easily solve all kind of placement test papers by practicing the exercises given below.

How to solve TCS Placement Papers?

You can easily solve all kind of questions by practicing the following exercises.

TCS Interview Experience - Kolkata, 4th July, 2019

Posted By : Debottam Das Rating : +201, -10
Before I go to the interview part, I would like to share the written exam experience also.
My exam was on 16th June, 2019, Kolkata, TCS gitobitan. At first the'll do your document verification, then after clicking your recent photograph and taking your thumb impression they'll let you sit for the exam on your allocated computer.

you can give a free mock test which follows the exact pattern of TCS here :

https://g91.tcsion.com//OnlineAssessment/index.html?2030@@M11

I'm sure you can practice English and aptitude from multiple websites including IndiaBix, so I would be directly sharing the types of codes that are given in the TCS written exam.

Q1.
1,2,1,3,2,5,3,7,5,11,8...
Print the nth term of this pattern.
or,
Print upto nth term off this pattern.

Ans. This series is a combination of Fibonacci series and prime numbers where, every odd index(i%2==1) contains Fibonacci series and every even index(i%2==0) contains prime number. basically a mixture of these two series
1,1,2,3,5,8..
and
2,3,5,7,11,13...

the code is:
#include<stdio.h>
int main()
{
  int i,j,flag,count,n,k;
scanf("%d",&n);
int a[n];
a[1]=1;
a[2]=2;
a[3]=1;
k=a[2];

for(i=4;i<=n;i++)
   {
    if(i%2==1)
a[i]=a[i-2]+a[i-4];
else if(i%2==0)
     {count=0;
flag=0;
while(flag!=1)
     {k++;
count=0;
for(j=1;j<=k;j++)
if(k%j==0)
count++;
if(count==2)
flag=1;
   }
   
a[i]=k;
   }
   }
printf("%dth term = %d\n",n,a[n]);
printf("The series is :\n");
for(i=1;i<=n;i++)
printf("%d ",a[i]);
}

Q2.
1,1,2,3,4,9,8,27,16,81...
Print the nth term of this pattern.
or,
Print upto nth term off this pattern.

Ans. This is a collection of two G.P. series, the common ratio of which are 2 and 3, they might even ask you to print the series where the computer would itself provide common ratios.

basically a mixture of these two series,
1,2,4,8,16...
and
1,3,9,27,81...

The code is :

#include<stdio.h>
int main()
{
int n,i,r1,r2;
printf("enter the number of elements in the series : ");
scanf("%d",&n);
n++;
int a[n];
a[1]=1;
a[2]=1;
printf("enter the common ratio for GP-1 : ");
scanf("%d",&r1);
printf("enter the number for GP-2 : ");
scanf("%d",&r2);
for(i=3;i<=n;i++)
if(i%2==1)
a[i]=a[i-2]*r1;
else
a[i]=a[i-2]*r2;
for(i=1;i<=n;i++)
printf("%d ",a[i]);
}

Q3. 1,6,4,9,7,12,10,15,13,18,16,21,19...
Print the nth term of this pattern.
or,
Print upto nth term off this pattern.

Ans. In this series, if the index is even, 5 is added to the previous term, else if the index is odd, 2 is deducted from previous term. The first term is 1.
1
1+5=6
6-2=4
4+5=9
9-2=7
etc.

The code is :

#include<stdio.h>
int main()
{
int ft,n,i;
scanf("%d",&n);
int a[n+1];
a[1]= 1;
for(i=2;i<=n;i++)
{
if(i%2==0)
a[i]=a[i-1]+5;
else
a[i]=a[i-1]-2;
}
printf("%dth term is= %d\n",n,a[n]);
printf("The series is : \n");
for(i=1;i<n;i++)
printf("%d ",a[i]);
}

Q4.GCD of two given numbers.

Ans. I have written this code both using recursion and without using recursion

//Without Recursion

#include<stdio.h>
int main()
{
int x,y,i,k=1;
printf("Enter both first and second number : ");
scanf("%d%d",&x,&y);
if(x==y)
printf("GCD is %d",x);
else if(x%y==0)
printf("GCD is %d",y);
else if(y%x==0)
printf("GCD is %d",x);
else if(x>y)
{
for(i=1;i<=y/2;i++)
if(x%i==0 && y%i==0 && i>k)
k=i;
printf("GCD is %d",k);
}
else if(y>x)
{
for(i=1;i<=x/2;i++)
if(x%i==0 && y%i==0 && i>k)
k=i;
printf("GCD is %d",k);
}
}

//With Recursion

//GCD through recursion modified
#include<stdio.h>
int GCD(int,int);
int main()
{
int x,y;
printf("Enter both first and second number : ");
scanf("%d%d",&x,&y);
printf("GCD of %d and %d is %d",x,y,GCD(x,y));
}
int GCD(int x,int y)
{
if(x==y)
return(y);
if(x%y==0)
return(y);
if(y%x==0)
return(x);
if(x>y)
return(GCD(x%y,y));
else
return(GCD(x,y%x));
}

Q4. Given three strings as an input. Change the vowels of the first string to $. Change the consonants of the second string to #. Convert the entire third string from lowercase to uppercase. Finally concatenate all these three strings and print the output.

Sample input :
String 1= face
String 2= your
String 3= fears

Sample output :
f$c$#ou#FEARS

Ans. The code can be written both using <string.h> and without using <string.h>. Because in case of TCS written exams header files except <stdio.h> everything is unusable, I've provided the code without using <string.h>.

The code is :

#include<stdio.h>
int main()
{
int i;
char s1[10],s2[10],s3[10];
printf("Enter first String : \n");
gets(s1);
printf("Enter second String : \n");
gets(s2);
printf("Enter third String : \n");
gets(s3);
for(i=0;s1[i]!='\0';i++)
{
if((s1[i]=='a') ||(s1[i]=='e')||(s1[i]=='i')||(s1[i]=='o')||(s1[i]=='u'))
s1[i]='$';
}
printf("%s",s1);
for(i=0;s2[i]!='\0';i++)
{
if((s2[i]!='a') &&(s2[i]!='e')&&(s2[i]!='i')&&(s2[i]!='o')&&(s2[i]!='u'))
s2[i]='#';
}
printf("%s",s2);
for(i=0;s3[i]!='\0';i++)
{
s3[i]=s3[i]-32;
}
printf("%s",s3);
}

There are other codes that you can also practice like, if a provided year is leap year of not, conditional summation of two numbers etc. Make sure to go through multiple websites in order to be fully prepared.


Now, coming to the interview part :

I got my result of my written test on 29th June, 2019. They told me that I've cleared the written with excellence and asked me to attend the interview on 4th July, 2019 at TCS gitanjali park. A small advice I would like to give, if you're not master of a topic/subject, you better not write it in your CV. One of my friends included Data Structure in his CV, but when he was asked to write a code of tree traversal using pointers, he went numb. Unfortunately, he didn't make it into TCS. So, prepare for the worst.

My interview was in the first slot, my reporting time was at 8:30 a.m. I appeared there before 7 a.m. still there were multiple students who appeared even before me, they opened the gate at 8:20 (before time). We entered the building. In our slot there were approximately 1000 students. At first, they started checking and verifying all of our documents, our X,XII,UG marksheets (all of them). Students whose documents were verified were asked to sit in a different room. After the verification was complete they started calling names one by one, there were more than 10 interview rooms, each containing 3 panelists,(1 technical, 2 HR or, 2 technical, 1 HR). After a certain time they called my name, a tall guy ( who was a HR himself) called me in one of those rooms.

I greeted good morning to all of the panelists
Panelist 1, Panelist 2, Panelist 3 - Good Morning, Mr. Das.

Panelist 1 - So, Mr. Das, I see that you have one year gap in your education, why is that ?
Me - Sir, I was preparing for Joint Entrance.

HR - I don't understand Mr. Das, you have more than 90 percent score in Boards, How come that degraded so much during engineering ?
Me - Sir, I don't like core subjects that much.

HR - Tell us the truth Mr. Das.
Me - Sorry sir, I didn't work hard during engineering, so my marks are low.

Technical 1 : What are the subjects of CS that you studied during engineering ?
Me - Sir, DBMS, DS, C, Java.

Technical 1: Can you tell us the difference b/w DBMS & RDBMS ?
Me - I told him the differences.

Technical 1 : Can you write codes Mr. Das. ?
( I was prepared and confident)
Me - Definitely sir.

Technical 1 : Do you know what a palindrome is ?
Me : Explained palindrome, then asked him if I should write the code also.

Technical 1 : Yes.
Me : Sir, palindrome of number, or string ?

Technical 1 : Write both..
Me : Sir, should I write using string.h or without using string.h?

Technical 1 : What would be the differences if you use string.h and you don't.
Me : I explained both of the situations.

Technical 1 : Write both of the codes.
Me : I wrote both of the codes.

Technical 1 : Can you explain the logic again for the code where you haven't used string.h.
Me : I took several test cases and explained the logic again.

Technical 2: You said, you know data structure too.
Me : Yes sir.

Technical 2 : Can you explain what a linked list is ?
Me : I explained linked list, its uses, with diagram, why it is considered as linear data type, why it is ADT,
structured a node of linked list. Initiated it with a pointer.

struct LinkedListNode
{
     int info;
     struct LinkedListNode *link;
}

Then I started explaining how it works, traversal of a linked list, how to add a node, how to delete a node from beginning, end, its uses etc. They were really happy with my explanation.

Technical 2 : Do you know Mr. Das what a minimal spanning tree is ?
Me : I explained minimal spanning tree using graph, with diagram, preocesses of finding minimal spanning tree (Prim's algorithm, Krushkal's algorithm etc.). Then I asked them if they want me to explain the algorithms also.

They said that I don't have to.

Technical 1: Do you know about greedy algorithm ?
Me : I explained greedy algorithm.

Technical 1: Who is the current CEO of TCS ?
Me : Answered.

Technical 1: Who is the current chairman of TCS ?
Me : Answered.

Technical 1, Technical 2, HR  : Okay Mr. Das, you're done for the day.
Me : Thank you sir. Thanks a lot.

When I was opening the door, to get out of the room.

Technical 1 : Mr. Das ?
Me : Yes sir ?

Technical 1 : Don't take any pressure, today is gonna be a memorable day for you.

At that very point I was sure that I got selected, after 15 long days of waiting, on 20th July, 2019, I received a mail that I have got selected for TCS and the offer letter would be provided within two weeks on TCS NEXTSTEP portal.

I hope it helps. That was my experience guys!!! and best of luck to all the juniors who are preparing for NQT 2020 or further.  :D.

Like this page? +201 -10




Companies List:

3i Infotech - AAI - ABACUS - ABB - Accel Frontline - Accenture - Aditi - Adobe - ADP - Agreeya - Akamai - Alcatel Lucent - Allfon - Alumnus - Amazon - Amdocs - AMI - Andhra Bank - AppLabs - Apps Associates - Aricent - Ashok Leyland - Aspire - Atos Origin - Axes - Bajaj - Bank of Maharashtra - BEL - BEML - BHEL - BirlaSoft - Blue Dart - Blue Star - BOB - BPCL - BPL - Brakes - BSNL - C-DOT - Cadence - Calsoft - Canara Bank - Canarys - Capgemini - Caritor - Caterpillar - CDAC - CGI - Changepond - Ciena - Cisco - Citicorp - CMC - Consagous - Convergys - CORDYS - Crompton - CSC - CTS - Cummins - Dell - Deloitte - Delphi-TVS - DeShaw - Deutsche - Dotcom - DRDO - EDS - EIL - ELGI - ELICO - ERICSSON - Essar - Fidelity - Flextronics - Freescale - FXLabs - GAIL - GE - Genpact - Geodesic - Geometric - Globaledge - GlobalLogic - Godrej - Google - Grapecity - HAL - HCL - Hexaware - Honeywell - HP - HPCL - HSBC - Huawei - Hughes - IBM - IBS - ICICI - iGate - Impetus - iNautix - Indian Airforce - Indian Airlines - Infosys - Infotech - Intec - Integra - Intergraph - IOCL - iSOFT - ISRO - Ittiam - JSW - Keane - Kenexa - L & T - L & T Infotech - LG Soft - Lifetree - LionBridge - Mahindra Satyam - Mastek - Maveric - McAfee - MECON - Microsoft - MindTree - Miraclesoft - Mistral - Motorola - Mphasis - MTNL - NIC - Nokia Siemens - Novell - NTPC - Nucleus - ORACLE - Patni - Perot - Polaris - Ramco - Robert Bosch - Samsung - SAP - Sapient - Sasken - SBI - Sierra Atlantic - Sonata - Sony India - Sutherland - Syntel - TCS - Tech Mahindra - VeriFone - Virtusa - Wipro - Zensar.