MathWorks 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
This page collects MathWorks 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 MathWorks patterns and recent shifts.
MathWorks 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
MathWorks 2024 coding
DSA practice aligned to MathWorks online assessments
MathWorks interview experience
Round structure and tips from student reports
MathWorks 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.
Reasoning
Statements: All dogs are animals. Some animals are pets. Conclusion: Some dogs are pets.
No definite relation that dogs are pets.
Verbal
Synonym of "Ancient":
Ancient means old.
Reasoning
Two trains move in the same direction at 50 kmph and 32 kmph respectively. A man in the slower train observes that 15 seconds elapse before the faster train completely passes by him. What is the length of the faster train?
Relative speed = 50 - 32 = 18 kmph = 18 × 5/18 = 5 m/s Time = 15 seconds Length of faster train = Relative speed × Time = 5 × 15 = 75 meters
Verbal
The idiom "add fuel to the fire" means:
It means: make a situation worse.
Quantitative
Find the compound interest on ₹5000 for 2 years at 10% per annum, compounded annually.
Correct answer: ₹1050
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)
Quantitative
A shopkeeper sells an item at 20% profit. If he had bought it at 10% less and sold it for ₹40 less, he would have gained 25%. Find the cost price.
Correct answer: ₹800
Reasoning
Find next number: 2, 3, 5, 7, 11, ?
Pattern: Prime numbers in sequence 2, 3, 5, 7, 11, 13... Next: 13
Reasoning
Odd one out: 10, 20, 30, 40, 55
Others are multiples of 10.
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
Each of the boys _____ given a prize.
"Each" takes singular verb → was.
Quantitative
Two containers of milk contain mixtures of water and milk in ratio 5:4 and 7:9. In what ratio they should be mixed so that mixture is of 6:6 ratios?
Correct answer: 9:8
Quantitative
If the average of five numbers is 25, what is their total sum?
Average = Sum / Count 25 = Sum / 5 Sum = 25 × 5 = 125
Reasoning
A walks 8 km north, then 15 km east. Distance from start is:
Right triangle → 17 km.
Quantitative
Identify the error: "The data shows that the results are positive."
Correct answer: Subject-verb agreement error
Your score
0/15(0%)
| Section | What shows up | Prep focus |
|---|---|---|
| Online assessment | Coding and/or MCQ filter | Weekly timed mocks |
| Technical rounds | DSA, CS fundamentals, projects | Live problem solving |
| HR / hiring manager | Motivation and communication | Specific, evidence-based answers |
First round: MathWorks Online Test
Skills emphasized: MATLAB/algorithms, DSA, numerical methods
Languages: MATLAB, C++, Python, Java
These are practice-style questions aligned to patterns students report for MathWorks drives around 2024. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
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: What is the sum of the first 50 natural numbers?
Solution: Sum of first n naturals = n(n+1)/2. For n = 50: 50 × 51 / 2 = 1275.
Answer: 1275
Problem: A person covers a distance at 60 km/h and returns at 40 km/h. What is the average speed for the whole trip?
Solution: For equal distances, average speed = 2ab/(a+b). = 2×60×40 / (60+40) = 4800/100 = 48 km/h.
Do not take the arithmetic mean (50); that would be wrong here.
Answer: 48 km/h
Problem: A shopkeeper marks goods 20% above cost and then gives a 10% discount. What is the profit percentage?
Solution: Let CP = ₹100. Marked price = ₹120. Discount = 10% of 120 = ₹12. SP = 120 − 12 = ₹108. Profit % = 8%.
Answer: 8%
Problem: A finishes work in 12 days, B in 15 days, and C in 20 days. Working together, how many days do they need?
Solution: Take total work = LCM(12,15,20) = 60 units. A = 5/day, B = 4/day, C = 3/day. Combined = 12 units/day. Time = 60/12 = 5 days.
Answer: 5 days
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
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
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
MathWorks 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
MathWorks 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
MathWorks 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
MathWorks 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
MathWorks 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 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
MathWorks 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 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)
MathWorks 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 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
MathWorks 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 MathWorks, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: MATLAB, C++, Python, Java.
| Area | Why it matters at MathWorks |
|---|---|
| MATLAB/algorithms | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Scientific Computing Software awareness | Helps in managerial / HR conversations |
| Communication | Explain your approach clearly; keep a few real examples ready for HR |