The TCS National Qualifier Test is structured with a precision that rewards candidates who understand the pattern as well as they understand the content. Knowing that there are aptitude questions is not enough. Knowing exactly how many questions appear per topic, how much time you have per question, and which topics carry the most weight relative to the preparation effort they demand - that is the level of detail that separates candidates who clear the NQT comfortably from those who fall one or two marks short. This article maps every section, every topic, every question type, and every preparation variable of the TCS NQT so you walk into the test hall with zero uncertainty about what to expect.

Technology Industry Analysis

If you want to pair this breakdown with an interactive practice environment, bookmark the TCS NQT Preparation Guide on ReportMedic - it covers section-wise mock questions aligned with the current NQT pattern without any sign-up required.

The Architecture of the TCS NQT: An Overview

The TCS NQT is not a single monolithic test. It is a two-tier structure composed of the Foundation Section and the Advanced Section, administered back to back in a single continuous sitting. The Foundation Section is mandatory for all candidates. The Advanced Section follows immediately and is attempted by candidates who have been pre-registered for Digital or Prime profiles, or in some cycles, by all candidates with Advanced section scores used for routing.

The full exam in its most complete form runs as follows:

Section Sub-section Questions Time
Foundation Numerical Ability 25 25 min
Foundation Verbal Ability 25 25 min
Foundation Reasoning Ability 25 25 min
Foundation Traits (Psychometric) 1 1 min
Advanced Advanced Quantitative Ability 10 25 min
Advanced Advanced Reasoning Ability 10 25 min
Advanced Advanced Coding 2-3 90 min

Total Foundation time: 76 minutes (75 minutes of aptitude + 1 minute Traits) Total Advanced time: 140 minutes Combined maximum sitting: approximately 3.5 to 4 hours including system setup, instructions, and biometric time

One architectural rule governs everything: you cannot navigate between sections once a section timer expires. When the 25 minutes for Numerical Ability ends, the section locks and you move to Verbal Ability whether you are ready or not. This is not a flexible, free-movement exam. Each section is a sealed window of time. This constraint shapes every preparation and exam-day strategy discussed in this article.

How the TCS NQT Pattern Has Evolved

Understanding the pattern’s history helps you avoid preparing for a version of the NQT that no longer exists.

Pre-2019 pattern: The early NQT was a shorter exam with fewer questions and no formal Advanced section distinction. The coding component was optional and carried lower weight. Verbal questions leaned more heavily on grammar rules and less on reading comprehension. The scoring methodology was simpler.

2019-2021 transition: TCS formalised the Ninja/Digital/Prime tiering, and the Advanced section became a structured component with defined time allocations. The coding section expanded to 90 minutes and became the primary differentiator for Digital routing. The Traits section was introduced as a psychometric checkpoint.

2022-present pattern: The Foundation section settled at its current 25-25-25-1 structure. Question difficulty in the Foundation section increased modestly, with Data Interpretation questions becoming more multi-step and Reasoning puzzles becoming more complex. The Advanced Coding section began awarding partial credit based on test case pass rates, which changed preparation strategy significantly. The on-campus and off-campus versions of the pattern became more closely aligned, with the main differences being in the delivery mode rather than the question set structure.

What this evolution means for preparation:

The trajectory is toward greater emphasis on coding ability and algorithmic thinking as the distinguishing factor between profile tiers. The Foundation section has stabilised and is unlikely to change dramatically in difficulty. The Advanced Coding section is where TCS has invested the most design effort in recent cycles, and it is where preparation effort yields the most significant profile-routing impact for candidates who are targeting Digital.

Candidates who prepared for the NQT 3-4 years ago and are re-appearing in the current cycle should note: the Foundation section is broadly similar but slightly harder on DI and Reasoning. The Advanced section is more structured and the coding component has a clearer problem-difficulty gradient than in earlier cycles. The partial credit scoring model is the most significant change that affects strategy - always submit something for every coding problem.

The version described in full detail throughout this article reflects the current pattern.

Foundation Section: Numerical Ability

Questions: 25 Time: 25 minutes Average time per question: 60 seconds Difficulty: Moderate (comparable to the arithmetic and DI sections of banking preliminary exams, but without the extreme DI complexity of the CAT) Negative marking: Varies by cycle - historically 0.33 per wrong answer in most cycles; verify the current cycle’s rules on TCS Next Step

What This Section Tests

The Numerical Ability section tests applied mathematical reasoning. The emphasis is on the speed and accuracy of calculation combined with the ability to interpret data presented visually. Pure theoretical mathematics - integration, differential equations, abstract algebra - does not appear here. The mathematics is practical and grounded in business and everyday contexts.

Topic-wise Breakdown and Weightage

Arithmetic (approximately 10-12 questions)

This is the single largest cluster within Numerical Ability and must be treated as the highest priority. Arithmetic problems span:

  • Percentages and their applications (discounts, commission, population growth, percentage change)
  • Profit and Loss (cost price, selling price, marked price, successive discounts)
  • Simple Interest and Compound Interest (including comparisons between SI and CI for the same principal)
  • Ratio and Proportion (including partnership problems and alligation/mixture)
  • Time, Speed, and Distance (including relative speed, trains crossing platforms, boats in streams)
  • Time and Work (efficiency-based problems, pipes and cisterns)
  • Averages and weighted averages

Representative example question pattern for Time, Speed, Distance: A vehicle covers the first half of a journey at 40 km/h and the second half at 60 km/h. If the total journey is 300 km, what is the average speed for the entire journey? This tests whether a candidate applies the harmonic mean formula rather than the arithmetic mean, a common trapping point.

Representative example for Mixture and Alligation: A container holds a mixture of milk and water in the ratio 5:3. How much water must be added to 64 litres of this mixture to make the milk-to-water ratio 5:4?

These questions require no advanced mathematics - just formula recall, careful equation setup, and arithmetic execution under time pressure.

Data Interpretation (approximately 6-8 questions)

DI questions appear as sets of 2-4 questions based on a single data representation. The data source can be a bar chart, a line graph, a pie chart, a table, or a combination. DI questions in the NQT are not as computation-heavy as CAT DI, but they do require careful reading of axes, legends, and units.

Representative example pattern: A table shows the quarterly sales figures for five product categories over three years. Questions ask: which category showed the highest percentage growth from Year 1 to Year 3, what was the combined sales of two categories in Q2 of Year 2, and by how much did Category C’s Year 3 total exceed Category D’s Year 2 total.

The key skill in DI is not calculation speed but data reading accuracy. Many candidates make errors by reading the wrong row or column or misidentifying the unit (lakhs vs crores, kg vs tonnes).

Number Systems and Algebra (approximately 4-5 questions)

These questions test foundational numerical properties:

  • HCF and LCM (and their product relationship)
  • Divisibility rules for 2, 3, 4, 6, 8, 9, 11
  • Remainders and modular arithmetic
  • Simplification using BODMAS
  • Basic linear equations and word problems
  • Surds and indices at a fundamental level

Representative example: What is the smallest number that, when divided by 12, 15, and 18, leaves a remainder of 5 each time? This tests LCM computation followed by adding the remainder.

Permutations, Combinations, and Probability (approximately 3-4 questions)

These topics appear less frequently than arithmetic but have appeared consistently across cycles. Foundation-level P&C includes:

  • Arrangements of letters in a word (with and without repetition)
  • Selections from a group
  • Basic probability as favourable outcomes divided by total outcomes
  • Complementary probability (probability that an event does NOT occur)

The NQT Foundation level does not require knowledge of multinomial theorem or advanced combinatorial identities.

Numerical Ability: Preparation Strategy

The single most important preparation practice for this section is timed question sets. Doing 25 numerical questions in 25 minutes under exam conditions, once every 2-3 days, rapidly builds the calculation speed and decision-making discipline that the section demands. Focus on formula recall and error-free arithmetic under speed. The on-screen basic calculator (addition, subtraction, multiplication, division, square root) is available during the exam - practice using it rather than doing all calculations mentally.

Formula sheet essentials for Numerical Ability:

