TCS NQT 2026 โ Quick Overview
| Detail | Information |
| Conducted by | TCS iON (online, remote or centre-based) |
| Eligibility | BE/BTech/ME/MTech/MCA/MSc โ 60% or 6.0 CGPA throughout, no active arrears |
| Streams | Ninja (โน3.36 LPA) ยท Digital (โน7 LPA) ยท Prime (โน9โ11.5 LPA) |
| Test duration | ~90โ120 minutes (Foundation) + additional Advanced section for Digital/Prime |
| Registration | Free, via the TCS NextStep / iON portal |
| Negative marking | No |
Key insight: Everyone writes the same Foundation test. Your score decides whether you're offered Ninja, or invited to the Advanced section for Digital/Prime interviews. So preparing "just to pass" costs you โน4โ8 LPA โ prepare to score high.
Exam Pattern โ Section by Section
| Section | Questions | Time | What it tests |
| Numerical Ability | ~20 | 25 min | Percentages, ratios, time & work, profit/loss, number series, data interpretation |
| Verbal Ability | ~25 | 25 min | Reading comprehension, error spotting, sentence completion, para jumbles |
| Reasoning Ability | ~20 | 25 min | Series, puzzles, blood relations, coding-decoding, seating arrangement |
| Programming Logic | ~10 | 15 min | C/pseudocode output prediction, data structures basics, OOP concepts |
| Hands-on Coding | 1โ2 problems | 30 min | Write working code in C, C++, Java, Python, or Perl |
| Advanced (Digital/Prime only) | Advanced aptitude + 2โ3 harder coding problems | ~90 min | DSA โ arrays, strings, recursion, greedy, basic DP |
Section 1 โ Numerical Ability Strategy
This section is speed-driven: roughly 75 seconds per question. Master these topics in order of frequency:
- Percentages & Profit/Loss โ appears in almost every set. Learn fractionโpercentage conversions by heart (1/8 = 12.5%, 1/6 = 16.66%โฆ).
- Time & Work / Pipes & Cisterns โ use the LCM method, not fractions. It's 2x faster.
- Ratio & Proportion, Mixtures โ alligation shortcut solves most mixture questions in 20 seconds.
- Number Series โ check differences, then ratios, then alternating patterns.
- Data Interpretation โ 3โ4 questions from one table/chart. Do these first; one reading answers all of them.
Practice source: IndiaBix (topic-wise) + PrepInsta TCS NQT section (company-specific pattern).
Section 2 โ Verbal Ability Strategy
- Reading comprehension: read the questions first, then scan the passage for answers. Saves 3โ4 minutes.
- Error spotting: 80% of errors are subject-verb agreement, tense mismatch, or preposition misuse. Revise just these three rules.
- Para jumbles: find the opening sentence (no pronouns, introduces the topic) and the closing sentence (conclusion words) โ the middle usually falls in place.
- Read one English editorial daily (The Hindu) for a month โ this alone lifts verbal scores noticeably.
Section 3 โ Reasoning Strategy
- Attempt order matters: series and coding-decoding first (30 sec each), puzzles and seating arrangement last (2โ3 min each).
- For seating arrangements, always draw the diagram โ never solve in your head.
- Blood relations: use a family-tree symbol notation (โก male, โ female) โ 10x fewer mistakes.
Section 4 โ Coding: What Actually Gets Asked
Foundation coding questions are LeetCode-Easy level. Frequently repeated patterns:
- Reverse a number / string, check palindrome
- Prime numbers, Armstrong numbers, factorials, Fibonacci
- Count vowels/consonants, character frequency
- Array: find min/max, second largest, sum of digits, sorting basics
- GCD/LCM, leap year, swapping without temp variable
- Pattern printing (star/number pyramids)
Example: Frequently Asked TCS NQT Problem
Q: Given a string, print the character that appears the most times.
# Python solution
s = input().strip()
freq = {}
for ch in s:
freq[ch] = freq.get(ch, 0) + 1
max_char = max(freq, key=freq.get)
print(max_char, freq[max_char])
Q: Check whether a number is an Armstrong number (e.g., 153 = 1ยณ+5ยณ+3ยณ).
# Python solution
n = int(input())
digits = str(n)
power = len(digits)
total = sum(int(d) ** power for d in digits)
print("Armstrong" if total == n else "Not Armstrong")
Language tip: Python is allowed and is the fastest to write under time pressure. If your college taught you C, practice reading input with scanf carefully โ most TCS coding failures are input-parsing bugs, not logic bugs.
For Digital/Prime Advanced coding, level up to: two-pointer problems, hashmap frequency problems, string manipulation, recursion, and simple greedy. Around 50 LeetCode Easy + 20 Medium problems is enough.
Ninja vs Digital vs Prime โ What's the Difference?
| Stream | Package | How to qualify | Interview difficulty |
| Ninja | โน3.36 LPA | Clear the Foundation test | Basic โ projects, one language, HR |
| Digital | โน7 LPA | High Foundation score + clear Advanced section | Moderate โ DSA, OOP, DBMS, projects in depth |
| Prime | โน9โ11.5 LPA | Top Advanced scores + strong interview | Hard โ DSA Medium, system basics, CS fundamentals |
Students who get Ninja can also attempt an internal Ninja-to-Digital upgrade test after joining โ but it's far easier to score Digital directly in the NQT.
The Interview Rounds (After the Test)
- Technical Round: your projects (know every line), one programming language in depth, DBMS basics (SQL joins, normalization), OOP pillars. Digital/Prime candidates also get live coding.
- Managerial Round: scenario questions ("a teammate isn't contributing โ what do you do?"), willingness to relocate, shift flexibility.
- HR Round: tell me about yourself, why TCS, service agreement awareness (TCS has a ~1-year agreement), documents check.
Practice technical questions from our interview question bank (240+ questions) โ especially JavaScript if your projects are web-based.
30-Day Preparation Plan
| Days | Focus | Daily routine (2โ3 hrs) |
| 1โ7 | Aptitude foundations | 1 hr numerical (percentages โ time & work), 30 min verbal, 30 min reasoning, 30 min coding basics |
| 8โ14 | Speed building | Topic-wise timed sets on IndiaBix; 2 coding problems daily (patterns, strings, arrays) |
| 15โ21 | TCS-specific pattern | PrepInsta TCS NQT previous questions; 1 full sectional mock every 2 days; pseudocode practice |
| 22โ27 | Full mocks | One full-length NQT mock daily + review every mistake; Advanced coding if targeting Digital/Prime |
| 28โ30 | Revision | Formula sheet revision, redo previously wrong questions, prepare interview intro & project explanation |
Common mistakes that fail candidates: not practicing on the TCS iON interface (do at least 2 mocks on a similar UI), spending 5 minutes stuck on one aptitude question, writing code without testing edge cases (empty input, single element), and ignoring the verbal section entirely.
Frequently Asked Questions
Is TCS NQT free to register?
Yes. Registration through the TCS NextStep portal for the recruitment NQT is free. Beware of paid third-party "guaranteed pass" services โ they are scams.
Can I attempt TCS NQT with an active arrear?
No โ TCS requires no active backlogs at the time of the selection process. Cleared history of arrears is generally acceptable within their overall academic criteria (60% / 6.0 CGPA throughout).
Which language is best for the coding section?
Whichever you're strongest in. Python is fastest to write; C/C++/Java are all fully supported. Don't switch languages a month before the exam.
Is there negative marking in TCS NQT?
No negative marking โ attempt every question. Never leave blanks.
How many times can I take the NQT?
TCS runs NQT cycles multiple times a year (typically 2โ3). If you don't clear one cycle, you can register for the next.
What CGPA do I need from Anna University?
Minimum 6.0 CGPA (60%) in 10th, 12th, and BE/BTech with no active arrears. Check your exact CGPA with our
CGPA calculator.
Continue Preparing