Every year TCS conducts TCS Ninja test across India to freshly graduated students from UG and PG as part

of their hir

Here is the list of syllabus to be prepared.

1. Verbal Ability
2. Numerical Ability
3. Reasoning Ability
4. Programming Logic
5. Coding – Hands on coding

Lets dive deep into the syllabus

Criteria of Eligibility

Percentage: Minimum aggregate marks should be 60% or 6 CGPA in Class Xth, Class XIIth, Diploma, UG and PG examinations
Backlogs / Arrears / ATKT: Students should not have more than 1 active backlog / arrear/ ATKT at the time of appearing for
Gap / Break in Education: It is mandatory to declare gaps in education, if any. Break in education should not be due to exten
Course Types:Only Full-Time courses will be considered (Part Time / Correspondence courses will not be considered). Stude
Work Experience: Students with prior work experience of up to 2 years are eligible to apply for the TCS Ninja hiring process
Age: Students should be of 18 to 28 years of age to participate in the TCS Ninja hiring process
Courses & Discipline: UG/PG Engineering Courses from B.E. / B.Tech / M.E. / M.Tech / MCA / M.Sc from any specialization o

1. Verbal Ability syllabus

a. English Grammer

b. Reading Comprehension

Questions - 24 Ques
Time - 30 mins

2. Reasoning Ability Syllabus

a. Problem Solving

b. Propositional Reasoning

c. Visual/Spatial Reasoning

d. Figural and Factual Analysis

e. Identifying Word

 
f. Decision Making

Questions - 30 Ques
Time - 50 mins

3. Numerical Ability

a. Number System

b. Mensuration

c. Arithmetic Ability
d. Elementary Statistics

e. Data Interpretation

f. Simplifications & Approximations

Questions - 26 Ques
Time - 40 mins

4. Programming Logic
a. Programming Logic

b. Computer Science Papers – C Language

 Questions - 10 Ques
Time - 15 mins

5. Coding Facts

a. Questions can be given from the following sections:

b.

Time - 15 + 30 mins
raduated students from UG and PG as part of their hiring process.

yllabus to be prepared.

bal Ability
rical Ability
ning Ability
mming Logic
Hands on coding

into the syllabus

ass Xth, Class XIIth, Diploma, UG and PG examinations.

ve backlog / arrear/ ATKT at the time of appearing for the TCS Selection process in the highest qualification. If selected, students should no
n, if any. Break in education should not be due to extended education (examinations cleared after the time stipulated by the Board / Unive
orrespondence courses will not be considered). Students who have completed their Secondary and / or Senior Secondary course from NIO
s are eligible to apply for the TCS Ninja hiring process
TCS Ninja hiring process
M.E. / M.Tech / MCA / M.Sc from any specialization offered by the university / college are only eligible to apply

Verbal Topics Questions

Passage Ordering Cloze Test 1-2
Synonyms and Antonyms Grammar 1-2
Spelling Sentence Completion 1-2
Error Identification Sentence Ordering 0-1
Sentence Completion Passage Ordering 0-1
Reading
Selecting words 1
Comprehension
Error Correction Error Identification 1-2
Error Correction 1-2
Best Expresses
0-1
Synonym
Reading and Comprehension Spellings 1-2
Cloze Test Synonyms 1-2
Word Selection 0-1

Reasoning Topics Questions

Meaning Word
1-2
Creation
Blood Relations Number Series 2-3
Seating Arrangements Blood Relations 1-2
Data Arrangements Coding – Decoding 1-2
Ages 1-2
Statements Data Sufficiency 1-2
Seating Arrangement
Logical Venn Diagram Based DI 1-2
(Easy)
Seating Arrangement
1-2
(Complex)
Visual Reasoning Odd Man Out 1-2
Distance & Direction 1-2
Statement &
1-2
Cube Folding, Paper Cuts, and Folds Conclusion
Analogy 1-2
Mathematical
Operational 1-2
Letter Series Arrangement

Symbols & Notations 2-3

Word Pattern

Decision Making
Data Sufficiency
Syllogism

Numerical Topics Questions

Probability 1–2
Divisibility P and C 1
Decimal Fractions and Numbers Number System 1
Number System and LCM & HCF Clocks and Calendar 0–1
Percentages 0–1
Time, speed, distance 0 – 1
Geometry
Series and
1–2
Area , Perimeter and Shapes Progressions
Work and Time 0–1
Ratios, Proportion
Profit and Loss 1
and Averages
Allegations and
Time and Work 1
Mixtures
 Arrangements and
