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.
