TCS Exam Pattern 2026 — Complete Guide

Last Updated: March 2026

Tata Consultancy Services (TCS) is India's largest IT services company and one of the top recruiters for fresh engineering graduates. Understanding the TCS exam pattern is crucial for cracking the placement process. This comprehensive guide covers everything you need to know about the TCS recruitment exam pattern for 2026.

---

TCS Recruitment Process Overview

The TCS selection process consists of multiple rounds:

1. Online Assessment (NQT - National Qualifier Test)
2. Technical Interview
3. HR Interview
4. Managerial Interview (for Digital profile)

---

Section-Wise Exam Pattern

Section	Number of Questions	Time Allotted	Marks per Question	Total Marks
Verbal Ability	24	30 minutes	1	24
Reasoning Ability	30	50 minutes	1	30
Numerical Ability	26	40 minutes	1	26
Programming Logic	10	15 minutes	1	10
Coding	2	55 minutes	varies	20
Total	92	190 minutes	-	110

---

Detailed Section Breakdown

1. Verbal Ability (30 Minutes - 24 Questions)

This section tests your English language proficiency.

Topics Covered:

• Reading Comprehension (2 passages, 5-6 questions each)
• Sentence Completion
• Para Jumbles
• Error Detection
• Synonyms and Antonyms
• Sentence Improvement
• Cloze Test

Sample Questions:

Q1. Choose the word that is closest in meaning to the underlined word: The manager reprimanded the employee for his negligence.

• a) Praised
• b) Scolded
• c) Ignored
• d) Promoted

Q2. Identify the error in the sentence: Neither of the students (a) / have submitted (b) / their assignments (c) / on time (d).

• a) a
• b) b
• c) c
• d) d

---

2. Reasoning Ability (50 Minutes - 30 Questions)

Tests logical thinking and problem-solving skills.

Topics Covered:

• Data Sufficiency
• Syllogisms
• Blood Relations
• Direction Sense
• Seating Arrangements
• Puzzles
• Coding-Decoding
• Venn Diagrams
• Odd One Out
• Pattern Recognition

Sample Questions:

Q3. If A is taller than B, B is taller than C, and D is shorter than C but taller than E, who is the shortest?

• a) A
• b) B
• c) C
• d) E

Q4. In a code language, COMPUTER is written as RFUVQNPC. How is MEDICINE written in that code?

• a) EOJDJEFM
• b) EOJDEJFM
• c) MFEJDJOE
• d) MFEDJJOE

---

3. Numerical Ability (40 Minutes - 26 Questions)

Tests mathematical and quantitative aptitude.

Topics Covered:

• Number System
• Percentages
• Profit and Loss
• Simple & Compound Interest
• Time, Speed & Distance
• Time and Work
• Ratio and Proportion
• Averages
• Permutation and Combination
• Probability
• Data Interpretation (Tables, Pie Charts, Bar Graphs)

Sample Questions:

Q5. A shopkeeper marks his goods 40% above the cost price and allows a discount of 25%. What is his profit percentage?

• a) 5%
• b) 8%
• c) 10%
• d) 15%

Solution: Let CP = 100, Marked Price = 140, SP = 140 × 0.75 = 105, Profit = 5%

Q6. A train 200m long crosses a platform 300m long in 25 seconds. What is the speed of the train in km/hr?

• a) 60
• b) 72
• c) 80
• d) 90

Solution: Total distance = 200 + 300 = 500m, Speed = 500/25 = 20 m/s = 72 km/hr

---

4. Programming Logic (15 Minutes - 10 Questions)

Tests basic programming concepts without actual coding.

Topics Covered:

• C/C++ Basics
• Data Types
• Control Structures
• Arrays and Pointers
• Object-Oriented Programming
• Algorithm Analysis
• Output Prediction

Sample Questions:

Q7. What is the output of the following code?

int x = 5;
printf("%d", ++x + x++);

• a) 11
• b) 12
• c) 13
• d) Compiler Error

Q8. Which sorting algorithm has the best average-case time complexity?

• a) Bubble Sort
• b) Selection Sort
• c) Merge Sort
• d) Insertion Sort

---

5. Coding Section (55 Minutes - 2 Questions)

Question Types:

• One easy question (simple logic/implementation)
• One medium question (data structures/algorithms)

Supported Languages: C, C++, Java, Python

Sample Questions:

Q9. (Easy) Write a program to find the sum of all prime numbers between 1 and N.

#include<stdio.h>
#include<stdbool.h>

