Skip to content

TCS Placement Papers 2025

Overview

This page answers searches for TCS 2025 question paper and TCS NQT 2025 question paper: from student reports questions from the 2025 NQT cycle, the section-wise pattern, and step-by-step solutions. Use it to see what TCS asked in the latest hiring wave, how hard each section felt, and which aptitude/coding themes mattered most.

Practice under a 180-minute timer, then review answer keys below. For older years and bulk previous year papers with solutions PDF, visit TCS previous year question papers. Main guide: TCS placement papers.

TCS NQT 2025 question paper pattern

Section Questions Time Difficulty Focus Areas
Numerical Ability 20-25 40 min Medium Quantitative aptitude, data interpretation
Verbal Ability 20-25 30 min Medium English grammar, reading comprehension
Reasoning Ability 20-25 40 min Medium Logical reasoning, puzzles
Programming Logic 10-15 20 min Medium Basic coding MCQs
Coding 1-2 50 min Medium-Hard Hands-on coding problems

Total: 90-110 questions, 180 minutes Platform: TCS iON platform Languages Allowed: C, C++, Java, Python Success Rate: ~20-25% cleared NQT and advanced to interviews

TCS Placement Papers 2025 - actual questions & solutions

This section contains practice questions styled on TCS placement papers 2025 (recent-cycle pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1

Q1: Average of 6 numbers is 18. If one number 12 is replaced by 24, what is the new average?

Solution:

Old sum = 6 × 18 = 108. New sum = 108 − 12 + 24 = 120. New average = 120/6 = 20.

Answer: 20

Question 2

Q2: Simple interest on ₹5000 at 8% per annum for 3 years is?

Solution:

SI = (P × R × T)/100 = (5000 × 8 × 3)/100 = ₹1200.

Answer: ₹1200

Question 3

Q3: Pipe A fills a tank in 10 hours, pipe B in 15 hours. How long to fill together?

Solution:

Combined rate = 1/10 + 1/15 = (10+15)/(10×15). Time = 10×15/(10+15) = 6 hours.

Answer: 6 hours

Question 4

Q4: A train 240 m long crosses a pole in 16 seconds. Find its speed in km/h.

Solution:

Speed = distance/time = 240/16 m/s = (240/16) × (18/5) = 54 km/h.

Answer: 54 km/h

Question 5

Q5: Pointing to a photo, Ravi said, ‘He is the son of my grandfather’s only son.’ How is the person related to Ravi?

Solution:

Grandfather’s only son = Ravi’s father. Son of Ravi’s father = Ravi himself (or his brother).

In standard puzzle framing with one son implied for the speaker context: the person is Ravi’s brother (or Ravi). Most campus keys take Brother.

Answer: Brother

Question 6

Q6: In a row of 40 students, A is 12th from the left and B is 10th from the right. How many students are between A and B if A is to the left of B?

Solution:

Positions from left: A = 12, B = 40 − 10 + 1 = 31. Students between = 31 − 12 − 1 = 18.

Answer: 18

Question 7

Q7: Identify the error: ‘Neither of the boys have submitted their assignment.’

Solution:

‘Neither’ is singular → verb should be has, not have.

Correct: Neither of the boys has submitted his/their assignment.

Answer: have → has

Question 8

Q8: Fill in the blank: ‘She has been working here _____ 2019.’

Solution:

Use since with a point in time; use for with a duration.

Correct: since.

Answer: since

Question 9: two sum

Show solution

Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]

Solution (Java):

public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
int need = target - nums[i];
if (map.containsKey(need)) return new int[]{map.get(need), i};
map.put(nums[i], i);
}
return new int[]{};
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 10: maximum subarray sum

Show solution

Problem Statement: Find the contiguous subarray with the largest sum.

Example:

Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6 // [4, -1, 2, 1]

Solution (Java):

public int maxSubArray(int[] nums) {
int best = nums[0], cur = nums[0];
for (int i = 1; i < nums.length; i++) {
cur = Math.max(nums[i], cur + nums[i]);
best = Math.max(best, cur);
}
return best;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 11: rotate array right by k

Show solution

Problem Statement: Rotate the array to the right by k steps.

Example:

Input: [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]

Solution (Java):

public void rotate(int[] nums, int k) {
k %= nums.length;
reverse(nums, 0, nums.length - 1);
reverse(nums, 0, k - 1);
reverse(nums, k, nums.length - 1);
}
void reverse(int[] a, int l, int r) {
while (l < r) { int t = a[l]; a[l++] = a[r]; a[r--] = t; }
}

Time Complexity: O(n)
Space Complexity: O(1)

Expected hiring

  • Total Hires: 42,000+ freshers
  • ASE: 36,000+ selections
  • Digital Cadre: 6,000+ selections
  • Locations: Pan-India

Salary packages

  • ASE: ₹3.5-4.2 LPA
  • System Engineer: ₹4.5-6 LPA
  • Digital Cadre: ₹7.5-8.5 LPA

Question trends

  • Aptitude: Medium (60% of questions)
  • Programming Logic: Medium (25% of questions)
  • Coding: Medium-Hard (15% of questions)
  • Focus: Fundamentals and problem-solving

Key insights from 2025

  • Aptitude Focus: Continued emphasis on quantitative ability and logical reasoning
  • Time Management: 180 minutes for 90-110 questions requires good speed and accuracy
  • Coding Basics: Focus on fundamental problems (arrays, strings, basic algorithms)
  • Programming Logic: Important section - practice output prediction questions
  • Problem-Solving: Emphasis on clear approach and correct implementation

Comments & Suggestions

Similar companies

Infosys · Wipro · Accenture · Cognizant · Capgemini · HCL