Technical - Other - 15 January 2004 Paper - 12

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. difference between packet swiching and circuit swiching
3. what is the probiblity of the occurance of 7 beetween 0 and 999 ans(18/25)
4. ans (360)
5. 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

Persistent Paper Aptitude - General - 21 February 2004 Paper - 13

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"

Persistent Paper Technical - Other - 15 January 2004 Paper - 14

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. difference between packet swiching and circuit swiching
3. what is the probiblity of the occurance of 7 beetween 0 and 999 ans(18/25)
4. ans (360)
5. 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.

Technical - C & C++ Paper - 10

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.

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.

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

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.

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.

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.

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

Aptitude - General - 21 February 2004 Paper - 11

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.

General - other Paper - 8

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

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.

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

Adjacency matrix question to find shortest path Ans=7.
A B C D E
A 0 m
B m 0 2 2 m
C 0 5
D 0 6
E 0
Where m=infinity, Find shortest path from B to E.

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.

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

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 .

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

What is the main use of B & B+ trees in database Ans= For queries

question on Left outer Join & Full outer Join. For both Variables are given & in options relationship is given to find whichever have greater tuples.

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

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

One question on file locking. Scenario is given
Ans 1. Provide indefinite locking

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

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.

A file have 3 bits for char such type of question Ans= 27000 or 24000(Confused)

Hash table question Ans=2.
A hash table has size of 11 & data filled in its positions like {3,5,7,9,6} how many comparison s have made if data is not found in the list in worst case?.
Options= i. 2 ii. 6 iii. 11 iv. 1

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

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 don’t work if length exceeds 1000 char.
iv. Error in this code.


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

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 it’s acsii value increment that index value at last u have an array which have counter for each alphabet. Sort this array & display.

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

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.

Make Program (Logic) to find word in Dictionary.
Hint: using Hash Table.

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)

General - other Paper - 9

Persistence paper SGSITS

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

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)

A critical section is –
ans a set of instruction which is shared by many proceeses

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

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)

find postfix and prefix of
A + B * ( C + D ) / E + F

Find out shortest path from A to B
A B C D E
A 0 m
B m 0 2 2 m
C 0 5
D 0 6
E 0

From the following when 43 will not be found by binary search (a series was given with last element 43 in each)

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)

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

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}

select e_no from Employee where salary = salary
a) query invalid
b)

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)

B tree is different from other
a) has fixed index file size
b) is better for queries like < <= > >=
c) searching will be easy
d)

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

void main()
{
int a[5] ={1,2,3,4,5},i,j=2;
for (i =0;i<5;i++ )
func(j,a[i]);
for (i =0;i<5;i++ )
printf(“%d”,a[i]);
}
func(int j,int *a)
{
j=j+1;
a=a+j;
}

oid main()
{
for (a=1;a<=100;a++)
for(b=a;b<=100;b++)
foo();
}
foo()
{ }
how many times foo will be called.
a) 5050
b) 1010
c)
d)

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)

packet switching is better than circuit switching coz
a) it takes less time
b) it takes less bandwidth
c)
d)

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)

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

General - other Badnera(PRMIT)Engg college,Amravati - 15 February 2007 Paper - 5

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.

Whole Testpaper Pune - 29 July 2006 Paper - 6

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.

1 2 5 4
8 9 7 1
9 7 6 3
2 3 5 8

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

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

Whole Testpaper PATIALA - 6 May 2006 Paper - 7

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

Whole Testpaper NANDED Paper - 3

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

{

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



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



TR2-
In this section they give 3 programs u have to do that program they ask any type of program for me they ask the programs like-

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



HR-
In this round they ask general questions like

Tell me about urself.

Ur weaknesses,strengths, hobbies

Why persistent.etc

General - other UIT-RGPV,Bhopal - 29 April 2007 Paper - 4

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

Candidate Experience - Persistent Exam in May 2008 Paper - 1

HI....

I am 1.6 yrs Ex in c++ unix.....

I gave persistent exam in May 2008....

Written was conducted by Merittrac consultancy....

Aptitude was simple for C++ there was questions about friend functions, templates, inheritance etc....

I had telephonic interview
1. How dynamic polymorphism works
2. If copy constructor is not there then what all things you can,t do.
For this I told concept of copy constructor and why wee need but he said NO....He said you can,t do
obj(obj1) which I think i preety obvious
Thts it no other C++ question.

3. Binary search Algorithm (its not binary search tree) doesn,t works for which data structure

4. There is a buffer and 4 threads are wrting on it and 2 threads are reading from it. Tell what will be data structure for this buffer.

5. Do u know process scheduling algorithms.....he said u have to make your own process scheduling algo what all parameters u will keep in mind.

6. What is throughput?

His main Emphasis was on OS.

7. When you click on yahoo mail a page drops saying Enter username and passwd. Once u supply username and passwd it enters and if u open another instance of browser it will not ask username passwd this time. So tell how this thing is implimented?

General - other MSIT, Kolkata - 28 March 2008 Paper - 2

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 8-bit)..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)