Bank of Baroda 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
This page collects Bank of Baroda 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 Bank of Baroda patterns and recent shifts.
Bank of Baroda 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
Bank of Baroda 2024 coding
DSA practice aligned to Bank of Baroda online assessments
Bank of Baroda interview experience
Round structure and tips from student reports
Bank of Baroda prep guide
Study plan and weekly schedule
Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.
Quantitative
A man can do a piece of work in 10 days, and another man can do it in 15 days. How long will they take to complete the work together?
First man's 1 day work = 1/10 Second man's 1 day work = 1/15 Combined 1 day work = 1/10 + 1/15 = (3+2)/30 = 5/30 = 1/6 Time taken together = 6 days
Quantitative
Simple interest on ₹5,000 at 8% p.a. for 3 years is:
SI = PRT/100 = 5000×8×3/100 = ₹1,200.
Quantitative
If all roses are flowers, and some flowers are red, which must be true?
From "all roses are flowers" and "some flowers are red", we cannot conclude about roses being red. But "some red things are flowers" must be true.
Verbal
Choose correctly spelled word:
Correct spelling is Necessary.
Quantitative
Pipe A fills a tank in 6 hours, pipe B empties it in 8 hours. Time to fill both open:
1/6 − 1/8 = 1/24 → 24 hours.
Quantitative
A person travels first half of distance at 40 km/hr and second half at 60 km/hr. Find average speed.
Let total distance = 2D Time for first half = D/40 Time for second half = D/60 Total time = D/40 + D/60 = D(3+2)/120 = 5D/120 = D/24 Average speed = 2D / (D/24) = 48 km/hr
Reasoning
Which is different: Monday, Tuesday, Wednesday, January
January is a month; others are days.
Verbal
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
With "neither...nor", the verb agrees with the subject closer to it. "Teacher" is singular, so "was" is correct.
Verbal
Problem: Arrange the sentences: 1. Therefore, regular exercise is essential 2. Physical activity improves mental health 3. Studies show that exercise reduces stress 4. It also enhances cognitive function
Logical order: 3 (evidence) → 2 (benefit) → 4 (additional benefit) → 1 (conclusion)
Reasoning
Arrange the words: 1. Elephant 2. Cat 3. Dog 4. Ant
Correct answer: 4, 2, 3, 1
Verbal
Choose the correctly spelled word:
Correct spelling is Accommodation.
Quantitative
A can complete a work in 12 days, B in 15 days. They work together for 4 days, then A leaves. How long will B take to complete the remaining work?
Correct answer: 6 days
Reasoning
Statements: All roses are flowers. Some flowers are red. Conclusions: I. Some roses are red. II. All red things are roses.
Analyzing the statements: - All roses are flowers (A → B) - Some flowers are red (B → C, some) Conclusion I: Some roses are red - Valid Conclusion II: All red things are roses - Invalid
Reasoning
A is taller than B but shorter than C. D is shorter than B. Who is tallest?
C > A > B > D → C is tallest.
Reasoning
In a row of 40 students, A is 11th from the left. Rank from the right is:
From right = 40-11+1 = 30.
Your score
0/15(0%)
| 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: IBPS / BoB Notification Test
Skills emphasized: Aptitude, reasoning, English, banking
Languages: Tech roles separate
These are practice-style questions aligned to patterns students report for Bank of Baroda drives around 2024. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Problem: A mixture has milk and water in the ratio 4:1. If 5 litres of water are added to 20 litres of mixture, what is the new milk:water ratio?
Solution: In 20 L: milk = 16 L, water = 4 L. After adding 5 L water: milk 16, water 9. Ratio = 16:9.
Answer: 16:9
Problem: Find compound interest on ₹10,000 at 10% per annum for 2 years, compounded annually.
Solution: Amount = 10000 × (1.1)² = 10000 × 1.21 = ₹12,100. CI = 12100 − 10000 = ₹2100. (SI for same period would be ₹2000; the extra ₹100 is interest on first-year interest.)
Answer: ₹2100
Problem: What is the angle between the hour and minute hands at 3:00?
Solution: At 3:00 the hands are exactly 90° apart (one quarter of the circle).
Answer: 90°
Problem: In how many ways can 5 different books be arranged on a shelf?
Solution: Arrangements of 5 distinct items = 5! = 120.
Answer: 120
Problem: If the sum of three consecutive integers is 72, what is the smallest of these integers?
Solution: Let the integers be x, x+1, and x+2.
x + (x+1) + (x+2) = 72 3x + 3 = 72 3x = 69 x = 23
So the integers are 23, 24, and 25.
Answer: 23
Problem: A train 150 meters long passes a pole in 15 seconds. What is its speed in km/h?
Solution: Distance = 150 m = 0.15 km. Time = 15 s = 15/3600 h = 1/240 h. Speed = 0.15 ÷ (1/240) = 0.15 × 240 = 36 km/h.
Faster check: 150/15 = 10 m/s → 10 × 18/5 = 36 km/h.
Answer: 36 km/h
Problem: If the cost price of a pen is ₹40 and it is sold at a 25% profit, what is the selling price?
Solution: Profit = 25% of 40 = ₹10. Selling price = 40 + 10 = ₹50.
Or SP = CP × 1.25 = 40 × 1.25 = ₹50.
Answer: ₹50
Problem: A can finish a job in 10 days and B in 20 days. How long will they take working together?
Solution: A’s one-day work = 1/10. B’s one-day work = 1/20. Together = 1/10 + 1/20 = 3/20 per day. Time = 20/3 ≈ 6.67 days (6 days 16 hours).
Answer: 20/3 days
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
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
Problem: Pointing to a photograph, Ravi says, ‘She is the daughter of my mother’s only son.’ How is the girl related to Ravi?
Solution: Ravi’s mother’s only son is Ravi himself (assuming one son). The girl is therefore Ravi’s daughter.
Answer: Daughter
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
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
Bank of Baroda 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.
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
Bank of Baroda 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.
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
Bank of Baroda 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.
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
Bank of Baroda 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.
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
Bank of Baroda 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.
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
Bank of Baroda 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.
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
Bank of Baroda 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.
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
Bank of Baroda 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.
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For Bank of Baroda, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Tech roles separate.
| Area | Why it matters at Bank of Baroda |
|---|---|
| Aptitude | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Indian Public Sector Banking awareness | Helps in managerial / HR conversations |
| Communication | Explain your approach clearly; keep a few real examples ready for HR |
SBI · Canara Bank · Axis Bank · HDFC Bank