TCS Digital Aptitude and Technical Questions 2026

TCS Digital requires a higher NQT percentile, a completed Advanced section, and a technical interview covering CS fundamentals across four domains. That combination is what separates it from the Ninja track.

TCS Digital in the NQT hiring stack

All three TCS engineering tracks use the same NQT as the written test. What changes is the cutoff required and the additional sections that Digital and Prime candidates must complete.

Track	CTC band	NQT requirement	Additional sections
TCS Ninja	Rs 3.5 to 3.9 LPA	Foundation only	None
TCS Digital	Rs 7.0 to 7.5 LPA	Foundation + higher cutoff	Advanced: Programming Logic + Coding
TCS Prime	Rs 9.0 to 11.0 LPA	Foundation + top percentile	Advanced + AI/data project review in extended technical

The Foundation section (Verbal, Reasoning, Numerical Ability) is the shared gate for every track. The FACE Prep TCS NQT aptitude guide covers the Foundation section in detail across all three Cognitive Skills sub-sections.

Digital-track candidates who score above the Ninja cutoff but below the Digital cutoff on the Foundation still qualify for Ninja. Completing the Advanced Coding section is optional during the NQT, but only candidates who complete it are considered for Digital or Prime placement. The TCS Ninja questions and pattern guide covers the Ninja-track flow in detail.

Eligibility and test pattern for TCS Digital

Eligibility

Most TCS Digital campus drives require the following. Candidates should confirm exact requirements through their placement cell, as cutoffs and batch windows vary by drive.

• Degree: BE/BTech in any stream (MCA/MSc as specified per drive)
• CGPA: 7.0 or above at time of registration (Ninja track minimum is 6.0)
• No active backlogs at time of NQT registration
• Graduation year within the eligible batch window for the specific drive

Test structure

Component	Questions	Time
Verbal Ability (Foundation)	24	30 min
Reasoning Ability (Foundation)	30	50 min
Numerical Ability (Foundation)	26	40 min
Programming Logic (Advanced)	approx. 20 MCQs	approx. 30 min
Coding (Advanced)	1 to 2 problems	approx. 30 min

No negative marking applies to the Foundation sections or to the Programming Logic MCQs in the Advanced section. The Coding problem is evaluated on test-case correctness and code efficiency. Candidates who attempt the Advanced section and perform below the Digital cutoff still retain their Ninja eligibility if their Foundation score meets the Ninja threshold.

Advanced aptitude: sample questions with worked solutions

Digital-track candidates need to clear the Foundation sections at a higher percentile than Ninja candidates. The following questions represent the difficulty range you should be comfortable with before the NQT.

Work and time

• Q1. A can complete a job in 12 days, B in 15 days. They work together for 4 days, then A leaves. How many more days does B need to finish the job?
  • A’s rate: 1/12 per day; B’s rate: 1/15 per day
  • Together in 4 days: 4 × (1/12 + 1/15) = 4 × (5 + 4)/60 = 4 × 9/60 = 3/5 of the job
  • Remaining: 1 − 3/5 = 2/5
  • B alone: (2/5) ÷ (1/15) = (2/5) × 15 = 6 days
  • Answer: 6 days

Profit and loss with discount

• Q2. A shopkeeper marks goods 40% above cost price and offers a 20% discount. Find the profit percentage.
  • Let cost price = 100
  • Marked price = 100 × 1.40 = 140
  • Selling price after 20% discount: 140 × 0.80 = 112
  • Profit = 112 − 100 = 12; profit percentage = (12/100) × 100 = 12%
  • Answer: 12%

Number system: remainders

• Q3. Find the remainder when 2^30 is divided by 7.
  • Powers of 2 mod 7: 2^1 ≡ 2, 2^2 ≡ 4, 2^3 ≡ 8 ≡ 1 (mod 7) — cycle length = 3
  • 30 = 3 × 10, so 2^30 = (2^3)^10 ≡ 1^10 = 1 (mod 7)
  • Answer: 1

Probability and combinations

• Q4. A committee of 4 is chosen from 5 men and 4 women. What is the probability that exactly 2 women are on the committee?
  • Total ways to choose 4 from 9: C(9,4) = (9 × 8 × 7 × 6)/(4 × 3 × 2 × 1) = 126
  • Ways with exactly 2 women: C(4,2) × C(5,2) = 6 × 10 = 60
  • Probability = 60/126 = 10/21
  • Answer: 10/21

Mixture and alligation

• Q5. Two vessels contain milk and water in ratios 3:1 and 5:3. In what ratio should they be mixed to get milk:water = 7:3?
  • Milk fraction in vessel 1: 3/4 = 0.75; vessel 2: 5/8 = 0.625; target: 7/10 = 0.70
  • By alligation: vessel 1 share : vessel 2 share = (0.70 − 0.625) : (0.75 − 0.70) = 0.075 : 0.05 = 3:2
  • Verify: (3 × 0.75 + 2 × 0.625)/5 = (2.25 + 1.25)/5 = 3.5/5 = 0.70 ✓
  • Answer: 3:2 (vessel 1 : vessel 2)

