Globallogic 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
Globallogic Placement Papers 2024
Overview
This page collects GlobalLogic 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 GlobalLogic patterns and recent shifts.
Download / jump links
Globallogic 2024 coding
DSA practice aligned to GlobalLogic online assessments
Globallogic interview experience
Round structure and tips from student reports
Globallogic prep guide
Study plan and weekly schedule
GlobalLogic 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: 1. All green are blue, 2. All blue are white
From "All green are blue": Some blue are green (I follows) Combined: All green are white, so Some white are green (II follows) and Some green are white (III follows) IV does not follow
Quantitative
A is twice as efficient as B. Together they complete a work in 12 days. In how many days will A alone complete it?
Let B's efficiency = 1 unit/day A's efficiency = 2 units/day Together: 1 + 2 = 3 units/day Total work = 3 × 12 = 36 units A alone: 36 / 2 = 18 days
Quantitative
A man invests ₹10,000 in a scheme which offers 10% per annum compound interest. Find the amount after 2 years.
Principal = ₹10,000 Rate = 10%, Time = 2 years Amount = P(1 + R/100)² = 10000(1 + 10/100)² = 10000(1.1)² = 10000 × 1.21 = ₹12,100
Quantitative
A car covers 180 km in 3 hours. Average speed is:
Speed = 180/3 = 60 km/h.
Quantitative
A is twice as old as B. 10 years ago, A was 4 times as old as B. Find the present age of A.
Correct answer: 30 years
Verbal
Choose the correct sentence:
Neither takes singular verb; "options" is plural noun with of.
Reasoning
A walks 6 km north, then 8 km east. Distance from start is:
Right triangle → 10 km.
Verbal
"She was _____ by the beautiful sunset."
Past tense passive voice requires past participle "amazed".
Verbal
The idiom "a piece of cake" means:
It means: very easy.
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.
Quantitative
A sum of money doubles itself in 5 years at simple interest. In how many years will it become 4 times?
Correct answer: 15 years
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
Find compound interest on ₹10,000 for 2 years at 10% per annum, compounded annually.
Amount = P(1 + R/100)^n Amount = 10000(1 + 10/100)^2 = 10000 × 1.1^2 = 10000 × 1.21 = ₹12,100 CI = Amount - Principal = 12100 - 10000 = ₹2,100
Reasoning
If letter positions are summed (A=1…Z=26), PEN equals:
Sum of positions = 35.
Reasoning
Arrange in dictionary order: Apple, Apply, Apt, Apex. Third word is:
Order: Apex, Apple, Apply, Apt → third is Apply.
Your score
0/15(0%)
Review
Globallogic 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: GlobalLogic Online Test
Skills emphasized: Coding, OOPs, system basics
Languages: Java, C++, Python
Sample Globallogic questions with solutions
These are practice-style questions aligned to patterns students report for GlobalLogic 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: Permutation basic
Problem: In how many ways can 5 different books be arranged on a shelf?
Solution: Arrangements of 5 distinct items = 5! = 120.
Answer: 120
Q2: Consecutive integers
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
Q3: Train and pole
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
Q4: Profit on a pen
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
Q5: A and B together
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
Q6: Sum of naturals
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
Q7: Average speed
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
Q8: Marked price discount
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%
Logical reasoning (2024)
Q1: Seating hint
Problem: Five friends sit in a row. A is to the left of B but right of C. D is to the right of B and left of E. Who is in the middle?
Solution: Order from left to right: C, A, B, D, E. The middle seat is B.
Answer: B
Q2: 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
Q3: 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
Q4: 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
Coding practice (2024)
Coding Q1: 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
GlobalLogic 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: 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
GlobalLogic 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: 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
GlobalLogic 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: 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
GlobalLogic 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: Linked list cycle
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
GlobalLogic 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: Binary tree level order
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
GlobalLogic 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: Coin change (min coins)
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)
GlobalLogic 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: Binary search
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
GlobalLogic 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 Globallogic
How the Globallogic online test usually feels
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For GlobalLogic, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, C++, Python.
Topic weight hints
| Area | Why it matters at GlobalLogic |
|---|---|
| Coding | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Digital Product Engineering 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
Comments & Suggestions
Related
Similar companies
Persistent Systems · EPAM · LTTS · Nagarro