2011 Persistent Placement Papers - IIPune

  • CategoryIT
  • Sub CategoryPlacement Papers
  • LocationPune
  • CompanyPersistent
  • Posted date on our Website13 February 2011

User Ratings

2 out of 5 based on 6 Ratings.
Here are the details of 2011 Persistent Placement Papers - II job in Persistent. This job or placement paper has been sourced from either company website or newspaper or other media and from students who appeared for this job. User is requested to verify the data before applying for the job.

Welcome to Persistent Placement Paper 2011. Here you will find Persistent Placement Paper Pattern and Download questions of Persistent Placement Paper 2011 with Answers & Solutions.

2011 Persistent Placement Papers:-

1. what does it do?
void f(int n)

1. Swap
2. Sort in Ascending order
3. Sort in Descending order
4. Computes permutation

2. Given a Fibonacci function
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

3. Where the root dir should be located

4. Anywhere on System disk

5. Anywhere on Disk'

6. In Main memory

7. At a fixed location on Disk

8. At fixed location on System Disk

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

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

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

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

13. Using LRU how many page faults are generated. 20 pages are there Ans=6 page fault

14. match the column

i. semaphore i
ii. Monitor ii
iii. Deadlock iii
iv. Mutual Exclusion iv. Iv

15. One question on file locking. Scenario is given

Ans 1. Provide indefinite locking

16. Prevent intermediate file Access. (Both 1 & 2)

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

18. packet switching is better than circuit switching coz

a) it takes less time
b) it takes less bandwidth
c) it takes low frequency
d) none

19. addition of two sparse matrix in 3 tupple notation ---time 30 min 24a tree has 1000000 nodes than how many search r required to search a node

20. A program to arrange a string in order of occurrence of the character

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

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

. There was a question on automata ans – the resultant string will have even no of c

6. CFG was given
S -> 1 S 1
S-> 0 S 0
S -> 1 1
S -> 0 0
Find out the string

24. One singly circular ordered list is there if M elements are to 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)none of these

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

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

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

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

About Persistent:-

Persistent work with its customers to help them proficiently deliver products to their end-users and ultimately, to maximize their core business. Persistent's outsourced software product development services allow its 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.

Persistent has invested in structuring a gigantic team of software engineers, veterans in product development culture. Persistent's team of industry specialists has an understanding of the industries in which its customers operate and the competencies that they necessitate. It has competency centers in telecom and wireless, life sciences, analytics and data infrastructure, embedded systems domains, product engineering and Microsoft and Java platforms.

Why Persistent  - Why shoul i join Persistent?:-

Persistent  extremely cohesive and close-knit. It open communication promotes an easy exchange of views and information. Seniors and juniors share a good rapport and transparency, and the entire organization works together as a single, large team.

At Persistent, you will come face to face with a vault of opportunities, the key to which will be the various projects assigned to you. Your tasks will challenge your abilities and force you to break out of the mold, constantly pushing you to achieve more.

Contact Details:

Address of Persistent:-

Persistent Systems Limited     Persistent Systems, Inc.
Bhageerath, 402,
Senapati Bapat Road
Pune 411016.
Tel: +91 (20) 2570 2000
Fax: +91 (20) 2567 8901

(Disclaimer : This Job or placement paper has been sourced from various sources like print media, Job consultants, past candidates, our users and/ or Company website. The posted date above means the date on which the Job was posted on our site and not on the company site. Users are advised to check with the company for latest requirements before applying for the job. Our website will not be responsible for any loss to the company or the candidate. We have no relation with the company and are not responsible for the validity of this Job. We donot charge the company or candidate or any student anything. If the respective company has any issue with the data provided or they want this particular job or placement paper to be removed they can write into us at infinitecourses@gmail.com)

Comments / Reviews / Queries On

Click to See more Comments