Verbal Ability note

The Advanced section does not add a separate Verbal sub-section. Digital-track candidates face a higher Foundation cutoff on Verbal Ability, not a different test format. Preparation for Verbal covers the same question types across all three NQT tracks: reading comprehension, sentence completion, para jumbles, and error identification.

Technical MCQs: sample questions with worked answers

These questions represent the topics and difficulty you should prepare for in TCS Digital’s technical interview, and to a lesser extent in the Programming Logic MCQs of the Advanced section.

Data Structures and Algorithms

• Q1. What is the time complexity of binary search on a sorted array of n elements?
  • Binary search halves the search space with each comparison: n, then n/2, then n/4, and so on
  • Number of steps to reach a single element: log₂(n)
  • Answer: O(log n)

Database Management Systems

• Q2. Relation R(A, B, C, D) has functional dependencies A→B, A→C, B→D. A is the only primary key. What is the highest normal form R satisfies?
  • A is a single-attribute key, so there are no partial functional dependencies. 2NF is satisfied.
  • A→B→D is a transitive dependency: B is not a key, so D depends on A indirectly via B. 3NF is violated.
  • Answer: 2NF (not 3NF)

Operating Systems

• Q3. Three processes arrive in order: P1 (arrives t=0, burst time = 8), P2 (arrives t=1, burst time = 4), P3 (arrives t=2, burst time = 2). Using non-preemptive SJF, find the average waiting time.
  • At t=0, only P1 is available. P1 runs from t=0 to t=8.
  • At t=8, both P2 (burst=4) and P3 (burst=2) are waiting. SJF picks P3. P3 runs from t=8 to t=10.
  • P2 runs from t=10 to t=14.
  • Waiting times: P1 = 0 − 0 = 0; P3 = 8 − 2 = 6; P2 = 10 − 1 = 9
  • Average = (0 + 6 + 9) / 3 = 5 minutes
  • Answer: 5 minutes

Computer Networks

• Q4. A Class C network 192.168.1.0 is subnetted with mask /26. How many usable host addresses are available per subnet?
  • /26 means 6 host bits per subnet: 32 − 26 = 6
  • Addresses per subnet: 2^6 = 64; subtract 2 for the network and broadcast addresses
  • Answer: 62 usable host addresses per subnet

Sorting algorithm analysis

• Q5. Which comparison-based sorting algorithms guarantee O(n log n) in the worst case?
  • Bubble sort, selection sort, insertion sort: worst-case O(n^2) — not guaranteed
  • Quick sort: O(n log n) average, O(n^2) worst case (degenerate pivot)
  • Merge sort: O(n log n) worst case — guaranteed
  • Heap sort: O(n log n) worst case — guaranteed
  • Answer: Merge sort and heap sort

Coding round: what the Advanced section tests

The Advanced section coding problem for TCS Digital is not reproduced here, as the exam is live and candidates sign a non-disclosure agreement. The pattern that holds across test cycles is well-documented by placement teams at engineering colleges.

• Problem category: Arrays, strings, linked lists, and basic dynamic programming. Matrix traversal problems appear occasionally.
• Difficulty: Medium. A brute-force solution that passes all test cases earns partial or full marks. An optimised solution (better time or space complexity) earns full marks consistently.
• Language options: C, C++, Java, Python (verify the supported list for your specific NQT cycle)
• Evaluation method: Test-case correctness and code efficiency. Output format must match exactly, including whitespace and newline characters.
• Problem count: One to two problems per candidate. Both appear in the same session with a shared time allocation.

The practical prep approach: solve 40 to 60 medium-difficulty problems on arrays and strings before your NQT date. Prioritise edge cases (empty input, single element, duplicates, large values) and clean output formatting. NQT coding problems are not designed to require advanced algorithm design; they test whether you can translate a clear problem statement into correct, working code under time constraints.

AI skills and the 60% shift in TCS’s hiring mix

In FY26, TCS CHRO Sudeep Kunnumal reported at the AI Impact Summit that 60% of TCS fresher hires were AI-skilled, with Digital and Prime cadre volume up 50% from three years earlier. For FY27, TCS has guided a fresher intake of roughly 25,000, down from 44,000 onboarded in FY26, with the AI-skilled tilt continuing. For the Digital track specifically, AI exposure already factors positively into candidate evaluation; for Prime, the extended technical now includes a review of AI or data projects.

The 60% shift in TCS’s hiring mix makes it clear that AI skills now sit alongside the CS fundamentals covered in this article. If you want to build an actual AI project before the placement cycle, TinkerLLM at Rs 299 is the entry point for experimenting with LLMs without committing to a long programme.