BEL 2025 aptitude
Quantitative, reasoning, and verbal drills with solutions
BEL Placement Papers 2025
Overview
This page collects BEL placement papers from 2025 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 BEL patterns and recent shifts.
Download / jump links
BEL 2025 coding
DSA practice aligned to BEL online assessments
BEL interview experience
Round structure and tips from student reports
BEL prep guide
Study plan and weekly schedule
BEL 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
Quantitative
The table shows sales (in thousands) for 5 products. If Product A sold 25% more than Product B, and Product B sold 40,000 units, find Product A's sales.
Product B = 40,000 Product A = 40,000 + 25% of 40,000 = 40,000 + 10,000 = 50,000
Verbal
Synonym of "Brief":
Brief means concise or short.
Quantitative
The ratio of ages of A and B is 3:5. After 10 years, the ratio becomes 5:7. Find the present age of A.
Let present ages be 3x and 5x After 10 years: (3x + 10)/(5x + 10) = 5/7 7(3x + 10) = 5(5x + 10) 21x + 70 = 25x + 50 4x = 20 x = 5 A's present age = 3 × 5 = 15 years
Verbal
Neither the teacher nor the students _____ present.
Verb agrees with nearer subject (students) → were.
Reasoning
In how many ways can 5 people be arranged in a row if two particular people must sit together?
Treat the two people as one unit: 4 units to arrange = 4! ways The two people can be arranged among themselves in 2! ways Total = 4! × 2! = 24 × 2 = 48 ways
Quantitative
In a mixture of 60 liters, the ratio of milk and water is 2:1. How much water should be added to make the ratio 1:2?
Correct answer: 60 liters
Reasoning
If P means +, Q means −, R means ×, then 18 R 2 P 6 Q 4 = ?
18 × 2 + 6 − 4 = 36 + 6 − 4 = 38.
Reasoning
If every letter is shifted +2 in the alphabet, SUN becomes:
Each letter +2 → UWP.
Quantitative
The ratio of ages of A and B is 3:5. After 8 years, the ratio becomes 5:7. Find the present age of A.
Let present ages be 3x and 5x. After 8 years: - A's age: 3x + 8 - B's age: 5x + 8 Given: (3x + 8)/(5x + 8) = 5/7 7(3x + 8) = 5(5x + 8) 21x + 56 = 25x + 40 4x = 16 x = 4 Present age of A = 3x = 3 × 4 = 12 years
Verbal
"To add fuel to the fire" means:
It means worsening a conflict or situation.
Reasoning
All pens are books. Some books are papers. Conclusion: Some pens are papers.
No definite overlap between pens and papers.
Reasoning
Find the next number: 1, 3, 6, 10, 15, ?
Correct answer: 21
Verbal
Problem: Find the synonym of "MAGNIFICENT": a) Ordinary b) Splendid c) Small d) Ugly
Magnificent means impressively beautiful or grand, so "Splendid" is the synonym.
Quantitative
If 20% of a number is 60, what is 35% of that number?
Let the number be x 20% of x = 60 x = 60 × 100/20 = 300 35% of 300 = 35/100 × 300 = 105
Quantitative
A train 150 m long runs at 54 km/h. Time to cross a man standing is:
54 km/h = 15 m/s. Time = 150/15 = 10 s.
Your score
0/15(0%)
Review
BEL exam pattern 2025
| Section | What shows up | Prep focus |
|---|---|---|
| Technical / domain | Syllabus aligned to the notification | Topic checklist |
| Aptitude | Quant + reasoning | Speed with accuracy |
| Interview | Subject depth + projects | Clear fundamentals |
First round: BEL / GATE-based Recruitment
Skills emphasized: GATE ECE/CSE technical, aptitude
Languages: C, C++, Embedded (role)
Sample BEL questions with solutions
These are practice-style questions aligned to patterns students report for BEL drives around 2025. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2025)
Q1: 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
Q2: 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
Q3: 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
Q4: SI three years
Problem: Find simple interest on ₹5000 at 8% per annum for 3 years.
Solution: SI = 5000 × 8 × 3 / 100 = ₹1200.
Answer: ₹1200
Q5: Boat upstream
Problem: A boat’s speed in still water is 15 km/h and the stream is 3 km/h. How long to cover 36 km upstream?
Solution: Upstream speed = 15 − 3 = 12 km/h. Time = 36 / 12 = 3 hours.
Answer: 3 hours
Q6: Mixture milk
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
Q7: CI vs SI hint
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
Q8: Clock angle
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°
Logical reasoning (2025)
Q1: 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
Q2: 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
Q3: 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
Q4: Blood relation
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
Coding practice (2025)
Coding Q1: 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
BEL 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: 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
BEL 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: 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
BEL 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: 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
BEL 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: 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
BEL 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: 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
BEL 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: 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
BEL 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: 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
BEL 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 BEL
How the BEL / gate-based recruitment usually feels
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For BEL, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: C, C++, Embedded (role).
Topic weight hints
| Area | Why it matters at BEL |
|---|---|
| GATE ECE/CSE technical | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Defence Electronics PSU 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 2025 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