Boost your TCS NQT preparation with the previous year's papers. Get free PDFs and insights into the question pattern, key topics, and MCQs. Perfect for freshers aiming to ace the test.

7 mins read

TCS NQT Previous Year Papers: Download PDFs and Get Top 5 MCQs

The TCS National Qualifier Test (NQT) is a gateway for freshers aspiring to kickstart their careers in one of India's leading IT firms, Tata Consultancy Services (TCS). A systematic approach to preparing for TCS NQT includes practicing question papers from the previous year, which provide insights into the exam pattern, difficulty level, and key topics. This article delves into TCS NQT's previous year's papers, guiding freshers on effective preparation strategies.

Understanding TCS NQT Previous Year's Papers

As a fresher, understanding the TCS NQT's previous year's papers is indispensable for you to ace the test. Let us look at how you can start your familiarization with the previous year's papers:

Understand the Exam Pattern: Familiarize yourself with the distribution of questions across sections like verbal ability, logical reasoning, and quantitative aptitude.
Identifying Frequently Asked Topics: Pinpoint commonly recurring questions and topics for targeted preparation.
Time Management Practice: Solve questions within the given timeframe to improve speed and accuracy.
Building Confidence: Gain an edge by practising real exam-like scenarios.

TCS NQT Latest Exam Pattern

The TCS NQT is structured to assess candidates across several domains. The exam comprises the following sections:

Numerical Ability: Questions to be answered in 25 minutes.

Logical Reasoning: Questions to be answered in 25 minutes.

Verbal Ability: Questions to be answered in 25 minutes.

Advanced Quantitative & Reasoning Ability: Questions to be answered in 25 minutes.

Advanced Coding: Coding problems to be solved in 90 minutes.

Download PDFs of TCS NQT Previous Year Sample Papers

Verbal Ability Test

Practicing sample papers from previous years for the Verbal Ability Test helps candidates improve their grammar, vocabulary, and comprehension skills. Understanding the question patterns allows for better time management and accuracy in solving sentence correction, reading comprehension, and verbal reasoning questions.

Click the link to download the PDF of TCS NQT Verbal Ability Test Set 1

Click the link to download the PDF of TCS NQT Verbal Ability Test Set 2

Reasoning Ability Test

The Reasoning Ability Test evaluates logical thinking and problem-solving skills. Solving past papers helps candidates identify frequently asked question types, such as puzzles, coding-decoding, and syllogisms. Regular practice enhances logical reasoning speed and accuracy, which is crucial for success in this section.

Click the link to download the PDF of TCS NQT Reasoning Ability Test

Numerical Ability Test

The Numerical Ability Test assesses quantitative aptitude, including topics like arithmetic, algebra, data interpretation, and number series. Going through previous years' sample papers improves calculation speed, strengthens conceptual understanding, and helps candidates recognize common question trends.

Click the link to download the PDF of TCS NQT Numerical Ability Test

Coding Test

For Coding Test sample questions, refer to the problem statement in the selected MCQs for the TCS NQT section below. Practicing these questions helps candidates understand the coding logic, syntax, and problem-solving approaches needed for the exam.

Related TCS NQT Resources for 2025

In addition to reviewing TCS NQT previous years' papers, it's essential to explore a variety of resources to enhance your knowledge and improve your preparation. Below are some relevant and helpful articles to assist you in getting ready for the TCS NQT exam:

TCS NQT Question Distribution Pattern

It's essential to note that the questions distribution pattern may undergo periodic updates; therefore, candidates are advised to refer to the official TCS recruitment portal for the most current information.

Section	Key Topics	Weightage
*Verbal Ability*	Synonyms, Antonyms, Reading Comprehension	20%
*Reasoning Ability*	Puzzles, Data Interpretation, Syllogisms (Click here to explore aptitude mock tests tailored for placement exams, designed to help you shine in any corporate recruitment process.)	30%
*Quantitative*	Arithmetic, Algebra, Geometry	30%
*Coding*	Basic programming, Problem-solving (Are you looking for coding assessment questions related to job placement? Click here to access coding practice sessions from moderate to challenging levels.)	20%

Top 5 MCQs with Answers for TCS NQT 2025

Click here to view quiz

Explanation: Using the compound interest formula: A=[P×{(1+r)^t}], where A=2P,t=5. 2= {(1+r)^5} Approximation yields 𝑟 ≈ 0.1487 or 14.87%, rounded to 15%.

Click here to view quiz

Explanation: Total balls = 4+3+5=12; Balls that are not red = 3+5=8

Probability = total outcomes/favourable outcomes= 8/12 = 2/3

Click here to view quiz

Explanation: Karan is Ritu’s son, making him Akshita’s brother. His wife would, therefore, be Akshita’s sister-in-law.

Click here to view quiz

Explanation: JACK = 224824 = 22
MARK = 2843824 = 31
NATE = 3044212 = 16
ERIC = 1238208 = 24

Problem Statement

Luke has a bookshelf with n books, each with height aia_iai. He recently bought a new shelf to keep some of his books since the first one was almost full. To add books to his new shelf:

