Interview experience
Persistent Systems Interview Questions and Answers (2026)
Overview
Section titled “Overview”Persistent’s core loop is a compact 3-4 round process, but a distinctive Martian internship-to-PPO pathway adds weeks of training and staged assessments before the final technical and HR rounds for some intake.
Persistent Systems interview process at a glance
Section titled “Persistent Systems interview process at a glance”| Round | Duration | What they test |
|---|---|---|
| Online Test | 60-90 min | CS fundamentals MCQs + aptitude/reasoning + 2 coding problems |
| Technical Interview (L1) | 45 min | DSA, OOP concepts, coding |
| Technical Interview (L2, some roles) | 30-45 min | Deeper problem-solving, project discussion |
| HR Interview | 15-20 min | Fit, offer discussion |
Online Test
Section titled “Online Test”CS fundamentals MCQs, aptitude/reasoning, and 2 coding problems - the coding problems carry the most weight toward clearing this stage.
Common questions
- C/C++/Java fundamentals MCQs
- OS, DBMS, and computer-networks MCQs
- Two easy-to-medium coding problems (arrays, strings, basic logic)
- Aptitude and logical-reasoning questions
Technical Interview (L1)
Section titled “Technical Interview (L1)”A DSA and OOP-focused round with live coding, roughly 45 minutes.
Common questions
- Implement and explain time/space complexity for arrays, linked lists, stacks, and queues
- OOP concepts - inheritance, polymorphism, encapsulation - with real-world examples
- Live coding on an easy-to-medium problem
- Basic project discussion
Technical Interview (L2, some roles)
Section titled “Technical Interview (L2, some roles)”A second, deeper technical round for select roles - more problem-solving pressure and a closer look at your project work.
Common questions
- A harder coding problem than L1, sometimes with follow-up optimization
- Deeper project walkthrough - design decisions, trade-offs, what you’d change
- Scenario-based problem-solving questions
Round-by-round breakdowns are on the Persistent Systems interview experience page.
HR Interview
Section titled “HR Interview”A short, 15-20 minute closing conversation on fit, motivation, and the offer.
Common questions
- Tell me about yourself
- Why Persistent Systems?
- Persistent positions itself as a product engineering partner rather than pure IT staffing - what does that distinction mean to you, and why does it appeal to you?
- Describe a project where you had to pick up a new technology quickly to deliver for a client or team
Sample answer frameworks for each of these are on the Persistent Systems HR interview questions page.
The Martian program: internship-to-PPO pathway
Section titled “The Martian program: internship-to-PPO pathway”Persistent’s reported Martian program is a distinctive campus pattern: rather than a single interview day, selected candidates go through a roughly 6-week internship with weekly MCQ checkpoints, then a final assessment (MCQs plus 2 coding problems in a Java or Python track they choose), a technical interview, a separate SVAR spoken-communication test on the Amcat platform, and an HR round covering hobbies, interest in CS, knowledge of Persistent, and relocation readiness - only after all of that does a pre-placement offer get decided. If your college mentions “Martian,” expect a multi-week commitment, not a single-day process.
Common technical interview questions and answers
Section titled “Common technical interview questions and answers”Q: Explain the four OOP concepts with a real-world example each.
Encapsulation bundles data with the methods operating on it and hides internal state - a BankAccount exposes deposit() and withdraw() but keeps balance private so no caller can set it directly. Abstraction exposes only the essential interface: a Vehicle abstract class declares start() without specifying whether the engine is petrol or electric. Inheritance lets a subclass reuse a base type’s members, as when SavingsAccount extends Account and adds interest calculation. Polymorphism lets one reference invoke many implementations, so a loop over Shape objects calls the right area() at runtime through dynamic dispatch. Persistent’s L1 round asks explicitly for real-world applications, so attach an example to every pillar rather than reciting definitions.
Q: Compare arrays and linked lists on time and space complexity.
An array stores elements in contiguous memory, so random access by index is O(1), but inserting or deleting in the middle is O(n) because subsequent elements must shift, and resizing requires allocating a new block and copying. A linked list stores nodes with pointers, so insertion or deletion at a known position is O(1), but access by index is O(n) since you must traverse from the head. Arrays have better cache locality, which often makes them faster in practice even where the asymptotic complexity looks worse. Linked lists also carry per-node pointer overhead, costing extra memory that arrays do not.
Q: How do you implement a queue using two stacks?
Keep an inStack for enqueues and an outStack for dequeues. Enqueue always pushes onto inStack in O(1). Dequeue checks outStack: if it is empty, pop every element from inStack and push it onto outStack, which reverses the order so the oldest element ends up on top, then pop from outStack. Each element is moved at most twice across its lifetime, so dequeue is O(1) amortised even though a single dequeue can cost O(n). Space is O(n) overall.
Q: What are storage classes in C, and what does static actually do?
C has four storage classes: auto (the default for local variables, stored on the stack and destroyed at scope exit), register (a hint to keep the variable in a CPU register, so you cannot take its address), static, and extern. A static local variable is allocated in the data segment rather than the stack, so it retains its value between calls to the function while remaining visible only inside that function. A static global variable or function has internal linkage, meaning it is visible only within its own translation unit - the standard way to keep a helper private to one .c file. extern declares that a symbol is defined in another translation unit without allocating storage for it.
Q: What is deadlock, and what conditions must hold for it to occur?
Deadlock is a state where each process in a set holds a resource and waits for one held by another, so none can ever proceed. All four Coffman conditions must hold simultaneously: mutual exclusion (a resource cannot be shared), hold and wait (a process holds one resource while requesting another), no preemption (a resource cannot be forcibly taken back), and circular wait (a cycle exists in the wait-for graph). Breaking any single condition prevents deadlock - the most practical technique is imposing a global ordering on lock acquisition, which eliminates circular wait. Operating systems can also avoid deadlock dynamically with Banker’s algorithm, or detect and recover by aborting a victim process.
Q: What is normalization, and what do 1NF, 2NF and 3NF require?
Normalization structures tables to remove redundancy and the insert, update, and delete anomalies it causes. 1NF requires atomic values in every column with no repeating groups - no comma-separated list in a single cell. 2NF additionally requires that every non-key attribute depend on the entire composite primary key rather than only part of it, eliminating partial dependencies. 3NF removes transitive dependencies, so a non-key attribute must not determine another non-key attribute - keeping department_name next to department_id in an Employee table breaks it. Data warehouses deliberately denormalise back toward a star schema, because for read-heavy analytics the join cost outweighs the redundancy cost.
Q: What is the difference between TCP and UDP?
TCP is connection-oriented: it performs a three-way handshake (SYN, SYN-ACK, ACK), numbers every byte, acknowledges receipt, retransmits lost segments, reorders out-of-sequence data, and applies flow control via a receive window plus congestion control. That reliability costs latency and header overhead - 20 bytes minimum versus UDP’s 8. UDP is connectionless and simply sends datagrams with no handshake, no acknowledgement, no ordering, and no retransmission, so it is faster and has lower overhead but can lose or reorder packets. Use TCP for HTTP, email, and file transfer where correctness matters; use UDP for DNS lookups, live video, VoIP, and gaming where a late packet is worse than a lost one.
Q: Reverse a linked list. What is the iterative approach and its complexity?
Use three pointers: prev starting at null and curr at head. In each iteration, store curr.next in a temporary variable, set curr.next to prev, then advance prev to curr and curr to the temporary. When curr reaches null, prev is the new head. This is O(n) time and O(1) space, which is the answer interviewers want. The recursive version recurses to the tail and rewires on the way back, still O(n) time but O(n) stack space, so offer the iterative version first and mention recursion as the alternative.
Frequently asked questions about Persistent Systems interviews
Section titled “Frequently asked questions about Persistent Systems interviews”What is the Persistent Systems interview process for freshers?
Persistent typically runs 3-4 rounds: 1. An Online Test (60-90 minutes) - CS fundamentals MCQs (C, OS, DBMS, computer networks), aptitude/reasoning, and 2 coding problems that carry the most weight. 2. A Technical Interview (L1, ~45 minutes) - DSA, OOP concepts, and coding. 3. A second Technical Interview (L2, 30-45 minutes) for some roles - deeper problem-solving and project discussion. 4. A short HR Interview (15-20 minutes) on fit and offer discussion. Total process usually wraps up in 1.5-3 hours on interview day. Some intake, notably the Martian internship program, adds a multi-week training-and-assessment stage before these final rounds.
What questions are asked in Persistent Systems interviews?
Expect CS fundamentals MCQs (C/C++/Java, OS, DBMS, computer networks), 2 easy-to-medium coding problems, OOP concept questions (inheritance, polymorphism, encapsulation) with real-world applications, and data structure questions on arrays, linked lists, stacks and queues including time/space complexity.
How many rounds are there in the Persistent Systems interview?
Most freshers go through 3-4 rounds: an Online Test, one or two Technical Interviews, and a brief HR round. Some drives add an Advanced Coding round or ‘Super Achiever Test’ depending on the role applied for.
What is Persistent’s Martian program?
It’s a reported internship-to-PPO pathway: after clearing the initial online assessment, candidates go through a roughly 6-week internship with weekly MCQ checkpoints, then a final assessment (MCQs plus 2 coding problems in a chosen Java or Python track), a technical interview, a spoken-English communication test (SVAR, run on the Amcat platform), and finally HR - before a pre-placement offer is decided.
Does Persistent test spoken English separately from the technical rounds?
For candidates on the Martian pathway, yes - there’s a dedicated SVAR (speech/versant-style) communication assessment on the Amcat platform between the technical interview and HR round, separate from the coding and CS-fundamentals evaluation.
How should I prepare for Persistent Systems interviews?
Revise core CS subjects (OS, DBMS, networks, OOP), practice easy-to-medium coding problems since they carry heavy weight in the online test, and be ready to explain how you’d pick up a new technology quickly - Persistent positions itself as a product engineering partner to clients, not just a staffing vendor, so that framing helps in the HR round.