Aptitude
CGI placement papers 2024
Overview
Section titled “Overview”CGI placement papers 2024. Primary filter: CGI Online Assessment. Focus: Aptitude, coding basics, consulting communication.
CGI 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.
Reasoning
All roses are flowers. Some flowers fade quickly. Conclusion: All roses fade quickly.
Only some flowers.
Quantitative
The average of 5 numbers is 20. If one number is removed, the average becomes 18. Find the removed number.
Correct answer: 28
Reasoning
In a row of 50 students, A is 15th from the left. Rank from the right is:
From right = 50-15+1 = 36.
Verbal
Antonym of "Arrival":
Arrival ↔ departure.
Verbal
The idiom "once in a blue moon" means:
It means something that happens very rarely.
Quantitative
A 120 m train crosses a pole in 8 s. Speed in km/h is:
Speed = 120/8 = 15 m/s = 54 km/h.
Quantitative
The sum of the ages of a father and his son is 60 years. If the father's age is four times that of his son, what are their current ages?
Let son's age = x years Father's age = 4x years x + 4x = 60 5x = 60 x = 12 Son's age = 12 years Father's age = 48 years
Verbal
The company's profits have been _____ steadily over the past year.
Correct answer: declining
Reasoning
Odd one out: Triangle, Square, Circle, Rectangle
Circle has no straight sides.
Reasoning
Pointing to a photograph, Ravi said, "He is the son of my grandfather's only son." The boy is Ravi's:
Grandfather's only son is Ravi's father → the boy is Ravi's brother.
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
Quantitative
A and B can complete a work in 20 days and 30 days respectively. If they work together, in how many days will they complete the work?
Correct answer: 12 days
Quantitative
A and B finish a job in 12 and 18 days. Working together they finish in:
1/12 + 1/18 = 5/36 → 36/5 = 7.2 days.
Verbal
Synonym of "Crucial":
Crucial means important.
Quantitative
Five friends A, B, C, D, E are sitting in a row. A is not at either end. B is to the immediate right of A. C is at one end. D is between C and E. Who is sitting in the middle?
C is at one end. D is between C and E, so arrangement: C-D-E or E-D-C A is not at end, B is right of A If C-D-E, then A-B must be before C: A-B-C-D-E (A at end, invalid) So: E-D-C, and A-B before: A-B-E-D-C Middle position: E
Your score
0/15(0%)
Review
Sample CGI Questions with Solutions
Section titled “Sample CGI Questions with Solutions”Practice-style questions (not leaked live papers).
Aptitude / Reasoning
Section titled “Aptitude / Reasoning”Q1: Simple interest on Rs.8000 at 10% for 2 years?
Answer: Rs.1600
Explanation: SI = PRT/100 = 1600.
Q2: If 30% of x = 150, x = ?
Answer: 500
Explanation: 0.3x=150 => x=500.
Q3: Average of 5 numbers is 20. One number 30 replaced by 10. New average?
Answer: 16
Explanation: Sum 100 -> 80; avg 16.
Q4: A finishes in 10 days, B in 15. Together?
Answer: 6 days
Explanation: 1/10+1/15=1/6.
Q5: Probability of drawing an ace from a deck?
Answer: 1/13
Explanation: 4/52=1/13.
Q6: Pipe A fills in 6h, B in 8h. Together to fill?
Answer: 24/7 hours
Explanation: 1/6+1/8=7/24.
Q7: CP Rs.500, SP Rs.600. Profit percent?
Answer: 20%
Explanation: (100/500)*100=20%.
Q8: Find next: 2, 6, 12, 20, 30, ?
Answer: 42
Explanation: n(n+1) pattern.
Coding Practice
Section titled “Coding Practice”Coding Q1: Longest substring without repeat
Approach: Sliding window + last index.
Complexity: O(n)
CGI tip: Narrate brute force then optimize then edge cases before coding.
Coding Q2: Merge intervals
Approach: Sort + merge.
Complexity: O(n log n)
CGI tip: Narrate brute force then optimize then edge cases before coding.
Coding Q3: Top K frequent
Approach: Count + heap.
Complexity: O(n log k)
CGI tip: Narrate brute force then optimize then edge cases before coding.
Coding Q4: Linked list cycle
Approach: Floyd tortoise-hare.
Complexity: O(1) space
CGI tip: Narrate brute force then optimize then edge cases before coding.
Coding Q5: Level order traversal
Approach: BFS queue.
Complexity: O(n)
CGI tip: Narrate brute force then optimize then edge cases before coding.
Coding Q6: Coin change min coins
Approach: DP unbounded.
Complexity: O(amount*coins)
CGI tip: Narrate brute force then optimize then edge cases before coding.
Coding Q7: Binary search
Approach: Lo/hi mid.
Complexity: O(log n)
CGI tip: Narrate brute force then optimize then edge cases before coding.
Coding Q8: Kadane max subarray
Approach: Running best.
Complexity: O(n)
CGI tip: Narrate brute force then optimize then edge cases before coding.
Coding Q9: Reverse a string in-place
Approach: Two pointers from ends.
Complexity: O(n)/O(1)
CGI tip: Narrate brute force then optimize then edge cases before coding.
Coding Q10: Check prime
Approach: Trial division to sqrt(n).
Complexity: Handle n<2
CGI tip: Narrate brute force then optimize then edge cases before coding.
Deep Prep Notes for CGI
Section titled “Deep Prep Notes for CGI”How the CGI Online Assessment Usually Feels
Section titled “How the CGI Online Assessment Usually Feels”Candidates describe a paced filter where easy marks disappear if you over-invest in one hard item. For CGI, start with a three-minute scan, mark certainty levels, and protect accuracy. Languages typically include Java, Python, SQL.
Topic Weight Hints (Candidate-Reported)
Section titled “Topic Weight Hints (Candidate-Reported)”| Area | Why it matters at CGI |
|---|---|
| Aptitude | Primary shortlist signal |
| Core CS (OOPs/DBMS/OS) | Technical interview depth |
| IT Consulting, Managed Services awareness | Managerial / HR differentiation |
| Communication | Especially for consulting and client-facing GSIs |
14-Day Sprint
Section titled “14-Day Sprint”- Days 1-3: pattern familiarization + 2 sectional mocks
- Days 4-7: weak-topic closed practice
- Days 8-10: full mocks every other day
- Days 11-14: interview narration + light revision
Related
Section titled “Related”Coding
OA
Hub

