Filter
Oil India Limited Placement Papers Ramco Placement Papers Rockwell Placement Papers3i Placement PapersABB Placement PapersAccel Frontline Placement PapersAccenture Placement PapersAcumen Software Placement PapersAditi Placement PapersAdobe Placement PapersADP Placement PapersAgile Placement PapersAgreeya Placement PapersAIG Placement PapersAkamai Placement PapersAks Software Systems Placement PapersAlcatel Placement PapersAllahabad Placement PapersAlle Placement PapersALLFON Placement PapersAlter Placement PapersAlumnus Placement PapersAmdocs Placement PapersAMI Placement PapersAndhra Bank Placement PapersANZ Placement PapersAppLabs Placement PapersAricent Placement PapersASDC Placement PapersAshok Placement PapersAshok LeyLand Placement PapersAspire Placement PapersASPNET Placement PapersAST Pvt Ltd Placement PapersAsto Placement PapersAtlas Placement PapersAxentis Soft Placement PapersAxes Placement PapersAztec Placement PapersBAAN Placement PapersBajaj Placement PapersBank Of Maharashtra Placement PapersBARC Placement PapersBEL Placement PapersBEML Placement PapersBently Placement PapersBFL Placement PapersBHEL Placement PapersBirlasoft Placement PapersBlueStar Placement PapersBOB Placement PapersBOSCH Placement PapersBPL Placement PapersBrakes Placement PapersBSNL Placement PapersC-DOT Placement PapersCadence Placement PapersCalsoft Placement PapersCampaq Placement PapersCanarys Placement PapersCapgemini Placement PapersCaritor Placement PapersCarrizalsoft Technologies Placement PapersCarrizalsoft Technologies Pvt Ltd Placement PapersCaterpillar Placement PapersCD Placement PapersCDAC Placement PapersCelstream Placement PapersCGI Placement PapersChangepond Placement PapersChatargee Placement PapersCisco Placement PapersCiticorp Placement PapersCMC Placement PapersCOGNIZENT Placement PapersComputer Placement PapersConsagous Placement PapersConsagous Technologies Placement PapersConvergys Placement PapersCORDYS Placement PapersCOSL Placement PapersCovansys Placement PapersCrompton Placement PapersCSC Placement PapersCTS Placement PapersDaimler Placement PapersDell Placement PapersDeloitte Placement PapersDelphi-tvs Placement PapersDeutsche Placement PapersDharma Placement PapersDigital Placement PapersdMtechnologies Placement PapersDot Placement PapersDot Com Infoway Placement PapersDRDO Placement PapersDSL Placement PapersDSQ Placement PapersDSRC Placement PapersE2E Placement PapersEasyTech Placement PapersEDS Placement PapersEFFIGENT Placement Papersefunds Placement PapersEIL Placement PapersELGI Placement PapersELICO Placement PapersEnercon Placement PapersEpson Placement PapersEricssion Placement PapersEssar Placement PapersFCG Placement PapersFidelity Placement PapersFlextronics Placement PapersForbes Placement PapersFORCE Placement PapersFuture Placement PapersFX Placement PapersFX Labs Placement PapersG2One Network Private Limited Placement PapersGDA Placement PapersGE Placement PapersGenpact Placement PapersGeodesic Placement PapersGeometric Placement PapersGlobal Placement PapersGodrej Placement PapersGoogle Placement PapersGrapcity Placement PapersGSSL Placement PapersHAL Placement PapersHCL Placement PapersHCL Technologies Placement PapersHello Placement PapersHexaware Placement PapersHFCL Placement PapersHindustan Placement PapersHo Placement PapersHoneywell Placement PapersHorizon Placement PapersHP Placement PapersHPCL Placement PapersHSBC Placement PapersHuawei Placement PapersHughes Placement PapersI-Flex Placement PapersI-Gate Placement Papersi2 Placement PapersIBM Placement PapersIBPS Placement PapersIBS Placement PapersICICI PO DRIVE Placement PapersIDBI Placement PapersIikanos Placement PapersIindus Placement PapersIkosindia Placement PapersImpetus Placement Papersinautix Placement PapersIndian Overseas Bank Placement PapersIndusTeqsite Placement PapersInfineon Placement PapersInformatica Placement PapersInfosys Placement Papersinfotech Placement PapersInphlox Placement PapersIntec Placement PapersIntegra Placement PapersIntegraphr Placement PapersInterwoven Placement PapersIntex Placement PapersIOCL Placement PapersIonnor Solutions Placement PapersiSoft Placement PapersIspat Placement PapersISRO Placement PapersIttiam Placement PapersIvega Placement PapersJ&B Placement PapersJataayu Placement PapersJean Placement PapersJean Martin Placement PapersJet Placement PapersJEYPEE Placement PapersJindal Placement PapersJKT Placement PapersJOHN Placement PapersKalam Software Technology Placement PapersKanbay Placement PapersKeane Placement PapersKenexa Placement PapersKkshema Placement PapersKleward Placement PapersKnoah Solutions Placement PapersKPIT Placement PapersKPIT Cummins Placement PapersL&T Placement PapersL&T Infotech Placement PapersL&T(EEC) Placement PapersLCube Placement PapersLG Placement PapersLG Soft India Placement PapersLifetree Placement PapersLinkwell Placement PapersLionBridge Placement PapersLogica Placement PapersLucent Placement PapersM-Phasis Placement PapersMA Placement PapersMANGANESE Placement PapersMascot Placement PapersMastek Placement PapersMatrix Placement PapersMAXSOFT Placement PapersMcAfee Placement PapersMECON Placement PapersMentor Placement PapersMerrill Placement PapersMicrosoft Placement PapersMindfire Solutions Placement PapersMindtree Placement PapersMiraclesoft Placement PapersMistral Placement PapersMotorola Placement PapersMTNL Placement PapersNagarro Placement PapersNalko Placement PapersNCR Placement PapersNess Placement PapersNest Placement PapersNewgen Placement PapersNFL Placement PapersNHPC Placement PapersNihilent Placement PapersNIIT Placement PapersNovartis Placement PapersNovell Placement PapersNTPC Placement PapersNucleus Placement PapersNYROS TECHNOLOGY Placement PapersOil Placement PapersONGC Placement PapersOnline Education Placement PapersOnMobile Placement PapersOracle Placement PapersOrange Placement PapersParagon Placement PapersPCS Placement PapersPDIL Placement PapersPentaware Placement PapersPentaware Tech Placement PapersPerot Placement PapersPersistent Placement PapersPhilips Placement PapersPlanetasia Placement PapersPNESTEC Placement PapersPolaris Placement PapersPoor Placement PapersPramati Placement PapersProdEx Placement PapersPSI Placement PapersQuark Placement PapersQuinnox Placement PapersQwest Placement PapersR Placement PapersRamco Placement PapersRapidigm Placement PapersRBI Placement PapersRedpine Placement PapersReliance Placement PapersReliance(RIL) Placement PapersRinl Placement PapersRipples Infolink Placement PapersRobert Placement PapersRobert Bosch Placement PapersRockwell Placement PapersRRB(Railway Placement PapersRRB(Railway Recruitment Board ) Placement PapersRSsoftware Placement PapersSahi Placement PapersSail Placement PapersSamsung Placement PapersSamtel Placement PapersSAP Placement PapersSapient Placement PapersSasken Placement PapersSatyam Placement PapersSBI Placement PapersScandent Placement PapersSchneider Placement PapersSCT Placement PapersSemanticSpace Placement PapersShriram Placement PapersSIEMENS Placement PapersSierra Placement PapersSkyTECH Placement PapersSLK Software Placement Paperssobha Placement PapersSoftSol Placement PapersSonata Placement PapersSony India Placement PapersSQL Placement PapersSQL Star Placement PapersSSC Placement PapersStarent Placement PapersStarent Networks Placement PapersSTMicroelectronics Placement PapersSubex Placement PapersSUN Placement PapersSuther Placement PapersSynergy Placement PapersSynopsys Placement PapersSyntel Placement PapersSystech Solutions Placement PapersTalisma Placement PapersTata Placement PapersTata Technologies Placement PapersTavant Placement PapersTCE Placement PapersTCS Placement PapersTech Placement PapersTech Mahindra Placement PapersTELCO Placement PapersTelserra Placement PapersTEMNOS Placement PapersTesco Placement PapersTexas Placement PapersThermax Placement PapersThink Placement PapersTHOROGOOD Placement PapersThoughtWorks Placement PapersTIL Placement PapersTISL Placement Paperstorry Placement PapersTriad Placement PapersTriam Placement PapersTrianz Placement PapersTrilogy Placement PapersTSPL Placement PapersTVS Placement PapersUbiNetics Placement PapersUnited Placement PapersUnited Health Group Placement PapersUS Placement PapersValueLabs Placement PapersValueOne Placement PapersVariFone Placement PapersVedanta Placement PapersVerchaska Placement PapersVERITAS Placement PapersVerizon Placement PapersVernalis Placement PapersVirtusa Placement PapersVisual Placement PapersVIT Placement PapersVizag Steel Plant Placement PapersVizual Placement PapersVSNL Placement PapersVsworx Placement PapersWBPDCL Placement PapersWepIndia Placement PapersWilco Placement PapersWipro Placement PapersXansa Placement PapersXcino Placement PapersYahoo Placement PapersYantro Placement PapersYASH Placement PapersZenith Placement PapersZenser Placement PapersZTE Placement Papers

Download persistent Placement Papers in MS Word and PDF Format for Job Interview

List of all download persistent placement papers in ms word and pdf format for job interview. Click Here View Job List. This page will help you to get all details about download persistent placement papers in ms word and pdf format for job interview. Download persistent placement papers in PDF and Ms word format. Latest and persistent last 5 years placement papers with solutions pdf download for campus job.

Persistent Placement Paper : Persistent Placement Paper Banglore 15 October 2012

Persistant ROUND 1: APTITUDE ROUND

It was less aptitude round but more technical round. It consisted 60 question 60 minutes an online test on software developed by persistent only (Testmate).
It consisted 5 logical questions ,2-3 quantitative questions ,Technical questions from OS,DBMS,Testing,CNT,Data Structure (mostly on trees,inorder,postorder,preorder).About 8-10 questions on C (quiet easy).
Basically they focus on all engineering syllabus covered for IT or CS stream.
Having done this, A problem statement was given based on file handling and we were told to write the code for it in 10 min.
After this a topic was given and we were told to write a passage on it “ India a land of Opportunities”.

The results for this round was declared at the end of the day and about 42 students cracked it to face the chain of interviews on the second day. Even i cleared it and it was a great feeling of clearing the apti after 3 unsuccessful attempts in Aptitude rounds. Now,I had decided to get the best from dis opportunity.

Persistant ROUND 2: Technical interview 1

Every1 was tensed bcoz persy is tough in technical and is very different from its seniors like TCS,Infy where technical interviews are cake walks. Now the interview started and the panel was very strict no 1 was allowed to talk o others or share questions after interview,Some were directly told dat they wer rejected 4m TI1 .My no was quite late and i went inside 1ce i was called. One NE guy was waiting 4 me and greeted me warmly. He asked me about if i had lunch and then he bombarded me with questions.
1. Tell me something about urself and projects u hav done .
2. Explain briefly the mini project.
3. Draw flow diagram for ur project and explain it in brief
4. Asked some questions in my project and its working
5. VB features used in project also about some basics of VB
6. Then he shifted to my BE project and got the basic idea of the project
7. After this question came favourite PL – i said C
8. No of questions on C- Sructures,pointers,LLs,... ...
9. Then OOPS principles ,inheritance,struct vs class
10. Then came DS, sorting techniques ,quicksort xplain .
11. Then came bit OS process threads
12. 2 puzzles – which i did nt answer very well

Then my interview was almost done and i was asked questions if any i asked few then i was asked to wait for some time in a room
Som of students wer then called and told dat they wer rejected and i had big butterflies in stomach but then i was called and sent to a room where a senior lady was waiting 4 me and yes, it was my TI2

Persistant ROUND 3: Technical Interview 3

The lady sitting was very senior and was very thorough with concepts and was 2 practical
1. Asked me to tell something about myself nd my last completed project .
2. Again i told her in brief and explained her some functionalities
3. Then she told me if there wer ny business analalysis used in my project and being a very basic project we had hardly included any then she asked me if i could suggest any on the same project.
4. After that she asked me about my fav subject I told –System softwares and then she told me to tell nything bout dat and work i had done bout dat . i told bout the 2 pass assembler i had done and xplained her in brief
5. Then she switched a bit to DBMS
6. Then we had a very casual talk about the engg studs and the syllabus
And then she asked me 2 wait again 4 further instructions . I was very tensed bcoz 4 me dis round was’nt dat easy or comfortable and the lady der was seeming really strict.But thankfully i was called for the next interview ie HR within few minutes

Persistant ROUND 4: HR

I was initially given a HR form to be filled and i was really happy to fill dis data , den som of my friend volunteers told me dat if i would give a decent HR i would definitely be in. So i was all prepared and 1ce called i went in, with all confidence to give the best shot .
Actually the HR was quiet busy and was sorting some papers and then he started my interview simultaneously
He asked me some basic quests like
1. Tell me somtihng bout urself
2. How was the procedure uptill now
3. Family background
4. Where do u blong to
5. Plan for higher education
6. Questions asked by me in prev interview nd ans got 4m the panel
And my HR got over in hardly 5 mins

Finally after completing all dis long recruitment procedure 1 was waiting eagerly 4 the results which wer to be announced on the next day.
I checked my phone 4 msgs or calls a thousand times or mailbox 4 hundreds of times, but in vain.
But a call came to me by 1 of my friend who told dat i was selected and i called our TPO and confirmed the news i was on cloud 9 and i informed all my dearer ones and every1 was delighted.
It was gud to here a positive feedback bout company 4m many of them and i thought that it was worth waiting.

Persistent Placement Paper : Persistent Placement Paper Dr.BATU Lonere 19 December 2011

Placement Papers Company Profiles | Test Patterns | Contribute Placement Papers
Persistent : Test Paper

The number of viewers:1820 reads

Previous Papers

Paper Type : Candidate-Experiences
Test Date : 19 Dec 2011
Test Location : Dr.BATU, Lonere
Posted By : vijay gade
Persistent placement paper
Persistent recruitment process and aptitude test experiences

Persistent Aptitude test,Persistent Off and On campus recruitment experience for fresher job,Persistent latest test pattern,written test procedure,Persistent Technical and Hr interview procedurre,Persistent recruitment process


HI friends,
Persistent visits our campus on 20th Dec, 2011. There was pre-placement talk @ 8am. The recruitment process consists of THREE rounds and each round was elimination round.

1. Aptitude Test

2. Technical interview

3. HR interview


1. Aptitude test was online and was from 10am to 11.30am. They had prepared separate papers for entc and IT+comp. Nearly 90 candidates were giving aptitude test. It consists of three parts
a. Objective type questions (60que, 60marks, 60min. )-For entc all 60 questions were from quantitative aptitude and for others they have included technical questions.
b. Puzzle for entc and others have to write code in c.(20marks, 20min.)
c. Essay- My topic was “INDIAN MEDIA”(10 marks, 10min.)
Within 15min. they declared result of aptitude test.

Only 13 students were able to crack the aptitude and only 2 from entc and luckily I was one of them.
They announced schedule for technical interview, which starts from 12. My slot was @ 2.30pm and I was last candidate for technical interview but it actually starts @ 5pm.

2. Technical interview-
There were two panels. I don’t know what I call myself but both panels interviewed me and it lasts for more than hour.
Me- Good afternoon sir

Panel 1 -It’s already Good evening. Anyways Vijay tell me some exciting moments of your life.

Me- Blah…Blah…

Panel 1 - Good. I know you are not from technical background but you might have learn c, I think in first year.

Me- Yes sir, in second semester.

Panel 1- so, try to recall that and tell me about recursion.

Me- blah…blah…

Panel 1 - Good. Can you write code to find factorial using recursion??

Me- I am not sure but I will try.

Panel 1- That’s great. Give your best shot and let me know where you will get problem.
Me- (wrote but incorrectly)

Panel 1- (corrected it) Okay, it’s fine.

(Looking in to online aptitude paper) so, you have solve that puzzle.(ask question on that)

Panel 1- Well, I will give you another interesting puzzle.(given)

Me- (solved but half)

Panel 1- (solve completely) My friend want to have word with you.

Panel 2 –so (looking into my resume) Vijay, if I give you stapler and asks to test it. How will you do that??

Me- blah…blah…

Panel 2- What else

Me- blah…blah…

Panel 2- Whatever you have told me was correct but I want more accurate.

Me- blah…blah

Panel 2- Ok. Do you know how lift is tasted??

Me - no sir.

Panel 2- You will be surprised. (Told)

Panel2-why most of the manholes are circular in shape??

Me-(I was surprised by the kind of question but managed to told something but he was not satisfied by my ans)

Panel 2- You got distinction in x, xii till 4th sem but second class in last sem. Why??

Me- blah…blah…

Panel 2- (Again looking into my resume) you are good @ sports. So, why don’t you make carrier in sports??
Me- blah…blah...

Panel 1- I am done with you. You can go now.
Me- Thank you, sir.

After 2min. I got HR form and I was only 3rd from 13 candidates who got that form. I got call for HR interview after 5min.

HR- Please have a seat.

Me - Good evening, sir. Thank you, sir.

HR- Tell me something about yourself.

Me- (Told)

HR- Tell me your three –ve points.

Me- (told)

HR- Do you know testing??

Me- Not actually but I will learn.

HR- If you don’t know anything about testing, then how we should believe you.

Me- (told about testing.)

HR- Good.

HR- Do you have any questions??

Me- (asked some)

HR- fill the form FATAFAT and submit it to me immediately.

Me-ok, sir. Thank you, sir.

HR interview lasts for 10min. only. They told us that they will mail the result tomorrow. Finally they select all three(2 comp and 1 entc), who appear for HR interview and I am lucky enough to get selected.
Best of luck guys. After all luck matters everywhere.

Persistent Placement Paper : PERSISTENT Placement Papers July 2012

If there r n processes and each process waits p time in waiting state then cpu utilization is-:

a) n(1-p)

