Paper 1 Corporate View: At Persistent, they work with their customers to help them proficiently deliver products to their

end-users and ultimately, to maximize their core business. Their outsourced software product development services allow their customers to minimize Time-To-Market, perk up the quality of their products, trim down risk of failure during the engineering development process, improve predictability and reliability of the engineering process while helping them minimize their over-all product engineering costs. They have invested in structuring a gigantic team of software engineers, veterans in product development culture. Their team of industry specialists has an understanding of the industries in which their customers operate and the competencies that they necessitate. They have competency centers in telecom and wireless, life sciences, analytics and data infrastructure, embedded systems domains, product engineering and Microsoft and Java platforms. Their customers range from numerous global software companies to early-stage companies that are developing cutting-edge technology products. They have long-standing relationships with their customers, built on their successful execution of prior engagements. Founded: 1990 Headquarters: Stra Area, India Contact: Persistent Systems Limited Bhageerath, 402, Senapati Bapat Road Pune 411016. Tel: +91 (20) 2570 2000 Work culture: They make working at Persistent an enjoyable experience by providing a correct balance between work and fun. Informal wear and vibrant weekends mixed with a sense of teamwork are inculcated from the very beginning. Their initiatives such as skip levels, one on-ones or HR meetings with employees encourage feedback at all levels. The feedback received is then converted into an actionable, ensuring employee satisfaction. Their openminded approach in all their endeavors is aimed at bringing out the best in you. They have a fair, transparent and a straight-forward atmosphere that decides any position solitarily on grounds of merit and not on any extraneous factors. They, at Persistent, strive to provide an environment that is stimulating with high levels of motivation, empowerment and recognition, removing obstacles that hinder creativity. Persistent is an energized atmosphere where they share successes while setting new standards of excellence. Entry level Recruitment: Persistent believes that the BE students can get the best exposure to the industry while working on the BE projects. Persistent has been offering BE projects to for the last more than 5 years. A large number of students have utilized this opportunity to absorb the

necessary skills and experience in turn making them productive earlier, which is the key to individual and industry success. Persistent had offered more than a 100 projects last year. Projects done with the Persistent guides have won accolades at various project competitions. This year too we will be offering the same number of total projects. The students have to register for appearing for the project tests. The link is provided on this page for this registration.

How to Apply: You can apply for Persistent job. About the Recruitment test: The recruitment test consists of 5 rounds. 1) 2) 3) 4) 5) Technical objective paper Technical subjective paper Technical interview 1 Technical interview 2 HR interview

Paper 2

The selection procedure of Persistent was toughest a fresher can face in his final year of engineering. The different levels of campus recruitment for Persistent Systems involves following stages. 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.

Paper 3

Hello Friends, Persistent systems (PSPL) conducted a pooled campus @ SDM, dharwad on 24th & 25th December 2010. They conduced 3 rounds. 1. Technical objective & technical subjective. 3. Technical interview. 4. HR round 1st. round: Technical objective. 60 questions, 60 mins. All technical question related to C, Cpp , DS, OS, networking, computer fundamentals No negative marks. They allowed 2 candidates to sit in a bench. Both candidates got same question paper, but questions were shuffled. Tip: Try to sit with a smart friend who can help you. Technical subjective:

In this round they asked to write a program and essay (duration: 30 mins). Essay has less weight age so need not write lengthy para. Topic was Indian Media. Just write some striking 8-10 points with some good points. Enough. Program is the most important part of this round. You'll be asked to write 1 program on either linked list or file handling. So be perfect t in both type. They asked us to write program to indent a input C program file. Even if you cant write program just write algorithm or pseudo code. They just want to check your logic. Out of 250+ candidates appeared, only 60 were short listed after 1st round. 2nd Round: Technical Interview: This was the toughest part. Questions may be asked on anything, any topic. So perfectly prepare with C, Cpp, DS, OS, web programming. And dbms most important. Be perfect in basic concepts of every subject. You may be asked to write a program for linked list or file handling. They love linked list. It may last for an hour or even more. Depending on performance of this round, they may take another round. If you clear technical round, you are almost done, HR round is just formality. All the best Guys.

Paper 4

Hi Friends, Recently I got selected for persistent, for me it is a surprising thing, because 2 days before for our campus Infosys visited. We prepare a little bit more compared to persistent. And my expectations on persistent is absolutely nill. But luckily i got selected for it. The things which should be necessarily required for this company was all the core subjects of cse i.e., C, DS, C++, DBMS, OS, CN, UNIX. Objective test: In this it consists of all CSE core subjects and GA and its easy if we had a little bit touch on our subjects. Written test: In this it contains two things

1) We should write an essay 2) We should write a program My sincere advice for the candidates who are appearing for persistent is to concentrate more on program rather than essay I was surprised after seeing my name in the selected list And then it consists of two technical HR's 1) He used to test all the core subjects and especially on DS and sorting algorithms we should thorough enough in it and in addition to these he may ask puzzles 2) The second technical interview is conducted in order to confirm that he had selected the right person or not and it is little bit easy compared to first technical HR And then it is followed by HR It placed a crucial thing for me, because the HR mainly focused on depressing me by asking the same question multiple times. I got some what tensed in this part and my good luck mam has said that I got selected soon after I gone from the HR room. This make me very happy and free from tension And better luck my dear friends. And I had a material for exclusively for persistent. Do let me know in case of any query.

Paper 5

First of all, if you are good at technical skills, this company is one of the best company for you. The selection process comprises of 5 stages: 1) 2) 3) 4) 5) Technical objective paper Technical subjective paper Technical interview 1 Technical interview 2 HR interview

The technical paper will not be tough if you have taken your subjects in engineering seriously or if you have prepared for GATE previously, its an advantage for you. Main subjects of concern were: * * * * * Data Structure DBMS Software Engg Concepts of C OS

This is the order of priority too. First written paper comprises of 60 questions to be attempted in 60 mins 5 from data structures 5 from C 5 from s/w engg 5 from dbms 5 from OS and computer system architecture and 5 from general aptitude. Your basics must be clear in all these subjects. Next, the second written test is taken consecutively so be prepared. It has two questions, one from english prose writting and another from C questions from english will be based on some very general topic on which every one can write atleast 2 pages(but dont write so much), the next question is to write a C program based on some nice logical problem. We were asked to write a program to read all sentences from one file, remove extra spaces(more than one consecutive spaces) between two words from each sentence, and write the modified sentences to another file. If you have survived till now, here starts your main race. Both the technical interviews will require you to prepare all the above mentioned subjects in great depth. Prepare your project too. You would be asked to write programs, write algorithms, solve puzzle type questions, about the toughest part in implementing your project, etc If you have still survived, you will get through because they don't filter much in HR round. My HR round was a cake walk, although my technical interviews lasted for 1:30 hours and 45 mins respectively. HR interview was hardly 20 mins. Best of luck! See you in Persistent.

Paper 6
First of all, if you are good at technical skills, this company is one of the best company for you. The selection process comprises of 5 stages: 1) Technical objective paper 2) Technical subjective paper 3) Technical interview 1 4) Technical interview 2 5) HR interview The technical paper will not be tough if you have taken your subjects in engineering seriously or if you have prepared for GATE previously, its an advantage for you. Main subjects of concern were: * * * * Data Structure DBMS Software engineering Concepts of C

* OS This is the order of priority too. First written paper comprises of 60 questions to be attempted in 60 mins 5 from Data structures 5 from C 5 from S/W engineering 5 from dbms 5 from OS and Computer system architecture and 5 from general aptitude Your basics must be clear in all these subjects. Next, the second written test is taken consecutively so be prepared. It has two questions, one from English prose writting and another from C question from English will be based on some very general topic on which every one can write atleast 2 pages (but dont write so much), the next question is to write a C program based on some nice logical problem. We were asked to write a program to read all sentences from one file, remove extra spaces(more than one consecutive spaces) between two words from each sentece, and write the modified sentences to another file. If you have survived till now, here starts your main race. Both the technical interviews will require you to prepare all the above mentioned subjects in great depth. Prepare your project too. You would be asked to write programs, write algorithms, solve puzzle type questions, about the toughest part in implementing your project, etc If you have still survived, you will get through because they don't filter much in HR round. My HR round was a cake walk. Although my technical interviews lasted for 1:30 hours and 45 mins respectively. HR interview was hardly 20 mins. Best of luck see you in Persistent!

Paper 7

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 This is the experience which I got in my campus All the best guys!

