Accenture

2024 NLT

Display Mode

Jump to Section

Practice Questions24

Export

PDF

Word

Back to Accenture

Accenture 2024-nlt

1 sections, 24 questions

Practice Questions

24 questions

Question 1

Profit & Loss

Problem

A shopkeeper marks an item 30% above cost price and gives 10% discount. Find his profit percentage.

Solution

Let CP = ₹100
Marked Price = ₹130
Discount = 10% of ₹130 = ₹13
Selling Price = ₹130 - ₹13 = ₹117
Profit = ₹117 - ₹100 = ₹17
Profit % = (17/100) × 100 = 17%

Question 2

Time & Work

Problem

A and B can complete a work in 20 days and 30 days respectively. They work together for 6 days, then A leaves. In how many days will B complete the remaining work?

Solution

A's 1 day work = 1/20
B's 1 day work = 1/30
Together in 1 day = 1/20 + 1/30 = 5/60 = 1/12
Work done in 6 days = 6 × 1/12 = 1/2
Remaining work = 1 - 1/2 = 1/2
B will complete in = (1/2) / (1/30) = 15 days

Question 3

Percentage

Problem

If 20% of a number is 60, what is 35% of that number?

Solution

Let the number be x
20% of x = 60
x = 60 × 100/20 = 300
35% of 300 = 35/100 × 300 = 105

Question 4

Simple Interest

Problem

A sum of money becomes ₹2,400 in 2 years and ₹3,200 in 4 years at simple interest. Find the principal amount.

Solution

Interest for 2 years = 3200 - 2400 = ₹800
Interest per year = ₹400
Interest for 2 years = ₹800
Principal = 2400 - 800 = ₹1,600

Question 5

Compound Interest

Problem

Find compound interest on ₹10,000 for 2 years at 10% per annum, compounded annually.

Solution

Amount = P(1 + R/100)^n
Amount = 10000(1 + 10/100)^2 = 10000 × 1.1^2 = 10000 × 1.21 = ₹12,100
CI = Amount - Principal = 12100 - 10000 = ₹2,100

Question 6

Time, Distance & Speed

Problem

A train 150 meters long passes a platform 200 meters long in 20 seconds. Find the speed of the train in km/hr.

Solution

Total distance = 150 + 200 = 350 meters
Time = 20 seconds
Speed = 350/20 = 17.5 m/s
Speed in km/hr = 17.5 × 18/5 = 63 km/hr

Question 7

Mixtures & Alligations

Problem

In what ratio should water be mixed with milk costing ₹12 per liter to get a mixture worth ₹8 per liter?

Solution

Using alligation:

Water (₹0)    Milk (₹12)
       \      /
        \    /
         \  /
         ₹8

Ratio = (12-8):(8-0) = 4:8 = 1:2

Question 8

Number Series

Problem

Find the next number: 2, 5, 11, 23, 47, ?

Solution

Pattern: Each number = previous × 2 + 1
2×2+1=5, 5×2+1=11, 11×2+1=23, 23×2+1=47
Next: 47×2+1 = 95

Question 9

Letter Series

Problem

Find the next letter: A, D, G, J, ?

Solution

Pattern: A(+3)→D(+3)→G(+3)→J(+3)→M
Next letter = M

Question 10

Coding-Decoding

Problem

If "TECHNOLOGY" is coded as "VGEPQMQNA", how is "COMPUTER" coded?

Solution

Pattern: Each letter shifted by +2
T→V, E→G, C→E, H→J, N→P, O→Q, L→N, O→Q, G→I, Y→A
COMPUTER: C→E, O→Q, M→O, P→R, U→W, T→V, E→G, R→T

Question 11

Syllogism

Problem

Statements: 1. All green are blue, 2. All blue are white.

Conclusions:
I) Some blue are green,
II) Some white are green,
III) Some green are white,
IV) All white are blue.

Solution

From "All green are blue": Some blue are green (I follows)
Combined: All green are white, so Some white are green (II follows) and Some green are white (III follows)
IV does not follow

Question 12

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

Only daughter of woman's mother = woman herself

So woman is the mother of the man

Question 13

Reading Comprehension

Problem

Read the passage and answer: "Artificial Intelligence has revolutionized various industries. Machine learning algorithms can now process vast amounts of data to identify patterns and make predictions. However, concerns about job displacement and ethical implications remain significant challenges." According to the passage, what are the main concerns about AI?

Answer: Job displacement and ethical implications

Question 14

Grammar - Subject-Verb Agreement

Problem

Choose the correct sentence:

a) Neither the students nor the teacher were present
b) Neither the students nor the teacher was present
c) Neither the students or the teacher was present