bool isPrime(int n) {
    if(n <= 1) return false;
    for(int i = 2; i * i <= n; i++)
        if(n % i == 0) return false;
    return true;
}

int main() {
    int n, sum = 0;
    scanf("%d", &n);
    for(int i = 2; i <= n; i++)
        if(isPrime(i)) sum += i;
    printf("%d", sum);
    return 0;
}

Q10. (Medium) Given an array, find the maximum sum subarray (Kadane's Algorithm).

def max_subarray_sum(arr):
    max_so_far = float('-inf')
    max_ending_here = 0
    
    for num in arr:
        max_ending_here += num
        if max_so_far < max_ending_here:
            max_so_far = max_ending_here
        if max_ending_here < 0:
            max_ending_here = 0
    
    return max_so_far

n = int(input())
arr = list(map(int, input().split()))
print(max_subarray_sum(arr))

---

Difficulty Level Analysis

Section	Difficulty Level	Key Challenge
Verbal Ability	Easy to Moderate	Time management in reading comprehension
Reasoning Ability	Moderate to Hard	Complex puzzles and arrangements
Numerical Ability	Moderate	Speed and accuracy in calculations
Programming Logic	Easy to Moderate	Understanding code flow
Coding	Moderate	Writing optimized code within time

---

Topic-Wise Weightage

Verbal Ability (24 Questions)

Topic	Questions
Reading Comprehension	10-12
Sentence Completion	4-5
Error Detection	4-5
Para Jumbles	3-4

Reasoning Ability (30 Questions)

Topic	Questions
Puzzles & Arrangements	8-10
Syllogisms	4-5
Data Sufficiency	4-5
Coding-Decoding	3-4
Blood Relations	3-4
Others	4-6

Numerical Ability (26 Questions)

Topic	Questions
Data Interpretation	6-8
Percentages & Profit/Loss	4-5
Time, Speed & Distance	3-4
Number System	3-4
Probability & P&C	3-4
Time and Work	3-4

---

Preparation Strategy by Section

Verbal Ability

1. Read English newspapers daily (The Hindu, Economic Times)
2. Practice at least 2-3 reading comprehensions daily
3. Build vocabulary using flashcards
4. Focus on grammar rules and sentence structures

Reasoning Ability

1. Solve 10-15 reasoning questions daily
2. Practice different types of puzzles systematically
3. Learn shortcuts for blood relations and direction sense
4. Master Venn diagram problems

Numerical Ability

1. Memorize tables up to 20, squares up to 30, cubes up to 20
2. Practice 20-30 quant problems daily
3. Focus on calculation speed
4. Learn approximation techniques for DI

Programming Logic

1. Revise C/C++ basics thoroughly
2. Practice output prediction questions
3. Understand pointer arithmetic
4. Study OOP concepts

Coding

1. Practice at least 2 coding problems daily
2. Focus on arrays, strings, and basic algorithms
3. Write clean, optimized code
4. Practice on platforms like HackerRank, LeetCode

---

Cut-off Trends (Last 3 Years)

Year	Overall Cut-off (Ninja)	Digital Cut-off
2023	55-60%	75-80%
2024	60-65%	78-82%
2025	65-70%	80-85%

Note: Cut-offs vary based on:

• Number of applicants
• Difficulty level of the exam
• College tier
• Role requirements

---

Important Tips for TCS Exam

1. Time Management: Practice mock tests to improve speed
2. Accuracy: Focus on accuracy as there may be negative marking
3. Sectional Cut-offs: Clear minimum cut-offs in each section
4. Coding Practice: Write code that handles edge cases
5. Mock Tests: Attempt at least 10-15 full-length mocks

---

Frequently Asked Questions (FAQs)

Q1. Is there negative marking in TCS NQT? A: Generally, no negative marking, but this can vary. Focus on accuracy regardless.

Q2. Can I use a calculator during the exam? A: No, calculators are not allowed. You get an on-screen calculator for numerical ability only.

Q3. What is the difference between TCS Ninja and Digital? A: TCS Ninja is the standard profile with 3.36 LPA package, while Digital offers 7-7.3 LPA and requires clearing a higher cut-off.

Q4. How many times can I attempt TCS NQT? A: You can attempt once per quarter/hiring cycle.

Q5. What is the best way to prepare for the coding section? A: Practice pattern printing, array manipulations, string operations, and basic algorithms like searching and sorting.

---

Additional Resources

• TCS Ninja Placement Papers 2026
• TCS Digital Placement Papers 2026
• TCS Off Campus Drive 2026

---

Good luck with your TCS preparation! 🚀