Paper 8

If you are good at technical skills, this company is one of the best company for you. The selection process comprises of 5 stages: 1) 2) 3) 4) 5) Technical objective paper Technical subjective paper Technical interview 1 Technical interview 2 HR interview

If you have gone through your engineering subjects very thoroughly and if you have prepared for GATE previously, its an advantage for you. Main subjects of concern were: * Data Structure * DBMS * Software engineering * Concepts of C * OS Your basic concepts must be clear in all these subjects. Next, the second written test is taken consecutively so be prepared. It has two questions, one from English writing and another from C question. You will be given a general topic in english to write on it, it would be very easy for everyone to write briefly about it. The next question is to write a C program based on some nice logical problem. We were asked to write a program to read all sentences from one file and replace the multiple spaces by a single space and to write the file into another file.

About 1500 students sat for written out of which 170 were shortlisted for technical inteview round. If you have survived till now, here starts your main race. Of 170 shortlisted another written test for weakest 40 students was conducted of which around 10 were selected for interviews. Both the technical interviews will require you to prepare all the above mentioned subjects in great depth. Prepare your project too. You would be asked to write programs, write algorithms, solve puzzle type questions etc. Around 45 were sent for HR round and finally 34 selections were done. If you have still survived, you will get through because they don't filter much in HR round, it's just like a formality.

Paper 10

Hi

frnds Procedure 4 round 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

Paper 11

PERSISTENT PAPER ON 5TH JUNE AT INDORE

"A journey of a thousand miles begins with a single step." I am Sharad Garg .I faced 2 Written, 2 TECHNICAL and 1 HR round. 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))

BEST OF LUCK TO ALL OF YOU

Paper 12

PERSISTENT PAPER ON 13TH MARCH,2008

HI! I AM HARSHA I CLEARED PERSISTENT & WANT TO SHARE MY EXP. WITH U .HOPE THIS WILL HELP U. GOOGLE PAPERS HELPED ME A LOT .THANKS FOR UR SUPPORT. COMPANY: PERSISTENT DATE : 13TH MARCH 08 TYPE ; CAMPUS FIRST ROUND: APTITUDE TEST: TOTAL 40 QUESTIONS 5 ON LR 15 ON C 15 ON DS 5 ON OS PLEASE NOTE THERE R NO QUESTIONS ON MATHS FRESHERS WORLD.COM PAPERS ARE SIMILAR. BOOKS TO REFER : TEST UR C SKILLS TOTAL 300 APPEARED 75 CLEARED SECOND ROUND: TEST ON PROGRAMMING ; THERE R TWO QUESTIONS TIME 1HR 1) AN ARRAY IS GIVEN WITH ELEMENTS A{O}<A[1]<A[2]..........A[N] PERFORM SEARCH .IT SHOULD NOT WORK FOR N NUMBER OF TIME. HINT;- BINARAY SEARCH ALSO WRITE ALOGO WITH PROGRAM 2) PERFORM IN ORDER ON TREE & TO THE OBTAINED LIST FIND IF IT IS PALINDROME OR NOT TOTAL 75 APPEARED 22 CLEARED THIRD ROUND : ON 14TH IT WAS HELD IN PERSISTENT ITSELF

TECHNICAL INTER1: FOR ME IT WAS OF 2 1/2 HR THEY ASK U SUBJECTS FROM 1ST YEAR TILL PRESENT TERM EMPHASIS IS GIVE ON DATA STRUCTURE & LINKLIST TREES GRAPHS SEARCHING SORTING .THEY ASK U SOME PUZZLES TOTAL 22 APPEARED 6 CLEARED FOURTH ROUND: TECHNICAL 2 : FOR ME IT WAS OF 1HR HERE THEY ASK ABT C++ ,FIBO PRIME CLOCK PUZZLES HINT : THEY DON'T EXPECT THAT U KNOW EVERYTHING BUT GIVE A TRY DON'T JUST GIVE UP . AND MOST IMP HAVE PATIENCE TIME DURATION IS LONG ITS JUST IF U CAN HANDLE THE PRESSURE. TOTAL 6 APPEARED 3 CLEARED. FIFTH ROUND HR: ITS JUST NOMINAL OUT OF 300 THEY SELECTED ONLY 3 & I WAS THE LUCK ONE . BEST OF LUCK TO ALL OF U. MAY GOD BLESS U .

Paper 13

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

Paper 14

PERSISTENT PAPER ON 29th APRIL AT BHOPAL

HELLO GUYS..........................i m sourabh sahu from UIT-RGPV, Bhopal...pursuing my BE in CS stream...persistent came to our college on 28-29 April...945 student appeared for it both for Development & Testing.............................. 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...

Paper 15

PERSISTENT PATTERN - APR 2006 Hai, I gor selected in Persistent System , by campus placement, exam. Pattern is like this. we have two written test , two TI, and One HR interview. in first written test there were 40 questions. out of which 15 from quantitive aptitude, and LR , remaining were from technical subject, like c, c++, ds, os, dbms etc. in second written test there were a programing round in which they given two program to write on paper ( programs are like made by Linklist and Array) In both TI the main emphasis on C, DS; final and last round was HR Interview. At last only 11 student were selected. its all procedure of test

Paper 16

PERSISTENT PATTERN - 06 MAY 2006 - PATIALA May 06 2006, PTU Joint Campus Placement at Chitkara Institute of Engg and Tech. 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.

Paper 17

College: Hitech institute of technology,Aurangabad, Maharashtra Hi, Mayur is here to share his experience of PSPL campus interview. I waited 3 years in my college just to get into and finally I got it. It's the best thing you can get from your college.The Campus Selection of Persistent Systems Limited, pune was scheduled on 29th feb and criteria was 1. 58% aggregate upto V Semester B.E. 2. No Current Backlogs. this was an open campus for all the eligible( CSE / IT/ ETC ) engineering students of aurangabad. the number of candidates eligible for PSPL was 636. But, I wasn't troubled with this.Then, the Day came, 29th feb.nearly 600 candidates were appeared for aptitude test. There are two categories for PSPL. 1. CS/IT People 2. Non CS/IT People.(ECT) They have different procedures of selection and different papers for two categories of people.As, I am from ECT I'll tell you about my experience plus I'll also tell you about CS/IT guys. For ECT. 45 questions, 45 marks, 1 hour duration. 2. APTITUDE - 30(easy), C PROGRAMMING - 15. 3. No sectional cut-off. No negative marking For CS/IT There was two aptitude tests Test-1 Pattern 1st round was technical aptitude (duration: - 1hr) 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%.

Test -2 In this, candidates were given with the 3 programs of DS and it was compulsory to solve atleast 2 programs for cracking apti.the programs were based on the linked list , arrays etc.The HR's were giving more preperance to the logic than syntax. The paper was quite good, c questions were tricky.mostly they asked questions based on output and error finding . Aptitude was simple but some questions were confusing. They gave PREPLACEMENT TALK after exam, just two of them handled us. Rest of the team was busy in checking papers. In PPT they shared lots of information regarding company's market value, their international partners, company locations, orgin of persistance, and salary offered to the freshers. The PPT lasted for 1hour. Then, CSE / IT Candidates were told to move to class room for second test in just 5 minutes. there was a technical programming paper ready for them.and students of ECT waited till then. after 2nd test within 30 min the short listed candidates list was out. 58 out of 600 candidates had made it !!
for ECT CANDIDATES 3rd round was TECH-1( verbal duration 45min to 1hr 15min) . In this round they asked technical question from c, microprocessor and basic electronics concepts ,theorems besides two or three puzzles. they mostly asked simple programs in c and microprocessor It was quite difficult round. One thing I would like to say that they were not looking for definitions but they wanted deep knowledge of concepts and generally asked How this can be implemented in real life. so be prepare with ur technical. Note:- In the beginning they said that there will be two technical rounds. Then depending upon the candidate 1st tech . they take 2nd tech round we are the only 2 students who were directly send from tech-1 to hr round for CSE/IT CANDIDATES

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. 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.
4th round was HR ROUND( duration 45 min to 1hrs)common for all candidates.

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

Paper 18

PERSISTENT PAPER ON 16th JUNE AT MAHARASHTRA

