Persistent Systems placement papers provide valuable insights into the company’s recruitment process. These sample questions are compiled from previous years’ placement papers. Practicing these will help candidates prepare effectively for the Persistent Systems test.
The Persistent Systems placement test consists of 60 questions to be answered in 60 minutes. It includes 5-8 aptitude questions, while the rest are based on Computer Science subjects, such as:
After the written test, candidates must clear the coding and essay writing round. For details, refer to the Persistent Systems Recruitment Process & Test Pattern.
Question: A, B, and C entered into a partnership with their capitals in the ratio 1/3: 1/4: 1/5. A withdraws half of his capital after 4 months. If the total annual profit is Rs. 847, what is A’s share?
A. Rs. 252
B. Rs. 280
C. Rs. 315
D. Rs. 412
Solution:
Answer: B
Explanation:
Question: A sweet seller sells 3/5th of sweets at a 10% profit and the remaining at a 5% loss. If the total profit is Rs. 1500, what is the total cost price of the sweets?
A. Rs. 36,500
B. Rs. 37,000
C. Rs. 37,500
D. None of these
Solution:
Answer: C
Explanation:
Assume A as the total cost price.
((3/5)×A×(10/100))−((2/5)×A×(5/100))=1500( (3/5) × A × (10/100) ) – ( (2/5) × A × (5/100) ) = 1500
Solving for A: A = Rs. 37,500
Question: A house is sold through multiple buyers, each selling at a profit:
If E’s house costs Rs. 35,00,000, what was the approximate cost price for A?
A. Rs. 15,40,000
B. Rs. 15,10,000
C. Rs. 15,00,000
D. Rs. 16,40,000
Solution:
Answer: D
Explanation:
Let X be the cost price of A’s house. 3500000=X×(1.1×1.15×1.25×1.35)3500000 = X × (1.1 × 1.15 × 1.25 × 1.35)
Solving for X: X ≈ Rs. 16,40,000
Question: The average case occurs in the linear search algorithm when:
A. The item is somewhere in the middle of the array
B. The item is not in the array at all
C. The item is the last element in the array
D. The item is the last element or not in the array at all
Answer: A
Explanation: Complexity analysis is based on how efficiently an algorithm operates. The average case occurs when the item is somewhere in the middle.
Question: In a B+-tree index, what do we maintain for each value?
A. Link
B. Node
C. Root
D. Leaf
Answer: D
Explanation: B+-trees store data in leaf nodes, allowing efficient searches.
Question: What does the following Java code snippet do?
public Object function() {
if (isEmpty())
return -999;
else {
Object high;
high = q[front];
return high;
}
}
A. Dequeue
B. Enqueue
C. Return the front element
D. None of the mentioned
Answer: C
Explanation: The code returns the front element of the queue without removing it.
Here are some coding problems commonly asked in Persistent Systems interviews:
Practicing Persistent Systems placement papers helps candidates understand the question patterns and difficulty levels. Focus on aptitude, data structures, and programming fundamentals for better results.
For more detailed solutions and interview preparation tips, explore Persistent Systems’ official test patterns and coding challenges.