Persistent Campus Placement Papers 2013

Persistent Campus Placement Papers 2013, Latest Papers of Persistent, Technical & Aptitude Questions With Answers

Persistent Technical Questions

* If there r n processes and each process waits p time in waiting state then cpu utilization is-:
a) n(1-p)
b) n*p
1. A string of pages were given and no of page faults have to be found in LRU algorithm
2. here is a file server which provides locking for mutual exclusion . if any procees locks the file
and abruptly terminated this will result in indefinitely locking .The solution they found is to
implement a timer for locking of file i.e. if time outs then server assumes that file is indefinitely
locked and terminate the process -
a) this solution is perfect for mutual exclausion
b) this will solve indefinite locking
c) this will result in interleaving of file between processes
d)
3. A critical section is -
ans a set of instruction which is shared by many proceeses
4. There was a question on automata ans - the resultant string will have even no of c
5. CFG was given
S -> 1 S 1
S-> 0 S 0
S -> 1 1
S -> 0 0
Find out the string
6. One singly circular ordered list is there if M elements are ti be inserted what will be the
complexity of time
a) O(M*N)
b) O(M*(M+N))
c) O ((M+N) * log(M+N))
d)
7. find postfix and prefix of
A + B * ( C + D ) / E + F
8. Find out shortest path from A to B
A B C D E
A 0 m
B m 0 2 2 m
C 0 5
D 0 6
E 0
9. From the following when 43 will not be found by binary search (a series was given with last
element 43 in each)
10. From 100 - 999 find the prob. Of getting 3 digit no with no 7 in any of its digit
a) 18/25
b) 10/25
c) 729/1000
d)


To GET MORE TECHNICAL INTERVIEW PAPERS VISIT: cseitliveprojects.com
Also GET CS, IT, ETC/ ET&T, ELEC, EEE, CIVIL, MECH CAMPUS PLACEMENTS PAPERS


11. from the set {a,b,c,d,e,f} find no of arrangements for 3 alphabet with no data repeated
12. To save space which option is better
a) write all join operation than select than project
b) ---------,,------------------than project----select
c) ----------,,-----------------in b/w select and project
Employee = { e_no , salary, fname, lname}
Works_On = {e_no, p_no, hrs}
Project = {p_no, p_name}
14.select e_no from Employee where salary = salary
a) query invalid
b)
15.Select fname ,lname from Employee where e_no in (select e_no from works_on where p_no
=(select * from project))
a) name of Employee who works on all project
b)
c)
d)
16.B tree is different from other
a) has fixed index file size
b) is better for queries like < <= > >=
c) searching will be easy
d)
17.func(char *s1,char * s2)
{
char *t;
t=s1;
s1=s2;
s2=t;
}
void main()
{
char *s1="jack", *s2="jill";
func(s1,s2);
printf("%s %s ",s1,s2);
}
OUTPUT jack jill
18.void main()
{
int a[5] ={1,2,3,4,5},i,j=2;
for (i =0;i<5;i++ )
func(j,a[i]);
for (i =0;i<5;i++ )
printf("%d",a[i]);
}
func(int j,int *a)
{
j=j+1;
a=a+j;
}
19.oid main()
{
for (a=1;a<=100;a++)
for(b=a;b<=100;b++)
foo();
}
foo()
{ }
how many times foo will be called.
a) 5050
b) 1010
c)
d)
20.A hash table has a sie of 11 and data filled in its position like{3,5,7,9,6}how many comparisons
have to be made if data is not found in the list in worst case
a) 2
b) 6
c) 11
d)
21.packet switching is better than circuit switching coz
a) it takes less time
b) it takes less bandwidth
c)
d)
22.addition of two sparse matrix in 3 tuple notation ---time 30 min
24a tree has 1000000 nodes than how many search r required to search a node
a) 25
b)
c)
d)
23.A prgrm to arrange a string in order of occurrence of the character


To GET MORE TECHNICAL INTERVIEW PAPERS VISIT: cseitliveprojects.com
Also GET CS, IT, ETC/ ET&T, ELEC, EEE, CIVIL, MECH CAMPUS PLACEMENTS PAPERS


