Birlasoft 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
Birlasoft Placement Papers 2024
Overview
This page collects Birlasoft 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 Birlasoft patterns and recent shifts.
Download / jump links
Birlasoft 2024 coding
DSA practice aligned to Birlasoft online assessments
Birlasoft interview experience
Round structure and tips from student reports
Birlasoft prep guide
Study plan and weekly schedule
Birlasoft 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 8 km north, then 15 km east. Distance from start is:
Right triangle → 17 km.
Quantitative
Based on the given table showing monthly deposits (Jan: ₹100K, Feb: ₹120K, Mar: ₹150K), calculate the percentage increase from January to March.
Correct answer: 50% increase
Reasoning
If every letter is shifted +2 in the alphabet, CANDLE becomes:
C→E, A→C, N→P, D→F, L→N, E→G → ECPFNG.
Quantitative
A car covers 180 km in 3 hours. Average speed is:
Speed = 180/3 = 60 km/h.
Quantitative
A sum of money doubles itself in 5 years at simple interest. In how many years will it become 4 times?
Correct answer: 15 years
Reasoning
Find next number: 1, 4, 9, 16, 25, ?
Pattern: n² where n = 1, 2, 3, 4, 5... 1²=1, 2²=4, 3²=9, 4²=16, 5²=25 Next: 6² = 36
Reasoning
Statements: All birds can fly. Penguins are birds. Conclusion: Penguins can fly. Is the conclusion valid?
Correct answer: Invalid (first premise is false)
Verbal
Find synonym of "Abundant"
Correct answer: Plentiful
Reasoning
What is the value of x? Statement I: x² - 5x + 6 = 0. Statement II: x > 0.
Statement I: x² - 5x + 6 = 0 (x - 2)(x - 3) = 0 x = 2 or x = 3 Statement II: x > 0 (doesn't help narrow down) Combining both: x = 2 or x = 3 (both positive)
Quantitative
A sum of ₹8,000 amounts to ₹9,600 in 4 years at simple interest. Find the rate of interest per annum.
Principal = ₹8,000, Amount = ₹9,600 Interest = 9,600 - 8,000 = ₹1,600 SI = P × R × T / 100 1,600 = 8,000 × R × 4 / 100 R = (1,600 × 100) / (8,000 × 4) = 5%
Quantitative
Compound Interest - Yearly vs Half-Yearly
Correct answer: ₹3.93 (approximately)
Verbal
Problem: Find the antonym of "BRILLIANT": a) Bright b) Dull c) Shining d) Smart
Brilliant means very bright or intelligent, so "Dull" is the antonym.
Verbal
Find antonym of "Temporary"
Correct answer: Permanent
Verbal
Antonym of "Expand":
Expand ↔ contract.
Quantitative
If "APPLE" is coded as "1225165", how is "MANGO" coded?
Pattern: A=1, B=2, C=3... Z=26 APPLE: A=1, P=16, P=16, L=12, E=5 → 1225165 MANGO: M=13, A=1, N=14, G=7, O=15 → 13114715
Your score
0/15(0%)
Review
Birlasoft 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: Birlasoft Assessment
Skills emphasized: Aptitude, coding basics, enterprise apps
Languages: Java, SQL, Python
Sample Birlasoft questions with solutions
These are practice-style questions aligned to patterns students report for Birlasoft 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: 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
Q2: 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
Q3: Consumption cut
Problem: If the price of an item rises by 25%, by what percent should consumption fall so that expenditure stays the same?
Solution: Required reduction = r/(100+r) × 100 with r = 25. = 25/125 × 100 = 20%.
Answer: 20%
Q4: Compound mark-discount
Problem: An article is marked 40% above cost and sold after a 10% discount. Find the profit percent.
Solution: SP = CP × 1.4 × 0.9 = 1.26 CP. Profit = 26%.
Answer: 26%
Q5: Loss to profit shift
Problem: An article sold at 10% loss would give 5% profit if sold for ₹60 more. Find the cost price.
Solution: 0.9P + 60 = 1.05P 60 = 0.15P P = 60 / 0.15 = ₹400.
Answer: ₹400
Q6: Worker scaling
Problem: Eight workers finish a job in 10 days. How many days will 10 workers take for the same job (same pace)?
Solution: Total man-days = 8 × 10 = 80. Days for 10 workers = 80 / 10 = 8 days.
Answer: 8 days
Q7: Distance from speed
Problem: A vehicle travels at 60 km/h for 2.5 hours. How far does it go?
Solution: Distance = speed × time = 60 × 2.5 = 150 km.
Answer: 150 km
Q8: Compound ratio
Problem: If two ratios are 3:5 and 5:7, what is the compound ratio?
Solution: Compound ratio = (3/5) × (5/7) = 3/7, written as 3:7.
Answer: 3:7
Logical reasoning (2024)
Q1: 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
Q2: Analogy
Problem: Book is to Reading as Fork is to ?
Solution: A book is used for reading; a fork is used for eating.
Answer: Eating
Q3: Odd one out
Problem: Find the odd one out: 3, 5, 7, 9, 11
Solution: 3, 5, 7, and 11 are prime. 9 = 3×3 is composite, so it is the odd one out.
Answer: 9
Q4: Coding letter shift
Problem: If CAT is coded as DBU, how is DOG coded in the same way?
Solution: Each letter moves +1 in the alphabet: C→D, A→B, T→U. D→E, O→P, G→H → EPH.
Answer: EPH
Coding practice (2024)
Coding Q1: 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
Birlasoft 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: Merge overlapping intervals
Problem: Given a list of intervals [start, end], merge all overlapping intervals and return the non-overlapping set that covers the same ranges.
Approach: Sort by start time. Walk once, merging into the last interval in the result when the next start is ≤ current end; otherwise append a new interval.
Complexity: O(n log n) time from the sort
Birlasoft 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: Top K frequent elements
Problem: Given an integer array and an integer k, return the k most frequent elements. Order among equals can be arbitrary unless the problem says otherwise.
Approach: Count frequencies with a hash map, then use a heap of size k (or bucket sort by frequency) to extract the top k keys.
Complexity: O(n log k) with a heap
Birlasoft 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: Linked list cycle
Problem: Given the head of a linked list, return true if there is a cycle and false otherwise.
Approach: Floyd’s tortoise and hare: move one pointer one step and another two steps. If they meet, a cycle exists. If the fast pointer hits null, there is no cycle.
Complexity: O(n) time, O(1) space
Birlasoft 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: Binary tree level order
Problem: Given the root of a binary tree, return the level-order traversal (breadth-first) as a list of levels.
Approach: Use a queue. For each level, drain the current queue size, collect values, and enqueue children for the next level.
Complexity: O(n) time, O(n) space
Birlasoft 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: Coin change (min coins)
Problem: Given coin denominations and an amount, return the fewest coins needed to make that amount, or -1 if it is impossible.
Approach: Unbounded knapsack DP: let dp[x] be the minimum coins for amount x. For each coin, update dp[c..amount]. Initialize dp[0] = 0 and the rest to a large sentinel.
Complexity: O(amount × coins)
Birlasoft 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: Binary search
Problem: Given a sorted array of distinct integers and a target, return the index of target or -1 if missing.
Approach: Maintain lo/hi. Compare mid with target and shrink the half that cannot contain it. Careful with overflow-free mid and empty arrays.
Complexity: O(log n) time
Birlasoft 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: Move zeros
Problem: Move all zeros in an array to the end while keeping the relative order of non-zero elements.
Approach: Two pointers: write non-zeros toward the front, then fill the remainder with zeros. Or swap zeros as you scan.
Complexity: O(n) time, O(1) space
Birlasoft 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 Birlasoft
How the Birlasoft assessment usually feels
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For Birlasoft, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, SQL, Python.
Topic weight hints
| Area | Why it matters at Birlasoft |
|---|---|
| Aptitude | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Enterprise Digital, SAP/Oracle 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