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.