Every candidate should have the following formula set at instant recall before exam day:

  • Simple Interest: SI = (P x R x T) / 100; Compound Interest: CI = P(1 + R/100)^T - P
  • Time and Work: If A can complete a job in X days and B in Y days, together they complete it in XY/(X+Y) days
  • Time and Distance: Distance = Speed x Time; Average Speed for two legs at equal distance = 2S1S2 / (S1+S2)
  • Profit/Loss: Profit% = (Profit / CP) x 100; SP = CP x (100 + Profit%) / 100
  • Mixture (Alligation): ratio to mix = (dearer - mean) : (mean - cheaper)
  • Probability: P(A) = Favourable outcomes / Total outcomes; P(A or B) = P(A) + P(B) - P(A and B) for non-mutually exclusive events

The one-minute decision framework for Numerical questions:

On reading a Numerical question, make this decision within 10 seconds: Can I solve this in under 60 seconds with reasonable confidence? If yes, solve it. If not, mark it for review and move on immediately. Do not attempt to “just try” a hard problem mid-section - the time cost of an abandoned attempt is the same as the time cost of a completed one, and you lose the opportunity to spend that minute on a question you could have solved cleanly.

For DI sets specifically, invest the first 30-40 seconds reading the chart or table completely before looking at any question. Candidates who read the first question and then try to extract data from the chart are slower and more error-prone than those who build a mental map of the data first.

Foundation Section: Verbal Ability

Questions: 25 Time: 25 minutes Average time per question: 60 seconds Difficulty: Moderate - comparable to verbal sections of banking preliminary exams; not as demanding as GMAT or GRE verbal Negative marking: Same cycle-specific rules as Numerical

What This Section Tests

The Verbal Ability section evaluates English language proficiency across reading comprehension, grammar, vocabulary, and sentence structure. This is not a test of literary analysis or advanced rhetoric. It tests whether a candidate can read English with adequate speed and understanding, identify grammatical errors, and communicate through written structure - all of which are relevant to the daily work of a TCS associate interfacing with clients and writing technical documentation.

Topic-wise Breakdown and Weightage

Reading Comprehension (approximately 8-10 questions)

Reading Comprehension typically appears as 2-3 passages of 150-250 words each, followed by 3-4 questions per passage. The passages cover topics such as technology trends, business strategy, social science observations, or general science - they are not literary or philosophical.

Question types within RC include:

  • Main idea or central theme of the passage
  • Inference questions (what can be concluded from the passage but is not directly stated)
  • Vocabulary in context (what does this word mean as used in paragraph 2)
  • Author’s tone or attitude
  • Specific detail retrieval (according to the passage, what is…)

Representative example: A passage of 200 words discusses how organisations are adapting their supply chains after disruption events. A question asks: “Which of the following best describes the author’s primary argument?” The answer requires distinguishing the main claim from supporting evidence.

RC questions reward candidates who can read purposefully and quickly. Skim for structure (topic sentence of each paragraph, concluding sentence of the passage) before reading the questions, then read for detail only when a specific question requires it.

Grammar and Error Identification (approximately 5-6 questions)

These questions present a sentence (or a four-part sentence where each part is labelled A, B, C, D) and ask the candidate to identify the grammatical error. Common error types tested:

  • Subject-verb agreement
  • Pronoun-antecedent agreement
  • Tense consistency within a sentence
  • Dangling or misplaced modifiers
  • Incorrect preposition usage
  • Faulty parallelism in lists

Representative example: “The team of engineers were unable to locate the fault despite (A) working through the night and (B) testing every (C) component individually.” The error is in the subject-verb agreement: “The team… was” not “were.”

Sentence Completion (approximately 4-5 questions)

A sentence with one or two blanks is provided. The candidate selects the best word or phrase to fill the blank from four options. These test vocabulary in context and the logical relationship between sentence parts.

Representative example: “The committee’s decision was ____ criticised by industry observers who felt that the ruling was both premature and inadequately ____ by evidence.” Options test whether the candidate can identify that the first blank requires an adverb like “widely” and the second requires something like “supported.”

Para Jumbles (approximately 4-5 questions)

Four to six sentences are presented in scrambled order. The candidate must arrange them into a logical, coherent paragraph. Para jumbles test discourse structure comprehension - understanding how ideas link, how pronouns refer back to previously introduced nouns, and how general statements relate to specific examples.

Strategy for para jumbles:

  1. Identify the opening sentence first (usually the one that introduces the topic without using a pronoun that refers to something not yet mentioned)
  2. Identify sentence pairs that clearly connect through pronoun references or logical sequence
  3. Work outward from those anchors

Synonyms, Antonyms, and Vocabulary (approximately 2-3 questions)

Direct vocabulary questions appear in smaller numbers in recent NQT cycles compared to older versions. These are the fastest to answer if you know the word and the slowest if you do not. A 200-300 word active vocabulary built through daily reading is the most efficient preparation.

Verbal Ability: Preparation Strategy

Thirty minutes of daily reading from quality English sources (a newspaper, a business or science magazine, or long-form journalism) is more effective for this section than any targeted vocabulary list. Read with attention to sentence structure - not just what is being said but how the sentences are constructed. For grammar, a focused review of the ten most common grammatical error types (subject-verb agreement, pronoun reference, tense consistency, parallelism, modifiers) covers the vast majority of what appears in the NQT.

Vocabulary building that actually works for the NQT:

Rather than memorising word lists, read passages from sources like Scientific American, The Economist, or quality technology journalism. When you encounter an unfamiliar word, note it with its context sentence - not just the definition. Words learned in context are retained far better than words learned from a list. By exam day, you want a working vocabulary that helps you answer RC questions in context, not just a list of definitions that may not match the contextual usage in the passage.

The RC timing strategy:

Each RC passage of 200-250 words with 3-4 questions should take no more than 3-3.5 minutes total. Read the passage once (aim for 90-120 seconds), then answer the questions using your comprehension and, when necessary, targeted re-reading of the relevant paragraph. Do not re-read the entire passage for each question. For the vocabulary-in-context question type, you do not need to re-read - find the specific sentence containing the word and use the surrounding context to determine meaning.

Para jumble technique at speed:

Practice completing para jumbles in under 90 seconds. The fastest reliable method:

  1. Find the sentence that introduces the topic without referencing something not yet mentioned (likely the opener)
  2. Find mandatory pairs - sentences where one directly responds to or continues the other
  3. Use these anchors to build the sequence from both ends

Error identification rapid-fire practice:

For grammar questions, reading the sentence aloud mentally often reveals errors that visual scanning misses. This is because spoken grammar instincts are frequently more reliable than analytical grammar rule application under time pressure. If something “sounds wrong,” investigate why - it usually corresponds to a real grammatical error.

Foundation Section: Reasoning Ability

Questions: 25 Time: 25 minutes Average time per question: 60 seconds Difficulty: Moderate to moderately high - the puzzle-based questions are the most time-consuming part of the Foundation section Negative marking: Cycle-specific; verify on TCS Next Step

What This Section Tests

Logical and analytical reasoning under time pressure. This section tests the candidate’s ability to form structured representations of complex constraint sets and derive conclusions from them quickly. Unlike Numerical Ability where calculation speed is a key variable, here the key variable is systematic thinking - the ability to set up the problem in a way that makes the answer findable without revisiting all constraints multiple times.

Topic-wise Breakdown and Weightage

Seating Arrangements (approximately 6-8 questions)

Seating arrangement problems appear as question sets of 3-4 questions based on a single constraint set. Two formats appear:

  • Linear arrangements: People seated in a row facing the same or opposite directions, with clues about relative positions (“A is not adjacent to B,” “C is to the left of D but not immediately”)
  • Circular arrangements: People seated around a table, where “left” and “right” depend on the facing direction

Representative example constraint set: Eight people - P, Q, R, S, T, U, V, W - are seated around a circular table. P faces the centre. Q is seated two positions to the right of P. R is not adjacent to Q or P. T sits exactly opposite to W. S sits to the immediate left of V. Based on these constraints, three questions ask about specific relative positions.