He walks from left to right, deciding for each book whether to leave it or place it on the new shelf. Books on the new shelf must be in strictly increasing order of height.

Your task is to find the maximum number of books Luke can place on his new shelf in increasing order of height.

Input Format

The first line of the input contains a single integer n – the number of books.

The second line of the input contains n space-seperated integers a1, a2, …, an – the height of the books where ai represents the height of the ith book from the left.

Output Format

Print a single integer, the maximum number of books he can place on the new shelf satisfying the given conditions.

Constraints

1 <= n <= 104

0 <= ai <= 108

Solution Python

# Enter your code here. Read input from STDIN. Print output to STDOUT
import random
def lis(arr):
    n = len(arr)

    # Declare the list (array) for LIS and
    # initialize LIS values for all indexes
    lis = [1]*n

    # Compute optimized LIS values in bottom up manner
    for i in range(1, n):
        for j in range(0, i):
            if arr[i] > arr[j]:
                lis[i] = max(lis[i], lis[j]+1)

    # Return the maximum of all LIS values
    return max(lis)


# Driver program to test above function
if __name__ == '__main__':
    n = int(input())
    arr = list(map(int, input().split(' ')))
    print(lis(arr))

Solution Java

function processData(input) {
    const lines = input.trim().split('\n');
    const n = parseInt(lines[0]);
    const heights = lines[1].split(' ').map(Number);
    const dp = new Array(n).fill(1);
    for (let i = 1; i < n; i++) {
        for (let j = 0; j < i; j++) {
            if (heights[i] > heights[j]) {
                dp[i] = Math.max(dp[i], dp[j] + 1);
            }
        }
    }
    const maxBooks = Math.max(...dp);
    console.log(maxBooks);
}

process.stdin.resume();
process.stdin.setEncoding("ascii");
let _input = "";
process.stdin.on("data", function (input) {
    _input += input;
});

process.stdin.on("end", function () {
   processData(_input);
});

Solution C++

#include <bits/stdc++.h>
using namespace std;


int main() {

    int n;
    cin>>n;

    vector<int> a;

    for(int i=0;i<n;i++){

        int x;
        cin>>x;

        auto it=lower_bound(a.begin(),a.end(),x);

        if(it==a.end()){
            a.push_back(x);
        }else{
            a[it-a.begin()]=x;
        }

    }

    cout<<a.size()<<endl;

    return 0;
}

Problem Statement

Team A has set a target of N-1 runs. Team B's goal is to score exactly N-1 runs to win. You are given an array of length N, where each element represents the maximum number of runs Team B can score on that particular ball. Team B will play one ball at a time and can score anywhere between 0 and the value given in the array for that ball.

The total number of balls Team B plays will equal the total number of runs they score. Starting from the first ball (index 0), your task is to determine if Team B can score exactly N-1 runs by selecting appropriate runs from each ball. You need to return true if Team B can score exactly N-1 runs or false if it is not possible.

Input Format

The first line of input should be a single integer N representing the length of the array.

The second line of input should contain N space-separated integer a1, a2, a3.... aN where ai value represents the maximum run team B can score on ith ball.

Output Format

Output a single Boolean value (true or false):

true: If it's possible for Team B to score exactly N-1 runs.

false: If it's not possible to reach the target.

Constraints

1 <= arr.length <= 10^5

0 <= arr[i] <= 10^5

Solution Python

# Enter your code here. Read input from STDIN. Print output to STDOUT
N = int(input())
arr = list(map(int, input().split()))
max_reach = 0

for i in range(N):
    if i > max_reach:
        print('false')
        exit()
    max_reach = max(max_reach, i + arr[i])
    if max_reach >= N - 1:
        print('true')
        exit()

print('false')

Solution C++

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

bool cricketMatch(){
    int n;
    cin >> n;
    vector<int> runs;
    for(int i = 0; i < n; i++){
        int x;
        cin >> x;
        runs.push_back(x);
    }
    int reachable = 0;
    for(int i = 0; i < n; i++){
        if(i > reachable){
            return false;
        }
        reachable = max(reachable, i + runs[i]);
    }
    return (reachable >= n-1);
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    if(cricketMatch()){
        cout << "true" << endl;
    }
    else{
        cout << "false" << endl;
    }
    return 0;
}

Solution Java

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int [] run = new int [n];
        for(int i=0; i<n;i++){
            run[i]=sc.nextInt();
        }
        boolean [] dp = new boolean[n];
        dp[n-1]=true;
        solution(n,run,dp);
        System.out.print(dp[0]);
    }
    public static void solution (int n , int run[],boolean[] dp){
        for(int i=n-2;i>=0;i--){
            if(run[i]!=0){
                for(int j=1;j<=run[i];j++){
                    if(i+j<n){
                        if(dp[i+j]){
                            dp[i]=true;
                            break;
                        }
                    }
                }
            }
        }
        return ;
    }
}

Conclusion

Preparing for TCS NQT requires a focused and strategic approach. Previous years' papers act as a bridge between theoretical knowledge and practical application, helping aspirants prepare effectively. By leveraging these papers, along with mock tests and targeted preparation, you can enhance your chances of acing the exam. Remember, consistent practice and time management are the keys to success.