Persistent Systems FAQs

01 December 2022


Persistent Systems Frequently Asked Questions

Ask Us Anything !

  • Degree: B.E/ B.Tech
  • 60% throughout 10th , 12th and Graduation
  • Only Computer Science and Infotmation technology students will be eligible.

  • Srujana: 9.0 LPA + 30K (Based on performance)= 9.3 LPA
  • Viveka: 7.5 LPA + 30K (Based on performance)= 7.8 LPA
  • Navayuva: 4.71 LPA + 30K (Based on performance)= 5.01 LPA

1) Strong in data structures and algorithms. Solid grasp of a few topics from the curriculum (Like RDBMS, N/W, OS, SDLC etc.)

2) Good in one programming language.

3) Awareness of the project domain.

4) Demonstrates willingness to learn new technologies.

5) Ability to take code level technical decisions.

6) Ability to solve technical problems in a correct and timely fashion

7) Writes technical documents/emails (audience: peers and immediate manager)

8) Should be able to explains own work in client/colleague’s telecommunication

9) Excellent written and verbal communication.

10) Excellent customer orientation.

11) Analytical skills and Innovative and Individual contributor.

  1. Level 1 package: 4.71 LPA + 30K (Based on performance)= 5.01 LPA
  2. Level 2 package: 7.5 LPA + 30K (Based on performance)= 7.8 LPA
  3. Level 3 package: 9.0 LPA + 30K (Based on performance)= 9.3 LPA

These packages depends on clearance of online examination at different levels.

Section A:

  1. Objective Test (20 Min)
  2. English Language Test (15 Min)
  3. Logical Ability Test (15 Min)
  4. Basic Programming (45 Min)

Section B:

  1. Advance Coding (60 MIn)

Section C:

Technical + HR Interview

  • DBMS
  • Basic concept, Data model, Views, Operation, TRC, DRC, Architecture
  • Computer Architecture
  • Operating Systems
  • SQL
  • ERD, Key, Database, SQL, Joins, Indexing
  • DSA
  • Advanced SQL
  • Computer Network
  • Reference Network Model and Protocols, Routing
  • Computer Architecture
  • Input/ Output

  • Data arrangement
  • Odd man out
  • Directions
  • Coding-Decoding
  • Syllogism
  • Blood relation

  • Grammar
  • Error spotting
  • Synonyms
  • Antonyms

  • Automata
  • OOPS concepts
  • Data Types
  • Iteration, Recursion, Decision
  • Procedure, functions and scope
  • Complexity Theory
  • Arrays, Linked Lists, Trees, Graphs
  • Stacks, Queues
  • Hash Tables
  • Heaps
  • Searching and Sorting