Setting up a diagram immediately upon reading the constraints is non-negotiable for time efficiency. Candidates who try to answer seating arrangement questions by re-reading the constraints for each sub-question lose significant time.

Blood Relations (approximately 3-4 questions)

Questions describe family relationships through a series of statements and ask the candidate to identify the relationship between two specified individuals.

Representative example: “A is the father of B. C is the mother of D. B is the son of C. E is the sister of B.” Questions ask: “What is A’s relationship to D?” and “How is E related to C?”

Draw a family tree immediately. Annotate each person with their gender if stated. The error candidates most commonly make is losing track of generations.

Syllogisms (approximately 3-4 questions)

Syllogism questions provide two or more categorical statements (All A are B; Some B are C; No C are D) and ask the candidate to identify which of the given conclusions must definitely be true.

Representative example: Statements: All programmers are engineers. Some engineers are managers. Conclusions: I. Some managers are programmers. II. All engineers are programmers. III. Some programmers may be managers. Which conclusions follow?

The Venn diagram method is the most reliable approach. Candidates who try to reason through syllogisms verbally are slower and more error-prone than those who draw diagrams.

Coding-Decoding (approximately 3-4 questions)

In a defined coding system, words or letters are substituted according to a pattern. The candidate must decode the pattern from examples and apply it to answer questions.

Representative example types:

  • Letter shifting (each letter moved forward/backward by a fixed number of positions in the alphabet)
  • Mixed pattern (consonants and vowels treated differently)
  • Word-level coding (a word is represented by a different word based on positional rules)

These questions are usually the fastest to answer in the Reasoning section if you identify the pattern correctly on the first attempt.

Number and Letter Series (approximately 3-4 questions)

A sequence of numbers or letters is presented with one term missing. The candidate identifies the governing pattern and fills the blank.

Representative example patterns:

  • Arithmetic progression with increasing difference (2, 5, 9, 14, 20, ?)
  • Alternating patterns (A, C, F, J, ?)
  • Mixed number-letter sequences

Data Sufficiency (approximately 2-3 questions)

A question is posed and two statements (I and II) are provided. The candidate must determine whether statement I alone, statement II alone, both together, or neither is sufficient to answer the question.

Representative example: Question: What is the value of x? Statement I: x² = 25 Statement II: x > 0 Neither statement alone gives a unique answer (Statement I gives x = 5 or x = -5). Together, they uniquely determine x = 5. Answer: Both statements together are needed.

Analytical/Logical Puzzles (approximately 2-3 questions)

Multi-entity, multi-attribute matching problems where several people are matched to several attributes (job, city, preference) using a set of elimination clues. These are the most time-consuming question type in the Reasoning section and should be triaged carefully.

Reasoning Ability: Preparation Strategy

For seating arrangements and puzzles, practice setting up the diagram within the first 30 seconds of reading. Speed in diagram setup is a trainable skill - it comes from repeated exposure to multiple problem configurations. Syllogisms respond well to consistent Venn diagram practice. Coding-decoding and series questions are faster and should be used as “time recovery” opportunities within the section - when you are running low on time, prioritise these question types over incomplete puzzles.

Managing the Reasoning section under time pressure:

With 25 questions in 25 minutes, the Reasoning section is the most time-pressured proportionally. The reason is that several question types (seating arrangements, complex puzzles) appear as sets of 3-4 questions built on a single scenario. Getting the scenario setup right is critical - if your initial diagram is wrong, all 3-4 questions based on it will be wrong, costing you a significant cluster of marks. The recommended approach:

  1. In the first 60 seconds, scan all 25 questions to identify which questions are part of a set and which are standalone
  2. Begin with standalone question types (blood relations, coding-decoding, series) to build marks quickly
  3. Then tackle the easier-looking arrangement or puzzle set
  4. Save the most complex multi-constraint puzzle for last, and solve it only if time permits

Blood relations diagram conventions:

Establish a consistent convention before the exam and use it every time. A common one: draw all males as squares, females as circles, marriage as a horizontal double line, parent-child as a vertical line. Using the same convention in every practice session means you can set up blood relation diagrams rapidly without deciding how to represent each relationship from scratch.

Syllogism accuracy under speed:

The Venn diagram method works for syllogisms but can be slow when there are three or four statements. For two-statement syllogisms, practice the possibility-checking method: draw the most conservative Venn diagram (minimal overlap, minimal containment) and the most liberal (maximum overlap, maximum containment) and check whether each conclusion is true in both, neither, or one. A conclusion that is true in both is a definite conclusion. A conclusion that is possible but not definite requires “some” language to be correct.

Foundation Section: Traits (Psychometric Assessment)

Questions: 1 (or a very small set, sometimes presented as a single composite question) Time: 1 minute Difficulty: Not applicable in the traditional sense - this is a psychometric instrument, not an aptitude question

What the Traits Section Is

The Traits section is a behavioural or psychometric assessment embedded at the end of the Foundation section. TCS introduced this component to gather a quick behavioural signal alongside the cognitive assessment. The question (or brief set of statements) typically presents workplace scenarios or preference statements and asks the candidate to indicate their response or level of agreement.

Representative format examples:

  • “Given a choice between a task that is familiar and one that is new and challenging, I would generally prefer:” (with options on a scale or between two choices)
  • “When my team disagrees about an approach, I typically:” (with several behavioural options)
  • Agree/Disagree on a 5-point scale with statements like “I prefer to plan extensively before beginning any task” or “I work most effectively when given clear, structured guidelines”

How TCS Uses Traits Scores

TCS does not publish the weight of the Traits section in the final NQT score, and candidate reports indicate that it does not function as a pass/fail filter in the same way aptitude sections do. Instead, it appears to be used as supplementary information during HR panel review and potentially in team placement decisions post-joining.

The practical implication: there are no “right” answers to game in the Traits section. Attempts to respond based on what you think TCS wants to see are both ethically problematic and practically ineffective - psychometric instruments are designed to detect inconsistent or socially desirable response patterns. Respond honestly and quickly. With only 1 minute allocated, there is no time for elaborate analysis of each option.

What Behavioural Traits TCS Is Looking For

While you should not attempt to game the Traits section, understanding the general behavioural profile TCS values in its associates gives context. TCS’s published values and cultural statements emphasise:

  • Adaptability and willingness to learn (relevant given the pace of technology change in IT services)
  • Team orientation over individual-first decision-making
  • Customer centricity (since TCS’s business model involves client relationships)
  • Integrity and transparency
  • Systematic, process-oriented thinking

Psychometric items in the Traits section are likely aligned with assessing these broad dimensions. A candidate who genuinely embodies these qualities - through their academic history, projects, and genuine work habits - will respond to Traits items naturally in a way that reflects well, without any deliberate strategy.

Advanced Section: Advanced Quantitative Ability

Questions: 10 Time: 25 minutes Average time per question: 2.5 minutes Difficulty: High - comparable to medium-to-hard CAT quantitative questions Target profile: Primarily candidates routing toward TCS Digital and Prime

What This Section Tests

The Advanced Quantitative section revisits topics that appear in the Foundation Numerical section but at a significantly elevated difficulty. Problems are multi-step, involve compound conditions, and frequently require insight (a non-obvious reformulation of the problem) rather than mechanical formula application. Speed is still required, but the bottleneck here is problem-solving depth rather than arithmetic pace.

Topic-wise Breakdown and Weightage

Advanced Permutations and Combinations (2-3 questions)

Multi-constraint arrangement problems where candidates must correctly account for restricted positions, identical elements, circular arrangements with fixed points, or selections with forbidden pairs.

Representative example: In how many ways can 4 men and 3 women be seated in a row such that no two women are adjacent? This requires placing the men first (4! arrangements), then selecting 3 of the 5 available gaps between men for the women (5P3 ways) - a two-step approach that many candidates set up incorrectly.

Advanced Probability (2-3 questions)

Conditional probability, Bayes’ theorem at a basic level, compound events, expected value questions.

Representative example: Two cards are drawn without replacement from a standard 52-card deck. What is the probability that the second card is an Ace given that the first card drawn was a King? This requires careful application of conditional probability with updated denominators.

