Latest Persistent Aptitude & Interview placement questions Paper Patter

Friday, January 14, 2011 Posted by Sangram Nandkhile

Latest Persistent Aptitude Paper Pattern
New Persistent aptitude technical papers tests, Real persistent placement papers,Latest Persistent Paper – Persistent Placement Paper,US,UK,India,mumbai,bengalore,chennai,pune

Hi, This is the paper Pattern followed for persistent Campus drive in previous Years.
What I found that they want people with sound technical knowledge thats why the test was focussed more on the technical questions.

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()
ans:print the persistant till the stack overflow occur
2) f(0)=0;
int f(int n)
ans 91;
3) question on seek() i.e. moving file pointer pointer has to point just before the last character of the file os) what is thrashing?
1) find number of nodes in complete binary tree of level 5
2) problem on queue. one queue was given and find the minimum number of insertion and deletion operation to get desired output.


There were two programs on c
1) create doubly linked list
2) Second question was on graph there is one unidirectional connected graph and we have to find connected edges in a graph user input the adjacency list /matrix
Hint: first find out the path matrix by warshall’s algorithm then from this matrix u will get which are the connected nodes which not in matrix 0 means unconnected 1 for connected


The most important round in which u ask to write a program
1)i have asked to write a program on finding a position of number in Fibonacci 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 overloading
7)static variable
8)how to allocate dynamic memory.
9)what is big o nation
10) all sorting algorithm and their complexity


They can ask u tell the different technical area of interest than c,c++,DSA. if u have so.
1) Puzzle on cutting cake in 8 same parts using only three cuts.
2) multithreading, multitasking, multiprocessor system
3) write a program reverse the integer no.
4) write a program to draw square without using rectangle function in c++.
5) FAT, NTFS, windows NT, WINDOWS XP
.6)warshall’s algorithm ,dijkstra’s algorithm
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)software engg.
10) software development life cycle.

Post a Comment

Related Posts Plugin for WordPress, Blogger...

Like Us