The TCS NQT syllabus covers more ground than most candidates expect. Understanding the full scope before beginning preparation - what is tested, how much of each topic appears, and in what difficulty range - is the difference between systematic preparation that covers everything important and scattered preparation that leaves gaps in critical areas.

Technology Industry Analysis - InsightCrunch The complete TCS NQT syllabus guide - every topic in every section covered in detail, the Foundation section structure with Numerical Ability, Verbal Ability, and Logical Reasoning subtopics, the Advanced section with Advanced Quantitative, Advanced Reasoning, and Coding content, topic frequency estimates, specific question types within each topic, what preparation each topic requires, the study priority order that produces maximum score per preparation hour, and what is not on the NQT syllabus (so you do not waste time studying it)

This guide is the complete syllabus reference. Use it to plan your preparation calendar, identify your topic gaps, and ensure no high-frequency topic is left uncovered before exam day.

The NQT Exam Structure: The Container for the Syllabus

Foundation Section vs. Advanced Section

The TCS NQT is divided into two main sections:

Foundation Section - Tests broad aptitude competency

  • Numerical Ability (Quantitative Aptitude)
  • Verbal Ability
  • Logical Reasoning Ability
  • (Personality section in some versions - this is not scored and requires no preparation)

Advanced Section - Tests higher-order reasoning and coding

  • Advanced Quantitative Ability
  • Advanced Reasoning Ability
  • Advanced Coding

Time Allocation by Section

Based on documented exam windows:

Section Questions Time Allotted Time Per Question
Numerical Ability (Foundation) ~26 40 min ~92 sec
Verbal Ability (Foundation) ~24 30 min ~75 sec
Logical Reasoning (Foundation) ~26 40 min ~92 sec
Advanced Quantitative ~15 20 min ~80 sec
Advanced Reasoning ~10 20 min ~120 sec
Advanced Coding 2 problems 45-60 min N/A

Note: TCS revises section structure and timings between windows. The figures above represent typical configurations based on candidate community reports. Verify the specific structure in your admit card and exam portal.

The Scoring Structure

Foundation and Advanced Quantitative/Reasoning:

  • Correct answer: +1 mark
  • Wrong answer: -0.33 marks (negative marking)
  • Unanswered: 0 marks

Advanced Coding:

  • Marks awarded based on test case passage percentage
  • No negative marking for coding
  • Partial credit for partial test case passage

Foundation Section: Numerical Ability (Quantitative Aptitude)

Complete Topic List with Subtopics

1. Number Systems and Number Theory