Number Theory and Advanced Arithmetic (2-3 questions)

Remainders using cyclicity, Euler’s theorem applications, Fermat’s little theorem, chain remainders, problems involving multiples and divisors with complex conditions.

Representative example: What is the remainder when 7^100 is divided by 50? This requires identifying the cyclicity of powers of 7 modulo 50, not brute-force calculation.

Advanced Time/Work, Speed/Distance (2-3 questions)

Complex multi-agent work problems with varying efficiencies, problems involving relative motion with acceleration, or mixture problems with continuous adding/removing.

Representative example: Pipes A and B together fill a tank in 6 hours. Pipe A alone fills it in 10 hours. Pipe C empties the full tank in 15 hours. If all three pipes are opened together, how long does it take to fill the tank starting from empty? This is a Foundation-level structure, but Advanced questions add conditions like “pipe C is opened only after the tank is half full” or “pipe A’s efficiency drops by 20% after the first 2 hours.”

Advanced Quantitative: Preparation Strategy

This section is where Foundation-only preparation falls short. Spend at least 45-60 minutes per day on this section across your preparation period. Work through P&C and Probability problems from CAT preparation materials - CAT easy-to-medium level is a good difficulty calibration. The key skill is recognising which mathematical principle underlies a problem before beginning to compute, rather than trying multiple approaches until one works.

Advanced Section: Advanced Reasoning Ability

Questions: 10 Time: 25 minutes Average time per question: 2.5 minutes Difficulty: High - complex multi-attribute puzzles, critical reasoning, and analytical reasoning of a type rarely seen in banking exams

What This Section Tests

Advanced Reasoning tests the ability to handle greater informational complexity than the Foundation Reasoning section. The constraints are more numerous, the attribute sets are larger, and some questions introduce logical argument analysis (critical reasoning) that requires evaluating the logical structure of a paragraph rather than a mathematical constraint set.

Topic-wise Breakdown and Weightage

Complex Seating Arrangements (3-4 questions)

Multi-layer arrangements: two concentric circles, a rectangular table with both edge and corner positions, or a combination of linear and circular seating across multiple rows. The constraint sets are longer (8-10 clues) and some clues are conditional (“If X is in the second row, then Y cannot be adjacent to Z”).

Multi-attribute Puzzle Sets (3-4 questions)

Five to seven entities each associated with two or three attributes. Constraints eliminate possibilities through direct statements, relative statements, and negative statements simultaneously.

Representative example: Six colleagues - A, B, C, D, E, F - each work in a different department (HR, Finance, Marketing, Operations, IT, Legal) and each use a different laptop brand. Twelve clues progressively restrict the possibilities. Questions ask which person works in IT, which brand does the Finance person use, and so on.

Critical Reasoning (2-3 questions)

Short argument paragraphs followed by questions asking candidates to: identify the assumption underlying the argument, choose the statement that most weakens the conclusion, choose the statement that most strengthens the argument, or identify the conclusion the argument is trying to support.

Representative example: “Companies that allow employees to work remotely report higher productivity scores than those requiring full office attendance. Therefore, remote work causes higher productivity.”

Question: Which of the following most undermines this conclusion? Options include: A - Remote-capable jobs are inherently more autonomous and therefore more productive regardless of location. B - Remote workers report higher job satisfaction. C - Office attendance improves team communication. D - Productivity measurement methods are inconsistent.

Option A is the correct weakener because it identifies that the correlation between remote work and productivity may be explained by a confounding variable (job type), rather than a causal relationship.

This type of question is unusual for many Indian engineering students who have not encountered GMAT/GRE-style critical reasoning. It rewards analytical thinking over memorised problem types.

Advanced Reasoning: Preparation Strategy

For complex puzzles, the preparation habit is the same as Foundation-level but at greater constraint volume. For critical reasoning, practice with GMAT-style CR question banks (freely available on platforms such as GMAT Club and Beat the GMAT). Understanding the argument structure terminology - premise, conclusion, assumption, inference, flaw - before tackling CR questions makes them significantly more tractable.

Critical reasoning: a structured approach

The core skill in critical reasoning is identifying the gap between the evidence presented and the conclusion drawn from it. Every valid argument structure has premises (facts or observations accepted as true) and a conclusion (the claim the author is trying to establish). The assumption is the unstated bridge between premises and conclusion - it is what must be true for the argument to hold. Weakener questions ask you to attack this bridge; strengthener questions ask you to reinforce it.

Framework for weakener questions:

  1. Identify the conclusion (the main claim)
  2. Identify the key evidence (the primary reason given for believing the conclusion)
  3. Identify the gap (what is assumed but not stated)
  4. Select the option that directly contradicts the assumption or shows that the conclusion could be wrong even if the evidence is true

Framework for strengthener questions:

  1. Same steps 1-3
  2. Select the option that directly confirms the assumption or eliminates an alternative explanation for the evidence

Common wrong answer traps in Critical Reasoning:

  • The relevant but off-topic trap: The option is related to the subject matter but does not address the logical connection between evidence and conclusion
  • The strengthener disguised as a weakener (or vice versa): The option addresses the topic of the argument but strengthens it when the question asks for a weakener
  • The extreme language trap: An option that says “always,” “never,” “all,” or “none” is usually wrong in CR unless the argument itself is making an absolute claim

Practising 5-8 GMAT Critical Reasoning questions per session across a three-week period - with careful analysis of each wrong choice after completing the set - builds the pattern recognition needed to answer these questions in the 2.5-minute window the Advanced Reasoning section provides.

Advanced Section: Advanced Coding

Questions: 2-3 Time: 90 minutes Difficulty: Ranges from Easy (Problem 1) to Hard (Problem 2 or 3) Target profile: Mandatory for Digital; most critical differentiator for Prime Supported languages: C, C++, Java, Python (and occasionally JavaScript, depending on cycle)

Structure of the Coding Section

The 90-minute coding section is the highest-weighted component for Digital and Prime profile routing. It is fundamentally different from the aptitude sections in nature - there is no multiple-choice. The candidate writes, compiles, and submits actual code within the TCS iON integrated development environment (IDE).

Problem 1 (Easy to Medium, approximately 15-25 minutes)

The first problem is an implementation-level problem. It tests whether the candidate can write clean, working code using standard programming constructs. No exotic algorithms or advanced data structures are required.

Representative topic areas for Problem 1:

  • String manipulation: Reverse words in a sentence, check if two strings are anagrams, count the frequency of each character, find the longest common prefix
  • Array operations: Find the second largest element, rotate an array by K positions, remove duplicates from a sorted array
  • Mathematical computation: Check if a number is prime, compute factorial using recursion, find all Armstrong numbers in a range
  • Pattern generation: Print a triangle, diamond, or spiral number pattern

Representative example problem: “Given a string, find the first non-repeating character and return its index. If no such character exists, return -1.”

A candidate comfortable with any of the four supported languages should solve this in 15-20 minutes with a working solution that passes all test cases.

Problem 2 (Medium to Hard, approximately 40-60 minutes)

The second problem requires algorithmic thinking. Brute-force solutions may pass some test cases but typically fail on large inputs due to time limit exceeded (TLE) errors. The intended solution uses a recognised algorithmic approach from the following categories:

  • Dynamic Programming: Subset sum, longest increasing subsequence, coin change, 0-1 knapsack, matrix chain multiplication at basic level
  • Greedy Algorithms: Activity selection, fractional knapsack, minimum number of coins for a target amount
  • Graph Traversal: Breadth-First Search (BFS) and Depth-First Search (DFS) applied to grid problems, shortest path problems, cycle detection
  • Binary Search: Binary search on the answer (find the minimum maximum or maximum minimum in a constraint set), searching in a rotated sorted array
  • Recursion and Backtracking: Generate all permutations or subsets, N-Queens at small N, maze path counting

Representative example problem: “You are given an array of integers representing the heights of buildings. Find the maximum amount of water that can be trapped between the buildings after a rain.” This is the classic Trapping Rain Water problem, requiring either a two-pointer approach (O(n) time, O(1) space) or a dynamic programming approach (O(n) time, O(n) space).