1)On which maximum operations cannot be performed .Something like that
a)Array
b)Hash Table
c)Linked List
d)Heap
e)Binary Tree
2)A hash table has a sie of 11 and data filled in its position like{3,5,7,9,6}how many comparisons have
to be made if data is not found in the list in worst case
a) 2
b) 6
c) 11
d)
ANS:- 2
3)Forest with n Trees and having p edges then
a)n(1-p)
b) n = p +2
c) n-p+1
d)
e)
4)Find the shortest path from B to E
ANS: 7
one Question on Postfix.
2ndSECTION (C LANGAUGE)
1) what is int(*(*ptr (int))(void)
a)Pointer to function with no arguments(void) and return pointer to integer.
b)----
c)
2)func(char *s1,char * s2)
{
char *t;
t=s1;
s1=s2;
s2=t;
}
void main()
{
char *s1="jack", *s2="jill";
func(s1,s2);
printf("%s %s ",s1,s2);
}
OUTPUT jack jill
3) void main()
{
int a[5] ={1,2,3,4,5},i,j=2,b;
for (i =0;i<5;i++ )
func(j,a[i]);
for (i =0;i<5;i++ )
printf("%d",a[i]);
}
func(int j,int *a)
{
j=j+1;
a=a+j;
b= b+2;
}
OUTPUT: 12345
4) void main()
{
for (a=1;a<=100;a++)
for(b=a;b<=100;b++)
foo();
}
foo()
{ }
how many times foo will be called.
a) 5050
b) 1010
c)
d)
ANS: 5050
5)A tree was given with nodes assigned clours red, blue, yellow, green and more that one node is
having colour red.They have asked that how many times the output will be red if the total number of
evaluation is 11.
some code was given--I don,t remember that.
3rd Section(O.S)
1) If there are n proceses and each process waits p time in waiting state then cpu utilization is-:
a) n(1-p)
b) n*p
2)No. of pages are given and using LRU algorithm we have to find the number of page faults.
a)2
b)6
c)5
d)7
3)There is a file server which provides locking for mutual exclusion . if any procees locks the file and
abruptly terminated this will result in indefinitely locking .The solution they found is to implement a
timer for locking of file i.e. if time outs then server assumes that file is indefinitely locked and terminate the process -
a) this solution is perfect for mutual exclausion
b) this will solve indefinite locking
c) this will result in interleaving of file between processes
d) will allow the concurrent process to access the file.
4)A critical Section is
a)for mutual exclusion
b)a set of shared resources
5)Match the following.
1)Critical Section a)Mutual exclusion
2)Wait/signal b)Deadlock
3)Working set c)Hoare,s Monitor
4)Semaphore d)
4th Section(TOC)
1)There was a question on automata
2)CFG was given
S -> 1 S 1
S-> 0 S 0
S -> 1 1
S -> 0 0
Find out the string

To GET MORE TECHNICAL INTERVIEW PAPERS VISIT: cseitliveprojects.com
Also GET CS, IT, ETC/ ET&T, ELEC, EEE, CIVIL, MECH CAMPUS PLACEMENTS PAPERS

5th section General
1)Probability to find digits which not contain 7 between 100 to 999
Ans=18/25
2)Difference between Packet switching & Circuit Switching.
Ans= CS take more time to established circuit.
3)in cache memory 100ns an in main memory 1200ns what is the cache hit ratio(Question is not
exactly the same,but something related to cache hit ratio)
4)From the set {a,b,c,d,e,f} find no. of arrangements for 3 alphabets with no data repeated.
ANS=360. OR for 4 alpha ANS=720.
6th section (DBMS)
1)employee(eno,ename) works_on(eno,pno,ename) project(pno, project)
select ename from employee where eno in(select eno from works_on where pno =(select *from
project)
what is the output ?
a)Employee who works on all project.
b)Employee who works one project .
c) name of employee who works on more than one project.

2)Select ename from employee where salary = salary
3)what is the use of B-tree
a) has fixed index file size
b) is better for queries like < <= > >=
c) searching will be easy
4)Question on inner Join returning N- tuples & Full outer Join returns M- tuples. For both Variables are
given & in options relationship is given to find whichever have greater tuples.And variable D is
given------
a)then N= M
b) N = M + D
5) To save space which option is better
a) write all join operation then select then project
b) write all join operation then projects then select
c)write all join operation then select between project
Test 2- Consist of Two Questions. In this we have to make a C program.
Q.1)Inward-spiral order matrix.i.e you have to traverse the matrix in clockwise manner and display the elements,for eg.
1 2 5 4
8 9 7 1
9 7 6 3
2 3 5 8
output should be 1, 2, 5, 4, 1, 3, 8, 5, 3, 2, 9, 8, 9, 7, 6, 7
Q.2)Consider a two dimensional array A[N][N] of the order n x n.Then you find the sub-squares and display the largest sum of the sub-square.Sub- squares are the contigious elements in the array.Largest sum can be find out by summing the elements in the sub-square


To GET MORE TECHNICAL INTERVIEW PAPERS VISIT: cseitliveprojects.com
Also GET CS, IT, ETC/ ET&T, ELEC, EEE, CIVIL, MECH CAMPUS PLACEMENTS PAPERS

Tweet