Solution

With "neither…nor", the verb agrees with the subject closer to it. "Teacher" is singular, so "was" is correct.

Question 15

Vocabulary - Synonyms

Problem

Find the synonym of "ABUNDANT":

a) Scarce!
b) Plentiful
c) Limited
d) Rare

Solution

Abundant means existing in large quantities, so "Plentiful" is the synonym.

Question 16

Vocabulary - Antonyms

Problem

Find the antonym of "TRANSPARENT":

a) Clear
b) Opaque
c) Visible
d) Bright

Solution

Transparent means see-through, so "Opaque" (not see-through) is the antonym.

Question 17

C Programming Output

Problem

What is the output?

int main() {
    int x = 5;
    printf("%d", x++ + ++x);
    return 0;
}

Solution

Note: This exhibits undefined behavior due to sequence point violations. However, in many compilers:
x++ uses 5, then x becomes 6
++x makes x = 7, uses value 7
Output: 5 + 7 = 12

Question 18

Loop Output

Problem

What is the output?

int main() {
    int i;
    for(i=0; i<5; i++) {
        if(i == 3) continue;
        printf("%d ", i);
    }
    return 0;
}

Solution

Loop executes: i=0 prints 0, i=1 prints 1, i=2 prints 2, i=3 skips (continue), i=4 prints 4

Question 19

Recursion

Problem

What is the output?

int func(int n) {
    if(n <= 1) return 1;
    return n * func(n-1);
}

printf("%d", func(5));

Solution

This calculates factorial:
func(5) = 5 × 4 × 3 × 2 × 1 = 120

Question 20

Second Largest Element

Problem

Find the second largest element in an array.

Solution

Track first and second largest while iterating.

Code

int secondLargest(int arr[], int n) {
    int first = INT_MIN, second = INT_MIN;
    for (int i = 0; i < n; i++) {
        if (arr[i] > first) {
            second = first;
            first = arr[i];
        } else if (arr[i] > second && arr[i] != first) {
            second = arr[i];
        }
    }
    return second;
}

Java

public int secondLargest(int[] arr) {
    int first = Integer.MIN_VALUE;
    int second = Integer.MIN_VALUE;
    for (int num : arr) {
        if (num > first) {
            second = first;
            first = num;
        } else if (num > second && num != first) {
            second = num;
        }
    }
    return second;
}

Python

def second_largest(arr):
    first = second = float('-inf')
    for num in arr:
        if num > first:
            second = first
            first = num
        elif num > second and num != first:
            second = num
    return second

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

Question 21

Palindrome Check

Problem

Check if a string is a palindrome.

Solution

Compare characters from both ends.

Code

#include <string.h>
#include <ctype.h>

int isPalindrome(char str[]) {
    int left = 0, right = strlen(str) - 1;
    while (left < right) {
        if (tolower(str[left]) != tolower(str[right]))
            return 0;
        left++;
        right--;
    }
    return 1;
}

Python

def is_palindrome(s):
    s = s.lower()
    left, right = 0, len(s) - 1
    while left < right:
        if s[left] != s[right]:
            return False
        left += 1
        right -= 1
    return True

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

Question 22

Prime Number Check

Problem

Check if a number is prime.

Solution

Check divisibility up to sqrt(n).

Code

#include <math.h>

int isPrime(int n) {
    if (n <= 1) return 0;
    if (n <= 3) return 1;
    if (n % 2 == 0 || n % 3 == 0) return 0;
    for (int i = 5; i * i <= n; i += 6) {
        if (n % i == 0 || n % (i + 2) == 0)
            return 0;
    }
    return 1;
}

Java

public boolean isPrime(int n) {
    if (n <= 1) return false;
    if (n <= 3) return true;
    if (n % 2 == 0 || n % 3 == 0) return false;
    for (int i = 5; i * i <= n; i += 6) {
        if (n % i == 0 || n % (i + 2) == 0)
            return false;
    }
    return true;
}

Python

def is_prime(n):
    if n <= 1:
        return False
    if n <= 3:
        return True
    if n % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    while i * i <= n:
        if n % i == 0 or n % (i + 2) == 0:
            return False
        i += 6
    return True

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

Question 23

Fibonacci Series

Problem

Print first n Fibonacci numbers.

Solution

Use iterative approach with two variables.

Code

void fibonacci(int n) {
    if (n <= 0) return;
    int a = 0, b = 1;
    printf("%d ", a);
    if (n > 1) printf("%d ", b);
    for (int i = 2; i < n; i++) {
        int c = a + b;
        printf("%d ", c);
        a = b;
        b = c;
    }
}