Problem 3 (When Present - Hard)

In some cycles, a third coding problem appears for Prime profile candidates. This is typically a hard-level problem requiring advanced data structures (segment trees, tries, disjoint set union), graph algorithms (Dijkstra’s shortest path, Bellman-Ford, topological sort), or complex dynamic programming (DP on trees, bitmask DP).

Most Ninja and Digital candidates do not need to prepare at this depth. Prime-targeting candidates should treat LeetCode Hard and Codeforces Div. 2 D/E problems as their calibration benchmark.

Dynamic Programming: The Most Important Advanced Coding Topic

Dynamic programming problems appear in Problem 2 in a significant proportion of NQT Advanced cycles. Many candidates lose marks here not because they do not know DP exists but because they cannot identify when a problem requires DP versus when it requires a greedy approach. The identification test is: does the optimal solution to the whole problem depend on the optimal solutions to overlapping sub-problems? If yes, DP. If the locally optimal choice at each step always leads to the globally optimal solution, use greedy.

Key DP patterns for NQT preparation:

1-D DP (single array state):

  • Fibonacci-style recurrence: current state depends on the previous one or two states
  • Coin change: minimum coins to reach a target amount
  • House robber: maximum value from a sequence with an adjacency constraint

2-D DP (grid or two-sequence state):

  • Longest Common Subsequence of two strings
  • Minimum path sum through a grid moving only right or down
  • Edit distance between two strings

DP with decision tracking: Problems where you need to reconstruct the optimal solution (not just its value) require maintaining a separate parent or decision array alongside the DP table.

Candidates targeting Digital should be able to code clean 1-D and simple 2-D DP solutions in their chosen language within 20-25 minutes.

Graph Traversal: BFS and DFS Applications

Graph problems in the NQT typically appear in disguised form - as grid problems where cells are nodes and adjacency is movement in four or eight directions. Recognising that a grid problem is a graph problem is the first skill; implementing BFS or DFS correctly is the second.

BFS applications in NQT-style problems:

  • Shortest path in an unweighted grid (minimum steps from start to end)
  • Level-by-level processing (find all cells at distance K from a source)
  • Flood fill (spread from a starting cell through connected cells of the same type)

DFS applications:

  • Connected components (how many separate islands in a grid of 0s and 1s)
  • Cycle detection in a graph
  • Path existence between two nodes

Implementation template to memorise (Python BFS):

from collections import deque

def bfs(grid, start):
    rows, cols = len(grid), len(grid[0])
    visited = set()
    queue = deque([(start[0], start[1], 0)])  # row, col, distance
    visited.add(start)
    directions = [(0,1),(0,-1),(1,0),(-1,0)]
    
    while queue:
        r, c, dist = queue.popleft()
        for dr, dc in directions:
            nr, nc = r + dr, c + dc
            if 0 <= nr < rows and 0 <= nc < cols and (nr,nc) not in visited:
                visited.add((nr, nc))
                queue.append((nr, nc, dist + 1))

Having a reliable BFS template ready to adapt is significantly more efficient under exam time pressure than constructing the traversal from scratch.

Coding Section: How to Manage 90 Minutes

The 90-minute window is generous compared to the Foundation sections’ 60-seconds-per-question constraint, but it is easy to mismanage:

Minutes 0-5: Read both (or all three) problems completely before writing a single line of code. Form a mental solution outline for each. This investment of 5 minutes prevents the common mistake of beginning to code Problem 1 only to realise after 20 minutes that Problem 2 is actually more tractable.

Minutes 5-25: Solve Problem 1. Aim for a clean, correct solution. Run against visible test cases before submitting. If your solution fails a visible test case, debug and fix it rather than submitting a broken solution hoping hidden cases pass.

Minutes 25-80: Work on Problem 2. Spend the first 5 minutes identifying the algorithmic approach. If you recognise the pattern (DP, BFS, binary search), implement the intended solution. If you do not, build a brute-force solution first that handles basic cases, submit it, and then attempt to optimise if time allows. A brute-force that passes 5 of 10 test cases is better than an elegant solution you did not have time to complete.

Minutes 80-90: Return to any incomplete problem. If Problem 2’s brute-force is submitted and you have remaining time, attempt to fix edge cases or improve the algorithm. Ensure both problems have at least a submitted solution, even if partial.

Coding Languages: Capabilities and Quirks

Python

  • Fastest to write; most concise code
  • Built-in data structures (list, dict, set) handle most problems without manual implementation
  • Standard library is comprehensive: collections.Counter, heapq, itertools
  • Runtime is slower than C++ for compute-heavy problems; large test cases on sorting/searching-heavy problems may hit TLE if the solution is not O(n log n) or better
  • Python 3 is supported; Python 2 is no longer available on most NQT cycles
  • Indentation errors are the most common reason a Python submission fails to compile in the TCS iON IDE - be meticulous about consistent spacing (4 spaces per indent level is the standard)

Java

  • Verbose but fast runtime
  • The Scanner and BufferedReader classes are both available for input; BufferedReader with Integer.parseInt is significantly faster for large inputs
  • Common NQT mistake: forgetting to close the Scanner or missing System.out.flush() when using PrintWriter for output, which can cause incomplete output on test cases
  • ArrayList, HashMap, PriorityQueue from java.util are all available and frequently needed
  • The class name in TCS iON must match the file name exactly (case-sensitive); the IDE enforces this

C++

  • Fastest runtime; most competitive programmers’ preferred language for algorithmic problems
  • #include <bits/stdc++.h> with using namespace std; works in TCS iON and provides access to all standard library features
  • STL containers (vector, map, set, unordered_map, priority_queue) are fully available
  • Common mistake: integer overflow when working with large numbers; use long long instead of int when intermediate products might exceed 2^31 - 1
  • Undefined behaviour (reading out of bounds, using uninitialised variables) can cause incorrect output that only manifests on certain test cases - this is hard to debug in a timed exam environment

C

  • No built-in dynamic data structures; candidates must implement linked lists, stacks, and queues manually if needed
  • Generally not recommended for candidates who are comfortable with C++ or Python, as the extra verbosity costs time with no unique advantage at the NQT difficulty level
  • printf and scanf are faster than their C++ equivalents and can matter on very large input problems

Which Language to Choose Choose the language in which you can write correct, compilable code fastest under time pressure. For most candidates, this is the language you have used most in academic coursework. The performance difference between Python and C++ rarely matters at NQT difficulty levels for Problems 1 and 2. It may matter for a Problem 3 in an advanced cycle, but by that point, a candidate with strong enough algorithmic skills to compete for Prime will already know which language gives them the best combination of speed and correctness.

Compiler Behaviour and Test Case Scoring

The TCS iON coding environment runs the submitted code against a set of hidden test cases. Scoring is based on the number of test cases passed:

  • If 7 of 10 test cases pass, the candidate receives 70% of the marks for that problem
  • The test cases include boundary conditions: empty arrays, single-element arrays, very large inputs (to test time complexity), negative numbers (where relevant), and duplicate values
  • The “Run” function lets you test your code against visible sample test cases before submission. Use this feature before final submission - a visible test case failure is a signal of a fundamental bug that needs fixing
  • A clean compile with no runtime errors but incorrect output on all test cases scores 0 - wrong logic is not rewarded regardless of code quality
  • A runtime error (segmentation fault in C/C++, NullPointerException in Java, IndexError in Python) typically scores 0 for the cases that trigger it

Common reasons for test case failures:

  • Off-by-one errors in loop bounds (the single most common bug type)
  • Not handling the edge case where the input is empty or has exactly one element
  • Integer overflow (using int instead of long long in C/C++ or Java)
  • Incorrect input parsing (reading input as string when it should be int)
  • Infinite loops caused by incorrect loop termination conditions

On-Campus vs Off-Campus Pattern Differences

The question structure of the NQT is designed to be consistent across both on-campus and off-campus modes. TCS uses the same question pools and the same marking framework for both channels. The differences are logistical rather than academic:

Delivery mode: On-campus sessions may use TCS iON’s remote proctoring capability, where students take the test on their own devices at their institution. Off-campus candidates appear at designated TCS iON test centres.

Remote proctoring requirements (on-campus or at-home mode):

  • A working webcam (internal or external) is mandatory. A blurry or non-functioning camera is grounds for disqualification
  • A stable internet connection is required throughout. TCS recommends a wired connection or strong WiFi; mobile data hotspots are generally not recommended due to latency variability
  • A single monitor setup is required. Dual monitors trigger a proctoring alert
  • The browser must be in full-screen, locked mode. The TCS iON safe browser application is typically downloaded and installed before the exam
  • The room must be adequately lit so the proctoring camera can clearly see the candidate’s face
  • No other person may be visible or audible in the background during the exam
  • Looking away from the screen repeatedly or for extended periods triggers an automated flag

Seat centre mode: At a physical test centre, the iON environment runs on the centre’s computers. No personal device is needed or permitted. Rough paper is provided and collected at the end. The proctoring is primarily human (invigilators in the hall) supplemented by screen recording.

Question variation: Both modes draw from the same pool but may not use identical questions. TCS uses question equating to ensure that candidates who receive a harder question set are not penalised compared to those who receive an easier one.

Test Navigation Rules

These rules are critical and non-negotiable. Understanding them before exam day eliminates avoidable errors:

Rule 1 - No section switching: You cannot leave a section before its timer expires and return to it later. You cannot move backward to a previous section at any point. Once the Numerical Ability section closes, those 25 questions are locked.

Rule 2 - Within-section navigation is free: Within a single section’s timer window, you can move between questions freely. You can mark a question for review and return to it as many times as you like before the timer expires.

Rule 3 - No external resources: The only resource permitted alongside the exam is the on-screen basic calculator (for aptitude sections). Notes, textbooks, second devices, and search engines are not accessible and attempting to access them triggers proctoring alerts.

Rule 4 - Mandatory section progression: If you finish a section early, you can review within it. When you submit or the timer expires, the platform moves to the next section automatically. You cannot choose to use remaining time from one section in the next.

Rule 5 - Coding section submission: For the coding section, the timer counts down the full 90 minutes across both (or three) problems. You can switch between problems, submit Problem 1 and work on Problem 2, or re-open a previously submitted problem as long as the 90 minutes has not expired.

Rule 6 - No re-attempt: Once you submit the exam (or the overall timer expires), the session is closed. There is no way to change answers after submission.

Topic Priority Matrix: Maximum ROI for Preparation Time

This matrix rates each topic on two dimensions: the frequency with which it appears (based on cumulative candidate-reported data across multiple cycles) and the relative preparation effort required to achieve proficiency. Topics with high frequency and low preparation effort represent the maximum return-on-investment for a time-constrained candidate.

Topic Appearance Frequency Preparation Effort ROI Rating Priority
Arithmetic (%, P/L, SI/CI) Very High Low Very High 1
Time, Speed, Distance High Low Very High 1
Data Interpretation Very High Medium High 2
Reading Comprehension Very High Low Very High 1
Seating Arrangements High Medium High 2
Syllogisms Medium Low High 2
Coding-Decoding Medium Very Low Very High 1
Blood Relations Medium Very Low Very High 1
Para Jumbles Medium Low High 2
Grammar / Error ID High Low Very High 1
Number Series Medium Low High 2
P&C (Foundation) Medium Medium Medium 3
Probability (Foundation) Medium Medium Medium 3
Coding - Problem 1 (Implementation) High (for Adv) Medium Very High 1
Coding - Problem 2 (Algorithms) High (for Digital) High High 2
Advanced P&C Low-Medium High Medium 3
Critical Reasoning Low-Medium High Low-Medium 4
Advanced Number Theory Low High Low 4
Coding - Problem 3 (Hard) Low Very High Low (unless targeting Prime) 5

Priority 1: Must cover first; highest frequency and fastest to build proficiency Priority 2: Cover after Priority 1 is solid; significant frequency and manageable preparation Priority 3: Cover if preparation window allows; medium frequency, requires more time investment Priority 4: Cover only if targeting Digital or Prime and have completed Priority 1-3 preparation Priority 5: Target only if specifically aiming for Prime profile; requires deep competitive programming background

How to Use This Breakdown for a Time-Bucketed Preparation Plan

The syllabus breakdown in this article is most useful when translated into a concrete time allocation. Here is a recommended weekly time budget for a candidate with 6 weeks before the NQT:

Weeks 1-2:

  • Numerical Ability (arithmetic cluster): 45 min/day
  • Verbal RC and Grammar: 30 min/day
  • Reasoning (seating arrangements and blood relations): 30 min/day
  • Coding (implementation-level problems in your chosen language): 60 min/day

Weeks 3-4:

  • Numerical DI and remaining arithmetic topics: 30 min/day
  • Verbal (para jumbles, sentence completion): 20 min/day
  • Reasoning (syllogisms, coding-decoding, series): 30 min/day
  • Coding (algorithmic problems: sorting, searching, basic DP): 90 min/day
  • Begin Advanced Quantitative (P&C, Probability): 30 min/day

Weeks 5-6:

  • Full Foundation mock every 3 days (25-25-25 questions in 75 minutes)
  • Advanced section mock every 4 days
  • Coding: 1-2 medium-level algorithmic problems per day
  • Error log review and targeted revision of weak topics
  • Full exam simulation (Foundation + Advanced) once in final week

The ReportMedic TCS NQT Preparation Guide is a practical supplement during Weeks 3-6 - the tool’s question sets allow you to practice specific topic areas in isolation or as timed section mocks, making it easy to integrate into the daily schedule above.

Scoring and Score Interpretation

TCS does not publish raw scores directly to candidates in all cycles. The NQT result is typically communicated as a pass/fail decision along with a profile routing decision (Ninja, Digital, or Prime). In cycles where a score report is issued, it shows section-level performance rather than a single overall score.

What the score report typically shows:

  • Foundation section: overall performance indicator or section-level classification
  • Advanced section: overall performance indicator
  • Coding: number of test cases passed per problem (in cycles that share this level of detail)

How profile routing works from scores: TCS applies internal scoring weightages and percentile benchmarks to raw performance data. The exact algorithm is proprietary. What is known from candidate experiences is that:

  • Foundation section performance is the gating criterion - falling below the Ninja cutoff in Foundation eliminates a candidate regardless of Advanced section performance
  • For Digital routing, Advanced Coding performance carries the most significant weight
  • For Prime routing, Advanced Quantitative, Advanced Reasoning, and Problem 2 or 3 coding performance collectively determine routing
  • Foundation Verbal performance has historically been the weakest differentiator for profile routing but contributes to the overall Foundation band

Negative marking and its effect on score: In cycles with 0.33 negative marking per wrong answer, a candidate who attempts 24 of 25 Numerical questions and gets 19 right and 5 wrong receives a score of 19 - (5 x 0.33) = 17.35 out of 25. A candidate who attempts 20 questions and gets all 20 right scores 20. The second candidate scores higher despite attempting fewer questions. This arithmetic underlines the value of accuracy over volume when you are unsure of the answer.

The practical decision rule for negative marking cycles:

  • If you can eliminate two of four options with confidence, the expected value of guessing from the remaining two is positive: 0.5 x 1 - 0.5 x 0.33 = +0.34 per attempt. Guess.
  • If you can eliminate only one of four options, the expected value is 0.33 x 1 - 0.67 x 0.33 = +0.11 per attempt. Marginally positive - guess cautiously.
  • If you have eliminated zero options and are entirely guessing from all four, the expected value is 0.25 x 1 - 0.75 x 0.33 = 0. Neither helpful nor harmful - skip and use the time elsewhere.

In cycles with no negative marking, the decision is simple: never leave a question blank. A guess gives you a 25% chance of a mark; a blank gives you 0%.

Exam Day Section-by-Section Mental Checklist

Having a mental protocol for each section reduces decision fatigue and helps you perform closer to your preparation ceiling on exam day.

