TCS

2025 NQT

Display Mode

Jump to Section

Practice Questions7

Export

PDF

Word

Back to TCS

TCS 2025-nqt

1 sections, 7 questions

Practice Questions

7 questions

Question 1

Simple Interest

Problem

A sum of money amounts to ₹9800 after 5 years and ₹12005 after 8 years at the same rate of simple interest. Find the rate of interest per annum.

Solution

Let Principal = P, Rate = R%

After 5 years: P + (P × R × 5)/100 = 9800
After 8 years: P + (P × R × 8)/100 = 12005

Subtracting the equations:
(P × R × 3)/100 = 12005 - 9800 = 2205
P × R = 73500

From first equation: P + (73500 × 5)/100 = 9800
P + 3675 = 9800
P = 6125

Rate R = 73500/6125 = 12% per annum

Question 2

Mixtures and Alligations

Problem

A mixture contains milk and water in the ratio 5:3. If 10 liters of water is added, the ratio becomes 5:4. Find the quantity of milk in the mixture.

Solution

Let milk = 5x, water = 3x

After adding 10 liters water:
Milk = 5x, Water = 3x + 10

New ratio: 5x/(3x + 10) = 5/4
Cross-multiply: 20x = 5(3x + 10)
20x = 15x + 50
5x = 50
x = 10

Quantity of milk = 5x = 5 × 10 = 50 liters

Question 3

Data Interpretation

Problem

The following table shows sales (in crores) of a company over 5 years. Find the average annual growth rate.

Year	Sales
2020	100
2021	120
2022	150
2023	180
2024	200

Solution

Total growth = 200 - 100 = 100 crores
Number of years = 4 (from 2020 to 2024)
Average annual growth = 100/4 = 25 crores per year

Question 4

Blood Relations

Problem

Pointing to a man, a woman said, "His mother is the only daughter of my mother." How is the woman related to the man?

Solution

Let's break down the statement:

"His mother" = the man's mother
"only daughter of my mother" = the woman herself (since she's the only daughter)

Therefore: The man's mother = the woman
The woman is the mother of the man.

Question 5

Series Completion

Problem

Find the next number in the series: 2, 6, 12, 20, 30, ?

Solution

Pattern analysis:

2 = 1 × 2
6 = 2 × 3
12 = 3 × 4
20 = 4 × 5
30 = 5 × 6

Next term = 6 × 7 = 42

Question 6

Array Rotation

Problem

Rotate an array to the right by k positions.

Example:

Input: nums = [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]

Solution

Use reversal algorithm:

Reverse entire array
Reverse first k elements
Reverse remaining elements

Code

Java

public void rotate(int[] nums, int k) {
    int n = nums.length;
    k = k % n;
    reverse(nums, 0, n - 1);
    reverse(nums, 0, k - 1);
    reverse(nums, k, n - 1);
}

private void reverse(int[] nums, int start, int end) {
    while (start < end) {
        int temp = nums[start];
        nums[start] = nums[end];
        nums[end] = temp;
        start++;
        end--;
    }
}

Python

def rotate(nums, k):
    k = k % len(nums)
    nums.reverse()
    nums[:k] = reversed(nums[:k])
    nums[k:] = reversed(nums[k:])

Time: O(n)Space: O(1)

Question 7

Palindrome Check

Problem

Check if a number is palindrome.

Example:

Input: 121
Output: true

Solution

Reverse the number and compare with original.

Code

Java

public boolean isPalindrome(int x) {
    if (x < 0) return false;
    int original = x;
    int reversed = 0;
    while (x > 0) {
        reversed = reversed * 10 + x % 10;
        x /= 10;
    }
    return original == reversed;
}

Python

def is_palindrome(x):
    if x < 0:
        return False
    original = x
    reversed_num = 0
    while x > 0:
        reversed_num = reversed_num * 10 + x % 10
        x //= 10
    return original == reversed_num

Time: O(log n)Space: O(1)

Year

Sales

2020

100

2021

120

2022

150

2023

180

2024

200

public void rotate(int[] nums, int k) { int n = nums.length; k = k % n; reverse(nums, 0, n - 1); reverse(nums, 0, k - 1); reverse(nums, k, n - 1); } private void reverse(int[] nums, int start, int end) { while (start < end) { int temp = nums[start]; nums[start] = nums[end]; nums[end] = temp; start++; end--; } }

public boolean isPalindrome(int x) { if (x < 0) return false; int original = x; int reversed = 0; while (x > 0) { reversed = reversed * 10 + x % 10; x /= 10; } return original == reversed; }

def is_palindrome(x): if x < 0: return False original = x reversed_num = 0 while x > 0: reversed_num = reversed_num * 10 + x % 10 x //= 10 return original == reversed_num

TCS

Display Mode

Jump to Section

Other Content

Export

TCS 2025-nqt

Practice Questions

Simple Interest

Problem

Solution

Mixtures and Alligations

Problem

Solution

Data Interpretation

Problem

Solution

Blood Relations

Problem

Solution

Series Completion

Problem

Solution

Array Rotation

Problem

Solution

Code

Palindrome Check

Problem

Solution

Code

TCS

Display Mode

Jump to Section

Other Content

Export

TCS 2025-nqt

Practice Questions

Simple Interest

Problem

Solution

Mixtures and Alligations

Problem

Solution

Data Interpretation

Problem

Solution

Blood Relations

Problem

Solution

Series Completion

Problem

Solution

Array Rotation

Problem

Solution

Code

Palindrome Check

Problem

Solution

Code