Skip to content

Zensar placement papers 2024

Zensar placement papers 2024. Primary filter: Zensar Assessment. Focus: Aptitude, coding, communication.

Zensar 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

Practice-style questions (not leaked live papers).

Q1: Pipe A fills in 6h, B in 8h. Together to fill?

Answer: 24/7 hours

Explanation: 1/6+1/8=7/24.

Q2: CP Rs.500, SP Rs.600. Profit percent?

Answer: 20%

Explanation: (100/500)*100=20%.

Q3: Find next: 2, 6, 12, 20, 30, ?

Answer: 42

Explanation: n(n+1) pattern.

Q4: A train 120 m long runs at 54 km/h. Time to pass a pole?

Answer: 8 seconds

Explanation: 54 km/h = 15 m/s; t = 120/15 = 8 s.

Q5: Ratio of ages A:B = 4:5. After 6 years = 6:7. A present age?

Answer: 12 years

Explanation: 4x+6 / 5x+6 = 6/7 => x=3 => A=12.

Q6: Simple interest on Rs.8000 at 10% for 2 years?

Answer: Rs.1600

Explanation: SI = PRT/100 = 1600.

Q7: If 30% of x = 150, x = ?

Answer: 500

Explanation: 0.3x=150 => x=500.

Q8: Average of 5 numbers is 20. One number 30 replaced by 10. New average?

Answer: 16

Explanation: Sum 100 -> 80; avg 16.

Coding Q1: Valid parentheses

Approach: Stack matching.

Complexity: O(n)

Zensar tip: Narrate brute force then optimize then edge cases before coding.

Coding Q2: Two Sum

Approach: Hash map complements.

Complexity: O(n)

Zensar tip: Narrate brute force then optimize then edge cases before coding.

Coding Q3: Longest substring without repeat

Approach: Sliding window + last index.

Complexity: O(n)

Zensar tip: Narrate brute force then optimize then edge cases before coding.

Coding Q4: Merge intervals

Approach: Sort + merge.

Complexity: O(n log n)

Zensar tip: Narrate brute force then optimize then edge cases before coding.

Coding Q5: Top K frequent

Approach: Count + heap.

Complexity: O(n log k)

Zensar tip: Narrate brute force then optimize then edge cases before coding.

Coding Q6: Linked list cycle

Approach: Floyd tortoise-hare.

Complexity: O(1) space

Zensar tip: Narrate brute force then optimize then edge cases before coding.

Coding Q7: Level order traversal

Approach: BFS queue.

Complexity: O(n)

Zensar tip: Narrate brute force then optimize then edge cases before coding.

Coding Q8: Coin change min coins

Approach: DP unbounded.

Complexity: O(amount*coins)

Zensar tip: Narrate brute force then optimize then edge cases before coding.

Coding Q9: Binary search

Approach: Lo/hi mid.

Complexity: O(log n)

Zensar tip: Narrate brute force then optimize then edge cases before coding.

Coding Q10: Kadane max subarray

Approach: Running best.

Complexity: O(n)

Zensar tip: Narrate brute force then optimize then edge cases before coding.

Candidates describe a paced filter where easy marks disappear if you over-invest in one hard item. For Zensar, start with a three-minute scan, mark certainty levels, and protect accuracy. Languages typically include Java, Python, SQL.

Area Why it matters at Zensar
Aptitude Primary shortlist signal
Core CS (OOPs/DBMS/OS) Technical interview depth
IT Services, Experience Tech awareness Managerial / HR differentiation
Communication Especially for consulting and client-facing GSIs
  1. Days 1-3: pattern familiarization + 2 sectional mocks
  2. Days 4-7: weak-topic closed practice
  3. Days 8-10: full mocks every other day
  4. Days 11-14: interview narration + light revision

Aptitude

Drills

Coding

DSA

OA

Assessment

Hub

Zensar

Birlasoft · Coforge · Hexaware · Mphasis · TCS · Infosys