Professional Documents
Culture Documents
TCS NQT
TCS NQT
TCS NQT
English 10 mins 15 10 to 13
Quantitative
30 mins 15 12 to 14
Aptitude
Programming
20 mins 10 6 to 7
Concepts
• Based on Grammar
a. Error Identification
b. Fill in the Blanks
c. Sentence Improvement
• Based on Vocabulary
• Fill in the Blanks
• Based on Logical Thought & Reading
• Paragraph & Sentence Jumble
• Comprehension
• Grammar
a. Nouns, Pronouns & Articles
b. Adjectives & Adverbs
c. Verbs & Tense
d. Subject Verb Agreement
e. Prepositions
• Vocabulary
a. Often Confused words
b. Correct spelling & use of words
Sneak Peek into the Programming Logic section of
TCS NQT 2020!
• The Programming Logic Section of the TCS NQT majorly revolves around
these five topics.
• Building blocks of programs where you are tested on your deep
knowledge in data types and variables. Logic is tested on questions like
below.
How does a computer store your name, age, etc…?
How do they get stored in the computer as 0’s and 1’s?
When we declare variables, we use some extra words like ‘const', ‘long',
‘short', ‘signed' etc… These words are language-neutral and you are tested
on the knowledge on their appropriate use and misuse.
Next, we will be tested on your awareness of the compilation process.
How is a specific code snippet understood by a machine and what are the
intermediate steps?
• Structured Programming where you are tested on comprehending a few
lines of code given to you based on the implementation of
conditional/branching statements like if, if-else, switch statements and
looping statements like for, while, do-while loops… Again, it is
pseudocode and not programming language-specific!
• Arrays, Strings, and Pointers where simple list manipulation comes
into the picture. The logic behind the working of arrays, strings, and
pointers are tested rather than specific syntax in a specific
programming language. Knowledge of string library functions like
string comparison, string reversal is constant immaterial of any
programming language is surely a part of the test.
• Algorithms: Some sorting algorithms like Heap sort, Merge sort,
Quicksort, and Selection sort might come handy in this scenario.
Knowledge of their time complexities – average-case, best-case, and
worst-case scenarios is crucial. Knowing some searching algorithms
like a linear search and binary search is important. Knowledge about
Binary Trees is truly an icing on the cake.
• Primary Data Structures of Collections: Intuitive knowledge of
operations on Stacks, Queues, Binary Trees and Linked Lists is
preferred. Some knowledge of Hash tables is definitely a game-
changer!