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...
(1 vote)
Those guys will give u the
Those guys will give u the same paper. They haven't changed it since July 2, 2001... coz that was the date written on top of every sheet! There's no negative marking in this paper.
The programming section differed as given in that paper and my paper had 3 questions. All were based on a graph whose Adjacency matrix was given. The graph consisted of various cities of india and it told about the various air routes existing among the cities. The programming has to be done in C, its mentioned there.
1) 5 fill in the blanks. A code with empty blanks and comments was given and we had to fill in the code based on those comments. Its easy, even if u have the basics right.
2) Had to write a function which printed the city with max and min connectivity and took only the adjacency matrix as its argument. Very simple, just sum the values in the row, then print the cities having max and min values u just calculated.
3) The graph was modified in this question and the edges were assigned weights. We had to write a function which printed the cities having the heaviest edges connected to them and also their weights. You should know how to make the weight matrix for this question...
tip: guys at Persistent like Trees, Graphs and Matrices.
Post new comment