College: Government College of Engineering AMRAVATI, Maharashtra Hi, I waited 3 years in my college just to get into and finally I got it. It's the best thing you can get from your college.The Campus Selection of Persistent Systems Limited, Nagpur was scheduled on 16th June and initially criteria was 1. 60% aggregate upto V Semester B.E. 2. All exams after 10th should have been cleared in just ONE attempt. But, on 14th June criteria was changed to 1. 58% aggregate upto V Semester B.E. 2. No Current Backlogs. So the number of candidates eligible for PSL just doubled.But, I wasn't troubled with this.Then, the DDay came, 16th June.250 candidates were eligible for that.We were waiting for them since 9:00 AM but they arrived late at 11:00 AM.They took directly exam of all of us. There are two categories for PSL. 1. CS/IT People 2. Non CS/IT People. They have different procedures of selection and different papers for two categories of people.As, I am from IT I'll tell you about my experience plus I'll also tell you about NON CS/IT guys. For CS/IT 1. Paper was of 40 marks, 40 questions, 1 hour duration. 2. Sections were like this APTITUDE - 15, C PROGRAMMING - 10, DATA STRUCTURES - 10, OPERATING SYSTEM - 5. 3. No sectional cut-off. For NON CS/IT 1. 50 questions, 50 marks, 1 hour duration.

2. APTITUDE - 35, C PROGRAMMING - 15. 3. No sectional cut-off. The paper was good, c questions were tricky. Aptitude was simple but some were confusing. They gave PRE-PLACEMENT TALK after exam, just two of them handled us. Rest of the team was busy in checking papers. The PPT was boring according to most of the students as it was technical. But when they showed their clients' logo everybody was amazed. The PPT lasted for 40 minutes. And after 10 minutes the short listed candidates list was out. 43 students were short listed in Non CS/IT type. 50 students were short listed in CS/IT type. Then, were told to move to class room for second test in just 5 minutes. Then, there was a technical programming paper ready for us. It consisted of two programs. 1. There is an array A[n] such that A[i]<A[i+1]. The array contains positive and negative integers. Write a function to return i such that A[i]=i. Return 0 if no such i is found. Due credits will be given if there are less than n comparisons. 2. Write a program to check whether the string obtained from pre-order traversal of a Tree is pallindrome or not. We could use any amount of paper that we require. I used 5 blank papers. The duration was 1 hour. For Non CS/IT people, the test consisted of 1. A program. 2. A sudoku like puzzle of numbers. When the results were out, 12 from Non CS/IT and 21 from CS/IT were called for interviews. Then we were waiting in a class for our turn and I was called first as I topped the second test. The HR of PSL took me to the cabin where I was going to be interviewed. And there was my interviewer. He was a decent guy with background in ERP. He had 3 patents on his name. He asked me a few questions 1. Write an algorithm to detect balance mathematical expressions. 2. Tell me about your education. 3. OS--> MUTEX, Deadlock, LINUX Commands like grep. 4. DBMS --> BCNF, Why normalization is used. My interview lasted for 1 hour. I couldn't answer most of the questions so I felt rejected and was quite angry with me. I removed my tie in anger and I shouted at my friends. Other students were called for second technical interview but I wasn't. After 1 hour, I was called for my HR. This was strange coz, other people had to face two technical interviews but I had faced only 1. But, surprised and amazed i went inside. HR was a cool person. The questions he asked were. 1. How was your Tech Interview, 2. Describe yourself and then a discussion. 3. Few questions from my resume. 4. Do u have any location preference 5. Testing or Developing. Then my HR was over and I was told to go but I stayed there just to help my friends. Results of all these were declared on 22nd June. And I was on the list. Now, I am Persistentian. Ohh. they told us package is 3.0 lpa + lunch and snacks during working hours in company.

Paper 19

PERSISTENT PAPER ON 17TH JUNE AT SGSITS,INDORE

hi friends, i am shrawan patel from SGSITS INDORE(MP) .....pursuing M.E.(E&TC)......persistent came to our college on 17-18 june 2008.......................200(approx) student appeared in written test for both Development(CS candidate) and Testing(Non CS Candidate) There were 2 written and 3 interviews round....... 1st written round......... >Aptitude Questions (very simple) >C related Questions (approx 10) >Reasoning Questions (approx 10) >Some English Questions (very Simple)

2nd written round........ >two Questions were there..(1 simple C program & 1 puzzle (little tough)). only 27 Candidates(10 NCS and 17 CS) were short listed for interviews round. and now Main role was going to start...... 1st interview round...... (technical round) >for NCS candidates they were asking from their branch and puzzles and some simple programs (like string related programs),,,for CS Candidates they were asking complete C & DATA STRUCTURE & DBMS etc. my questions were..... >some digital electronics Questions( like implimentation of XOR using NAND & NOR gates) >some Questions from 8085(read & wright machine Cycles, basic info about 8085...and some more question) >some questions from Optical & mobile Communication (like TIR, Benefits of OFC, GMSK, PSK & GSM / CDMA) >Two puzzles (For NCS they were asking many puzzles so practice for puzzles) 2nd interview round.....(technical round) > my 1st interview round was good.. that's why they didn't take my second interview..but u should be prepare for that also. 3rd interview round......(HR round) > HR round was very simple...be relax and go for HR...... my Qs were.............. > tell me about yourself. >tell me about your family values. >why persistent.? >why IT from E& TC.? >why M.E.? >why no job after B.E.? >Do U have any Previous Offer.? >Qs about my strengths and weaknesses.? >Do u think that u r best ? >Do u want to ask something.? i answered all the questions in very confident way.... Finally 11 candidates (7 NCS & 4 CS) were

selected.....i was also one of them.....thank GOD..... ok friends.......its all about my experience....and good luck u all....

Paper 20

PERSISTENT PAPER ON 14TH OCTOBER 2007

Written 1> Write a program to count the no. of occurrence of word in given string Ex- Ram is good boy. Ram is doing good job. Ram 2 is 2 good 2 boy 1 doing 1 job 1 2> Write a program to search the student record on the basis of binary search where records are search on the basis of roll no. 1> write a program to reverse the string? U cant use extra space instead some counter variables? Ex- Life is beautiful. Outputbeautiful is Life. 2> Write a program to count the no. of vertices connected to a vertice in graph using adjancy list. I cleared the written test and called for interview. There r 2 technical interview and 1 hr interview. 1 technical interview on 22 oct 2007 Sir: with hand sacked Hello, I m mr. jha Sir: tell me abt urself. Me: said Sir: why u have chosen j2me and blue tooth technology Me: as I told in my intro I hve done Blue Presenter system as major project in my last sem., which is based on bluetooth technologies. Sir, We want to be different from the people thats why we have chosen these technologies. Sir: wht is this blue presenter Me: said. Sir: ur favorite subjects Me: data structure, database, Uml and Oops concepts Sir: lets first talk abt ds, What is data structure Me: said Sir: why we use data structure Me: said Sir: do u know types of data structure, linear and non-linear Me: I thought, he will definitely ask me abt graph, so I was socked and looking to the sir Sir: wht is nonlinear data structure? Me: Sir, Graph and Tree are nonlinear data structures Sir: How many types of tree do u know Me: binary tree, avl tree, b+ tree, multi-way tree, balanced tree, and threaded tree. Sir: which searching algorithms are used for tree?

Me: after sometime, I replied, sir, preorder, inorder and postorder. Sir: just tell me post order of this tree Me: said Sir: explain me, how u get this Me: explained Sir: tell me the algo to search the tree level wise 1 23 4567 o/p? 1 2 3 4 5 6 7 Me: first I just made a adjancy list and told sir we can get it from this Sir: tell me how u hve converted this tree into it while I m having only root node address Me: sorry sir, can I try for other way Sir: ya sure, Me: had tried 2-3 times and finally, Sir: wht happened Me: sir I got one solution but it produces twice the second level Sir: while u go to the 3 level it will print it thrice. Just explain me wht u r trying Me: explained Sir: just left it. Lets talk abt link list, how to delete a node from linked list Me: sir, from where start or end or by value Sir: given me one linked list, told me just delete the node whose value is 3 Me: I have written a code to delete that node Sir: but it cant work in the case if its first node Me; tried, really its not working, I tried in other way, but I didnt able to write general code its was very embarrassing for me becoz I love linked list and not able to write this simple code that time. Sir: tell me the logic Me: explained, and it was right, I know Sir: wht r the advantage of C over Cpp? Me: said Sir: what is oops concept? Me: explained, Sir: what is used in the case of template classes Me: sir, reusability Sir: is it oops concept Me: no sir, Inheritance is used in template classes Sir: Do u know database Me: yes sir Sir: wht is normalization? Me: said Sir: why we use de-normalization? Me: said Sir: what is ACID? Me: sir they r properties of transaction, Atomicity, Consistency, Isolation and durability. Sir: Do u want to ask me any question? Me: I thought I was not cleared the interview? And I asked sir, in which technologies ur working? Sir: all, java, .net c, cpp Me: sir, any suggestion for me, as I m fresher, dont aware of the industries environment Sir: U hve made good project in ur curriculum, u just do search on net wht new technologies is coming in market. Thats it. Me: thank u sir, nice to meet u Sir: wait down the stair and send the next candidate. I was cleared the first round and called for second technical tomorrow 2 technical Me: May I come in sir

Sir: yes plz, hve a seat Me: thank u sir Sir: looking to my written test sheet and first interview marks, U have asked abt ds, c/cpp and database in first interview Me: yes sir Sir: lets talk abt java? From where u hve made final sem project Me: sir, from college Sir: tell what is blue presenter system Me: explained, Sir: have u use any API or implemented it itself Me: Sir we have used bluecove API, which is freely available on the net. Sir java doesnt hve direct support for com, and we have to use third party sw, since we r fresher dont have enough money to invest, we have used vb for com support. Using socket-server programming communicated java and vb. Sir: meanwhile another sir has come in the cabin Sir: sir, he has made a project in bluetooth technology, do u want to ask any questions? 2 Sir: how r u controlling the applications Me: Sir, we have implemented one client application which is installed on mobile phone and one server application which is running on desktop pc. 2 Sir: how to installed client application on mobile. Me: sir, just send the jar file to mobile and select that file it ask u, U want to installed the application and follow the instructions. 2 Sir: what is the use of ur application? Me: sir, while we giving presentation, there is a headeck of synchronization between operator and presenter, or while u want to change the slide u have to come near the PC or Laptop means u r not free to give walk around presentation. This application free u from this restrictions and walk around presentation improve presentation performance, u can see the list of slide titles on ur mobile, back and forth the slide or even see the slide notes on ur hand. 1 Sir: wht security u hve used in this project? Me: there is no use of security in this project, only one mobile is connected to pc at a time 1 Sir: let consider I m connected to Pc and shutdown the Pc and some one want to control any application. Me: sir, using pass key u connected to the PC, its the functionality of bluetooth device. Sir when u shutdown the system our application is terminated which is running on PC and then mobile application. So, no other person will perform any operation. Sir: what is J2Me? Me: said very well Sir: what is the difference between desktop application and mobile application? Me: said perfectly Sir: what criteria r considered while implementing mobile application? Me: Sir, since mobile application have less memory and power capability, we have to take care of memory, so that performance of the device is not degraded. Sir: Do u know design pattern? Me: yes sir, Singleton pattern and factory pattern Sir: What is Singleton pattern Me: explained with example Sir: write the code for singleton pattern Me: yes sir, Class A { private static A a; private A() {} public static A getObject() { if(a.equals(null))

a=new A(); else return a; } } Sir: what is the difference between equals m/d and == equal to? Me: said perfectly Sir: can we use == instead of equals m/d in this code Me: sir yes Sir: modify the code Me: yes sir Sir: I think it wont return or return is missing in this code? Me: yes sir, I modified the code Class A { private static A a; private A() {} public static A getObject() { if(a==null) return (a=new A()); else return a; } } Sir: I want to reduce the line of code and use only one return? Me: yes sir, I modified the code once more, sir just remove the else and one return Class A { private static A a; private A() {} public static A getObject() { if(a==null) a=new A(); return a; } } Sir: if there r 2 thread running then what happened with this code Me: sir as a is a static member of class, it is shared among both thread Sir: but second thread overrides the 1st instance Me: sir it may happen Sir: if 2 threads is running simultaneously then, how many times new is called Me: thinking, I answered sir once Sir: if at the same time both threads at a==null, both find a==null and create the instance then Me: I was in dilemma; I remembered its just like a dirty read problem, and after sometime Sir: think dear, use pen and paper Me: after that I answered sir, new is called twice, we can avoid this problem using synchronization Java support 2 types of synchronization semaphore and monitor Semaphore: when we use synchronized before variables, its called Monitor: when we use synchronized before m/d its called monitor or using synchronized block And I modified the m/d signature as Synchronized public static A getObject(){ } Sir: synchronized is used before access modifier Me: no sir, after access modifier, since on page I didnt find space after public I written it before Sir: what is factory pattern? Me: I didnt work on it sir, but I know why we use it and what is the utility of it, and explained it with

example. Sir: Lets move to data structure, very simple question Me: yes sir Sir: what is the difference between stack and queue? Me: explained with example Sir: looking to my written and objective answer sheet, (as I got 5 marks out of 7 in OS), Do u know OS? Me: yes sir Sir: what is paging? Me: I explained whole procedure and why we use paging Sir: anil, do u know database Me: yes sir Sir: what is transaction? Me: sir, transaction is a logical unit of set of operation, which is execute all operation or none. Sir: What is ACID? Me: said Sir: U wants to work in java or C Me: sir, its totally depends on organization requirement. Sir: ya I know but tell me whether java or C Me: sir, I more interested in java but I dont have problem in C, if organization needs me to work in C, I can do so. Sir: Ok anil Me: thank u sir, nice to meet u.. Before HR interview, assistance hr came and told me we got some comment on ur interview.. and after that told me but its positive side, ok come at 2:30 oclock, its 12:30 oclock. Sir its too let Sir: no its ok, come at 2:30 after taking lunch While I was waiting for lift, sir had come and told me after 10 min ur hr round will be taken, do u hve any problem Me: No sir HR Sir: be comfortable Me: yes sir Sir: from when u r in pune Me: sir, from 5-6 days Sir: u hve given any other companies interview Me: yes sir, CSC, nec-hcl and persistent in our college campus and I was out from final round Sir: what turns u back Me: means what sir Sir: what u have done in theses days and performed very well in interviews Me: sir, I have worked on my technical skills, and basically I was working on my communication skills, I think my public speaking skill is not good Sir: what u hve done for it? Me: sir, talking with friends, reading news papers and I have joined many communities on Internet and orkut and reading articles over there Sir: which article you have read recently? Me: sir its of bluetooth and laser technologies, u can access laptop or pc without mouse or keyboard using laser technologies. There is no need to connect mouse and keyboard. Sir: who is the author of this article? Me: sir, its general discussion group, there is no specific writer Sir: how frequently do u open these discussion group Me: sir, whenever I find time Sir: what is the charge of Internet in indore? Me: sir, 10 rs per hour, but I m not living in indore, my father is transferred from ujjain to dhar. Sir: how far you have to travel to access net Me: sir, 3-4 km Sir: which game do u play? Me: cricket

Sir: ohh boring game Me: sir, its good for health and I learned team working there Sir: do u play professional cricket or gali cricket Me: sir, I didnt play professional cricket, I played in college with my friends Sir: how frequently do u play Me: sir, I didnt find time to play cricket now Sir: another game which u play Me: carom, badminton and computer games . Sir: do u have racket in ur home Me: yes sir, Sir: Anil, tell me about ur self Me: said, and at last I said I am a person who enjoys challenges and looking for creative solutions to the problem. Sir: do u solve puzzles? Me: not frequently sir, but ya when I find, I can Sir: I am giving u one puzzle solve it Me: there r 2 buckets 1 is of 5 liter and one 6 liter, 3rd bucket of 20 or 25 liter, and 1 nal which can produce water, U have to measure 9 liter water without wastage of water Wastage of water means? once water is taken from nal other then 9 liter is wastage of water Me: I am thinking Sir: how much time will you take? Me: sir, 5 minute, I am still trying to solve it and ask sir not single liter wastage Sir: tell me what is the puzzle Me: I explained Sir: ok, solve it Me: I got one solution but there is 1-liter wastage Sir: have u solved it Me: yes sir, but there is 1-liter wastage of water Sir: tell me the solution Me: I explained Sir: try without wastage Me: I tried in other way but still there is 1-liter wastage Sir: sir, what happened? Me: sir, I got 2 m/d but in both cases, there is 1-liter wastage of water Sir: so what do you think? There is no solution without water Me: sir, I think so Sir: just take a 6-liter water put it to 5-liter bucket, what remains Me: 1 liter Sir: put it into big bucket now try to solve it Me: I was trying, 2 hr Sir: told me ur 5 minute is over, Me: sir, I am trying 1Sir: what u cant find the solution? Me: sir, I will ask to my friends, Sir: if no one is around u then Me: sir, I go to the net, and search the solution, put the query on the puzzle communities that I have joined, and ask for solution Sir: its means I have to change the question next time Me: sir, if I dont find the answer I will definitely do that Sir: put 5-liter water from 5-liter bucket to 6 liter and take one-liter water from nal, now Me: yes sir, we can do like that 5 times Sir: 5 times?????????? Me: sorry sir 4 times Sir: 4 times???????? Me: no sir, in 3 times we can measure 9-liter water without wastage. Sir: now what I have to do? Me: sir, what can I say? Sir: why r u here?

Me: sir, to be a part of persistent Sir: so ask me Me: sir, will I selected? Sir: yes u r selected, now just behave like an employee of persistent Me: I was very happy and smiling Sir: do u want to ask me any question? Me: no sir, Sir: r u sure, u dont want to ask any question? Me: sir, what is the package Sir: 3.0 Me: sir, what abt the bound? Sir: we dont have any written bound just oral bound Me: sir, what abt the training? Sir: its abt 2 and half month on r skills, when do u want to join Me: sir after diwali Sir: be comfortable, interview is over, just talk in normal way Abhi de de offer letter Me: yes sir, Sir: document is not ready this time, when will u return from home Me: 10 nov Sir: when will u come for offer letter Me: sir, on 11th nov Sir: ok, we will send u mail, just put ur bag here and come with us to take lunch Me: thank u sir, both hr told me congrats and then, one hr mam has come there and told me congrats

Paper 21

PERSISTENT PAPER ON 4th APRIL 2008 Hi Frds !!! I am Suraj Manekar Persistant Came To Our Campus on 4th of April They Have Two Test One On General and second on Programming. They Have Changed Their Paper Pattern Now There Was 15 Qt Questions On Quanti with analytical, 10 on C,10 on DSA and No DBMS No Toc, And Only 5 OS Question There APT Paper FIRST SECTION a) Quati Section 15 marks i) analytical ii) quanti b) C Section 10 marks c) DSA section 10 marks d) OS section 5 marks C section: 1 main() { printf("persistant"); main(); }

ans:print the persistant till the stack overflow occur 2) f(0)=0; f(16)=? int f(int n) { if(n>100) n=n-10; else something } ans 91; 3) queston on seek() i.e. moving file pointer pointer has to point just before the last character of the file os) what is thrashing? DSA 1) find number of nodes in complete binary tree of level 5 ans:-63 2) problem on queue. one queue was given and find the minimum number of insertion and deletion operation to get desired output. SECOND SECTION There were two programs on c 1) create doubly linked list 2)second question was on graph there is one undirectional connected graphand we have to find connected edges in a graph user input the adjecency list /mattrix Hint: first find out the path mattrix by warshalls algorithm then from this mattrix u will get which are the connected nodes which not in mattrix 0 means unconnected 1 for connected FIRST TECHNICAL INTERVIEW The most important round in which u ask to write a program 1)i ahve asked to write a program on finding a position of number in fabonaci series. 2)finding a liked list whether it is looping linked list or general linked list 3)to write a program to create linked list. 4)virtual function of c++. 5)calloc and malloc 6)operator overloding 7)static variable 8)how to allocatte dynamic memory. 9)what is big o nation 10) all sorting alogorithm and their complexity SECOND TECHNICAL INTERVIEW They can ask u tell the differenrt technical area of interst than c,c++,DSA. if u have so. 1) Puzzle on cutting cake in 8 same parts using only three cuts. 2) multithreding, multitasking, multiprocessor system 3) wrte a program reverse the integer no. 4) write a program to draw square without using recatangle function in c++. 5) FAT, NTFS, windows NT, WINDOWS XP. 6)warshalls alogorithm ,dijkstra algoriyhm 7)query on sql to find the names of the person who is having same name. 8)linux give the command which tells the process status 9)softare engg. 10) software development life cycle. THIRD ROUND HR 1) asked me write a essay.

2) asked me tell two most concering issue in the world. prepare u r resume neately. be honest in HR. so guys after these three interview i got the news that i have get selected in persistant. so be prepare for persistant with c,c++,dsa and os.

Paper 22

PERSISTENT PAPER ON 28th MARCH AT KOLKATA Hi Friends... Our test spanned for 2 days (28th & 29th) Package offered : 3.0+ ( around 3.2 to3.3 /annum while joining) 2 technical apti +2 technical interview + 1 HR interview recuritment drive was for two positions 1. Development : for CS/ IT/ MCA 2. Testing: for ECE/EIE/ Electrical total no. of candidates: 1000+ ( it was a pool campussing; 12 pvt engg. colleges participated) selected: 17 (10 from development; 7 from testing) Develpment papers were completely different from the first aptitude. I am from ECE, Techno India college of Technology ; Hence concentrating on Testing ... day 1:- 1. General Aptitude ( MCQ): total 30 questions time: 50 minutes Quantitative Aptitude (15 Q) ( r.s .aggrawal..some tricky questions...) C Aptitude(10 Q)( exploring C...cracking I.T. interview TMH) English Aptitude (f.i.b)(2 Q) Probability question(3 Q) 2. Written Aptitude (Quality & Testing) this section is completely different; no references are useful; you have to be very innovative;... they judge mainly on you approach and rough work... 2 questions 1 hr : 1st Questions : An LIC company has 4 clauses (I forgot the clauses)...you have to construct a C function module or devise an algorithm to accomodate all the clauses effectively....This was only one part of the coin... the 2nd part of the question was to analysis the feasibilty of the algorithm.. i.e. you have to give atleast 3 invalid input and devise what type of output should my program give...and reason why used this invalid input as a test input... Similarly, you have provide atleast 7-8 valid test input, coresponding output and valid reasons. 2nd Questions: A puzzle was given...21 conditions...36 (6*6) empty cells...all cells to be filled by no. from 1 to 9 ,all numbers can repeat 4 times...one condition for example is that a single no. can't repeat in its

just neighbourhood cells(row wise,column wise or diagonal wise) Tips: Don't panic...do enough rough work analysis...again repeating ...they study only your approach.. Day 2 : 1st technical interview ( a 2-member panel; a friendly gentleman and a friendly Lady) (about 20 mins) tell me abt yrself Questions on 2nd Aptitude test...inquired on our approaches difference between *++i and i++* no. squares in a chessboard (204...think carefully...it is not 8*8=64) swap two varibles without using third variable some more puzzles what do you know about software testing? what is unit metric tip: they don't look at your outer looks ....they only judge your technical ability...never say "I don't Know".....always go for the question and spend time analyzing the questions....It is NOT necessary to correctly deduce always the right answer..but everytime try to logical reason your approach to the panel... 2nd technical interview (a single person..a bit serious but encouraging gentleman) (about 45 mins) tell me abt yrself list some of your core subjects write a program to swap two variables without using third variable ( lucky to get the same question) wap to test three co ordinate are in same line write a program to arrange 1 to10 integers in ascending order explain some sorting algoritms using a number array 3,4,5,8,1,0,7 ( I explained Bubble sort, selection sort, and quick sort) which one of them is the fastest...why...what are their best, worst, and average complexities...give some disadvantages of Quick sort...why the best case of quick sort is of the order n*logn (with base 2).... now the discussion shifted to electronic questions.... what is modulation... derive depth of modulation for am... what are different types of modulation.... what type of detection is used in am receiver...why we use local oscillator... what is the range of depth of modulation... show graphically am.. what are different registers in 8085 8085 is 8 bit register or 16-bit register....( 8 -bit)..are you sure...then why...(data bus 8bit)..interface a rom and a ram to 8085 microprocessor clearly indicating CS (chip select line),rd and wr lines and data bus Hr interview: the interviewer was standing ...I was seated...(i felt a bit awkward and embarrassed and was trying very hard to hide my nervousness) tell me about yrself why persistent how was our testing procedure what are your professional goals do you have any questions? tell us clearly your present corresponding address ( later ,after selections, they told that they will post the offer letter to the same address)

That was it guys...a grueling but exciting session...I was not thinking about get selcted or rejected...just focussed on clearing each and every round...this attitude helped me a lot...deliver your best, prepare for the worst.....enough gyan doses.... chill out guys....

Paper 23

PERSISTENT PAPER ON 2nd FEBRUARY 2008

HI ! ITS RAHUL JAIN FROM SRIT JABALPUR . BHAI LOG GALTI SE PERSY NIKAL GAYE I WANT TO SHARE MY EXPERIENCE WITH ALL OFYOU FOR CRACKING PERSISTENT.WELL IT WAS A TOUGH NUT TO CRACK.. MY FIRST CAMPUS EXPERIENCE WAS WITH INFY BUT I COULDNOT CLEAR ITS WRITTEN ROUND SO I WAS VERY MUCH DEJECTED BUT THE VERY MUCH SUPPORT NEEDED TO GET OFF INFY SETBACK WAS GIVEN BY MY FRIENDS ,PARENTS AND GOD.EVERYBODY SAID WHATEVER HAPPENS ITS FOR OUR GOOD . ABEY INFY NA NIKALNA ACHHI BAAT HAI. BUT I WAS STILL LITTLE BIT HAPPY AS MOST OF MY BEST BEST FRIENDS CLEARED WRITTEN AND ALMOST ALL HR ALSO.COMING BACK FROM INFY TRAGEDY IT WAS PERSY SO I TRIED HARD SO THAT I CAN CLEAR AS MANY ROUNDS AS I CAN.BY GODS GRACE THE NUMBER TURNED OUT TO BE ALL THERE ARE 5 ROUNDS: 1.WRITTEN 1- { 30 MIN 30 Q} { 12-LR ,C,C++.3-ENGLISH,MATHS} 2.WRITTEN 2- { 1 HR 2 Q. 1 TO WRITE AS MANY AS I/P & O/P FOR THE GIVEN PSEUDO CODE.2 nd WAS PUZZLE. 3. TECH 1 { ALL SUBJECTS STUDIED DURING BE AND C,C++ DS} FOR YOUR KIND INFORMATION I AM A E&TC STUDENT. 4.TECH 2-{ SAME WITH PUZZLES} 5.HR. TOTAL ABOUT 400 STUDENTS APPEARED ONLY 86 CLEAREDFIRST ROUND.26 NEXT ROUND. 14 THIRD ROUND.FINALLY 9 WERE SELECTED. FIRST ROUND WAS A BIT EASY IF YOU ARE THOROUGH WITH RS AGGARWAL & ARUN SHARMA.{ 30 MIN 30 Q}. SECOND ROUND WAS TOUGH { 2Q 60 MIN}.Q WAS SOMETHING LIKE THIS. A PSEUDO CODE WAS GIVEN AND YOU HAVE TO WRITE ALL POSSIBLE I/P & O/P COMBINATIONS PREMIUM=500 IF (AGE<25 AND MALE AND NOT MARRIED) PREMIUM=PREMIUM -100 SOMETHING LIKE THIS 3-4 CONDITIONS WERE GIVEN.ANOTHER Q WAS A TOUGH PUZZLE.NOW CAME TECH1. Q BASED ON FOLLOWING TOPICS WERE ASKED :DATA COMM ,DIGITAL CKT AND SYSTEMS,NETWORK ANALYSIS, C,C++, DS,ELECTRONICS,ANALOG AND DIGITAL COMM. IT WAS ABOUT 1.30 HRS LONG NO INTERVIEW WAS LESS THAN 1.15HRS

THEN CAME TECH2. Q BASED ON C,C++,DS. THIS TIME LEVEL OF Q WAS HIGH AND VERY VERY STRESSFUL ONE. ABOUT 7-8 PROGRAMS WERE ASKED TO BE WRITTEN SUCH AS FIBBONICA SERIES, SWAPPING TWO NUMBER IN AS MANY WAYS YOU CAN , ALMOSTALL LINKED LIST OPERATIONS ,REVERSING A LINKED LIST ,SRUCTURE, UNION,ARRAYS. IT ALSO TOOK 1.30 HRS.THEN SUDDENLY A LADY ENTERED SHE WAS THE HR .SHE SAT FOR ABOUT 15MIN AND WAS OBSERVING ME QUITE CLOSELY. THEN SHE STARTED ASKING ABOUT MY FAMILY BACKGROUND,HOBBIES,WHAT I THINK OF SOFTWARE INDUDTRY(ABOUT 23TIMES),ONE PUZZLE,WHY SOFTWARE ( I TOLD COMING FROM A EC BACK GROUND COULD PROVE A ADDED ADVANTAGE TO ENTER IN SOFTWARE INDUSTRY WITH BASIC KNOWLEDGE OF COMPUTERS). SO GUYS I HAVE NO INTENTIONS TO SCARE YOU BUT TO GET YOU AWARED THAT TODAY S WORLD IS FULL OF COMPETETION GIVE IT YOUR BEST SHOT EVERY TIME PREPARE FOR GOOD COMPANIES LIKE INFY,PERSIE. EVEN I THOUGHT OF CLEARING PERSIE BUT MY SELF CONFIDENCE, AND GOD HELPED CLEAR IT SO BE OPTIMISTIC I AM EVEN YOU CAN DO IT.
Paper 24

PERSISTENT PAPER AT NANDED hi.. i am Manisha Korpe from s.g.g.s i e&t,nanded. i got selected in persistent. now i am telling about selection procedure of persi. specially for electronics & telecom students. don't worry about apti it's very simple. there are 30 questions and time is of 60 min,no sectional cutoff criteria is above 55%. It consists of following rounds 1.APTITUDE 2.TR1 3.TR2. 4.HR Aptitude consists of 2 sections.1-quantitative,2-'c'questions.apti is separate for electronics & computer ,IT. so don't worry apti is of 30 marks out of which 25 marks on qunti & 5 marks on 'c' questions. In quanti they ask questions on probability,permutation & combination,ages,averages,simple & compound interest,percentage. In 'c' questions are like find out output of given program,error finding.apti is very simple u can easily crack.some questions from apti which i remember are .find output of following 1.main() { i=2; printf("%d %d",++i,++i); } ans- 4 3 2.main() { int n; printf("enter any no"); scanf("%d",&n);

for(i=0;i<N;I++)< P> { printf("\t%d",fib(i)); } getch(); } fib(int n) { if (n= =0) { return 0; } else if(n= =1) { return 1; } else return (fib(n-1)+fib(n-2)); } find the output of above program for n=8. for this type of question refer book "test ur c skill". 3.find the probability of getting any day is sunday in any leap year . ans-2/7 4.if a stick of any length is breakdown in two parts.find the probability getting length of stick more than 3:1 TR1In this section they ask the questions on 'c',microprocessor(if u mention in introduction as a field of interest),'c++' some questions are like 1.what r storage classes in 'c'.explain about 'extern ' 2.tell something about calloc and malloc.and difference betn.these two. 3.do program for finding factorial of given number using recursion or without using recurtion. 4.do program for fibonises series using recursion or without using recursion. 5. without using strev function print the reverse string. 6.without using third string swap the contents of string. And basic questions like on pointer,microprocessor. TR2In this section they give 3 programs u have to do that program they ask any type of program for me they ask the programs like1. multiplication of two nos.in 8085 microprocessor 2. if input array is given as [ 1,3,5,6,1,3,4,1,5,7,8] U have to print the array such that in which do not repeat the nos.which r in input array i.e. Output array is [1,3,5,6,4,7,8]

3.find the given no. is in form of 2^n or not 4.if an array is given find the addition of two successive elements and print this addition in another array. Eg.A=[2,3,6,9,1,5,7] is input then output is B=[5,15,10,12] HRIn this round they ask general questions like Tell me about urself. Ur weaknesses,strengths, hobbies Why persistent.etc

Paper 25

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.

Paper 26 PERSISTENT SYSTEMS PAPER ON 07th FEBRUARY AT NAGPUR Hai friends, Please Remember one thing, that if the subjects like oop and dbms are not covered yet, then they wont take ur exam on that...... i thought the paper would contain it and the subjects are yet to be covered (as I am in 6th sem) so i didnt prepare the C and data structures. Dont make that childish mistake. They consider your subjects covered and then they take the test accordingly. For Computer people they have placement for Development and for others (NA for electrical) ETC it is Quality Analysis and testing. Criteria to appear is 60 % and above from ssc hsc engg present and no KT you have to be a clean person. (a Saint) I am from Computers , so discussing the Development paper: QA had different test 1st Round:Appeared 350+ Selected: 59 only All MCQz = Multiple choice Questions 15 questions on aptitude LR, percentages, age problems,Ratio proportion 15 Questions on C give the output, what is the error, some had abcde and some had abcd options only 10Questions on Data Structures Complexity, Better sorting techniques,etc 5 Question on OS. Unix, paging, segmentation. 2nd Round:Selected =22 Write a C Program 1) An Array to be passed to a function and check some condition and print. <--- SO pointers are considered 2)Datastructure BTREE pre-order and its traversal and checking if itis palindrome. 3rd round Interview : In the nagpur Persistent campus............. results yet to be out ...... I think five would be selected Persistent is a 11th fastest growing company , so if you want to learn while you earn go for it Package provided was 2.6+

Paper 27

PERSISTENT PAPER ON 14th NOVEMBER AT PUNE Hi I have attended the persistent written test. The paper consists of 2 test. Test 1 -- consists of only technicalobjective questions, It has six sections & each have 5 Qns. The sections are -1. C Programming 2. Theory 3. Genera 4. OS 5. Database 6. Data Structures 1st SECTION(Data structures and Alogorithm.) 1)From the following when 43 will not be found by binary search (a series was given with last element 43 in each) 2)On which maximum operations cannot be performed .if we want to use abstract data type. a)Array b)Hash Table c)Linked List d)Heap e)Binary Tree 3)A hash table has a size 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 4)Forest with n Trees and having p edges then a)n(1-p) b) n = p +2 c) n-p+1 d) e)

5)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 c) d)

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)output for the diagram one diagram of AC was given a.odd number of a b.even numbers of a c.even number of b. d odd number b CFG was given S -> 1 S 1 S-> 0 S 0 S -> 1 1 S -> 0 0 Find out the string 3) 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 200ns what is the cache hit ratio.what % should be cache memory so that not more than 20 % is main memory accessed. a.90% b.95% c.98% d80% 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. 5) 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. d) 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 d) 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 c) 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. 1254 8971 9763 2358 output should be 1, 2, 5, 4, 1, 3, 8, 5, 3, 2, 9, 8, 9, 7, 6, 7

Q.2) insert operation on doubly link list.

Paper 28

PERSISTENT PAPER PATTERN ON 30 JULY 2006 AT PUNE Hi I have attended the persistent written test. The paper consists of 2 test. Test 1 -- consists of only technicalobjective questions, It has six sections & each have 5 Qns. The sections are -1. C Programming 2. Theory 3. Genera 4. OS 5. Database 6. Data Structures 1st SECTION(Data structures and Alogorithm.) 1)From the following when 43 will not be found by binary search (a series was given with last element 43 in each) 2)On which maximum operations cannot be performed .Something like that a)Array b)Hash Table c)Linked List d)Heap e)Binary Tree 3)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 4)Forest with n Trees and having p edges then a)n(1-p) b) n = p +2 c) n-p+1

d) e) 5)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

c) d) 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 3) 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. 5) 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. d) 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 d) 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 c) 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. 1254 8971 9763 2358 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.

Paper 29

PERSISTENT PATTERN - 21 FEB 2004 Hi I have attended the persistent written test. The paper consists of 2 test. Test 1 -- consists of only technicalobjective questions, It has six sections & each have 5 Qns. THe sections are -1. C Programming( in which some C Qns are there) 2. Theory ( Qns from Compiler toc etc.) 3. General( Qns from probability etc.) 4. OS(Qns from OS, like 5 processes are given with their burst & some scheduling policy is also given, now find out when process P is completed) 5. Database ( Qns from Normalisation, Transactions etc) 6. Data Structures Qns are pretty simple. one Knowing only the basics can be able to clear the exam. Just go through C language part in some detail. Test 2--- Consist of only 1 Qn for program. In this we have to make a C program. Qn is that there is a binary tree , a node having three pointers -- Left child, right child, parent. Now the problem is to delete the tree in top-down fashion ie First delete parent & then child. In previous paper, the Qn ask in this section is that--To take a string from the User & then arrange the characters in that string in ascending order like if user enters "babcac" the program should print it as "aabbcc" The test is very simple just go thru the basics of OS, DBMS & data structures. & concentrate over C programming. It is very essential.

Paper 30

PERSISTENT PAPER - 15 JAN 2004 - INDORE Dear all, Persistence system came to INDORE for freasher recruitments on 15th jan 2004. I also appeared for the test and now I am waiting for the result which will be delared on 20th jan. So, I am sending the questions (based on memory). THERE ARE TWO ROUND OF WRITTEN.

IN THE 1ST ROUND it was objective which consists of 6 sections AND EACH SECTION HAS 5 QS. Duration 1hour 1ST SECTION:( DATA STRUCTURE) 1. question from binary search tree ans(250) 2. 3. hash table problem ans(5) 4. adjacent matrix to calculate shortest path ans(7) 5.