b) n*p

1. A string of pages were given and no of page faults have to be found in LRU algorithm

2. here is a file server which provides locking for mutual exclusion . if any procees locks the file

and abruptly terminated this will result in indefinitely locking .The solution they found is to

implement a timer for locking of file i.e. if time outs then server assumes that file is indefinitely

locked and terminate the process -

a) this solution is perfect for mutual exclausion

b) this will solve indefinite locking

c) this will result in interleaving of file between processes

d)

3. A critical section is -

ans a set of instruction which is shared by many proceeses

4. There was a question on automata ans - the resultant string will have even no of c

5. CFG was given

S -> 1 S 1

S-> 0 S 0

S -> 1 1

S -> 0 0

Find out the string

6. One singly circular ordered list is there if M elements are ti be inserted what will be the

complexity of time

a) O(M*N)

b) O(M*(M+N))

c) O ((M+N) * log(M+N))

d)

7. find postfix and prefix of

A + B * ( C + D ) / E + F

8. Find out shortest path from A to B

A B C D E

A 0 m

B m 0 2 2 m

C 0 5

D 0 6

E 0

9. From the following when 43 will not be found by binary search (a series was given with last

element 43 in each)

10. From 100 - 999 find the prob. Of getting 3 digit no with no 7 in any of its digit

