Skip to content

Persistent Systems placement papers 2024

Persistent Systems placement papers 2024. Primary filter: Persistent Online Assessment. Focus: Coding, OOPs, DBMS, aptitude.

Persistent Systems 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

Sample Persistent Systems Questions with Solutions

Section titled “Sample Persistent Systems Questions with Solutions”

Practice-style questions (not leaked live papers).

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

Answer: 500

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

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

Answer: 16

Explanation: Sum 100 -> 80; avg 16.

Q3: A finishes in 10 days, B in 15. Together?

Answer: 6 days

Explanation: 1/10+1/15=1/6.

Q4: Probability of drawing an ace from a deck?

Answer: 1/13

Explanation: 4/52=1/13.

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

Answer: 24/7 hours

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

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

Answer: 20%

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

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

Answer: 42

Explanation: n(n+1) pattern.

Q8: 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.

Coding Q1: Kadane max subarray

Approach: Running best.

Complexity: O(n)

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

Coding Q2: Reverse a string in-place

Approach: Two pointers from ends.

Complexity: O(n)/O(1)

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

Coding Q3: Check prime

Approach: Trial division to sqrt(n).

Complexity: Handle n<2

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

Coding Q4: Valid parentheses

Approach: Stack matching.

Complexity: O(n)

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

Coding Q5: Two Sum

Approach: Hash map complements.

Complexity: O(n)

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

Coding Q6: Longest substring without repeat

Approach: Sliding window + last index.

Complexity: O(n)

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

Coding Q7: Merge intervals

Approach: Sort + merge.

Complexity: O(n log n)

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

Coding Q8: Top K frequent

Approach: Count + heap.

Complexity: O(n log k)

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

Coding Q9: Linked list cycle

Approach: Floyd tortoise-hare.

Complexity: O(1) space

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

Coding Q10: Level order traversal

Approach: BFS queue.

Complexity: O(n)

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

How the Persistent Online Assessment Usually Feels

Section titled “How the Persistent Online Assessment Usually Feels”

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

Area Why it matters at Persistent Systems
Coding Primary shortlist signal
Core CS (OOPs/DBMS/OS) Technical interview depth
Software Product Engineering 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

Persistent Systems

Hexaware · Coforge · Thoughtworks · Mphasis · LTTS · TCS