Python

def fibonacci(n):
    if n <= 0:
        return
    a, b = 0, 1
    print(a, end=" ")
    if n > 1:
        print(b, end=" ")
    for i in range(2, n):
        c = a + b
        print(c, end=" ")
        a, b = b, c

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

Question 24

Two Sum Problem

Problem

Find two numbers that add up to target.

Solution

Use hash map for O(n) solution.

Code

Java

public int[] twoSum(int[] arr, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < arr.length; i++) {
        int complement = target - arr[i];
        if (map.containsKey(complement)) {
            return new int[]{map.get(complement), i};
        }
        map.put(arr[i], i);
    }
    return new int[]{};
}

Python

def two_sum(arr, target):
    seen = {}
    for i, num in enumerate(arr):
        complement = target - num
        if complement in seen:
            return [seen[complement], i]
        seen[num] = i
    return []

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

int secondLargest(int arr[], int n) { int first = INT_MIN, second = INT_MIN; for (int i = 0; i < n; i++) { if (arr[i] > first) { second = first; first = arr[i]; } else if (arr[i] > second && arr[i] != first) { second = arr[i]; } } return second; }

public int secondLargest(int[] arr) { int first = Integer.MIN_VALUE; int second = Integer.MIN_VALUE; for (int num : arr) { if (num > first) { second = first; first = num; } else if (num > second && num != first) { second = num; } } return second; }

def second_largest(arr): first = second = float('-inf') for num in arr: if num > first: second = first first = num elif num > second and num != first: second = num return second

#include <string.h> #include <ctype.h> int isPalindrome(char str[]) { int left = 0, right = strlen(str) - 1; while (left < right) { if (tolower(str[left]) != tolower(str[right])) return 0; left++; right--; } return 1; }

def is_palindrome(s): s = s.lower() left, right = 0, len(s) - 1 while left < right: if s[left] != s[right]: return False left += 1 right -= 1 return True

#include <math.h> int isPrime(int n) { if (n <= 1) return 0; if (n <= 3) return 1; if (n % 2 == 0 || n % 3 == 0) return 0; for (int i = 5; i * i <= n; i += 6) { if (n % i == 0 || n % (i + 2) == 0) return 0; } return 1; }

public boolean isPrime(int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (int i = 5; i * i <= n; i += 6) { if (n % i == 0 || n % (i + 2) == 0) return false; } return true; }

def is_prime(n): if n <= 1: return False if n <= 3: return True if n % 2 == 0 or n % 3 == 0: return False i = 5 while i * i <= n: if n % i == 0 or n % (i + 2) == 0: return False i += 6 return True

void fibonacci(int n) { if (n <= 0) return; int a = 0, b = 1; printf("%d ", a); if (n > 1) printf("%d ", b); for (int i = 2; i < n; i++) { int c = a + b; printf("%d ", c); a = b; b = c; } }

def fibonacci(n): if n <= 0: return a, b = 0, 1 print(a, end=" ") if n > 1: print(b, end=" ") for i in range(2, n): c = a + b print(c, end=" ") a, b = b, c

public int[] twoSum(int[] arr, int target) { Map<Integer, Integer> map = new HashMap<>(); for (int i = 0; i < arr.length; i++) { int complement = target - arr[i]; if (map.containsKey(complement)) { return new int[]{map.get(complement), i}; } map.put(arr[i], i); } return new int[]{}; }

def two_sum(arr, target): seen = {} for i, num in enumerate(arr): complement = target - num if complement in seen: return [seen[complement], i] seen[num] = i return []

Accenture

Display Mode

Jump to Section

Other Content

Export

Accenture 2024-nlt

Practice Questions

Profit & Loss

Problem

Solution

Time & Work

Problem

Solution

Percentage

Problem

Solution

Simple Interest

Problem

Solution

Compound Interest

Problem

Solution

Time, Distance & Speed

Problem

Solution

Mixtures & Alligations

Problem

Solution

Number Series

Problem

Solution

Letter Series

Problem

Solution

Coding-Decoding

Problem

Solution

Syllogism

Problem

Solution

Blood Relations

Problem

Solution

Reading Comprehension

Problem

Grammar - Subject-Verb Agreement

Problem

Solution

Vocabulary - Synonyms

Problem

Solution

Vocabulary - Antonyms

Problem

Solution

C Programming Output

Problem

Solution

Loop Output

Problem

Solution

Recursion

Problem

Solution

Second Largest Element

Problem

Solution

Code

Palindrome Check

Problem

Solution

Code

Prime Number Check

Problem

Solution

Code

Fibonacci Series

Problem

Solution

Code

Two Sum Problem