a) 18/25

b) 10/25

c) 729/1000

d)

11. from the set {a,b,c,d,e,f} find no of arrangements for 3 alphabet with no data repeated

12. To save space which option is better

a) write all join operation than select than project

b) ---------,,------------------than project----select

c) ----------,,-----------------in b/w select and project

Employee = { e_no , salary, fname, lname}

Works_On = {e_no, p_no, hrs}

Project = {p_no, p_name}

14.select e_no from Employee where salary = salary

a) query invalid

b)

15.Select fname ,lname from Employee where e_no in (select e_no from works_on where p_no

=(select * from project))

a) name of Employee who works on all project

b)

c)

d)

16.B tree is different from other

a) has fixed index file size

b) is better for queries like < <= > >=

c) searching will be easy

d)

17.func(char *s1,char * s2)

{

char *t;

t=s1;

s1=s2;

s2=t;

}

void main()

{

char *s1="jack", *s2="jill";

func(s1,s2);

printf("%s %s ",s1,s2);

}

OUTPUT jack jill

18.void main()

{

int a[5] ={1,2,3,4,5},i,j=2;

for (i =0;i<5;i++ )

func(j,a[i]);

for (i =0;i<5;i++ )

printf("%d",a[i]);

}

func(int j,int *a)

{

j=j+1;

a=a+j;

}

19.oid main()

{

for (a=1;a<=100;a++)

for(b=a;b<=100;b++)

foo();

}

foo()

{ }

how many times foo will be called.

a) 5050

b) 1010

c)

d)

20.A hash table has a sie of 11 and data filled in its position like{3,5,7,9,6}how many comparisons

have to be made if data is not found in the list in worst case

a) 2

b) 6

c) 11

d)

21.packet switching is better than circuit switching coz

a) it takes less time

b) it takes less bandwidth

c)

d)

22.addition of two sparse matrix in 3 tuple notation ---time 30 min

24a tree has 1000000 nodes than how many search r required to search a node

a) 25

b)

c)

d)

23.A prgrm to arrange a string in order of occurrence of the character

Persistent Placement Paper : PERSISTENT TECHNICAL PAPER July 2012

1)On which maximum operations cannot be performed .Something like that

a)Array

b)Hash Table

c)Linked List

d)Heap

e)Binary Tree

2)A hash table has a sie of 11 and data filled in its position like{3,5,7,9,6}how many comparisons have

to be made if data is not found in the list in worst case

a) 2

b) 6

c) 11

d)

ANS:- 2

3)Forest with n Trees and having p edges then

a)n(1-p)

b) n = p +2

c) n-p+1

d)

e)

4)Find the shortest path from B to E

ANS: 7

one Question on Postfix.

2ndSECTION (C LANGAUGE)

1) what is int(*(*ptr (int))(void)

a)Pointer to function with no arguments(void) and return pointer to integer.

b)----

c)

2)func(char *s1,char * s2)

{

char *t;

t=s1;

s1=s2;

s2=t;

}

void main()

{

char *s1="jack", *s2="jill";

func(s1,s2);

printf("%s %s ",s1,s2);

}

OUTPUT jack jill

3) void main()

{

int a[5] ={1,2,3,4,5},i,j=2,b;

for (i =0;i<5;i++ )

func(j,a[i]);

for (i =0;i<5;i++ )

printf("%d",a[i]);

}

func(int j,int *a)

{

j=j+1;

a=a+j;

b= b+2;

}

OUTPUT: 12345

4) void main()

{

for (a=1;a<=100;a++)

for(b=a;b<=100;b++)

foo();

}

foo()

{ }

how many times foo will be called.

a) 5050

b) 1010

c)

d)

ANS: 5050

5)A tree was given with nodes assigned clours red, blue, yellow, green and more that one node is

having colour red.They have asked that how many times the output will be red if the total number of

evaluation is 11.

some code was given--I don,t remember that.

3rd Section(O.S)

1) If there are n proceses and each process waits p time in waiting state then cpu utilization is-:

a) n(1-p)

b) n*p

2)No. of pages are given and using LRU algorithm we have to find the number of page faults.

a)2

b)6

c)5

d)7

3)There is a file server which provides locking for mutual exclusion . if any procees locks the file and

abruptly terminated this will result in indefinitely locking .The solution they found is to implement a

timer for locking of file i.e. if time outs then server assumes that file is indefinitely locked and terminate the process -

a) this solution is perfect for mutual exclausion

b) this will solve indefinite locking

c) this will result in interleaving of file between processes

d) will allow the concurrent process to access the file.

4)A critical Section is

a)for mutual exclusion

b)a set of shared resources

5)Match the following.

1)Critical Section a)Mutual exclusion

2)Wait/signal b)Deadlock

3)Working set c)Hoare,s Monitor

4)Semaphore d)

4th Section(TOC)

1)There was a question on automata

2)CFG was given

S -> 1 S 1

S-> 0 S 0

S -> 1 1

S -> 0 0

Find out the string

5th section General

1)Probability to find digits which not contain 7 between 100 to 999

Ans=18/25

2)Difference between Packet switching & Circuit Switching.

Ans= CS take more time to established circuit.

3)in cache memory 100ns an in main memory 1200ns what is the cache hit ratio(Question is not

exactly the same,but something related to cache hit ratio)

4)From the set {a,b,c,d,e,f} find no. of arrangements for 3 alphabets with no data repeated.

ANS=360. OR for 4 alpha ANS=720.

6th section (DBMS)

1)employee(eno,ename) works_on(eno,pno,ename) project(pno, project)

select ename from employee where eno in(select eno from works_on where pno =(select *from

project)

what is the output ?

a)Employee who works on all project.

b)Employee who works one project .

c) name of employee who works on more than one project.



2)Select ename from employee where salary = salary

3)what is the use of B-tree

a) has fixed index file size

b) is better for queries like < <= > >=

c) searching will be easy

4)Question on inner Join returning N- tuples & Full outer Join returns M- tuples. For both Variables are

given & in options relationship is given to find whichever have greater tuples.And variable D is

given------

a)then N= M

b) N = M + D

5) To save space which option is better

a) write all join operation then select then project

b) write all join operation then projects then select

c)write all join operation then select between project

Test 2- Consist of Two Questions. In this we have to make a C program.

Q.1)Inward-spiral order matrix.i.e you have to traverse the matrix in clockwise manner and display the elements,for eg.

1 2 5 4

8 9 7 1

9 7 6 3

2 3 5 8

output should be 1, 2, 5, 4, 1, 3, 8, 5, 3, 2, 9, 8, 9, 7, 6, 7

Q.2)Consider a two dimensional array A[N][N] of the order n x n.Then you find the sub-squares and display the largest sum of the sub-square.Sub- squares are the contigious elements in the array.Largest sum can be find out by summing the elements in the sub-square

Persistent Placement Paper : DAIICT, GandhiNagar

1. Aptitude test

Involving 60 questions to be answered in 60 mins. Involves 5 aptitude questions, and other 55 questions from all Computer Science/IT subjects like Data Structures, Microprocessor, C/C++, Java, DBMS, Networking, Operating Systems and Communication Systems.

2. Written Test

Involving Essay Writing and a C program (we were asked to write a program to convert source code input as a file.c into a source code file with C specific indentation removing extraneous spaces and performing appropriate indentation ). This test is to be completed in 30 mins.

Results were declared after this two rounds of 90 mins. 92 people got selected out of 302.

3. Technical Round: 1

This round is toughest of all to clear as it involved too much elimination of students.
You will be asked questions from all subjects mentioned above, core programming concepts and DBMS queries. Subjects may different based on the stream you come from

4. Technical Round: 2

This round is a bit easy compared to first technical round. They would put up questions on projects, technology mentioned in resume. You will also be asked about your prefered technology if you get selected in Persistent. This round goes up to 15-20 mins on average.

Results were again declared after technical rounds. Around 35 people got selected out of 92.

5. Final HR round

This round involves one-to-one chat with HR head involving questions on easy puzzles, family background, your weaknesses and how you will over come them, strengths and how did it helped you and some questions on ur hobbies.

You are 99.9% selected if you get through technical round and have some basic communication skills.

Finally 24 people were in all selected out of 302 that appeared for the recruitment process. You will be offered a package of 3.5 CTC and 3 gross. Training period involves stipend of around 7500 which goes for around 6 months.

Persistent Placement Paper : Tekkali

Hi Friends,

I,m very happy after selecting for Persistent. Actually I didn,t prepare much for it, just casually i attended to the campus.

Inorder to get into the persistent we should have a better touch on our core subjects especially sorting algorithms and Data structures
The subjects he mainly focussed are C, DS, C++, OS, DBMS, CN, UNIX.

Persistent exam contains two sets

Objective test:

In this he will touch all the subjects which i had mentioned above. In addition to that GA 5+ questions will be there. It,s easy to get into the written exam by having a basic idea on our core subjects

Descriptive test:

In this he will give one essay and one program. My sincere advise for descriptive test is to concentrate more on program rather than essay then after the written test it is followed by two technical interview,s and HR

In the first technical interview he will mainly concentrate on coding. i.e., on DS and sorting algorithms and he will ask you to explain the program which is given in the written test. And he used to ask puzzles. He will cover all the core subjects

In the second technical interview he will ask all the core subjects but it is little bit low level compared to technical one.

Later it is followed by HR, this is the one which make me so confused and tensed, in this he used to depress us. We should be bold enough to face it

Persistent Placement Paper : nit raipur

1 Technical test...objective
2 Technical/English test subjective.
3.technical interview.
4 hr interview.
total student appeared 156 .
cleared the test (obj and sub) 35
cleared the technical interview 12
final selection 4
most student rejected these company bcoz
1.boreing ppt
2 low package
3 waiting for govt. sectors
4 after that day thr was snap on 20th dec
5 so many round for selection
total question 60 total tym 60min package 2.5L to 3L
objective technical questions
total 60 question
50 where technical + 10 apptitude(simple)
on all these 50 question u first need to be prepare for GATE its tht much tough
all question r frm dbms os se c data str.networking csa ............
and after that 30 min for
subjective question 2sets
1set
write abt globalization
write a c program to implement linked list.
set 2
write abt "india a land of opportunity"
wap to reverse the words of sentence without using extra space
eg "life is beautiful" to "beautiful is life"
Technical interview
it was really amazing to give a interview for 1hr
hmm its sure all interview are approx 1hr...
so prepare all subject u know can be asked by thm..... .if u don,t know any subject say it properly to thm thn also thy will ask u do u know abt the basic of tht subject or not ........they mainly giv stress on dbms ( relation intigrity .types of intigrity cursor, keys , join, normalization ,differnet bet 4th and 5th normal form with eg , transection b/w user A and user B ,locks which lock will u use in certain condition , why u use locks,, rdbms and dbms packages ) os (unix systm , kernal , paging , vertual mamory , typs of scheduling etc ) csa (gray code convertion , l1 cache l2 cache , rom ram cache difference ,how computer works etc ) data str( types of data str , which data str u will prepare when why how, impliment thn in any progming language, sorting and selection sorting complexity how they works b+ tree avl tree binary tree c implementaion) differce bet java c cpp and threads multithreads uses etcssss

Persistent Placement Paper : Indore

1Writtent Test: this test is objective type which is having 40 question in 1 hour
No of Quetion Area
10 Q from aptitude
5 Q from LR
10-12 Q C language
8-10 Q DS
8-10 OS