Before the exam begins:

  • Verify your name, registration number, and exam details on the screen during the setup phase
  • Get physically comfortable: adjust the chair, position the mouse and keyboard, and settle your breathing
  • Note the start time displayed on screen and confirm the section order matches what you prepared for

Entering Numerical Ability (25 min):

  • Remind yourself: 60 seconds per question maximum before skipping
  • Scan all 25 questions in the first 90 seconds to identify DI sets (linked questions)
  • Use the on-screen calculator for any multi-step arithmetic
  • With 5 minutes remaining, stop starting new problems and return to all marked-for-review questions

Entering Verbal Ability (25 min):

  • Read each RC passage completely before looking at any of its questions
  • Tackle grammar and vocabulary questions first if your RC reading speed is slow - they are faster per question
  • For para jumbles, spend no more than 90 seconds before committing to your best answer
  • With 3 minutes remaining, confirm every question has at minimum a guessed answer

Entering Reasoning Ability (25 min):

  • Diagrams before any deduction, always
  • Scan all 25 to identify arrangement sets versus standalone questions; do standalone first
  • Set up blood relation trees on rough paper immediately; never track relationships mentally
  • Flag incomplete puzzles and return with any remaining time

Entering Advanced Quantitative (25 min):

  • Getting 6-7 of 10 correct is a strong performance; do not panic when problems are hard
  • Read all 10 first; attempt the most familiar-looking 2-3 first to build confidence and marks
  • Show all working on rough paper to catch arithmetic errors

Entering Advanced Reasoning (25 min):

  • Critical reasoning questions first (faster if argument structure is clear)
  • For complex puzzles: allocate maximum 8 minutes and move on if stuck

Entering Advanced Coding (90 min):

  • Read both (or all three) problems fully before writing any code
  • Run visible test cases before submitting each solution
  • Always submit something for every problem, even if it is a brute-force partial solution

Common Misconceptions About the NQT Syllabus

Candidates frequently arrive at the NQT with inaccurate beliefs about what the exam tests and how it is structured. Addressing these directly eliminates preparation blind spots.

Misconception 1: “The coding section is only for Digital candidates, so I can skip it as a Ninja applicant.”

The Advanced Coding section is part of the Advanced section that all candidates who proceed past the Foundation section are expected to attempt. Even if you are targeting only the Ninja profile, leaving the coding section blank signals to TCS’s routing algorithm that you have no programming ability, which may affect borderline Foundation scores being evaluated for profile placement. More practically, attempting Problem 1 (implementation level) and submitting even a partially working solution costs you no marks and may earn partial credit that strengthens your overall profile. There is no strategic advantage in skipping it.

Misconception 2: “The NQT verbal section is easy - I can rely on my general English.”

This is the most common reason for underperformance in the Verbal section. Candidates who are comfortable communicating in English often assume the exam verbal section matches their conversational proficiency. In practice, RC inference questions and para jumbles require a specific set of analytical reading skills that conversational fluency does not automatically provide. A candidate who reads extensively and has practised inference questions specifically will consistently outperform a fluent-but-untrained candidate.

Misconception 3: “I should memorise previous NQT question papers to prepare.”

TCS uses large, rotating question banks. While reviewing previous cycle questions is useful for calibrating difficulty and understanding question formats, memorising specific questions and answers provides almost no advantage and wastes preparation time that could build genuine skills. Candidates who rely on memorised questions often panic when the actual exam presents a familiar-looking question with a slightly different data set or constraint.

Misconception 4: “The Reasoning section is easier than Numerical, so I should allocate less time to it.”

Many candidates find seating arrangement and complex puzzle questions more time-consuming than arithmetic, even if they feel more comfortable with logical reasoning conceptually. The Reasoning section’s difficulty is not in the complexity of the underlying mathematics but in the volume of constraint management under time pressure. Candidates who underprepare Reasoning often find themselves stuck on a single puzzle set for 8-10 minutes, which cascades into incomplete sections and lower overall scores.

Misconception 5: “A brute-force coding solution that gets wrong answers is better than nothing.”

A solution that produces wrong outputs for test cases scores zero for those cases, same as a blank submission. What is better than nothing is a solution that produces correct output for at least some test cases - even a brute-force that handles base cases correctly earns partial credit. The distinction is between “wrong answer” (code runs but produces incorrect output) and “no submission” (blank IDE). The former can earn partial marks if some test cases pass; the latter earns nothing. Always submit something.

Misconception 6: “The Foundation section is straightforward enough that I do not need to take timed mocks.”

The 60-seconds-per-question constraint is not merely a logistical detail - it is a fundamental feature of the test design. Candidates who practise numerical and reasoning without time constraints consistently underperform in the actual exam because their practised solve speed is significantly slower than required. The difficulty of each individual question may be manageable; the difficulty of 75 questions in 76 minutes is the real challenge.

Section-Specific Quick Reference

This reference table consolidates the key specifications for every section in one scannable view for last-minute review before the exam.

Section Questions Time Avg per Q Calculator Neg Mark Priority Topics
Numerical Ability 25 25 min 60 sec Yes (basic) 0.33 (verify) Arithmetic, DI
Verbal Ability 25 25 min 60 sec No 0.33 (verify) RC, Grammar
Reasoning Ability 25 25 min 60 sec No 0.33 (verify) Arrangements, Blood Relations
Traits 1 1 min 60 sec No None N/A
Adv. Quantitative 10 25 min 150 sec Yes (basic) Verify P&C, Probability
Adv. Reasoning 10 25 min 150 sec No Verify Puzzles, CR
Adv. Coding 2-3 90 min 30-45 min/prob No None Implementation, DP, Graph

Language support in Advanced Coding: C, C++, Java, Python (JavaScript in select cycles)

Section navigation: No backward movement between sections once a section timer closes

Proctoring (test centre): Webcam recording + human invigilators + screen recording

Proctoring (remote): Webcam mandatory, single monitor, full-screen browser lock, no background persons, stable internet required

Rough paper: Provided at test centre; collected at the end; no personal notes permitted

On-screen aids: Basic calculator (aptitude sections only), question navigation palette, mark-for-review function

What to bring: Printed admit card, original government photo ID, and any documents specified in the admit card instructions

How the NQT Syllabus Compares to Other Competitive Exams

Candidates often prepare for the NQT using materials designed for other exams - banking prelims, AMCAT, or CAT - and benefit from understanding exactly where the difficulty levels overlap and where they diverge. This calibration helps you use the right resources at the right intensity.

NQT vs Banking Prelims (IBPS PO, SBI PO)

Banking preliminary exams test arithmetic, reasoning, and English at a difficulty level that is broadly comparable to the NQT Foundation section. The key differences:

  • Banking prelims have a larger emphasis on number series and simplification; NQT has a larger emphasis on DI and applied arithmetic
  • Banking reasoning sections have more seating arrangements and puzzles than NQT Foundation, and slightly less data sufficiency
  • Banking verbal sections are somewhat easier on inference-based RC than NQT; they are comparable on grammar
  • Banking prelims have no coding component at all

Practical implication: Banking prelim preparation materials are well-suited for NQT Foundation numerical and reasoning practice. The DI questions in banking mains (not prelims) are a good stretch target for NQT-level DI. If you have used banking prep resources and are comfortable with them, you are approximately at NQT Foundation difficulty.

NQT vs AMCAT

The AMCAT (Aspiring Minds Computer Adaptive Test) is used by many companies as a screening instrument and is sometimes used as a comparison point by NQT candidates.

  • AMCAT is adaptive (difficulty adjusts question by question); NQT Foundation is not adaptive within a section
  • AMCAT’s quantitative section is slightly easier than NQT Foundation numerical in most administered forms
  • AMCAT’s coding section is generally easier than NQT Advanced Coding; AMCAT Problem 1 calibrates approximately to NQT Problem 1, but AMCAT rarely presents a Problem 2 at NQT Advanced Coding difficulty
  • AMCAT verbal and logical sections are comparable to NQT Foundation at lower difficulty

