EXL 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
EXL Placement Papers 2024
Overview
This page collects EXL placement papers from 2024 with practice questions, worked solutions, and the exam pattern students reported that cycle. Use it when you want drive history: what the first round looked like, which topics repeated, and how to approach solutions. Work the sets below under a timer, then compare with newer material so your prep matches both established EXL patterns and recent shifts.
Download / jump links
EXL 2024 coding
DSA practice aligned to EXL online assessments
EXL interview experience
Round structure and tips from student reports
EXL prep guide
Study plan and weekly schedule
EXL Aptitude Mock Quiz
Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.
Questions15
Time10 min
Reasoning
A walks 10m North, turns right walks 5m, turns right walks 10m. Direction from start?
Correct answer: East (5m east of starting point)
Verbal
Find synonym of "Enormous"
Correct answer: Huge
Verbal
The idiom "once in a blue moon" means:
It means something that happens very rarely.
Verbal
Antonym of "Optimistic":
Optimistic ↔ pessimistic.
Reasoning
Find the next number: 8, 6, 9, 7, 10, ?
−2,+3 alternating → 10-2=8 → 8.
Quantitative
A man buys an article for ₹800 and sells it at 25% profit. Selling price is:
SP = 800 × 1.25 = ₹1,000.
Quantitative
A is twice as old as B. 10 years ago, A was 4 times as old as B. Find the present age of A.
Correct answer: 30 years
Reasoning
Problem: What is the value of x? Statement 1: x² = 16 Statement 2: x > 0
From statement 1: x = 4 or -4 From statement 2: x > 0 Combining both: x = 4
Quantitative
Find x: 3x + 7 = 22
3x = 15 → x = 5.
Reasoning
Number Series - 37, 47, 58, ?, 79, 95
Correct answer: 70
Reasoning
All pens are books. Some books are papers. Conclusion: Some pens are papers.
No definite overlap between pens and papers.
Quantitative
If the probability of an event occurring is 0.3, what is the probability of it not occurring?
P(not occurring) = 1 - P(occurring) = 1 - 0.3 = 0.7
Quantitative
A person walks 5 km North, then 3 km East, then 2 km South. How far is he from starting point?
Correct answer: 3√2 km
Verbal
Antonym of "Permanent":
Permanent ↔ temporary/brief.
Quantitative
The price of a product is increased by 25%. By what percentage should the consumption be reduced so that the expenditure remains the same?
Correct answer: 20%
Your score
0/15(0%)
Review
EXL exam pattern 2024
| Section | What shows up | Prep focus |
|---|---|---|
| Aptitude / logical | Quant, reasoning, sometimes verbal | Timed sectional accuracy |
| Coding / programming logic | Easy-medium DSA or output-style MCQs | Handle tricky inputs |
| Technical interview | OOPs, DBMS, OS, projects | Explain aloud |
| HR | Fit, location, intent | A few real examples ready |
First round: EXL Online Test
Skills emphasized: Aptitude, SQL, communication
Languages: SQL, Python, Excel
Sample EXL questions with solutions
These are practice-style questions aligned to patterns students report for EXL drives around 2024. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2024)
Q1: Age ratio
Problem: The ratio of ages of A and B is 3:5. After 8 years the ratio becomes 5:7. Find A’s present age.
Solution: Let ages be 3x and 5x. (3x+8)/(5x+8) = 5/7 7(3x+8) = 5(5x+8) 21x + 56 = 25x + 40 4x = 16 → x = 4 A’s age = 12 years.
Answer: 12 years
Q2: Pipe fill
Problem: Pipe A fills a tank in 6 hours and pipe B in 8 hours. How long do they take together to fill it?
Solution: Combined rate = 1/6 + 1/8 = 4/24 + 3/24 = 7/24. Time = 24/7 hours ≈ 3 hours 26 minutes.
Answer: 24/7 hours
Q3: Simple interest
Problem: Find the simple interest on ₹8000 at 10% per annum for 2 years.
Solution: SI = (P × R × T) / 100 = (8000 × 10 × 2) / 100 = ₹1600.
Answer: ₹1600
Q4: Percentage recover
Problem: If 30% of a number is 150, what is the number?
Solution: 0.3x = 150 → x = 150 / 0.3 = 500.
Answer: 500
Q5: Average after replace
Problem: The average of five numbers is 20. One number 30 is replaced by 10. What is the new average?
Solution: Old sum = 5 × 20 = 100. New sum = 100 − 30 + 10 = 80. New average = 80 / 5 = 16.
Answer: 16
Q6: Series n(n+1)
Problem: Find the next term: 2, 6, 12, 20, 30, ?
Solution: Pattern: 1×2, 2×3, 3×4, 4×5, 5×6, 6×7. Next = 6 × 7 = 42.
Answer: 42
Q7: Deck probability
Problem: What is the probability of drawing an ace from a standard 52-card deck?
Solution: There are 4 aces in 52 cards. Probability = 4/52 = 1/13.
Answer: 1/13
Q8: Net percent change
Problem: A number is increased by 20% and then decreased by 20%. What is the net percentage change?
Solution: Start with 100 → 120 → 96. Net change = 4% decrease. Formula: successive +a then −a gives −(a²/100)% = −4%.
Answer: 4% decrease
Logical reasoning (2024)
Q1: Syllogism
Problem: Statements: All engineers are graduates. Some graduates are managers. Conclusion: Some engineers are managers. Does it follow?
Solution: The ‘some graduates’ who are managers need not overlap with the engineers. The conclusion does not follow necessarily.
Answer: Does not follow
Q2: Direction turn
Problem: A person walks 5 km north, then 3 km east, then 5 km south. How far is he from the start, and in which direction?
Solution: North 5 and south 5 cancel. He is 3 km east of the start.
Answer: 3 km east
Q3: Series multiply
Problem: Find the next number: 3, 9, 27, 81, ?
Solution: Each term is multiplied by 3. Next = 81 × 3 = 243.
Answer: 243
Q4: Seating hint
Problem: Five friends sit in a row. A is to the left of B but right of C. D is to the right of B and left of E. Who is in the middle?
Solution: Order from left to right: C, A, B, D, E. The middle seat is B.
Answer: B
Coding practice (2024)
Coding Q1: First unique character
Problem: Find the first non-repeating character in a string and return its index, or -1 if none exists.
Approach: Count frequencies in one pass (hash map or array of 26 for lowercase). Second pass returns the first index with count 1.
Complexity: O(n) time
EXL tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q2: Stack with min
Problem: Design a stack that supports push, pop, top, and getMin in average O(1) time.
Approach: Keep a parallel min-stack (or store pairs). When pushing, also push the new minimum. When popping, pop both stacks.
Complexity: O(1) per operation amortized
EXL tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q3: Maximum subarray sum (Kadane)
Problem: Given an integer array, find the contiguous subarray with the largest sum and return that sum. Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (from [4,-1,2,1]).
Approach: Keep a running sum. If the running sum drops below 0, reset it to 0 before taking the next element (or track the best ending-here value). Track the global maximum as you scan once from left to right.
Complexity: O(n) time, O(1) extra space
EXL tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q4: Reverse a string in place
Problem: Given a mutable character array representing a string, reverse it in place without allocating another array of the same size.
Approach: Use two pointers at the start and end. Swap characters, then move inward until the pointers meet. Watch empty and single-character inputs.
Complexity: O(n) time, O(1) extra space
EXL tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q5: Check prime
Problem: Write a function that returns true if n is prime and false otherwise. Handle n < 2 correctly.
Approach: Return false for n < 2. Trial-divide from 2 to floor(sqrt(n)). If any divisor divides n evenly, it is composite; otherwise prime.
Complexity: O(√n) time
EXL tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q6: Valid parentheses
Problem: Given a string containing only ‘()[]’, decide whether the brackets are balanced and correctly nested.
Approach: Scan left to right with a stack. Push opening brackets. On a closing bracket, the stack top must be the matching opener. At the end the stack must be empty.
Complexity: O(n) time, O(n) space
EXL tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q7: Two Sum
Problem: Given an array of integers and a target, return indices of two numbers that add up to the target. Assume exactly one solution and you may not use the same element twice.
Approach: Walk the array once. For each value x, check whether target − x was seen earlier in a hash map of value → index. If yes, return both indices; else store x.
Complexity: O(n) time, O(n) space
EXL tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q8: Longest substring without repeating characters
Problem: Given a string s, find the length of the longest substring without repeating characters. Example: ‘abcabcbb’ → 3 (‘abc’).
Approach: Sliding window with a map (or last-seen index) of characters. Expand the right pointer; when a duplicate appears inside the window, move the left pointer past the previous occurrence.
Complexity: O(n) time
EXL tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Deep prep notes for EXL
How the EXL online test usually feels
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For EXL, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: SQL, Python, Excel.
Topic weight hints
| Area | Why it matters at EXL |
|---|---|
| Aptitude | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Analytics & Operations Management awareness | Helps in managerial / HR conversations |
| Communication | Explain your approach clearly; keep a few real examples ready for HR |
14-Day sprint
- Days 1-3: Learn the 2024 pattern and take two sectional mocks
- Days 4-7: Closed practice on weak topics from your error log
- Days 8-10: Full mocks every other day; review the same day
- Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready