Skip to content

Persistent Systems Online Assessment

Overview

Here is how public prep guides and student write-ups describe the Persistent Systems online assessment. This is not an official company brochure.

Martian internship-to-PPO pathway with staged training assessments is a distinctive campus pattern reported for Persistent.

Usual selection rounds

Rounds students usually mention: Online assessment (aptitude + CS fundamentals + coding) → Technical interviews → Communication / SVAR (Amcat reported in Martian path) → HR

Item From student reports
Platform AMCAT / Cocubes mentioned in secondary guides; Martian GFG account describes aptitude+logical+CS fundamentals MCQs plus 2 coding questions
Online test summary Product-engineering flavoured filter: aptitude/verbal/logic plus a coding section that candidates say carries more weight than at mass-service firms. Some drives club everything; others separate coding.
Eligibility notes Drive-specific; confirm notification
Branches (reported) Typically CS/IT and related for software tracks

Online test sections

Section Questions Time Notes
Aptitude / logical / verbal ~15-20 each (from student reports estimates) drive-specific PapersAdda aggregates AmbitionBox/Shiksha style estimates - check your college placement email
Coding 1-2 (sometimes 2 in Martian assessment) - Easy-medium; language track matters in Martian training assessments (Java or Python)

Extra notes from sources

  • Martian Program: weekly training assessments then final MCQ+2 coding for PPO shortlist.

Sample practice question styles

These are practice questions for speed - not claimed to be from a real Persistent Systems live paper.

Coding Q1: 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

Persistent Systems 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: Move zeros

Problem: Move all zeros in an array to the end while keeping the relative order of non-zero elements.

Approach: Two pointers: write non-zeros toward the front, then fill the remainder with zeros. Or swap zeros as you scan.

Complexity: O(n) time, O(1) space

Persistent Systems 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: Rotate array

Problem: Rotate an array to the right by k steps. Example: [1,2,3,4,5,6,7], k = 3 → [5,6,7,1,2,3,4].

Approach: Normalize k %= n. Reverse the whole array, reverse the first k elements, then reverse the rest. That yields the rotation in place.

Complexity: O(n) time, O(1) space

Persistent Systems 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: First unique character

Problem: Find the first non-repeating character in a string and return its index, or -1 if none exists.

Approach: Count frequencies in one pass (hash map or array of 26 for lowercase). Second pass returns the first index with count 1.

Complexity: O(n) time

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

Prep tips from those student reports

  1. Prioritise coding correctness for the product-engineering filter
  2. Be ready to defend projects and CS fundamentals in tech rounds
  3. Practice a timed communication/SVAR style speaking test if on Martian/Amcat path

Sources

These notes come from public reports and can differ by campus, year, and role. If your college placement email or the official careers/notification PDF says something different, follow that.

Comments & Suggestions

Similar companies

Hexaware · Coforge · Thoughtworks · Mphasis · LTTS