Practical implication: If you are preparing for both AMCAT and NQT simultaneously, NQT preparation covers AMCAT requirements but not the other way around. Preparing specifically for AMCAT and assuming that prepares you adequately for NQT is a risky approach, particularly for candidates targeting Digital.

NQT vs CAT

The CAT (Common Admission Test) for IIM admissions is significantly harder than the NQT across all quantitative and verbal dimensions. CAT data interpretation involves multi-set, calculation-heavy problems. CAT verbal reasoning includes complex inference and logical structure questions. CAT quantitative problems frequently require algebraic insight that goes well beyond NQT arithmetic.

However, CAT preparation materials are excellent for building the Advanced section skills needed for NQT Digital and Prime routing:

  • CAT easy-to-medium level quant is a good difficulty calibration for NQT Advanced Quantitative
  • CAT VARC (Verbal Ability and Reading Comprehension) RC inference questions are excellent training for NQT Foundation RC at a harder difficulty
  • CAT LRDI (Logical Reasoning and Data Interpretation) easy-level sets are appropriate for NQT Advanced Reasoning practice

Practical implication: If your goal is the TCS Prime profile and you have exposure to CAT-level preparation, you are well-prepared for both Advanced sections. If you are targeting Ninja or Digital and have not studied at CAT level, use banking prelim and sectional practice materials rather than full CAT resources, which may over-prepare you for Foundation while leaving you short of time to build coding skills.

NQT vs TCS CodeVita

TCS CodeVita is TCS’s separate programming competition, distinct from the NQT, aimed at identifying top competitive programmers. CodeVita problems are significantly harder than NQT Advanced Coding - CodeVita requires knowledge of advanced graph algorithms, segment trees, and complex mathematical combinatorics. Preparing specifically for CodeVita is not necessary for NQT success, and the two should not be conflated in preparation planning.

The Numerical Ability Section: Topic Deep-Dives with Worked Logic

Beyond the topic list, candidates benefit from understanding the underlying reasoning pattern for the types of questions most frequently mishandled in the NQT Numerical section.

Why Mixture and Alligation Questions Catch Candidates Off Guard

Mixture problems are classified under arithmetic but they involve a specific non-obvious insight: when two components are combined, the resulting ratio depends on the quantity of each component added, not just their individual concentrations. The alligation method provides a shortcut that bypasses the algebraic equation setup:

Draw a cross pattern. Place the concentration of Component A at the top left, Component B at the top right, and the desired final concentration at the centre. The cross-difference (top left minus centre, centre minus top right) gives the ratio in which the two components must be mixed. This method works for any two-component mixture including profit/loss blending, speed blending, and percentage blending.

Candidates who have not specifically practised alligation attempt these problems by setting up algebraic equations, which takes 3-4x longer. At NQT’s 60 seconds per question, that extra time is often the difference between attempting the question and skipping it.

Compound Interest: The One Formula That Covers All NQT CI Variations

The standard CI formula, CI = P(1 + R/100)^T - P, is well-known but frequently misapplied. NQT questions introduce variations:

  • Half-yearly compounding: Use R/2 as the rate and 2T as the time
  • Quarterly compounding: Use R/4 as the rate and 4T as the time
  • CI for 2 years vs SI for 2 years: The difference = P(R/100)^2, which is always positive since CI > SI for T > 1 year

Memorising the difference formula for 2-year CI vs SI directly answers a commonly appearing NQT question type in under 20 seconds.

Time and Work: The Efficiency Fraction Method

The most common error in time-and-work problems is treating “A takes X days” as a rate problem and setting up equations with fractions. The faster method: express each person’s efficiency as a fraction of the whole job per day. A who takes 12 days does 1/12 of the job per day. B who takes 18 days does 1/18 per day. Together: 1/12 + 1/18 = 3/36 + 2/36 = 5/36 of the job per day. Days to complete together: 36/5 = 7.2 days.

The efficiency fraction method extends naturally to pipes-and-cisterns problems (a filling pipe adds a positive fraction; a draining pipe subtracts a negative fraction) and to problems with partial day contributions.

Building a Complete 8-Week Preparation Calendar

A structured calendar removes daily decision-making and maximises consistency. The schedule below assumes a candidate targeting the TCS Digital profile with approximately 2-3 hours of study available per day.

Week 1: Diagnostic and Arithmetic Foundation

  • Day 1: Take a full Foundation diagnostic mock (no preparation, just baseline). Note section scores.
  • Days 2-3: Percentages, profit and loss (theory + 30 practice questions per topic)
  • Days 4-5: Simple and compound interest, ratio and proportion (theory + 30 questions per topic)
  • Days 6-7: Time, speed, and distance (30 questions); light verbal reading daily throughout

Week 2: Arithmetic Completion and Reasoning Basics

  • Days 1-2: Time and work, averages and mixtures (30 questions per topic)
  • Days 3-4: Seating arrangements - linear and circular (2 practice sets per day)
  • Days 5-6: Blood relations (20 questions), coding-decoding (20 questions)
  • Day 7: Foundation numerical timed mock (25 questions in 25 minutes); review errors

Week 3: DI, Verbal Development, and Syllogisms

  • Days 1-2: Bar chart and table DI (2 sets per day, 4 questions per set)
  • Days 3-4: Pie chart and line graph DI; RC passages (2 passages + questions per day)
  • Days 5-6: Syllogisms (20 questions per day), grammar error identification (20 questions per day)
  • Day 7: Full Foundation section mock (all three sections, 76 minutes); review

Week 4: Advanced Quantitative Introduction and Coding Ramp-Up

  • Days 1-2: Number theory and number series (30 questions), P&C basics revisited
  • Days 3-4: Advanced P&C (20 questions per day from CAT-level materials)
  • Days 5-7: Coding - implement 10 array and string problems in chosen language; focus on clean, compilable code
  • Verbal: Para jumbles and sentence completion (15 questions per day)

Week 5: Advanced Section Full Coverage

  • Days 1-2: Advanced probability (conditional, expected value) - 15 questions per day
  • Days 3-4: Advanced Reasoning - complex multi-attribute puzzles (1 complete set per day)
  • Days 5-7: Coding - implement 3 DP problems (coin change, longest common subsequence, 0-1 knapsack); implement BFS grid traversal
  • Take one full Advanced section mock (Quant + Reasoning + 2 coding problems)

Week 6: Integration and Mock Testing

  • Full Foundation + Advanced mock every 3 days
  • Between mocks: targeted revision of the 3 weakest topic areas from each mock’s error analysis
  • Coding: 1 medium-level algorithmic problem per day
  • Final 2 days: No new topics; formula review; logistics confirmation

This calendar is designed for a candidate who has approximately 2 hours available on weekdays and 3-4 hours on weekends. Candidates with more time can compress it into 5-6 weeks; candidates with less time should prioritise the Priority 1 topics from the matrix and accept partial coverage of Priority 3-4 topics.

Final Notes on Preparation Approach

The TCS NQT rewards methodical preparation more than last-minute cramming. The breadth of the syllabus - spanning arithmetic, English language, logical reasoning, and programming - means a candidate who starts preparation 6-8 weeks in advance and covers each area systematically will outperform a candidate who studies for 3 weeks but covers only some areas.

For the Foundation section, consistent daily practice is the core mechanism of improvement. For the Advanced section, understanding algorithmic patterns deeply enough to apply them to unfamiliar problem formulations is the core requirement. These two demands are different in nature and should be approached differently in your daily schedule.

Pair this syllabus breakdown with hands-on practice. The TCS NQT Preparation Guide on ReportMedic provides a browser-based environment where you can test yourself on NQT-pattern questions across every section without creating an account. Use it to convert the theoretical knowledge in this article into applied exam performance.

Every section of the TCS NQT is learnable. The syllabus is wide but not deep (with the exception of the Advanced Coding section for Prime-level candidates). A candidate who knows exactly what to prepare - which this article provides - has already converted uncertainty into a tractable plan.

The pattern details and topic weightages in this article are synthesised from official TCS communications and multiple cycles of candidate-reported experiences. Always verify the current cycle’s exact specifications on nextstep.tcs.com before your exam date.