2 Written Test: this test having three program for which i m required to write the code in one hour.these three question from DS (from graph)
Q1. A city connected graph and it,s adjency matrices are given to me and i m required to find city which is connected to min and max no of cities.
Q2. Second Question having five fill in the blanks and corresponding condition are given in comment. we r required to write the condition in if..else statment like
i m giving u a sample example:
/* value of x can not be less then y */
if(....) // Q 1
printf("y is always greater then x");

Q3. is also based on graph for finding the minimum weighted path.

1 TECH:(1:30 hour,s) it,s totally based on DS and second written test. some simple puzzle

2 TECH: (1:30 hour,s)it,s also based on DS and some HR ques and some question from OS.

HR: general HR questions based on your CV. so you should able to justify each and every word written in ur CV. They can ask anything. show your confidence and presence of mind. maximum questions are based on my hobby.

that,s all. and finally i m selected.it was not so easy but not so tuff also.
1st round around 400 students
2nd round only 67 students
3 rd round around 6(Devloping)+9(testing) students
4 th round only 4 (Developing) student
final round only 2 (Developing) student from DAVV (1 MCA(Sharad Garg)+ 1 BE(Sachin))

Persistent Placement Paper : JIMS,Rohini

PERSISTENT PAPER ON 29TH FEBRUARY,2008 AT JIMS ROHINI

Hi, friends. I am Anoop Yadav CSE student from APEEJAY COLLEGE OF ENGG SOHNA. I have attended the persistent joint campus on 29th Feb. 2008 at JIMS ROHINI. There were basically 39 colleges from DELHI IP UNIVERSITY. The joint campus was only for CST/IT students.
There were 2600 students
180 cleared the 1st round
And finally 42 students were selected.
I was the only student selected from my college.

Pattern
1st round was technical aptitude (duration: - 1hrs)
It basically contain 40 questions
15 general aptitudes like logical deduction from RS aggarwal (simple one)
35 technical questions from C, C++, DBMS, OPERATING SYSTEM
Overall it was a simple round and cutoff was I think 50-55%.

2nd round was programming round:- (duration :- 1hrs)
It consists of 2 programs
1) It was a linked list program
Statement:-
write a program using linked list in which each node consists of following information.
Name[30]
Branch
Rollno
Telephone no
i) Write the program to add information of students in linked list
ii) now search the record of students such that three consecutive student have same telephone number.

2) statement :-
Write a program that count the number of times a word is repeated in a given
Paragraph
Ex . Persistent company looks for technical guys . Persistent is a core company
Which deals in outsourcers
Output should be like:-
Persistent 2
Company 2
Looks 1
NOTE:- Both round 1st and 2nd were held at consecutively and I think that programming round was not elimination round . programs were discuss by them during there technical rounds.

3rd round was TECH-1( verbal duration 45min to 1hr 15min)
In this round they will ask technical question from c, c++, dbms , operating system , microprocessor.
It was quite difficult round. One thing I would to say that that were not looking for definitions but they want depth knowledge of concepts and generally asked
How this can be implemented in real life so be prepare with ur technical.
My technical round was continued for 1:30 hrs.
Note:- In the beginning they will said that there will be two technical rounds. Then depending upon the candidate 1st tech . they take 2nd tech round .
They were some cutoff in tech-1. In my time the candidate who scored 28-30 out 30 were directly send to HR ROUND.
The candidate who scored 26-27 were send for tech-2 there also they have cutoff of 26 marks out of 30. this thing we came to know after our Hr rounds.
we are the only 4 students who were directly send from tech-1 to hr round

4th round was TECH-2 (Verbal duration (45 min to 1hrs)

5th round was HR ROUND( duration 45 min to 1hrs).

it was completely based on ur resume . I will suggest u to be honest to hr officer as they ask next questions from what u have said in the last questions . pls don’t take it lightly . it was the main elimination round many students were rejected in hr round.

Note:- there were giving full time to each student in every round whether they have to reject or select the student .
Suggestions :-
1) They are looking for technical guys. They are not looking ur communication skills so try to explain the logics in what ever language u r comfortable. I had given my both technical and hr rounds in HINDI . SO don’t worry abt the communication skills .
2) Be honest in ur resume write only those subjects in resume on which u have full command because ur technical starts from ur favorite subjects so don’t try to impress with ur resume because both technical and hr round goes around resume.
3) Try to be honest in hr round because there is a cross questioning after ur each answer.
4) Company simply looks for concepts not for definition so try to have depth knowledge in each subjects mentioned above.

Persistent Placement Paper : UIT-RGPV,Bhopal

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

Hope to meet u all...@ persistent...
By Category
Post Your Resume Here