2ndSECTION (C LANGAUGE) 1 what is int(*(*ptr (int))(void) 2. recursion to find the value of GET(I don't remaember the digit but it is 2 arguments (ans 6) 3. 4 recursion function to calculate fun(4,9)( ans e) 5 problem from strcmp 3rd SECTION(O.S) 1. 2 string reference is given calculate the page fault based on LRU (ans:3 or 6) 3cache hit ratio numerical (ans 98%) 4 ans 360 (but I am not sure) 5 4TH SECTION(DBMS) 1. query is given based on table employ(eno,name,salary..),workl(eno,.),project(pno,..) select eno from employ where eno in(select eno from workl groupby eno where count(*)=(select count(*) from project)) 2.select eno from emply where salary=salary 3.which is not required in trascation options are (a).atomicity (b)isolation (c)normalization (d)concerrancy 4. 5 5TH SECTION(TOC) 1. one transtion state is given identify the grammer it accept 1 2. 0 0 1 1,0 option are( a) (10)* (b) string starting from 1 (c) ) string starting from 0 (d) 1*0* 2.totolagy ans(b) 3 4 5 S->1S1 S->00 S->11 S->0S0 Option are (a) 00100100 {b) 110010001(c) I don't remember

6th SECTION (GENERAL COMPUTER) 1 2. 3. 4. 5.

difference between packet swiching and circuit swiching what is the probiblity of the occurance of 7 beetween 0 and 999 ans(18/25) ans (360) ans (37000)

SECOND ROUND (OF 1HOUR) (VERY VERY TOUGH) TWO C PROGRAMS ARE GIVEN Q1. U have to write the function for matrix addition using link list. It is called "sparse matrix" .The structure for the element is as follows. Typedef struct element{ Int row; Int column; Int value; Element * next; }element,sparsematrin*; If value contains zero then there should not be node assign for that.U have to also check boundary condition in your program. Function is: SparseMatrix SmAdd(SaprseMatrix m1,SparseMatrix m2) ( Revised concept of linked list and have a look at coding..) Q2.Problem:One boy has to climb steps. He can climb 1 or 2 steps at a time. Write a function that will returns number of way a boy can climb the steps. Int WaytoSteps(int n) (eg:- suppose number of steps is n=4 ,the function will return 5 (one-one-one-one ,one-one-two, one-two-one-,two-one-one, two-two) second round is vey important for getting selected.

Paper 31

Persistent Sample Test Paper. Paper Pattern: Two papers are there both of 1 hour 1.Objective 2.Programming ( in C ).

Objective Paper Six Sections are there each section contains 5 Questions. Paper is of GATE pattern. 1. Data Structure. 2. DBMS. 3. TOC. 4. OS. 5. General Section. 6. C programming. DATA STRUCTURE 1. Question of Binary search tree to find node when 43 will not be found Ans= Every data

set was having 43 as its last element. 2. To find complexity of Linked list .Singly circular ordered list is there if m elements are

to be inserted what will be the complexity of time. i. O(m*n). ii. O(m*(m+n)). iii. O((m+n)*log(m+n)) 3. Adjacency matrix question to find shortest path Ans=7.

ABCDE A0m Bm022m C05 D06 E0 Where m=infinity, Find shortest path from B to E. 4. Forest & Tree question to find total no of nodes

1 n-(p+2) ANS 2. n-p+2. 3. n-p. etc same question is in Sahni I think go thru it. 5. Infix to Postfix expression Of A+B*(C+D)/E+F {ANS=ABCD+*E/+F+ } question is not

confirm but pattern is of same type DBMS 1. Query from Navathe Select fname,lname from employee where eno in (select eno

from works-on where pno=(select * from project)); what is the output . 2. A query is given eg. Select name from employee where salary=salary. They ask

whether query runs or not so just check it. Ans=Query Invalid 3. What is the main use of B & B+ trees in database Ans= For queries

4.

question on Left outer Join & Full outer Join. For both Variables are given & in options

relationship is given to find whichever have greater tuples. 5. To save space which option is better . Options are

i. Write all join operation than select than project. ii. Write all join operation than project than select. iii. Write all join operation in between select & project. OS 1. 2. Using LRU how many page faults are generated. 20 pages are there Ans=6 page fault match the column

Options i. semaphore i ii. Monitor ii iii. Deadlock iii iv. Mutual Exclusion iv. Iv 3. One question on file locking. Scenario is given

Ans 1. Provide indefinite locking 4. 5. Prevent intermediate file Access. (Both 1 & 2) If there are n processes & each process waits p time in waiting state then CPU

utilization is (options are) 1. n(1-p) 2. (1-p to the power n) ANS (not sure) 3. 1-np. 4. n*p 5. A critical section is Ans = a set of instruction which is shared by many process. General 1. 2. Probability to find digits which not contain 7 between 100 to 999 Ans=18/25 Packet switching & Circuit Switching some diff are there Ans= CS take more time to

established circuit. 3. 4. A file have 3 bits for char such type of question Ans= 27000 or 24000(Confused) Hash table question Ans=2. {3,5,7,9,6} how many

A hash table has size of 11 & data filled in its positions like

comparison s have made if data is not found in the list in worst case?. Options= i. 2 ii. 6 iii. 11 iv. 1 5. 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. C Programming

1. 2. 3. {

Array pointer is pass String Buffer Question String Concatenate(Char *s1,Char *s2)

Char buf[1000]; Buf[0]=null; Strcat(buf,s1); Strcat(buf,s2); Return buf; } i. should not return pointer to local variable. ii. Nothing Wrong in this function. iii. It dont work if length exceeds 1000 char. iv. Error in this code. 4. foo() call how many times Ans=5050.

For(i=1;i<=100;i++) For (j=1;j<=100;j++) Foo(); Programming Section ( mainly ask 2 programs.) 1. Occurrence of letters in String. Get string from KB of any length & print letters coming

maximum time first than second largest.. i.e in descending order. Their requirement: They want that u make this program thru linked list if u do that than it is well n good. Must allocate memory dynamically. Use proper assumptions & Comments everywhere this will add more advantage .use in all programs. Output look like if u enter string aababbbcba b 5 times a 4 times c 1 times just like that Hint: Make array of 256 chars. Now Scan the string pick each char and according to its acsii value increment that index value at last u have an array which have counter for each alphabet. Sort this array & display. 2. Sparse Matrix Addition.

A structure of sparse matrix is given. You have to create a function sparseadd to add 2 sparse matrices Structure is some how like Struct Sparsematrix { int row ;

int col ; int val; SparseMatrix *next; } You have to made function to add two sparse matrices. Function signature like SparseMatrix SparseAdd(SparseMatrix s1,SparseMatrix s2) Interview Questions 1. 2. 3. Prepare DS,DBMS,OS,TOC thoroughly may ask abt anyone everything . Reversing a linked list. How u make database for windows directory structure or any OS.

Hint: using trees & field parent of which points to parent. 4. Make Program (Logic) to find word in Dictionary.

Hint: using Hash Table. 5. 6. 7. 8. 9. 10. 11. Make logic of sorting which is not given in books. Make ur own. win NT architecture given in galwin book in end. File system FAT, NTFS etc. Prepare your project & CV Thoroughly. They ask to make a Joke. Tcp/ip. Whatever they presented in PPT watch it carefully(Most Important)

Paper 32

Persistence paper SGSITS

1. If there r n proceses and each process waits p time in waiting state then cpu utilization is-: a) n(1-p) b) n*p 2. 3. A string of pages were given and no of page faults have to be found in LRU algorithm 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) 4. A critical section is

ans a set of instruction which is shared by many proceeses 5. 6. There was a question on automata ans the resultant string will have even no of c CFG was given

S -> 1 S 1 S-> 0 S 0 S -> 1 1 S -> 0 0 Find out the string 7. 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) 8. find postfix and prefix of

A+B*(C+D)/E+F 9. Find out shortest path from A to B

ABCDE A0m Bm022m C05 D06 E0 10. From the following when 43 will not be found by binary search (a series was given

with last element 43 in each) 11. 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) 12. from the set {a,b,c,d,e,f} find no of arrangements for 3 alphabet with no data

repeated 13. 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. { 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. { 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++ ) void main() func(char *s1,char * s2) < <= > >=

printf(%d,a[i]); } func(int j,int *a) { j=j+1; a=a+j; } 19. { 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 oid main()

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

Paper 33

MODE: CAMPUS COLLEGE: Government Engineering College, Aurangabad RECRUITMENT FOR: Development/Testing The test consisted of a 1hr technical objective questions and 1hr ,Programming test. Tech. Qs There were six sections and each consist of 5qs. A. Computer Algorithms

1. Time Complexity 2. Which of the following cannot be implemented efficiently in Linear Linked List 1. Quicksort 2. Radix Sort 3. Polynomials 4. Insertion Sort 5. Binary Search 3. In binary search tree , n=nodes, h=height of tree. What's complexity? 1. o(h) 2. o(n*h) 3. o(nLogn) 4. o(n*n) 5. None 4. 5. B. C Programs

1. Printf("%d%d",i++,i++); 1. Compiler Dependent 2. 4 4 3. 4 3 4. 3 4 5. None of Above 2. void main() { printf("persistent"); main();

} 1. Till stack overflows 2. Infinite 3. 65535 4. 34423 5. None 3. Swapping 4. what does it do? void f(int n) { if(n>0) { if(A[i]>A[j]) swap(); } else f(n-1); } 1. Swap 2. Sort in Ascending order 3. Sort in Descending order 4. Computes permutation 5. 5. Given a Fibonacci function f1=1;f2=1 fn=f(n-1)+f(n-2) which of the following is true? 1. Every Second element is even 2. Every third element is odd 3. The series increases monotonally 4. For n>2, fn=ceiling(1.6 * f(n-1)) 5. None C. Operating System

1. Where the root dir should be located 1. Anywhere on System disk 2. Anywhere on Disk' 3. In Main memory 4. At a fixed location on Disk 5. At fixed location on System Disk 2. Problem on Concurrency

3. Problem on Round Robin Algorithm 4. 5. D. General

1. If x is odd, in which of the following y must be even 1. X+Y=5 2. 2(X+Y)=7 3. 2X + Y =6 4. X+2Y=7 5. 2. 1000! How many digits? What is the most significant and Least significant

digit 3. 4. 5. E. Theory

1. If a production is given S -> 1S1 0S0 00 11 Then which of the following is invalid 1. 00101010100 2. 3. 4. 5. 2. Context free grammar cannot recognize 1. if-then-else 2. var 3. loops 4. syntax 5. None 3. 4. 5.

F.

DBMS

1. If table A has m rows and table B has n rows then how many rows will the following query return SELECT A.A1,B.B1 FROM A,B WHERE A.A3=B.B3 1. <=(m*n) 2. m*n 3. <=(m+n) 4. >=(m+n) and <=(m*n) 5. m+n 2. A Query optimizer optimizes according to which of the following criteria 1. Execution time 2. Disk access 3. CPU usage 4. Communication time 5. None 3. Which of the following is not a characteristic of a transaction 1. Atomicity 2. Consistency 3. Normalization 4. Isolation 5. Durability 4. The def. of Foreign key is there to support 1. Referential integrity 2. Constraint 3. 4. 5. None 5. Problem Process A Process B WRITELOCK(X) WRITELOCK(Y) READ(X) READ(Y) ... ... 1. The problem is serializable 2. The problem is not serializable

3. It can be run in parallel 4. 5. None PROGRAMMING SECTION (This consisted of Two programs to be solved in 1 hour.) A sparse matrix is a matrix in which a node with val=0 is not represented. The whole matrix is represented by a Linked list where node typedef struct Node { int row; int col; int value; sparsematrix next; } Element, *sparsematrix; The problem is, if there are two matrix given suppose m1 and m2, then add them and return the resultant sparsematrix. If suppose there are N functions say from 0,1,2,... N-1 and it's given that A[i][j]=1 if the function i contains a call to func. j otherwise A[i][j]=0, then write a function that will form groups of related functions and print them line by line and at the end print the number of total groups