This structured plan covers Aptitude, Coding, and Communication Skills โ ensuring youโre prepared for all TCS NQT sections.
๐๏ธ Week 1: Foundation Building
Day 1-3: Quantitative Aptitude – Basics
โ
Number System
โ
LCM & HCF
โ
Percentage
โ
Ratio & Proportion
๐ Practice on: IndiaBIX or PrepInsta
Day 4-5: Logical Reasoning – Basics
โ
Blood Relations
โ
Directions
โ
Syllogism
โ
Seating Arrangements
๐ Practice on: GeeksforGeeks
Day 6-7: Verbal Ability – Basics
โ
Synonyms & Antonyms
โ
Sentence Completion
โ
Reading Comprehension
๐ Practice on: Testbook
๐๏ธ Week 2: Skill Refinement
Day 8-10: Coding – Basics
โ
C / C++ / Python (Choose one)
โ
Data Types, Loops, Conditional Statements
๐ Practice on: CodeChef or LeetCode
Day 11-12: Coding – Problem Solving
โ
Pattern Printing
โ
Arrays (Basics)
โ
String Manipulation
๐ Practice on: HackerRank
Day 13-14: Practice Full Mock Test
โ
Take a TCS NQT Mock Test to assess your progress
๐ Use: PrepInsta, TalentBattle, or TCS NQT Official Portal
๐๏ธ Week 3: Intermediate Practice
Day 15-17: Quantitative Aptitude – Advanced
โ
Profit & Loss
โ
Time & Work
โ
Probability
โ
Permutations & Combinations
Day 18-19: Logical Reasoning – Advanced
โ
Puzzle-based Questions
โ
Coding-Decoding
โ
Statement & Conclusion
Day 20-21: Verbal Ability – Advanced
โ
Spotting Errors
โ
Sentence Correction
โ
Email Writing (Practice TCS Email Format)
๐๏ธ Week 4: Intensive Practice & Revision
Day 22-24: Coding – Advanced
โ
Data Structures Basics (Linked Lists, Stacks, Queues)
โ
Solving Easy-Medium Problems on LeetCode
Day 25-26: Mock Tests & Practice
โ
Solve 2-3 full-length TCS NQT mock tests
โ
Identify weak areas and improve them
Day 27-28: Revision & Final Tips
โ
Review key concepts
โ
Revise shortcuts for Aptitude questions
โ
Practice time management for the test
๐ Recommended Practice Questions for TCS NQT
- Aptitude:
โค Time & Work: “A and B can complete a task in 20 days. If A works alone for 10 days and B works alone for 5 days, how long will they take together to finish the remaining work?” - Logical Reasoning:
โค Puzzle: “Six friends are sitting in a circular table facing inward. A is between B and C. D is opposite to A. Who is sitting between D and B?” - Coding:
โค Easy: Reverse a string
โค Medium: Find the second-largest number in an array
โค Advanced: Implement a stack using arrays
๐ฏ Pro Tips for Success
โ
Practice regularly โ Consistency is key.
โ
Solve previous year’s TCS NQT papers โ They often repeat patterns.
โ
Master Email Writing โ Focus on structure, grammar, and tone.
โ
Focus on speed and accuracy โ The test is time-bound.
๐ Mock Test Links (Free & Effective)
- TCS NQT Official Sample Test
๐ TCS NQT Sample Test - PrepInsta TCS NQT Mock Tests
๐ PrepInsta Mock Test - GeeksforGeeks TCS NQT Practice
๐ GFG TCS NQT Practice - IndiaBIX Aptitude & Reasoning Practice
๐ IndiaBIX Mock Tests - HackerRank TCS NQT Coding Practice
๐ HackerRank Practice
๐ป Coding Question Examples (TCS NQT Level)
Basic Level
- Reverse a String
Input:hello
โ Output:olleh
- Check Prime Number
Input:7
โ Output:Prime
- Factorial Calculation
Input:5
โ Output:120
Intermediate Level
- Second Largest in an Array
Input:[10, 5, 8, 20, 15]
โ Output:15
- Palindrome Check
Input:madam
โ Output:Palindrome
- Armstrong Number
Input:153
โ Output:Armstrong
Advanced Level
- Sorting Array in Ascending Order
Input:[4, 2, 9, 1]
โ Output:[1, 2, 4, 9]
- Fibonacci Series using Recursion
Input:5
โ Output:0 1 1 2 3
- Binary Search Algorithm
Input:Array = [2, 4, 6, 8, 10], Target = 8
โ Output:Index 3
โก Shortcut Tricks for TCS NQT
โ Aptitude Tricks:
- Speed, Time & Distance: Use the formula:
Speed=DistanceTime\text{Speed} = \frac{\text{Distance}}{\text{Time}}
โก๏ธ For trains crossing a platform, add the train’s length + platform’s length.
โ Percentage Conversion Trick:
- 20% of 450? โ Divide by 10, then multiply by 2 โ Answer:
90
โ Probability Tip:
- Probability of drawing a red card from a deck?
Probability=Favorable OutcomesTotal Outcomes=2652=12\text{Probability} = \frac{\text{Favorable Outcomes}}{\text{Total Outcomes}} = \frac{26}{52} = \frac{1}{2}
โ
Coding Tip for Arrays:
โก๏ธ To find the second largest element in an array:
function secondLargest(arr) {
let sortedArr = [...new Set(arr)].sort((a, b) => b - a);
return sortedArr[1];
}
console.log(secondLargest([10, 20, 30, 40, 20])); // Output: 30
๐ Bonus Preparation Tips
โ
Focus on TCSโs Pseudocode section โ Itโs common in the exam.
โ
Practice Email Writing using TCSโs official template.
โ
Solve Previous Year Papers for repeated patterns.
