Coforge 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
Coforge Placement Papers 2024
Overview
This page collects Coforge 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 Coforge patterns and recent shifts.
Download / jump links
Coforge 2024 coding
DSA practice aligned to Coforge online assessments
Coforge interview experience
Round structure and tips from student reports
Coforge prep guide
Study plan and weekly schedule
Coforge 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
Statements: All engineers are professionals. Some professionals are managers. Conclusions: I. Some engineers are managers. II. All managers are engineers.
Analyzing the statements: - All engineers are professionals (A → B) - Some professionals are managers (B → C, some) Conclusion I: Some engineers are managers - Since all engineers are professionals, and some professionals are managers, we can say some engineer
Reasoning
Find next number: 2, 5, 10, 17, 26, ?
Pattern: Differences are 3, 5, 7, 9 (odd numbers) Next difference = 11 Next number = 26 + 11 = 37
Quantitative
A mixture contains milk and water in ratio 3:2. If 10 liters of water is added, ratio becomes 2:3. Find initial quantity of mixture.
Let initial: Milk = 3x, Water = 2x After adding 10L water: Milk = 3x, Water = 2x + 10 3x / (2x + 10) = 2/3 9x = 4x + 20 5x = 20 x = 4 Initial quantity = 3x + 2x = 5x = 20 liters
Quantitative
Two numbers are in ratio 3:5 and their sum is 56. The larger number is:
Parts = 8. Larger = 5/8 × 56 = 35.
Verbal
Antonym of "Optimistic":
Optimistic ↔ pessimistic.
Verbal
A person who writes dictionaries is a:
Correct term: Lexicographer.
Verbal
A tap fills a tank in 5 hours, and another tap empties it in 7 hours. How long will it take to fill the tank if both taps are open?
Filling tap fills 1/5 of tank per hour Emptying tap empties 1/7 of tank per hour Net filling = 1/5 - 1/7 = (7-5)/35 = 2/35 per hour Time to fill = 1 / (2/35) = 35/2 = 17.5 hours
Reasoning
Statements: 1) Some boxes are cars, 2) Some cars are roads Conclusions: I) Some roads are boxes, II) Some cars are boxes, III) No box is a road, IV) Some roads are cars.
Correct answer: Only II and IV follow
Reasoning
Find the missing number: 8, 12, 18, 26, 36, ?
Correct answer: 48
Verbal
Antonym of "Permanent":
Permanent ↔ temporary/brief.
Quantitative
The LCM of 12 and 18 is:
LCM(12,18) = 36.
Quantitative
In a class of 40 students, Ravi ranks 15th from the top. What is his rank from the bottom?
Total students = 40 Rank from top = 15 Rank from bottom = 40 - 15 + 1 = 26
Quantitative
A man can row 6 km/h in still water. If the river flows at 2 km/h, how long will he take to row 12 km upstream?
Speed in still water = 6 km/h Speed of stream = 2 km/h Upstream speed = 6 - 2 = 4 km/h Time = Distance/Speed = 12/4 = 3 hours
Reasoning
If in a code, CAT = 24 and DOG = 26, then BAT = ?
Sum of positions: B+A+T = 2+1+20 = 23.
Quantitative
The ratio of savings to current account deposits in a bank is 3:5. If the total deposits are ₹800,000, find the savings account deposits.
Correct answer: ₹300,000
Your score
0/15(0%)
Review
Coforge 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: Coforge Assessment
Skills emphasized: Aptitude, coding basics, domain awareness
Languages: Java, Python, SQL
Sample Coforge questions with solutions
These are practice-style questions aligned to patterns students report for Coforge 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: 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
Q2: 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
Q3: 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
Q4: 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
Q5: 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
Q6: 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
Q7: 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
Q8: 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%
Logical reasoning (2024)
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 (2024)
Coding Q1: 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
Coforge 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: 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
Coforge 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: 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
Coforge 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: 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
Coforge 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: 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
Coforge 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: 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
Coforge 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: 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
Coforge 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: 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
Coforge 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 Coforge
How the Coforge 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 Coforge, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, Python, SQL.
Topic weight hints
| Area | Why it matters at Coforge |
|---|---|
| Aptitude | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| IT Services, Digital 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