PERSISTENT Sample Placement Papers for Freshers for Job Interview

List of PERSISTENT placement papers for freshers. PERSISTENT Written exam papers for jobs in interview. Sample model papers
Persistant ROUND 1: APTITUDE ROUNDIt was less aptitude round but more technical round. It consisted 60 question 60 minutes an online test on software developed by persistent only (Testmate).It consisted 5 logical questions ,2-3 quantitative questions ,Technical questions from OS,DBMS,Testing,CNT,Data Structure (mostly on trees,inorder,postorder,preorder).About 8-10 questions on C (quiet easy).Basically they focus on all engineering syllabus covered for IT or CS stream.Having done this, A problem…
Placement Papers Company Profiles | Test Patterns | Contribute Placement PapersPersistent : Test PaperThe number of viewers:1820 readsPrevious Papers Paper Type : Candidate-Experiences Test Date : 19 Dec 2011 Test Location : Dr.BATU, Lonere Posted By : vijay gadePersistent placement paperPersistent recruitment process and aptitude test experiencesPersistent Aptitude test,Persistent Off and On campus recruitment experience for fresher job,Persistent latest test pattern,written test procedure,Persistent…
If there r n processes and each process waits p time in waiting state then cpu utilization is-:a) n(1-p)b) n*p1. A string of pages were given and no of page faults have to be found in LRU algorithm2. here is a file server which provides locking for mutual exclusion . if any procees locks the fileand abruptly terminated this will result in indefinitely locking .The solution they found is toimplement a timer for locking of file i.e. if time outs then server assumes that file is indefinitelylocked…
1)On which maximum operations cannot be performed .Something like thata)Arrayb)Hash Tablec)Linked Listd)Heape)Binary Tree2)A hash table has a sie of 11 and data filled in its position like{3,5,7,9,6}how many comparisons haveto be made if data is not found in the list in worst casea) 2b) 6c) 11d)ANS:- 23)Forest with n Trees and having p edges thena)n(1-p)b) n = p +2c) n-p+1d)e)4)Find the shortest path from B to EANS: 7one Question on Postfix.2ndSECTION (C LANGAUGE)1) what is int(*(*ptr (int))(void)a)Pointer…
1. Aptitude testInvolving 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 TestInvolving 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…
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 structuresThe subjects he mainly focussed are C, DS, C++, OS, DBMS, CN, UNIX.Persistent exam contains two setsObjective test:In this he will touch all the subjects which i had mentioned above. In addition to that GA 5+ questions will be there.…
1 Technical test...objective2 Technical/English test subjective.3.technical interview.4 hr interview.total student appeared 156 .cleared the test (obj and sub) 35cleared the technical interview 12 final selection 4most student rejected these company bcoz1.boreing ppt2 low package3 waiting for govt. sectors4 after that day thr was snap on 20th dec5 so many round for selectiontotal question 60 total tym 60min package 2.5L to 3Lobjective technical questionstotal 60 question50 where technical + 10 apptitude(simple)on…
1Writtent Test: this test is objective type which is having 40 question in 1 hourNo of Quetion Area10 Q from aptitude 5 Q from LR10-12 Q C language8-10 Q DS8-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…
PERSISTENT PAPER ON 29TH FEBRUARY,2008 AT JIMS ROHINIHi, 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 students180 cleared the 1st roundAnd finally 42 students were selected.I was the only student selected from my college.Pattern1st round was technical aptitude (duration:…
First Round,, (written objective)>Simple Aptitude(10 ques)>data Structure(10)>O.S.>DBMSSecond round (subjective)>Three Programs were there..data structureOut 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…
PERSISTENT PATTERN - 06 MAY 2006 - PATIALAMay 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…
Test-1 Pattern1st round was technical aptitude (duration: - 1hr)It basically contain 40 questions15 general aptitudes like logical deduction from RS aggarwal (simple one)35 technical questions from C, C++, DBMS ,OPERATING SYSTEMOverall 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…
PERSISTENT PAPER ON 16th JUNE AT MAHARASHTRA College: Government College of Engineering AMRAVATI, MaharashtraHi, 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 was1. 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 to1. 58% aggregate…
PERSISTENT PAPER ON 16th JUNE AT MAHARASHTRA College: Government College of Engineering AMRAVATI, MaharashtraHi, 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 was1. 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 to1. 58% aggregate…
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…
PERSISTENT PAPER ON 14TH OCTOBER 2007Written 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 2is 2good 2boy 1doing 1job 12> 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…
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 rounds1.APTITUDE2.TR13.TR2.4.HR Aptitude consists of 2 sections.1-quantitative,2-,c,questions.apti is separate for electronics & computer…
PERSISTENT PAPER ON 15th FEBRUARY Hello guysI appeared for persistent campus.Appered 132Shortlisted 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…
PERSISTENT PAPER ON 14th NOVEMBER AT PUNE HiI 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…
PERSISTENT PATTERN - 21 FEB 2004HiI 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…