Interview experience
TCS interview experiences covering TCS NQT (Online Test), Technical Interview, Managerial Interview, HR Interview. Round-wise notes, common questions, and what candidates report clears each stage.
TCS Interview Questions and Answers (2026)
Tata Consultancy Services (TCS) is a global leader in IT services, consulting, and business solutions. Part of the Tata Group, TCS operates in 50+ countries, serving clients across industries with digital transformation, cloud, and technology services. TCS is one of the largest recruiters of engineering graduates in India.
Explore: Interview experience · HR interview questions · Overview · Placement papers · Preparation guide
Overview
TCS funnels every fresher through a single test - the NQT - and your score there, not a separate application, decides whether you interview for the entry-level Ninja band, the higher-paid Digital band, or the top Prime band.
HR interview questions
TCS HR interview questions with sample answer frameworks - motivation, relocation, STAR stories, and culture-fit prompts.
TCS interview process at a glance
| Round | Duration | What they test |
|---|---|---|
| TCS NQT (Online Test) | ~180-190 min | Verbal, reasoning, numerical ability, programming logic (Foundation), and hands-on coding (Advanced) - score decides Ninja/Digital/Prime |
| Technical Interview | 20-45 min | DSA/coding, CS fundamentals, resume and project discussion |
| Managerial Interview | 15-30 min | Confidence, leadership, situational judgment |
| HR Interview | 10-20 min | Attitude, willingness to relocate/switch domains, offer discussion |
TCS NQT: quick answers
These answers are compiled from public candidate reports and prep guides, not from an official notice, and drives differ. The instruction screen of your own test is the final word.
| Question | Answer |
|---|---|
| How many questions and how long? | About 190 minutes in two parts. Foundation (Part A) has 65 questions in roughly 75 minutes: numerical ability, verbal ability and reasoning. Advanced (Part B) has about 17-18 items: advanced quant and reasoning plus 2-3 coding problems. |
| Does it have negative marking? | No. Most 2025-26 prep guides and candidate reports say a wrong answer and a skipped question both score zero, so attempt everything. Sections are timed and you usually cannot go back to a closed section. |
| Is there a sectional cutoff? | Yes, by most accounts. Prep guides describe per-section cutoffs rather than one aggregate, set fresh for each test cycle and not published. A weak section can sink a strong total. |
| How much is the cutoff? | Not published. Prep guides estimate roughly 55-65 percent overall for Ninja and 75-80 percent including Part B for Digital, but these are estimates. The fixed part is eligibility: 60 percent or 6.0 CGPA across 10th, 12th and graduation, no active backlogs, and a gap of at most 2 years. |
| Which platform is it on? | TCS iON. You register on the TCS NextStep portal, and the admit card tells you whether you sit it at a TCS iON centre or remotely; most recent cycles report centre-based tests. |
| Is there coding? | Yes, in the Advanced section. Reports describe 2-3 problems (one guide lists 3 problems in 90 minutes), scored per test case passed. Languages commonly listed are C, C++, Java and Python; some guides also list C# or Perl. |
| Do I have to attempt Part B? | Only if you want Digital or Prime. Clearing Foundation alone makes you eligible for Ninja interviews; Digital and Prime shortlists use the combined Foundation plus Advanced score. |
TCS interview questions by track
Your NQT score decides which band’s interview you get, and the depth changes with the band. These are questions candidates report on GeeksforGeeks, LeetCode Discuss and Glassdoor; they show the level, not a fixed list.
| Track | Reported questions and topics |
|---|---|
| Ninja | Write a simple program live (palindrome, prime check, Fibonacci, second largest element). OOPs pillars, abstract class vs interface. DBMS basics, normalization, TRUNCATE vs DELETE, a simple SQL query. Final-year project walkthrough. |
| Digital | Java or your main language in depth, driven by your projects. Array and string problems such as array rotation and longest substring with K distinct characters. SQL joins, ACID, OS basics. Time and space complexity of your solution. |
| Prime | Implement a data structure live (one June 2025 report: a doubly linked list, then a pattern-printing program). A light design question such as a library management system. Deeper review of an AI, ML or data project if your resume has one. |
Asked across every track: tell me about yourself, why TCS, whether you will relocate and take any technology or shift, and whether you will still join if offered a lower band than you hoped for.
TCS NQT (Online Test)
An adaptive-style test split into a Foundation section (verbal, reasoning, numerical ability, programming logic) and an Advanced section (hands-on coding). Clearing only Foundation caps you at Ninja; Advanced is mandatory if you want to be evaluated for Digital or Prime.
Common questions
- Numerical ability - time-speed-distance, percentages, data interpretation
- Verbal ability - reading comprehension, error spotting, sentence completion
- Reasoning ability - logical deductions, coding-decoding, syllogisms
- Programming logic MCQs plus 1-2 hands-on coding problems in the Advanced section
Technical Interview
Opens with your resume projects, then moves into coding and core CS fundamentals. Digital and Prime candidates tend to get longer, deeper interviews with an added system-design-style question.
Common questions
- Find the second largest element in an array / reverse the words in a string
- DBMS - normalization, ACID transactions, SQL query writing, TRUNCATE vs DELETE
- OOPs - four pillars, inheritance, polymorphism, abstract class vs interface
- C/C++ (when on resume) - malloc vs calloc, pointers, constructors/destructors
- Digital/Prime track: a light system-design question, e.g. design a library management system
- Time and space complexity of your coding solution
Round-by-round breakdowns are on the TCS interview experience page.
Managerial Interview
A shorter round focused on how you’d operate inside a large delivery team rather than raw technical depth - leadership, ambiguity, and teamwork scenarios.
Common questions
- Describe a time you took the lead on a project or team task
- How do you handle ambiguity or a last-minute change in your assignment?
- Give an example of resolving a disagreement within a team
- Walk me through a problem-solving scenario relevant to client delivery work
HR Interview
A short closing conversation on motivation, flexibility, and logistics rather than a deep behavioral round - some Ninja-track drives merge this straight into the managerial round.
Common questions
- Tell me about yourself and why TCS
- Are you comfortable being assigned to any technology, domain, or location TCS decides, rather than picking your own?
- Night shifts and early-morning client calls for global accounts
- Higher studies, online degrees, or MBA plans alongside ILP
- What are your career goals and expected joining timeline?
- Salary and offer discussion
Sample answer frameworks for each of these are on the TCS HR interview questions page.
Ninja vs Digital vs Prime: why your NQT score decides everything
Unlike companies that let you apply to a specific track, TCS assigns your band purely off NQT performance. Foundation-only clears go to Ninja; a higher combined Foundation+Advanced score is required for Digital; and only the strongest scorers (80+ percentile), often with something concrete to show on AI/data projects, get considered for Prime. Since the bands differ meaningfully in starting CTC (roughly Rs 3.5-3.9 LPA for Ninja versus Rs 9-11 LPA for Prime) and in how deep the technical interview goes, it’s worth treating the NQT’s Advanced/coding section as the highest-leverage part of the entire process rather than an afterthought after Foundation.
Common technical interview questions and answers
Q: How do you find the second largest element in an array?
Do it in a single pass with two variables, largest and secondLargest, both initialised to negative infinity. For each element, if it is greater than largest, push the old largest down into secondLargest and set largest to the new value; else if it is greater than secondLargest but not equal to largest, update secondLargest. That is O(n) time and O(1) space, and it beats the sort-then-take-the-second-last approach, which costs O(n log n). Mention the edge cases interviewers look for: arrays with fewer than two elements, and arrays where the maximum repeats, such as 5, 5, 3, where the answer should be 3.
Q: How do you reverse the words in a string?
The clean in-place approach has two steps: first reverse the entire character array, then reverse each individual word between its own boundaries. Starting from the input the sky is blue, reversing everything gives eulb si yks eht, and reversing each word gives blue is sky the. It runs in O(n) time and O(1) extra space if the string is mutable. The simpler answer is to split on whitespace, reverse the resulting list, and join with a single space, which is O(n) time but O(n) space; either is acceptable as long as you handle multiple spaces between words and leading or trailing spaces.
Q: What is normalization, and what are 1NF, 2NF, and 3NF?
Normalization organises tables to remove redundant data and the insert, update, and delete anomalies it causes. First normal form requires every column to hold a single atomic value with no repeating groups, so a Phones column holding two numbers must be split into separate rows. Second normal form requires 1NF plus no partial dependency, meaning no non-key column depends on only part of a composite primary key. Third normal form requires 2NF plus no transitive dependency, so in a table keyed by StudentID that stores DeptID and DeptName, DeptName depends on DeptID rather than on the key, and must move into its own Department table.
Q: Write a SQL query to find the second-highest salary in a table.
The most readable version uses ORDER BY with an offset: SELECT DISTINCT salary FROM employee ORDER BY salary DESC LIMIT 1 OFFSET 1; DISTINCT matters, because without it two employees on the top salary would make the query return the top salary again. A portable alternative is a correlated subquery: SELECT MAX(salary) FROM employee WHERE salary NOT IN (SELECT MAX(salary) FROM employee); The version interviewers like most generalises to the Nth highest: SELECT salary FROM (SELECT salary, DENSE_RANK() OVER (ORDER BY salary DESC) AS rnk FROM employee) t WHERE rnk = 2; since DENSE_RANK gives tied salaries the same rank.
Q: Explain INNER JOIN versus LEFT JOIN with an example.
An INNER JOIN returns only rows that have a match on both sides, while a LEFT JOIN returns every row from the left table and fills the right table’s columns with NULL where no match exists. Given an employees table and a departments table, SELECT e.name, d.dept_name FROM employees e INNER JOIN departments d ON e.dept_id = d.id; silently drops employees whose dept_id is NULL or points at a missing department. Swapping in LEFT JOIN keeps those employees with dept_name as NULL. A useful follow-up trick: adding WHERE d.id IS NULL after a LEFT JOIN gives exactly the unmatched left-side rows, which is the standard way to find orphan records.
Q: Explain inheritance and polymorphism with an example.
Inheritance lets a child class reuse and extend a parent class’s fields and methods, modelling an is-a relationship: a class Car extends Vehicle inherits start and stop while adding its own behaviour. Polymorphism means one interface with many forms. Compile-time polymorphism is method overloading, where several methods share a name but differ in parameter list, resolved by the compiler. Runtime polymorphism is method overriding, where a child redefines a parent method with the same signature and the JVM picks the child version based on the actual object, so Vehicle v = new Car(); v.start(); calls Car’s start. That is what lets you write code against the parent type and swap implementations without changing the caller.
Q: How do you calculate the time and space complexity of your solution?
Count how the number of basic operations grows with the input size n and keep only the dominant term, dropping constants: a single loop over n is O(n), a nested loop over the same array is O(n squared), and halving the search space each step, as binary search does, is O(log n). A loop containing a sort is O(n log n) per iteration, and sorting once before a linear scan gives O(n log n) overall because the sort dominates. Space complexity counts only the extra memory you allocate beyond the input, so a hash map holding up to n keys is O(n) while a fixed set of pointer variables is O(1); recursion also costs O(depth) for the call stack, which is why an in-place quicksort is still O(log n) space on average.
Q: How would you design a library management system?
Identify the entities first: Book (with a title, author, and ISBN), BookCopy (a physical copy with a barcode, since a library holds several copies of one title), Member, and Loan, which links a member to a copy with an issue date and a due date. The core relationships are one Book to many BookCopies and one Member to many Loans, so the database has a books table, a copies table with a foreign key to books, a members table, and a loans table with foreign keys to copies and members. Key operations are search by title or author (backed by an index), issue a copy if one is available, return a copy, and calculate a fine from the number of days past the due date. Adding reservations and a maximum-books-per-member rule is the usual follow-up on the Digital and Prime tracks.
Q: What are the four pillars of OOP?
Encapsulation bundles data and methods and hides internals behind access modifiers so callers use a public interface. Abstraction exposes only what matters - abstract classes and interfaces define contracts without forcing every detail on the user, like a car dashboard hiding the engine. Inheritance lets a child class reuse and extend a parent (Car extends Vehicle). Polymorphism is one interface, many implementations: compile-time via method overloading, runtime via overriding so Vehicle v = new Car(); v.start(); runs Car’s start. TCS panels often ask for a one-line example per pillar, not just definitions.
Q: What is ACID in DBMS?
Atomicity means the transaction is all-or-nothing - if one statement fails, the whole transaction rolls back. Consistency means constraints and business rules still hold after commit. Isolation means concurrent transactions do not read each other’s uncommitted work at the level the engine guarantees. Durability means once committed, data survives a crash via the write-ahead log. Follow-up: DELETE inside a transaction can roll back; TRUNCATE is DDL and typically cannot.
Q: What is the difference between malloc() and calloc() in C?
Both allocate heap memory and return a void * you cast. malloc(size) allocates size bytes without initializing them - contents are garbage until you write. calloc(n, size) allocates n × size bytes and zero-initializes every byte, which is safer for arrays and structs. calloc costs a little more because of zero-fill. Always check for NULL, free what you allocate, and avoid double-free. If C is on your resume, TCS interviewers often pair this with pointer basics.
Q: What is the difference between TRUNCATE, DELETE, and DROP in SQL?
DELETE is DML: removes rows matching a WHERE clause, can be rolled back inside a transaction, and fires triggers; without WHERE it deletes all rows but keeps the table. TRUNCATE is DDL: removes all rows quickly by deallocating pages, usually cannot be rolled back, resets identity seeds, and does not fire row-level DELETE triggers on most engines. DROP removes the entire table object including structure. Interviewers want you to say DELETE is row-wise and logged; TRUNCATE is faster bulk reset of data.
Q: Explain pointers in C with a simple example.
A pointer stores the address of another variable. int x = 10; int *p = &x; makes p hold x’s address; *p reads or writes x through the pointer. Passing int p to a function lets the callee modify the caller’s variable - classic swap uses pointers because C passes arguments by value. . TCS C questions often jump from this to NULL means no valid address; dereferencing NULL is undefined behaviour. Arrays decay to pointers to their first element, which is why arr[i] is (arr + i)malloc/free.
Q: Are you comfortable working night shifts at TCS?
Answer honestly. Many TCS accounts for US or UK clients use rotational or fixed night shifts for freshers. A strong answer: you understand global delivery, you can adjust sleep once you know the roster, and you will follow team norms. If you have a hard constraint, state it calmly early rather than agreeing in HR and refusing after joining. Managerial panels sometimes use extreme hypotheticals (4:30 a.m. starts) to test flexibility, not to assign that shift immediately.
Q: Do you plan higher studies while joining TCS as a fresher?
Be truthful. If you have no immediate plans, say you want to focus on TCS training and delivery first and may pursue certifications or part-time learning aligned with project work. If you are enrolled in an online degree, disclose it - Prime and HR panels have asked about conflicts with ILP hours. Saying you will leave for full-time MBA in six months is a red flag; saying you might do an employer-supported upskilling path after stabilizing on a project is safer when true.
Frequently asked questions about TCS interviews
Does the TCS NQT have negative marking?
No. Most 2025-26 prep guides and candidate reports say the NQT has no negative marking, so a wrong answer and a skipped question both score zero. Sections are timed separately, so pace each one rather than banking time.
What is the TCS NQT cutoff?
TCS does not publish one. Prep guides describe sectional cutoffs set fresh for each test cycle, with rough estimates of 55-65 percent overall for Ninja and 75-80 percent including the Advanced section for Digital. The fixed requirement is eligibility: 60 percent or 6.0 CGPA across 10th, 12th and graduation, with no active backlogs.
What is the TCS interview process for freshers?
TCS hires freshers through the TCS NQT (National Qualifier Test), a single entry point that feeds the Ninja, Digital, and Prime tracks. The process typically runs: 1. TCS NQT online test (~180-190 minutes, Foundation + Advanced sections) covering verbal, reasoning, numerical ability, programming logic, and hands-on coding. 2. Technical Interview - DSA/coding questions plus a discussion of your projects. 3. Managerial Interview - checks confidence, leadership, and how you handle situational questions. 4. HR Interview - attitude, willingness to relocate, and offer discussion.
What is the TCS NQT and how is it structured?
The TCS NQT runs about 190 minutes across a Foundation section (65 questions - verbal, reasoning, numerical ability, programming logic) and an Advanced section (17 questions/problems - hands-on coding). Part B (Advanced) is mandatory if you want to be considered for the Digital or Prime bands; scoring only on Part A caps you at Ninja. There’s no negative marking.
What is the difference between TCS Ninja, Digital, and Prime?
All three run through the same NQT, but your score decides the band. Ninja needs only the Foundation section cleared (roughly 50-60 percentile, minimum 6.0 CGPA) and starts around Rs 3.5-3.9 LPA. Digital needs a higher NQT score (roughly 65-75 percentile) on both Foundation and Advanced sections, plus a tougher technical interview, and starts around Rs 7-7.5 LPA. Prime needs the highest score (80+ percentile), an extended technical round, and often expects you to show an AI/data-related project; it starts around Rs 9-11 LPA.
How many rounds are there in the TCS interview?
Typically four stages: the NQT online test, a Technical Interview, a Managerial Interview, and an HR Interview. Some campus drives combine the managerial and HR rounds into one conversation, especially for the Ninja track.
What questions are asked in the TCS technical interview?
Expect coding questions (array/string problems like finding the second largest element or reversing words in a string), core CS fundamentals (DBMS normalization and SQL queries, OOPs concepts like inheritance and polymorphism), and a detailed walkthrough of your resume projects. Digital and Prime candidates often get an added system-design style question, such as designing a library management system.
How should I prepare for TCS interviews?
Practice the NQT pattern (aptitude plus basic-to-medium DSA coding) under time pressure, revise core CS fundamentals (OOP, DBMS, OS) for the technical round, and be ready to explain your willingness to work in any technology, domain, or location TCS assigns - that flexibility is something TCS interviewers explicitly probe for given how broadly they staff freshers across projects. If you’re targeting Digital or Prime, push your NQT score higher since it directly decides which band’s interview you get.
Will TCS ask me to accept Ninja, testing, or mainframe work?
Often yes in managerial or HR. NQT score decides the band; many candidates who hoped for Digital are asked whether they will still join on Ninja. Panels also probe assignment to testing, mainframe, or stacks not listed on the resume, because fresher staffing follows client demand. A clear “yes, I will learn the assigned stack” lands better than “only Java Digital or I walk away,” unless you are prepared to decline the offer.
Is the TCS HR round only a formality?
No. Communication, relocation, night-shift comfort, service-agreement willingness, higher-studies plans, and role-band flexibility are real filters. Candidate reports show rejects for arrogance, one-word answers after a strong technical round, or refusing flexibility after agreeing on the application form.
How to prepare for TCS interviews
- Loop map: TCS NQT (Online Test); Technical Interview; Managerial Interview; HR Interview. Confirm timings from the drive mail.
- Technical depth: Drill the Q&A section until answers are spoken, not read. Know every resume project cold.
- Experiences: Study round-wise notes on the interview experience page - real prompts beat generic lists.
- HR: Three STAR stories + a specific “Why TCS?” on the HR page.
A practical TCS prep plan
Use this as a default four-week loop before a TCS drive. Adjust to your invite timeline.
- Week 1: Oa pattern first: sit one untimed paper, then redo it under the real clock. Open the TCS previous-year sets on this site and mark which sections ate your time. Write the timing on a sticky note. That number is more useful than a 200-problem LeetCode streak you never timed.
- Week 2: Most TCS drives fail people on the first timed paper or OA. Do three timed sits this week. After each one, log every miss in a two-column note: topic and why (slow, wrong formula, bad edge case, panic). The next sit should only add problems from that log.
- Week 3: Technical interviews at TCS usually want a clean project story, one or two CS fundamentals, and (if the process has it) a behavioral or values round. Write STAR stories on paper, not in your head. Practise “Why TCS?” with one concrete product, lab, or business line - not a slogan.
- Week 4: Star stories + one project walkthrough recorded on your phone. If you still have energy, redo only the questions you failed in week 2.
10-day crash version: Days 1-4 timed DSA, days 5-7 resume projects + CS fundamentals, days 8-9 mock interviews out loud, day 10 HR STAR stories on the HR page.
Compensation notes
Candidate-reported fresher/early-career packages for TCS often cite Ninja ~₹3.4-3.6 LPA. Treat forum numbers as ranges, not guarantees - confirm the written offer letter for your team and location.
Sources
Interview process details and sample questions on this site are editorially organized from public candidate reports and hiring write-ups, with round structure, prep notes, and company-specific framing added by our team. For round-by-round stories, see the TCS interview experience page. For OA papers and coding drills, use TCS on placementpapers.app. NQT quick answers and track-wise questions draw on placementpreparation.io’s TCS NQT pattern page, FACE Prep’s TCS guides, GeeksforGeeks and LeetCode Discuss interview experiences, and Glassdoor candidate reviews.