Clocks and Calendar 1–2
Series
Arrangement & Series Geometry 2
Ratios and Proportions Reasoning 2
Series and Progressions Equations 0–1
Allegations and Mixtures
Distance, Speed and Time
Ages
Averages
Equations
Probability
Percentages

Mean, Median, Mode, Standard Deviation, and Variance

Tabular Data Interpretation

Graphical Data Interpretation
Pie Charts Data Interpretation

Simple Arithmetic Calculations

Programming Logic
Questions
topics
Data Types inTCS mcq c questions Variables Functions 1
Functions and Scope C input Output 2
Recursion and Iteration Command Line 1
Stacks Queues Arrays 1 – 2
 File Handling
Array Trees Graphs 2
 Variables and Registers Linked Lists, Greedy 1 – 2
Loops
Command Line Arguments

TCS Questions on OOPS

Input Output Questions
Stacks and Queue
Linked List
Trees
Graphs
Dynamic Programming and Greedy
Hashing
Searching and Sorting
Time Complexity

Number Series Printing - Example - 1, 2, 5, 4, 25, 16, 125,

64 ......
This series is mixture of power of 2 and power of 5. You have
to print it via code.

Strings - Example - Read a string and convert all the

uppercases to $ sign and all lower cases to & sign and print the
output.
Matrix - Finding Highest sum for a row in a given matrix
Pythagoras Triplets
LCM of 3 numbers
ected, students should not have any pending backlog or arrear at the time of joining TCS
ated by the Board / University). Any break in education should not exceed 24 months and is permissible only for valid reasons. Relevant do
condary course from NIOS (National Institute of Open Schooling) are also eligible to apply if the other courses are full time. All pending ba

Difficulty
Medium
Medium
High
Medium
High
Medium
Medium
Medium
High
High
Medium
Medium

Difficulty

Medium
Medium
Medium
Medium
High
Medium
Low

High
Medium
Medium
High
High

Medium

Medium

Difficulty
Medium
Medium
Medium
Medium
High
Medium

High
Medium
Medium

Medium
High
High
Medium
Medium

Difficulty
Medium
Medium
Medium
High
High
High
r valid reasons. Relevant document proof, as applicable, will be checked for gaps in education
are full time. All pending backlogs should be completed within the stipulated time duration
 5. Coding Facts

Questions can be given from

the following sections:

Time - 15 + 30 mins
 5. Coding Facts

Number Series Printing -

Example - 1, 2, 5, 4, 25, 16, 125, 64 ......
This series is mixture of power of 2 and power of 5.
You have to print it via code.

Strings - Example - Read a string and convert all the

uppercases to $ sign and all lower cases to & sign and print
the output.
Matrix - Finding Highest sum for a row in a given matrix
Pythagoras Triplets
LCM of 3 numbers
 Verbal Topics Questions Difficulty
Cloze Test 1-2 Medium
Grammar 1-2 Medium
Sentence Completion 1-2 High
Sentence Ordering 0-1 Medium
Passage Ordering 0-1 High
Reading Comprehension 1 Medium
Error Identification 1-2 Medium
Error Correction 1-2 Medium
Best Expresses
0-1 High
Synonym
Spellings 1-2 High
Synonyms 1-2 Medium
Word Selection 0-1 Medium

Reasoning Topics Questions Difficulty

Meaning Word Creation 1-2 Medium
Number Series 2-3 Medium
Blood Relations 1-2 Medium
Coding – Decoding 1-2 Medium
Ages 1-2 High
Data Sufficiency 1-2 Medium
Seating Arrangement
1-2 Low
(Easy)
Seating Arrangement
1-2 High
(Complex)
Odd Man Out 1-2 Medium
Distance & Direction 1-2 Medium
Statement & Conclusion 1-2 High
Analogy 1-2 High
Mathematical
Operational 1-2 Medium
Arrangement
Symbols & Notations 2-3 Medium

Numerical Topics Questions Difficulty

Probability 1–2 Medium
P and C 1 Medium
Number System 1 Medium
Clocks and Calendar 0–1 Medium
Percentages 0–1 High
Time, speed, distance 0–1 Medium
Series and Progressions 1–2 High
Work and Time 0–1 Medium
Ratios, Proportion and
1 Medium
Averages
Allegations and
1 Medium
Mixtures
Arrangements and
1–2 High
Series
Geometry 2 High
Reasoning 2 Medium
Equations 0–1 Medium

Programming Logic
Questions Difficulty
topics
Variables Functions 1 Medium
C input Output 2 Medium
Command Line 1 Medium
Stacks Queues Arrays 1–2 High
Trees Graphs 2 High
Linked Lists, Greedy 1–2 High