Persistent Systems
First Round,, (written objective)
>Simple Aptitude(10 ques)
>data Structure(10)
>O.S.
>DBMS
Second round (subjective)
>Three Programs were there..
data structure
Out of 940... 9 were shortlisted for Development part & 20 for Testing Part. After that Real Coutdown begins,,,
Third Round(Technical 1)
Persistent needs core tech guys....They asked everything about data structure....most of the guys are rejected from this. this round ...luckily I made it.....now in development 6 were left for round 4..& in testing 14..
Now In fifth round they asked everything about ur project...tech skills...as I hv wrote servlets in CV ..they asked lot of things in itThey told us to design program for sudoku.....Now from this round only 2 were selected for HR. in Development & 6ere in Testing .....& Final selection 2 for Development & 3-4 for testing............finally after a long hurdle I made a comp of repo.......this comp has very very high rejection ratio..after all they wont give 3.4 lakh /annum easily.....All the best to all...
(2 votes)
Test Paper :2 Paper Type
Test Paper :2
Paper Type : General - other
Test Date : 15 February 2007
Test Location : Badnera(PRMIT)Engg college,Amravati
Posted By : Ajay KK
PERSISTENT PAPER ON 15th FEBRUARY
Hello guys
I appeared for persistent campus.
Appered 132
Shortlisted 20
After 2 TI.
Selected : Only One!!! (Hmhhh!!!! That's not me) The first test was of 30marks & had 60 minutes & no -ve marking. But, remember that they tell you: "No -ve marking ,so that you can attempt all!" But it's their trick they want to eliminate candidates who Guess options (what we call as Tole,or Tukke)
C ques was on pointers & arrays, Macros,Scope of variables. Plz read probability also.(Throwing dice & coins , cards Plz note, they will also collect your rough sheet along wih answer sheet & i think it's also some strategy.
2nd test was on programming 2 programs have to be wrtitten 1) Binary Tree Sort (assume tree is there & use 'inorder' traversal. ) 2)Finding element in array (Use Binary search if given array is 'sorted') They focus on complxity also.
1St TI
Asked all basic of DS , focus was on Link list ,trees.& OOPs concept.
2nd TI
They ask to write programs for linklist,quicksort, e.t.c.
HR
Be prepared with all of DS & sorting algos. They love linklist.
Post new comment