Core concepts:

  • Natural numbers, integers, rational/irrational numbers
  • Divisibility rules (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
  • HCF (Highest Common Factor) - using prime factorization and Euclidean algorithm
  • LCM (Lowest Common Multiple) - using prime factorization
  • HCF × LCM = product of two numbers
  • Prime factorization
  • Cyclicity of units digits (for powers: 2 cycles in 4, 3 cycles in 4, 7 cycles in 4, etc.)
  • Remainders and modular arithmetic

Question types:

  • “Find HCF/LCM of given numbers”
  • “A number divided by X gives remainder Y. Find the number”
  • “Find the units digit of 7^53”
  • “How many numbers between 100-500 are divisible by both 4 and 6?”

Frequency estimate: 2-3 questions Preparation requirement: Low (formulas are fixed and learnable in 2-3 hours)

2. Percentages

Core concepts:

  • Percentage calculation fundamentals
  • Percentage increase/decrease formula: (new - old)/old × 100
  • Successive percentage change formula: a + b + ab/100
  • Converting between percentage and fraction/decimal
  • Percentage as part of a whole

Question types:

  • “Price increased by 20% then decreased by 15%. Net change?”
  • “A’s salary is 25% more than B’s. By what % is B’s salary less than A’s?”
  • “What percentage of 400 is 64?”
  • “Population increased by 10% in year 1 and 15% in year 2. Total increase?”

Frequency estimate: 3-4 questions Preparation requirement: Low to medium (concepts are familiar from school; successive change formula is the key addition)

3. Profit, Loss, and Discount

Core concepts:

  • Cost Price (CP), Selling Price (SP), Marked Price (MP) relationships
  • Profit% = (SP - CP)/CP × 100
  • Loss% = (CP - SP)/CP × 100
  • Discount = MP - SP; Discount% = Discount/MP × 100
  • SP when profit%: SP = CP × (1 + profit%/100)
  • Chain discounts: net discount = 1 - (1-d1)(1-d2)
  • False weight problems

Question types:

  • “A shopkeeper marks goods 40% above CP and offers 25% discount. Find profit%”
  • “Two articles sold at equal prices, one at 20% profit and one at 20% loss. Net result?”
  • “A dishonest merchant uses 900g weight instead of 1kg. Find profit%”

Frequency estimate: 2-3 questions Preparation requirement: Low (formula-based; most questions follow the same structure)

4. Simple and Compound Interest

Core concepts:

  • SI = PRT/100 (P = principal, R = rate%, T = time in years)
  • CI = P(1 + R/100)^T - P
  • CI - SI for 2 years = P(R/100)²
  • Effective annual rate for half-yearly/quarterly compounding
  • Present value and future value calculations

Question types:

  • “Find SI on Rs.5000 at 8% for 3 years”
  • “CI on Rs.8000 at 10% for 2 years?”
  • “Difference between CI and SI on Rs.X at R% for 2 years = Rs.Y. Find P or R”
  • “A sum doubles in 8 years at SI. In how many years will it triple?”

Frequency estimate: 2-3 questions Preparation requirement: Low (fixed formulas, limited question variety)

5. Ratio and Proportion

Core concepts:

  • Simplifying ratios
  • Combining ratios: A:B and B:C → A:B:C (equalize the B term)
  • Proportion: a/b = c/d; cross multiplication
  • Direct and inverse proportion
  • Partnership calculations (profit distribution based on time × investment)
  • Alligation and mixture

Question types:

  • “A:B = 3:5, B:C = 2:7. Find A:C”
  • “Rs.840 divided among A, B, C in ratio 3:4:5. B’s share?”
  • “Two partners invest Rs.3000 and Rs.5000 for 6 months and 4 months. Profit Rs.1800. How shared?”
  • “Milk to water ratio is 4:3. How much water added to 35 liters to make it 4:5?”

Frequency estimate: 3-4 questions Preparation requirement: Low to medium (multiple sub-topics; alligation is the hardest)

6. Time, Speed, and Distance

Core concepts:

  • Speed = Distance/Time; unit conversions (km/h to m/s: multiply by 5/18)
  • Average speed for equal distances = 2ab/(a+b) (harmonic mean)
  • Relative speed: same direction = v₁-v₂ ; opposite directions = v₁+v₂
  • Train problems: total distance = (length of train + length of platform/object)
  • Boat and stream: upstream = v_boat - v_stream; downstream = v_boat + v_stream
  • Circular track problems: meeting times
  • Meeting problems: two people starting from different points

Question types:

  • “Train 200m long crosses a pole in 10 seconds. Speed in km/h?”
  • “Two trains approach each other at 60 and 40 km/h. Distance 200km. Meeting time?”
  • “A boat travels 15km upstream and 25km downstream in 5 hours. Find boat’s speed in still water”
  • “Walking at 4/5 of normal speed, person is 15 min late. Normal time?”

Frequency estimate: 3-4 questions Preparation requirement: Medium (multiple sub-types; boat/stream and circular tracks need specific practice)

7. Work and Time

Core concepts:

  • Work done = rate × time
  • If A completes work in n days, A’s rate = 1/n per day
  • Combined rate = 1/t₁ + 1/t₂ + …
  • Work done in specific days = rate × days
  • Pipes and cisterns (filling: positive rate; emptying: negative rate)
  • Work and wages (wages proportional to work done)

Question types:

  • “A completes work in 12 days, B in 18 days. Together?”
  • “A and B together complete work in 6 days. A alone takes 10 days. B alone takes?”
  • “Pipe A fills tank in 4 hours, Pipe B empties in 6 hours. Together?”
  • “20 men complete work in 15 days. How many more men to complete in 12 days?”

Frequency estimate: 2-3 questions Preparation requirement: Low to medium (method is consistent; pipes and cisterns adds one variation)

8. Data Interpretation (DI)

Core concepts:

  • Reading bar charts, line graphs, pie charts, tables
  • Percentage change between values
  • Ratio calculations from displayed data
  • Combined analysis from two data sources
  • Approximation (reading chart values precisely enough for calculations)

Question types (DI sets of 3-4 questions):

  • “From the bar chart, which year showed maximum growth?”
  • “What percentage of total sales did Product A account for in Year 3?”
  • “What is the ratio of Region X revenue in Q1 to Q3?”
  • “By how much did total expenses change from Year 1 to Year 2?”

Frequency estimate: 4-6 questions (1-2 DI sets) Preparation requirement: High (highest frequency, requires speed; questions-first approach is essential)

9. Permutations and Combinations

Core concepts:

  • Fundamental counting principle
  • Permutation: nPr = n!/(n-r)!
  • Combination: nCr = n!/[r!(n-r)!]
  • Arrangements with identical elements
  • Arrangements with constraints (certain people always/never together)
  • Circular arrangements: (n-1)!

Question types:

  • “How many ways can 5 people sit in a row?”
  • “How many 3-digit numbers can be formed from {1,2,3,4,5} without repetition?”
  • “In how many ways can a committee of 3 men and 2 women be formed from 6 men and 4 women?”
  • “A, B must always be together in a group of 6. Arrangements?”

Frequency estimate: 2-3 questions Preparation requirement: Medium to high (conceptually harder; requires practice on constraint types)

10. Probability

Core concepts:

  • P(event) = favorable outcomes / total outcomes
  • P(A or B) = P(A) + P(B) - P(A and B) for non-mutually exclusive events
  • P(A and B) = P(A) × P(B) for independent events
  • Conditional probability: P(A B) = P(A and B)/P(B)
  • Probability with replacement vs. without replacement

Question types:

  • “2 cards drawn from a 52-card deck. Probability both are aces?”
  • “A bag has 4 red and 5 blue balls. Probability first 2 draws are different colors?”
  • “Two dice rolled. Probability sum > 8?”
  • “3 coins flipped. Probability of at least 2 heads?”

Frequency estimate: 2-3 questions Preparation requirement: Medium to high (conditional probability is hardest; lower ROI for Ninja target)

11. Averages and Weighted Averages

Core concepts:

  • Simple average = sum / count
  • Weighted average = (sum of weight × value) / sum of weights
  • Effects of adding/removing elements on average
  • Finding missing elements given average

Question types:

  • “Average of 10 numbers is 15. One is removed; average becomes 14. Value of removed number?”
  • “Class A has 20 students with average 75. Class B has 30 with average 85. Combined average?”

Frequency estimate: 1-2 questions Preparation requirement: Low (simple formulas)

Foundation Section: Verbal Ability

Complete Topic List with Subtopics

1. Reading Comprehension (RC)

Structure: 2-3 passages per exam, each 200-350 words, with 3-4 questions per passage

Passage topics: Technology and innovation, business trends, science and environment, social phenomena, historical analysis. Engineering-relevant domains are common.

Question types:

  • Main idea / central theme of the passage
  • Specific detail questions (“According to the passage, which of the following…”)
  • Inference questions (“The author implies that…”)
  • Vocabulary in context (“In the passage, ‘ubiquitous’ most nearly means…”)
  • Author’s tone or attitude
  • Purpose of specific paragraph

The questions-first approach: Read all questions for the passage before reading the passage itself. This allows you to read the passage looking for specific information rather than trying to retain everything. Saves 45-60 seconds per passage.

Frequency estimate: 6-10 questions (25-42% of verbal section) Preparation requirement: High (highest weight; strategy improvement produces biggest gains)

2. Grammar and Error Detection

Core grammar rules tested:

Subject-Verb Agreement (most common):

  • Singular subjects take singular verbs
  • “Neither/Either…nor/or” - verb agrees with nearest subject
  • Collective nouns (committee, team, board) - context-dependent (singular if acting as unit)
  • Indefinite pronouns (everyone, someone, each) - singular

Tense Consistency:

  • Narrative should maintain consistent tense unless describing actual time shifts
  • Perfect tenses (had + past participle for past-before-past)

Pronoun Reference:

  • Pronouns must agree with their antecedent in number and gender
  • “It” vs. “they” for collective nouns
  • Relative pronouns: “who” for people, “which/that” for things

Modifier Placement:

  • Dangling modifiers (modifier without a logical subject)
  • Misplaced modifiers (modifier too far from what it modifies)

Parallelism:

  • Elements in a list must have the same grammatical form
  • Correlative conjunctions (both…and, either…or) require parallel structure

Question format: Identify the error in an underlined sentence, or choose the grammatically correct option

Frequency estimate: 4-6 questions Preparation requirement: Low to medium (fixed rules; subject-verb agreement covers the most questions)

3. Vocabulary (Synonyms and Antonyms)

Vocabulary level: Professional and academic English. Business communication vocabulary rather than literary or archaic terms.

Common tested words (illustrative):

  • Synonyms: verbose/wordy, diligent/assiduous, ambiguous/equivocal, taciturn/reticent
  • Antonyms: diffident × confident, lethargic × energetic, candid × evasive

Preparation approach: Read quality business and technology content regularly. Use vocabulary in context rather than memorizing lists. For unknown words, apply elimination (rule out obviously wrong options, guess from remaining).

Frequency estimate: 4-6 questions Preparation requirement: Medium (knowledge-based; regular reading is the most efficient preparation)

4. Fill in the Blanks

Types:

  • Single blank requiring appropriate vocabulary
  • Double blank requiring two words that work together contextually
  • Grammar-based blanks (selecting correct preposition, conjunction, article)

Context clues: Most fill-in-the-blank questions have contextual signals (contrast signals like “however/despite,” cause signals like “because/therefore,” emphasis signals like “even/especially”)

Frequency estimate: 3-4 questions Preparation requirement: Low (context inference skill; improves with RC practice)

5. Para-Jumbles (Sentence Rearrangement)

Structure: 4-6 sentences in scrambled order; arrange in logical sequence

Approach:

  • Identify the opening sentence (introduces the topic, no reference to prior context)
  • Identify the closing sentence (conclusion, synthesis, or logical endpoint)
  • Connect middle sentences using pronouns, transition words, and logical flow
  • Look for time sequences, cause-effect chains, or enumeration structures

Frequency estimate: 2-4 questions Preparation requirement: Medium (time-consuming; lower ROI for time-constrained candidates)

6. Sentence Completion (Contextual)

Types:

  • Academic word usage: selecting the word that fits the academic/professional register of the sentence
  • Idiom completion: completing a common English idiom or phrase

Frequency estimate: 2-3 questions Preparation requirement: Low (contextual; overlap with vocabulary preparation)

Foundation Section: Logical Reasoning

Complete Topic List with Subtopics

1. Number Series

Pattern types:

  • Arithmetic series: each term differs by a constant (2, 5, 8, 11…)
  • Geometric series: each term multiplied by a constant (3, 6, 12, 24…)
  • Squared/cubed sequences: (1, 4, 9, 16, 25…) or (1, 8, 27, 64…)
  • Prime number series: (2, 3, 5, 7, 11, 13…)
  • Fibonacci-type: each term = sum of two preceding (1, 1, 2, 3, 5, 8…)
  • Two interleaved series: (2, 10, 4, 12, 6, 14…) alternating two independent series
  • Difference-of-differences: second-order patterns (1, 2, 4, 7, 11, 16…)
  • Wrong number in series: identify the element that breaks the pattern

The hierarchy approach: Check arithmetic first, then geometric, then squared/cubed, then prime, then interleaved. Most NQT series are solved at the first or second level.

Frequency estimate: 4-6 questions Preparation requirement: Low (pattern recognition improves quickly with 1-2 hours of practice)

2. Letter Series

Pattern types:

  • Alphabetical forward/backward: (A, C, E, G…) forward by 2
  • Position-based: each letter’s alphabet position follows a numeric pattern
  • Alternating forward/backward in the same series
  • Letter pairs or triplets with internal patterns

Tip: Remember A=1, B=2…Z=26. Calculate positions numerically and identify the numeric pattern.

Frequency estimate: 2-3 questions Preparation requirement: Low (similar to number series once position mapping is natural)

3. Seating Arrangements (Linear)

Structure: 5-8 people/objects arranged in a row with 4-6 constraints

Common constraints:

  • “A sits at one end”
  • “B is immediately right of C”
  • “D and E are not adjacent”
  • “F is exactly two seats to the right of G”
  • “Exactly one person sits between H and I”

The constraint-application method:

  1. List all positions (1 through N)
  2. Start with the most constrained element (fixed position or most restrictions)
  3. Apply each constraint sequentially, eliminating impossible positions
  4. Verify all constraints after placement

Frequency estimate: 3-5 questions (1-2 sets) Preparation requirement: High (methodology investment; significant time savings once mastered)

4. Seating Arrangements (Circular)

Structure: 5-8 people arranged in a circle with constraints

Key difference from linear: In a circle, “position 1” is relative (no absolute endpoints). Fix one person and arrange others relative to them.

Constraint types: Similar to linear but include “X and Y are diagonally opposite” and “X faces center/faces away from center” (for some versions).

Frequency estimate: 2-3 questions (typically 1 set) Preparation requirement: High (harder than linear; specific practice needed)

5. Syllogisms

Structure: 2-4 statements about categories (Some A are B; All B are C; No C are D) followed by conclusions to evaluate

The Venn diagram method:

  • “All A are B”: draw A circle inside B circle
  • “Some A are B”: draw A and B circles partially overlapping
  • “No A are B”: draw A and B circles completely separate
  • “Some A are not B”: A circle extends partially outside B circle

Evaluation:

  • “Definitely follows”: True in all valid diagram configurations
  • “Possibly follows”: True in at least one valid diagram configuration
  • “Definitely does not follow”: False in all valid diagram configurations

Frequency estimate: 3-4 questions Preparation requirement: Low (Venn diagram method is mechanical; fast once internalized)

6. Blood Relations

Types:

  • Two-generation chains: grandfather/father/son relationships
  • Three-generation problems with gender ambiguity
  • Mixed pointing problems (“X pointing at Y says ‘this person’s father is my grandfather’s son’”)

Method: Draw a family tree diagram. Use M/F for gender. Trace relationships step by step.

Common terms: Maternal uncle (mother’s brother), paternal aunt (father’s sister), first cousin, nephew, niece.

Frequency estimate: 3-4 questions Preparation requirement: Low to medium (two-generation problems are fast; three-generation requires care)

7. Direction and Distance

Structure: A person walks in a series of directions (North, South, East, West, NE, NW, SE, SW) for given distances. Find final position, displacement, or direction from starting point.

Method: Draw the path on a compass diagram. Track net East-West and North-South displacement separately. Use Pythagoras for actual displacement when perpendicular components are given.

Frequency estimate: 2-3 questions Preparation requirement: Low (systematic approach; diagram is the key tool)

8. Coding-Decoding

Types:

  • Letter shift coding: each letter replaced by the letter N positions forward or backward in alphabet (APPLE → DSSOH if shift +3)
  • Position substitution: letter at position N replaced by letter at position (27-N) = reverse alphabet
  • Numeric coding: letters assigned numbers based on position
  • Pattern coding: whole words coded, find the pattern to decode a new word
  • Symbol substitution

Method: Identify whether the coding is shift-based (try shift values 1-13), reversal-based, or position-based by testing on the given example. Apply the identified pattern to the test word.

Frequency estimate: 2-3 questions Preparation requirement: Low (pattern recognition; quick once shift/reversal patterns are known)

9. Input-Output Problems

Structure: A machine performs operations on numbers/words in steps. Given the initial input and some intermediate steps, find a missing step or the final output.

Method: Observe the transformation from step to step. Identify whether numbers are being sorted, words rearranged, operations performed on values, or a combination. Once the rule is identified, apply it forward or backward.

Frequency estimate: 2-3 questions Preparation requirement: Medium (rule identification takes practice; the hardest problem type in reasoning for some candidates)

10. Odd One Out (Classification)

Types:

  • Number classification: which number does not fit the pattern?
  • Letter classification: which letter group is different?
  • Word classification: which word does not belong to the category?

Method: Identify the common pattern in most items, find the one that breaks it.

Frequency estimate: 1-2 questions Preparation requirement: Low (pattern recognition)

11. Analogies

Types:

  • Relationship analogies: Tool:Function, Part:Whole, Cause:Effect
  • Number analogies: (3:9 :: 4:?)
  • Letter analogies

Frequency estimate: 1-2 questions Preparation requirement: Low

Advanced Section: Advanced Quantitative Ability

What “Advanced” Means Here

The Advanced Quantitative section covers harder versions of Foundation quantitative topics. The question types are the same, but the problems are more complex, involve more steps, or test less common subtopics.

Advanced DI: Two data sources used in a single question (e.g., a table and a pie chart both needed to answer one question). Multi-step calculations.

Advanced Percentages/Ratios: Three or more successive changes, complex alligation problems.

Advanced Time-Speed-Distance: Problems with varying speeds at different stages, complex meeting scenarios.

Advanced Probability: Conditional probability, probability with multiple events, combinations-based probability.

Advanced Combinations: Arrangements with multiple constraint types simultaneously active.

Frequency estimate: ~15 questions across all Advanced Quantitative topics Preparation requirement: The topics are the same as Foundation; “advanced” means harder versions requiring full conceptual mastery rather than formula memorization.

Advanced Section: Advanced Reasoning

What the Advanced Reasoning Section Tests

Advanced Reasoning has fewer questions than Foundation Reasoning but each question is harder and takes more time:

Complex Circular Arrangements: 7-8 people with 5-6 constraints including gender constraints, directional constraints (facing in/out), and profession constraints.

Multi-Variable Data Sufficiency: Two statements provided; determine whether each alone is sufficient to answer the question, whether both together are sufficient, or whether even together they are insufficient.

Analytical Puzzles: “Five people live on five floors. Each person has a different job. Using the given clues, determine who lives on the 3rd floor.”

Cause and Effect: Two statements; determine whether statement 1 is the cause of statement 2, vice versa, or neither.

Frequency estimate: ~10 questions Preparation requirement: The same methodology applies as Foundation Reasoning but with more complex problems. Complex circular arrangements require specific practice beyond Foundation linear arrangement practice.

Advanced Section: Coding

The Two-Problem Structure

The Advanced Coding section presents two programming problems:

Problem 1 (Easy difficulty): Comparable to LeetCode Easy. Solvable in 15-20 minutes by a well-prepared candidate. Tests fundamental algorithm concepts with straightforward implementation.

Problem 2 (Medium difficulty): Comparable to LeetCode Medium. Requires recognizing an appropriate algorithm pattern and implementing it correctly. Expected time 25-40 minutes for a well-prepared candidate.

The Complete Coding Syllabus

Programming Languages: Candidates can write in any of the following languages (TCS provides multiple language options):

  • Java (most commonly used by TCS NQT candidates)
  • C
  • C++
  • Python
  • JavaScript (in some windows)

Language Proficiency Required:

  • Array/list operations (creation, access, modification, traversal)
  • String operations (length, substring, concatenation, character access)
  • Dictionary/HashMap operations (insertion, retrieval, key checking)
  • Function definition and recursion
  • Basic input/output for competitive programming format

Data Structures Tested:

Arrays:

  • One-dimensional arrays: traversal, search, sort
  • Two-dimensional arrays: matrix operations
  • Subarray problems
  • Common patterns: two-pointer, sliding window

Strings:

  • Character manipulation
  • Substring operations
  • Pattern matching
  • String reversal and palindrome detection

Linked Lists:

  • Singly linked list: traversal, insertion, deletion
  • Reversal of linked list
  • Detection of cycles (Floyd’s algorithm)
  • Merging sorted linked lists

Stacks and Queues:

  • Stack operations and applications (balanced parentheses, expression evaluation)
  • Queue operations
  • Monotonic stack problems

Trees:

  • Binary tree traversals (inorder, preorder, postorder)
  • Binary search tree operations
  • Height and depth calculations
  • Level-order traversal (BFS on trees)

Hash Tables:

  • Using HashMaps/dictionaries for frequency counting
  • Using sets for uniqueness checking
  • Two-sum pattern (complement lookup)

Algorithms Tested:

Searching and Sorting:

  • Binary search (and its variations - first/last occurrence, search in rotated array)
  • Merge sort, quick sort (conceptual understanding)
  • Counting sort for specific problems

Two-Pointer Technique:

  • Sorted array pair with given sum
  • Container with most water
  • Three-sum
  • Palindrome verification

Sliding Window:

  • Maximum/minimum sum subarray of size K
  • Longest substring with specific properties (no repeating characters, at most K distinct)

Dynamic Programming (DP) - Entry Level:

  • Fibonacci sequence (memoization and tabulation)
  • Climbing stairs (1D DP)
  • Maximum subarray sum (Kadane’s algorithm)
  • 0/1 Knapsack (basic version)
  • Longest Common Subsequence (LCS)

Recursion and Backtracking:

  • Recursive factorial, Fibonacci
  • Tower of Hanoi
  • All permutations/combinations of a set
  • N-Queens (conceptual; implementation for bonus marks)

Graph Algorithms - Basic:

  • BFS (breadth-first search)
  • DFS (depth-first search)
  • Cycle detection in undirected graph
  • Number of connected components

The Preparation Focus:

For Ninja track targeting (Easy problem completion):

  • String problems: 30-40 LeetCode Easy string problems
  • Array problems: 30-40 LeetCode Easy array problems
  • HashMap problems: 20 LeetCode Easy hash table problems
  • Two-pointer: 15-20 LeetCode Easy two-pointer problems
  • Total: approximately 100-140 Easy problems with consistent practice

For Digital track targeting (Easy + significant Medium progress):

  • All above plus:
  • Sliding window: 15-20 Medium problems
  • Binary search variations: 15-20 Medium problems
  • DP Entry-level: 20-25 Medium DP problems
  • Trees: 15-20 Medium tree problems
  • Total: approximately 100-140 Easy + 70-90 Medium problems

What Is NOT on the TCS NQT Syllabus

Knowing what to exclude prevents wasted preparation time on topics that do not appear:

Not on NQT:

  • Calculus, differential equations, complex analysis (university mathematics beyond class 12 scope)
  • Advanced statistics (hypothesis testing, ANOVA, regression analysis)
  • Linear algebra beyond basic matrix understanding
  • Geometry (circles, triangles, area/volume) - appears rarely if at all
  • GATE-level computer science (operating systems depth, computer architecture, formal languages)
  • Advanced graph algorithms (Dijkstra’s, Bellman-Ford, minimum spanning trees)
  • Advanced DP (matrix chain multiplication, edit distance - very low frequency)
  • Machine learning algorithms (neural networks, gradient descent)
  • Physical chemistry, organic chemistry (completely irrelevant)

The implication: If you have been studying university mathematics beyond class 12 or GATE-level CS topics for TCS NQT, redirect that preparation time to the high-frequency topics listed in this guide.

Study Priority Order: What to Learn First

The Tiered Priority System

Not all syllabus topics deserve equal preparation time. This priority tiering guides time allocation:

Tier 1 (Prepare first, highest impact):

Quantitative:

  • Data Interpretation (questions-first approach + calculation speed)
  • Percentages and Ratios (successive change formula)
  • Time-Speed-Distance (equation setup for all sub-types)

Verbal:

  • Reading Comprehension (questions-first approach)
  • Subject-Verb Agreement (grammar)

Reasoning:

  • Number Series (hierarchy approach)
  • Syllogisms (Venn diagram method)
  • Linear Seating Arrangements (constraint-application method)

Coding:

  • String problems (array-like operations)
  • Array problems
  • HashMap patterns

Tier 2 (Prepare after Tier 1 is solid):

Quantitative:

  • Work and Time
  • Simple/Compound Interest
  • Profit/Loss/Discount
  • Averages

Verbal:

  • Vocabulary synonyms/antonyms
  • Fill in the blanks

Reasoning:

  • Blood Relations
  • Direction and Distance
  • Circular Arrangements (simpler versions)
  • Coding-Decoding

Coding:

  • Two-pointer technique
  • Sliding window (intro level)

Tier 3 (Prepare if time allows; Digital track aspirants should complete):

Quantitative:

  • Permutations and Combinations
  • Probability
  • Number Systems (deeper)

Verbal:

  • Para-jumbles
  • Critical reasoning

Reasoning:

  • Complex circular arrangements
  • Input-output machines
  • Data Sufficiency (Advanced section)

Coding:

  • Binary search variations
  • Dynamic programming (Fibonacci, climbing stairs, Kadane’s)
  • Tree traversals (BFS/DFS)

The Complete Syllabus Preparation Calendar

Mapping the Syllabus to an 8-Week Schedule

Week 1: Tier 1 Quantitative

  • Days 1-2: Data Interpretation (questions-first approach, 5 DI sets with timing)
  • Days 3-4: Percentages and Ratios (successive change formula, 30 problems)
  • Days 5-6: Time-Speed-Distance (all 4 sub-types: plain, relative speed, train, boat)
  • Day 7: Review + 10-question timed QA practice set

Week 2: Tier 1 Verbal and Reasoning

  • Days 1-2: Reading Comprehension (questions-first, 3 passages per day)
  • Days 3-4: Subject-Verb Agreement + Grammar overview (30 error detection questions)
  • Days 5-6: Number Series (all 7 types, 30 series)
  • Day 7: Syllogisms (Venn diagram method, 20 problems)

Week 3: Tier 1 Reasoning continued + Coding Start

  • Days 1-3: Linear seating arrangements (method practice, 2 full arrangements per day)
  • Days 4-5: Coding - language fluency (array manipulation, string operations in chosen language)
  • Days 6-7: Coding - HashMap patterns (frequency counting, complement lookup)

Week 4: Tier 2 Topics + First Calibration Mock

  • Days 1-2: Work and Time + Simple/Compound Interest (25 problems each)
  • Days 3-4: Blood Relations + Direction-Distance (20 problems each)
  • Day 5: Profit/Loss/Discount + Averages (20 problems each)
  • Day 6: Vocabulary (30 synonym/antonym questions) + Fill in the blanks
  • Day 7: First full timed calibration mock + thorough review

Week 5: Tier 2 Continued + Coding Easy Problems

  • Days 1-3: Circular arrangements (simpler versions, 3 per day)
  • Days 4-5: Coding - LeetCode Easy (2 per day, array and string focused)
  • Days 6-7: Coding-Decoding + Para-jumbles (15 each)

Week 6: Tier 2/3 Completion + Second Calibration Mock

  • Days 1-2: Combinations and Probability (20 problems each)
  • Days 3-4: Coding - LeetCode Easy (2 per day, focus on two-pointer and sliding window intro)
  • Day 5: Advanced section preview (harder DI, complex arrangements)
  • Days 6-7: Second full timed mock + thorough review

Weeks 7-8: Simulation Phase

  • 3 full mock tests per week
  • Daily 30-minute coding (LeetCode Easy with timing, target 18-minute completion)
  • Gap-filling based on mock results
  • No new topics after Week 6

This calendar covers the full syllabus in 8 weeks for a candidate starting from average foundations.

The TCS NQT Preparation Guide: Syllabus Coverage

The TCS NQT Preparation Guide on ReportMedic provides systematic coverage of the complete NQT syllabus with:

Topic-organized question banks: Questions organized by the exact topics listed in this syllabus guide, allowing targeted practice at the topic level before transitioning to mixed-topic timed practice.

NQT-calibrated difficulty: Questions at the exact difficulty level tested in NQT - not too easy (which fails to build exam-condition performance) and not too hard (which is CAT/GATE level and not NQT-relevant).

Full timed mock tests: Complete Foundation + Advanced mock tests simulating the exact NQT format, allowing calibration of scores against the approximate qualifying ranges.

Section-wise tracking: Performance tracking by section and topic, enabling candidates to see exactly which syllabus topics need the most preparation investment.

Using the preparation guide alongside this syllabus guide ensures that every topic receives appropriate preparation and no high-frequency topic is missed.

Topic-Level Deep Dives: The Questions That Appear Most

Number Series: The Seven Patterns You Must Know

Number series is one of the fastest question types for prepared candidates and one of the slowest for unprepared candidates. The seven patterns cover virtually all NQT series questions:

Pattern 1: Arithmetic progression Difference between consecutive terms is constant. Example: 7, 12, 17, 22, 27, ? → difference = 5 → next = 32 Identification: Calculate the difference between term 1 and 2, then verify with subsequent terms.

Pattern 2: Geometric progression Each term is multiplied by a constant ratio. Example: 3, 6, 12, 24, 48, ? → ratio = 2 → next = 96 Identification: Calculate the ratio between term 1 and 2, verify.

Pattern 3: Squared/Cubed sequences Terms are perfect squares or cubes (often with a modifier). Example: 1, 4, 9, 16, 25, ? → n² → next = 36 Example: 2, 9, 28, 65, ? → n³+1 → next = 126 (5³+1) Identification: Try n², n²+1, n²-1, 2n², n³ patterns.

Pattern 4: Prime number sequences Terms are prime numbers (consecutive or with gaps). Example: 2, 3, 5, 7, 11, 13, ? → primes → next = 17

Pattern 5: Fibonacci-style Each term = sum of two preceding terms. Example: 1, 1, 2, 3, 5, 8, 13, ? → next = 21 Identification: Check if term 3 = term 1 + term 2.

Pattern 6: Two interleaved series Alternate terms form two independent sequences. Example: 2, 10, 4, 12, 6, 14, 8, ? → alternating +2 and +2 → next = 16 Identification: Split into odd-positioned and even-positioned terms, check each separately.

Pattern 7: Difference-of-differences The differences between terms form their own pattern. Example: 1, 2, 4, 7, 11, 16, ? → differences: 1, 2, 3, 4, 5 → next difference = 6 → next = 22

The “wrong number” variant: Find the number that does not fit the pattern. Approach: Establish the pattern from the surrounding terms; the number that violates it is the wrong one.

Seating Arrangements: The Complete Method

Because seating arrangements are both the hardest and the most time-consuming reasoning topic, a detailed method breakdown is worth including here:

The constraint application hierarchy:

Step 1: Read all clues first without placing anyone. Get a complete picture of constraints before beginning.

Step 2: Identify fixed-position clues. “A sits at one end” or “C is in the 3rd seat from the left” - these fix absolute positions. Place them first.

Step 3: Apply directional adjacency clues. “B is immediately to the right of D” places B and D together with a specific order.

Step 4: Apply relative position clues. “Exactly two people sit between E and F” narrows possible positions without fixing either.

Step 5: Apply exclusion clues. “G and H are not adjacent” eliminates certain configurations.

Step 6: Test remaining possibilities systematically. With most constraints applied, the remaining positions typically have 2-3 viable configurations. Check each against all constraints until only one works.

Step 7: Verify all constraints in the final arrangement. Before answering the questions, confirm every single constraint is satisfied.

The critical time rule: If you have spent 90 seconds applying constraints without establishing the core structure (fixed positions and adjacencies), skip this arrangement and return with a fresh perspective after completing faster questions. Fresh attempts often click in 30-40 seconds after a 5-minute interval.

Reading Comprehension: The Questions-First Protocol

The most impactful single skill in NQT verbal is the questions-first approach for RC. Here is the complete protocol:

Step 1 (30 seconds): Read all questions for the passage. Do not read the passage yet. Understand what each question is asking:

  • “Main idea” question: need the overall argument
  • “According to passage” questions: need specific detail locations
  • “Author implies” questions: need inference points
  • “Vocabulary in context” questions: need the word’s context sentence

Step 2 (60-90 seconds for 250-word passage): Read the passage with the questions in mind. As you read, mentally flag sections relevant to specific questions. You are not trying to retain everything - you are finding the specific information the questions require.

Step 3 (45-60 seconds per question): Answer each question from memory or by re-reading only the flagged section. For the main idea question, confirm against the opening and closing sentences.

Total time for a 3-question RC set: approximately 3-4 minutes.

Without the questions-first approach, the process is: read the full passage (90-120 seconds), then answer each question (going back to re-read relevant sections each time). Total: 4-6 minutes for the same 3-question set.

The questions-first approach saves 45-90 seconds per passage. With 2-3 passages per exam, this recovers 90-270 seconds of time that can be allocated to harder questions elsewhere.

Coding: The Five Most Common Easy Problem Patterns

Understanding the most common Easy problem patterns helps candidates practice the highest-impact topics first:

Pattern 1: Two-Sum (Hash Map) Problem type: Given an array of numbers and a target, find two numbers that sum to the target. Approach: Store seen numbers in a HashMap with their indices. For each number, check if (target - number) is in the map. Time complexity: O(n) space and time. Practice: LeetCode #1, #170, #167, #653

Pattern 2: Reverse/Palindrome (Two-Pointer) Problem type: Check if a string/number is a palindrome, or reverse a string/linked list. Approach: Two pointers from opposite ends, compare, move inward. Time complexity: O(n) time, O(1) space for strings, O(1) or O(n) for linked lists. Practice: LeetCode #125, #234, #9, #344

Pattern 3: Frequency Counting (HashMap) Problem type: Find the most frequent element, check if two strings are anagrams, find the first non-repeating character. Approach: Build frequency map, then query it. Time complexity: O(n) time and space. Practice: LeetCode #242, #387, #349, #217

Pattern 4: Maximum/Minimum Subarray (Kadane’s Algorithm) Problem type: Find the contiguous subarray with maximum sum. Approach: Track current_sum and max_sum. For each element: current_sum = max(element, current_sum + element). Time complexity: O(n) time, O(1) space. Practice: LeetCode #53, #121, #1800

Pattern 5: Linked List Manipulation Problem type: Reverse a linked list, find middle node, detect cycle. Approach: Pointer manipulation for reversal; slow/fast pointers for middle and cycle detection. Time complexity: O(n) time, O(1) space. Practice: LeetCode #206, #876, #141, #237

The Five Most Common Medium Problem Patterns

For Digital track aspirants:

Pattern 1: Sliding Window (Variable Size) Problem type: Longest substring with K distinct characters, minimum window substring. Approach: Maintain a window with a left pointer and a right pointer. Expand right until invalid, then shrink left until valid. Practice: LeetCode #3, #76, #159, #424

Pattern 2: Binary Search Variations Problem type: Search in rotated sorted array, find first/last occurrence, search in 2D matrix. Approach: Standard binary search framework with modified condition checks. Practice: LeetCode #33, #34, #74, #153

Pattern 3: Tree Traversal Problem type: Level-order traversal, zigzag traversal, path sum. Approach: BFS for level-order (queue-based), DFS for path problems (recursive or stack-based). Practice: LeetCode #102, #103, #112, #543

Pattern 4: Dynamic Programming (1D) Problem type: Climbing stairs, house robber, maximum alternating sum. Approach: Define dp[i] as the answer for the first i elements. Identify the recurrence relation. Practice: LeetCode #70, #198, #509, #322

Pattern 5: Two-Pointer (Sorted Array) Problem type: Three-sum, container with most water, trapping rain water. Approach: Start with pointers at both ends; move the pointer pointing to the smaller value. Practice: LeetCode #11, #15, #167, #42

The Syllabus Coverage Verification Checklist

Before your exam, verify each syllabus area has been covered:

Quantitative Aptitude:

  • DI (questions-first approach practiced, 10+ sets under time)
  • Percentages (successive change formula internalized)
  • Ratios and Proportions (alligation practiced)
  • Time-Speed-Distance (all 4 sub-types: basic, relative, train, boat)
  • Work and Time (individual + combined rates)
  • Simple and Compound Interest (both formulas + CI-SI difference formula)
  • Profit, Loss, Discount (chain discounts, false weight)
  • Number Systems (divisibility rules, HCF/LCM, cyclicity)
  • Averages (weighted averages, effect of adding/removing elements)
  • Combinations and Probability (15+ problems each)

Verbal Ability:

  • Reading Comprehension (questions-first approach automatic, 2+ passages daily for 4 weeks)
  • Subject-Verb Agreement (core rules internalized, 30 practice questions)
  • Tense consistency and pronoun reference (20 practice questions)
  • Vocabulary synonyms/antonyms (50+ professional vocabulary words exposed to)
  • Fill in the blanks (context inference practiced)
  • Para-jumbles (opening/closing identification practiced)

Logical Reasoning:

  • Number series (all 7 pattern types recognized quickly)
  • Letter series (position-mapping method natural)
  • Linear arrangements (constraint-application method systematic, 20+ arrangements practiced)
  • Circular arrangements (fixed reference point method, 10+ arrangements)
  • Syllogisms (Venn diagram method automatic, 25+ problems)
  • Blood relations (family tree diagram method, 20+ problems)
  • Direction and distance (compass diagram method, 15+ problems)
  • Coding-decoding (shift and position patterns recognized)
  • Input-output (rule identification practiced, 10+ problems)

Coding:

  • String problems (30+ Easy completed)
  • Array problems (30+ Easy completed)
  • HashMap patterns (20+ Easy completed)
  • Two-pointer (15+ Easy completed)
  • Easy completion time: under 20 minutes consistently
  • (Digital: Sliding window Medium - 15 problems)
  • (Digital: Binary search variations - 15 problems)
  • (Digital: DP entry level - 15 problems)

When all boxes are checked (Tier 1 and 2 at minimum), the syllabus is adequately covered for Ninja qualification.

Frequently Asked Questions About TCS NQT Syllabus

Q1: What is the complete TCS NQT syllabus?

The TCS NQT syllabus covers: Numerical Ability (quantitative aptitude including DI, percentages, ratios, time-speed-distance, work-time, interest, profit/loss, combinations, probability), Verbal Ability (reading comprehension, grammar/error detection, vocabulary, fill in the blanks, para-jumbles), Logical Reasoning (number/letter series, arrangements, syllogisms, blood relations, direction-distance, coding-decoding, input-output), Advanced Quantitative (harder versions of Foundation quantitative topics), Advanced Reasoning (complex arrangements, data sufficiency, analytical puzzles), and Advanced Coding (two programming problems at Easy and Medium difficulty covering arrays, strings, linked lists, trees, hash tables, and algorithm patterns).

Q2: Is TCS NQT syllabus the same as the NQT exam pattern?

The syllabus defines what is tested. The exam pattern describes the structure (number of questions, time limits, sections). Both together give the complete picture. This guide covers the syllabus; the exam pattern table in this article covers the structure.

Q3: Does the TCS NQT syllabus change every year?

The core topics remain consistent year to year. TCS may adjust the weight given to specific topics and may update the Advanced Coding section’s difficulty calibration. The Foundation section topics (DI, percentages, arrangements, RC, series) have been consistent across multiple years.

Q4: What is the TCS NQT syllabus for the coding section?

The coding section tests: arrays, strings, linked lists, stacks and queues, trees (basic), hash tables (frequency counting, two-sum), two-pointer technique, sliding window (intro level for Medium), binary search, and entry-level dynamic programming (Fibonacci, climbing stairs, Kadane’s). Languages accepted include Java, C, C++, Python.

Q5: How much weightage does each section have in TCS NQT?

TCS does not publish official weightage percentages. Based on question counts: Foundation sections (QA, Verbal, Reasoning) each have approximately 24-26 questions. Advanced sections have fewer questions but similar or higher per-question weight. Coding contributes through test case passage rates.

Q6: Is there a personality section in TCS NQT?

Some NQT versions have included a brief personality section or behavioral assessment. This section is generally not scored in the competitive sense - it collects profile data about candidates. No preparation is required or useful for a personality section.

Q7: What is the syllabus difference between TCS NQT Foundation and Advanced sections?

Foundation covers standard aptitude topics at the difficulty level of competitive bank exams. Advanced covers the same topics but with harder questions (more complex, multi-step, less common subtopics) plus a two-problem coding assessment. The Advanced section is what separates Digital track candidates from Ninja track candidates.

Q8: Does TCS NQT test computer science subjects like OS, DBMS, or Computer Networks?

Not in the standard NQT exam. The NQT tests aptitude, verbal, reasoning, and coding algorithm skills. CS theory subjects (OS, DBMS, CN) are tested in the technical interview, not in the NQT itself. Prepare CS theory for the interview, not for the NQT.

Q9: What programming language is best for TCS NQT coding section?

Java is the most commonly used language in TCS NQT based on community reports and is TCS’s primary delivery language. Python is second most common (concise syntax for certain problem types). Use the language in which you can write clean, correct code fastest.

Q10: Is there negative marking for all sections of TCS NQT?

Negative marking (-0.33 per wrong answer) applies to the Foundation sections (Numerical, Verbal, Reasoning) and typically the Advanced Quantitative and Reasoning sections. The coding section uses test case passage rates with no negative marking - you cannot be penalized for attempting code even if it produces wrong outputs.

Q11: What are the most important topics in TCS NQT syllabus?

For NQT qualification, the highest-priority topics by frequency and impact are: Data Interpretation (QA), Linear Seating Arrangements (Reasoning), Reading Comprehension (Verbal), Number Series (Reasoning), and Easy-level coding (array, string, HashMap patterns). These topics collectively appear in most NQT questions and have the highest preparation ROI.

Q12: How deep should I study each syllabus topic?

For high-frequency topics (DI, arrangements, RC, series, coding patterns): deep enough to solve questions correctly under time pressure without reference. For medium-frequency topics: solid formula and methodology understanding. For lower-frequency topics (complex probability, advanced DP): conceptual understanding plus basic problem exposure.

Q13: Is there a syllabus for TCS NQT Verbal section specifically?

Yes. Reading Comprehension (questions-first approach on 200-350 word passages), Error Detection/Grammar (subject-verb agreement, tense, pronoun, parallelism), Vocabulary Synonyms/Antonyms (professional English vocabulary level), Fill in the Blanks (contextual inference), and Para-Jumbles (logical sentence sequencing).

Q14: What geometry topics are in TCS NQT syllabus?

Geometry (triangles, circles, area calculations) appears minimally if at all in standard NQT windows. It is not a high-frequency topic and should not receive significant preparation time compared to the topics listed in this guide.

Q15: Does TCS NQT include data structures theory questions (not coding)?

No. Data structures are tested through the coding section (implement an algorithm using appropriate data structures), not through theory questions. You do not need to know the formal definitions of time complexity or Big-O for the Foundation sections.

Q16: What is the syllabus for TCS NQT Advanced Coding specifically?

Easy problem: Arrays, strings, hash tables, two-pointer, basic recursion - at LeetCode Easy difficulty. Medium problem: Sliding window, binary search, entry-level DP, tree traversals - at LeetCode Medium difficulty. The problems are stated in natural language; you implement the solution in your chosen language.

Q17: How is the TCS NQT coding section different from competitive programming?

TCS NQT coding is closer to standard algorithm problem-solving (LeetCode-style) than competitive programming (Codeforces/CodeChef-style). NQT does not test advanced competitive programming topics like heavy DP, complex graph algorithms, or number theory beyond basic. Focus on clean, correct solutions to standard problem types rather than highly optimized competitive solutions.

Q18: Are the syllabus topics the same for TCS Ninja and TCS Digital?

Yes, both tracks take the same exam with the same syllabus. The difference is in the score required: Digital requires higher scores across all sections and specifically much stronger coding performance (Easy complete + Medium progress). The syllabus is identical; the performance bar is different.

Q19: What is the most efficient way to cover the complete TCS NQT syllabus?

Follow the tiered priority system: cover Tier 1 topics first (DI, percentages, TSD, RC, series, arrangements, coding basics) in the first 3 weeks, complete Tier 2 in weeks 4-6, and use weeks 7-8 for simulation with Tier 3 as available. This order maximizes score improvement per preparation hour.

Q20: Is there a difference between TCS NQT syllabus and TCS campus placement test syllabus?

The TCS campus placement test typically uses the NQT as its primary assessment tool, so the syllabus is largely the same. Some campus drives may also include a technical interview or group discussion component that is separate from the NQT. The NQT itself has the same syllabus whether administered on-campus or through the open drive.

Q21: How many questions come from Data Interpretation specifically?

Typically 4-6 questions per exam in the Foundation Quantitative section, organized in 1-2 DI sets of 3-4 questions each. DI is the highest-weight single topic in the quantitative section. Some Advanced Quantitative sections also include a harder DI set.

Q22: Does TCS NQT test mental ability or just academic knowledge?

Both. The aptitude sections test abstract reasoning (series, arrangements, analogies) which reflect mental ability. The RC and verbal sections test language comprehension. The quantitative sections test both academic mathematical knowledge and application speed. The coding section tests algorithmic thinking. The combination covers both dimensions.

Q23: What coding topics should I absolutely not skip?

Arrays, strings, and HashMap patterns are non-negotiable. These three topic areas cover the majority of Easy-level coding problems in TCS NQT. A candidate who cannot independently solve a basic array problem (find maximum, reverse array, remove duplicates) or a basic string problem (check palindrome, count characters) has not completed the minimum coding syllabus.

Q24: Is there a logical deduction or critical reasoning section in TCS NQT?

Critical reasoning (if-then logic, assumption identification, conclusion evaluation) appears occasionally in the reasoning section but is not a high-frequency topic. It is lower preparation priority than arrangements, series, and syllogisms. The Advanced Reasoning section may include data sufficiency problems that have some critical reasoning elements.

Q25: How has the TCS NQT syllabus evolved over recent years?

The Foundation section topics have remained stable. The most notable evolution has been in the Advanced section: the coding section has become more important as a Digital track differentiator, and the Advanced Quantitative and Reasoning sections now include harder versions of Foundation topics rather than distinct new topic types. The personality/behavioral section has been present in some windows but not others.

The Syllabus in the Context of a Learning Journey

Connecting the Syllabus to ILP

A remarkable feature of the TCS NQT syllabus is that it partially overlaps with what TCS tests in ILP (Initial Learning Program). Candidates who qualify the NQT and join TCS will encounter syllabus-adjacent material in ILP:

Java coding (TCS ILP): The same language used for NQT coding (if Java was chosen) is TCS’s primary ILP teaching language. Every LeetCode Java problem solved for NQT preparation builds the Java fluency that ILP week-one assessments test.

Problem-solving methodology (both): The algorithmic thinking developed through NQT coding preparation (identify the pattern, select the approach, implement cleanly) is the same thinking ILP expects in capstone projects.

Data analysis (overlap): DI skills developed for NQT quantitative have real-world applications in the data analysis components that appear in various TCS practice areas.

This overlap means that NQT preparation is not merely a one-time exam preparation exercise - it is building foundations that compound into ILP performance, project work quality, and early career effectiveness.

Candidates who arrive at ILP having thoroughly prepared for the NQT syllabus consistently perform better in ILP’s first-week assessments than those who prepared only enough to qualify.

The TCS NQT Preparation Guide on ReportMedic covers the complete syllabus with NQT-calibrated content. Pair it with daily LeetCode practice and a structured 8-week calendar, and every syllabus topic will be adequately covered.

The Mock Test as a Syllabus Coverage Verifier

Using Mock Tests to Find Syllabus Gaps

The most efficient way to find uncovered syllabus topics is through a well-calibrated mock test. Topics that appear in the mock that you have not studied will show clearly as wrong answers.

The mock-based gap analysis process:

Take the mock test and mark every question you got wrong. For each wrong answer, note the specific topic type (not just “QA” but “ratio problem” or “work problem”).

After the mock, group the wrong answers by topic. Topics that produced multiple wrong answers are syllabus gaps.

Revisit those topics systematically before the next mock. Cover the concept, work through 15-20 practice questions, verify with 5 timed questions.

The second mock, taken 1-2 weeks later, will show whether the gap has been filled. Wrong answers in the same topic area indicate the gap remains; right answers confirm coverage.

This process, repeated across 4-6 mock tests, systematically closes all syllabus gaps by exam day.

The “One Wrong Per Topic” Standard

A useful calibration standard for syllabus coverage: in any 10-question practice set for a specific topic, you should be getting at least 8-9 correct under timed conditions. If you are getting 6-7 correct, the topic is partially covered. If you are getting 4-5, the topic is not yet adequately covered.

Apply this standard topic by topic through the syllabus. Topics clearing the 8-9/10 threshold under timed conditions are ready. Topics below this threshold need more practice before exam day.

Topic-Specific Preparation Resources

What to Use for Each Syllabus Area

For candidates seeking resources beyond this guide and the NQT preparation platform:

Quantitative Aptitude books:

  • R.S. Aggarwal’s “Quantitative Aptitude for Competitive Examinations” - the standard reference covering all NQT quantitative topics at appropriate depth
  • Arun Sharma’s “How to Prepare for Quantitative Aptitude” - strong DI coverage and speed-building exercises

Logical Reasoning books:

  • R.S. Aggarwal’s “A Modern Approach to Verbal and Non-Verbal Reasoning” - comprehensive coverage of all reasoning types tested in NQT
  • M.K. Pandey’s “Analytical Reasoning” - strong arrangement and puzzle coverage

Verbal Ability books:

  • S.P. Bakshi’s “Objective General English” - comprehensive grammar rules and RC practice
  • R.S. Aggarwal’s “English Grammar” - focused grammar reference

Coding resources:

  • LeetCode (free tier): the primary coding practice resource; topics covered exactly map to NQT coding syllabus
  • “Cracking the Coding Interview” (Chapter 1-7): arrays, strings, linked lists, stacks, trees, bit manipulation - all NQT-relevant
  • NeetCode.io (free): video explanations of LeetCode problems by pattern type

NQT-specific:

The Syllabus as a Living Document

How to Track Your Coverage

Creating a personal syllabus tracker converts this guide from a reference document into an active preparation tool:

Create a spreadsheet with columns:

  • Topic name
  • Section (QA / Verbal / Reasoning / Coding)
  • Priority tier (1/2/3)
  • Status (Not started / In progress / Practiced / Mock-verified)
  • Questions practiced (count)
  • Current accuracy (% correct in timed practice)
  • Target accuracy (from the coverage checklist)

Update this tracker weekly as preparation progresses. The tracker converts the question “am I ready?” into a specific, answerable status: “8 of 10 Tier 1 topics are mock-verified; 2 remaining are in progress.”

The exam-ready standard: All Tier 1 topics: Mock-verified (correct in practice and in mock tests) All Tier 2 topics: Practiced (correct in focused practice) Tier 3 topics: At minimum In-progress (conceptual understanding)

This standard, achieved before exam day, confirms complete sylllabus coverage at the appropriate depth.

Summary: The Complete Syllabus at a Glance

Foundation Numerical Ability (26 questions, 40 minutes): Number systems, percentages, profit/loss/discount, simple/compound interest, ratios/proportions, time-speed-distance (4 sub-types), work and time, data interpretation (DI sets), permutations/combinations, probability, averages.

Foundation Verbal Ability (24 questions, 30 minutes): Reading comprehension (2-3 passages), grammar/error detection (subject-verb agreement, tense, pronoun, parallelism), vocabulary (synonyms/antonyms), fill in the blanks, para-jumbles.

Foundation Logical Reasoning (26 questions, 40 minutes): Number series (7 pattern types), letter series, linear and circular seating arrangements, syllogisms, blood relations, direction and distance, coding-decoding, input-output, odd-one-out, analogies.

Advanced Quantitative (~15 questions, 20 minutes): Harder versions of Foundation quantitative topics. Same topics, higher complexity and more steps.

Advanced Reasoning (~10 questions, 20 minutes): Complex circular arrangements, data sufficiency, analytical puzzles, cause-effect reasoning.

Advanced Coding (2 problems, 45-60 minutes): Problem 1 (Easy): Arrays, strings, hash tables, two-pointer, basic recursion at LeetCode Easy level. Problem 2 (Medium): Sliding window, binary search, entry-level DP, tree traversals at LeetCode Medium level.

What is NOT on the syllabus: Calculus, advanced statistics, GATE-level CS theory, geometry (minimal if at all), advanced graph algorithms, machine learning.

Study priority: Tier 1 (DI, percentages, TSD, RC, series, arrangements, basic coding) → Tier 2 (interest, work, blood relations, direction, circular arrangements, vocabulary, coding patterns) → Tier 3 (combinations, probability, para-jumbles, complex reasoning, Medium coding).

This is the complete NQT syllabus. Cover it systematically. Qualify confidently.

Using This Syllabus Guide as Your Preparation Map

How to Apply This Guide

This syllabus guide should not be read once and set aside. Use it as a living reference throughout your preparation:

Before starting preparation: Review the complete topic list for each section. Assess your current knowledge of each topic. Mark topics as: Strong (need maintenance only), Moderate (need development), or Weak (need foundational study). This self-assessment creates your preparation priority map.

During preparation: After completing each topic, check it off the relevant section. Track which topics you have covered versus which remain. Ensure no high-frequency topic is uncovered before your exam date.

One week before the exam: Review the topic list once more. Confirm that all Tier 1 topics have been practiced under timed conditions. Confirm that Tier 2 topics have at least basic coverage. Accept that Tier 3 topics you have not covered yet will not be covered in the final week - simulation mocks are the priority.

The day before the exam: Quickly review the topic structure (what is in each section) and your personal notes on any topics where you have developed specific shortcuts or mnemonics. Do not learn new topics.

The complete syllabus, systematically prepared using the priority tier system and calibrated through regular mock tests with the TCS NQT Preparation Guide on ReportMedic, produces the exam-ready preparation that qualification requires.

Know the syllabus. Prioritize the topics. Prepare systematically.

The qualification follows from the preparation.

Practice Questions by Topic: Verifying Your Syllabus Coverage

20 Sample Questions Covering Key Syllabus Topics

The following questions represent the difficulty level and style of NQT questions across the major syllabus areas. Attempting them helps verify your coverage before exam day.

Quantitative - Data Interpretation (use the table below):

Year Product A Product B Total
2020 120 80 200
2021 150 100 250
2022 180 120 300

Q1: By what percentage did Product A’s sales increase from 2020 to 2022? Answer: (180-120)/120 × 100 = 50%

Q2: What is the ratio of Product B’s sales in 2021 to Total sales in 2020? Answer: 100:200 = 1:2

Quantitative - Percentages: Q3: A price increased by 20% then decreased by 25%. What is the net change? Answer: 20 + (-25) + (20×-25)/100 = 20 - 25 - 5 = -10% (net decrease of 10%)

Quantitative - Time, Speed, Distance: Q4: A train 300m long passes a pole in 15 seconds. It will pass a platform 200m long in how many seconds? Answer: Speed = 300/15 = 20 m/s. Distance = 300+200 = 500m. Time = 500/20 = 25 seconds

Quantitative - Work: Q5: A can complete a task in 12 days. B can complete it in 18 days. Working together, how many days will they take? Answer: Rate = 1/12 + 1/18 = 3/36 + 2/36 = 5/36 per day. Days = 36/5 = 7.2 days

Reasoning - Number Series: Q6: Find the next number: 2, 6, 12, 20, 30, ? Answer: Differences are 4, 6, 8, 10 → next difference = 12 → 30+12 = 42

Q7: Find the wrong number: 3, 7, 15, 31, 64, 127 Answer: Pattern: ×2+1 each time. 3→7→15→31→63→127. Wrong number is 64 (should be 63)

Reasoning - Syllogism: Q8: All cats are mammals. Some mammals are dogs. Which conclusion definitely follows? (a) Some cats are dogs (b) Some dogs are mammals (c) All mammals are cats (d) No cats are dogs Answer: (b) - Some mammals are dogs is given. Therefore some dogs are mammals (reversible for “Some”).

Reasoning - Blood Relations: Q9: A is B’s sister. C is B’s father. D is C’s father. What is D’s relation to A? Answer: A is B’s sister → they share the same father C. C’s father is D. So D is A’s grandfather.

Reasoning - Direction: Q10: A man walks 10km North, then 6km East, then 10km South. How far is he from his starting point? Answer: North-South: 10 North - 10 South = 0 net. East-West: 6 East net. Distance = 6km.

Verbal - Error Detection: Q11: Identify the error: “Neither the students nor the teacher are present.” Answer: “are” should be “is” - with neither…nor, the verb agrees with the nearest subject (“teacher” is singular)

Verbal - Vocabulary: Q12: Choose the synonym of VERBOSE: (a) Silent (b) Wordy (c) Energetic (d) Careful Answer: (b) Wordy. Verbose means using more words than necessary.

Coding - Array (Python): Q13: Write a function that returns the maximum element in an array without using the built-in max().

def find_max(arr):
    if not arr:
        return None
    max_val = arr[0]
    for i in range(1, len(arr)):
        if arr[i] > max_val:
            max_val = arr[i]
    return max_val

Coding - String (Python): Q14: Check if a string is a palindrome (case-insensitive, ignoring spaces).

def is_palindrome(s):
    cleaned = s.lower().replace(" ", "")
    return cleaned == cleaned[::-1]

Coding - HashMap (Python): Q15: Given an array, find if any two numbers sum to a target value.

def has_pair_with_sum(arr, target):
    seen = set()
    for num in arr:
        if target - num in seen:
            return True
        seen.add(num)
    return False

These sample questions verify conceptual understanding. For NQT-style full practice sets under timed conditions, the TCS NQT Preparation Guide on ReportMedic provides complete topic-organized question banks with immediate feedback.

Connecting Syllabus to Scoring Strategy

Section-by-Section Scoring Strategy Based on the Syllabus

Understanding the syllabus allows you to develop a within-exam scoring strategy:

Foundation Quantitative section strategy: Open with DI sets (highest weight, questions-first approach active). Move to percentage and ratio questions (fastest among the remaining types). Leave combinations and probability for last (lowest ROI per time unit).

Foundation Reasoning section strategy: Open with number series questions (fastest to solve). Move to syllogisms (fast with Venn diagram method). Move to blood relations and direction problems. Leave arrangements for last (highest time cost; if time remains, apply the method; if not, attempt answers using partial constraint application).

Foundation Verbal section strategy: Open with all RC passages using questions-first approach (highest weight, strategy-dependent). Move to grammar error detection (fast with subject-verb check). Move to vocabulary and fill-in-the-blanks. Leave para-jumbles for last (highest time cost).

Advanced Coding strategy: Read both problems first (3 minutes). Identify the easier one. Complete it entirely before beginning the harder one. Submit before starting the second problem.

This section-by-section strategy, derived directly from syllabus topic analysis, maximizes expected marks per unit of exam time.

The Syllabus Mastery Standard

What “Covering the Syllabus” Actually Means

There is a meaningful difference between “having been exposed to a topic” and “having mastered it to NQT qualification standard.” The mastery standard requires:

For aptitude topics: Solve the most common question types correctly under 90-second time pressure, at least 8-9 times out of 10, without reference to formulas.

For reasoning topics: Apply the specific methodology (Venn diagram for syllogisms, constraint application for arrangements) automatically rather than needing to reconstruct the approach each time.

For verbal: Execute the questions-first RC approach automatically; identify the most common grammar error types within 15-20 seconds of reading the sentence.

For coding: Implement solutions to Easy-level problems within 18-20 minutes without looking up syntax or algorithm approaches.

This mastery standard - not mere familiarity - is what translates into exam-day performance at the qualifying level.

The 8-week preparation calendar in this guide, if executed consistently with timed practice throughout, produces this mastery level across the syllabus.

Begin from the beginning of the syllabus. Work through systematically. Verify with mock tests. Arrive at exam day having mastered every high-frequency topic in every section.

That is what complete syllabus preparation means.

That is what qualification requires.