2011 Persistent Placement Papers - IPune

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

User Ratings

4 out of 5 based on 22 Ratings.
Here are the details of 2011 Persistent Placement Papers - I 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. 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

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


3. Printf("%d%d",i++,i++);

1. Compiler Dependent
2. 4 4
3. 4 3
4. 3 4
5. None of Above

4.  void main()
{
printf("persistent");
main();
}
1. Till stack overflows
2. Infinite
3. 65535
4. 34423
5. None

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

6. A Query optimizer optimizes according to which of Freshersworld.com the following criteria

1. Execution time
2. Disk access
3. CPU usage
4. Communication time
5. None

7. Which of the following is not a characteristic of a transaction

1. Atomicity
2. Consistency
3. Normalization
4. Isolation
5. Durability

8. The def. of Foreign key is there to support

1. Referential integrity
2. Constraint
3. None

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


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

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

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

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

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

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

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

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

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

  • I am pursuing b.e. with 66% agreegate i got 70 in X & 59.33% in XII ............ so am i eligible for persistent or not? yuvraj, on 14-10-2011 Report Abuse

  • I want these paper with answers. Please sir will you mail me this placement paper sachin, on 28-09-2011 Report Abuse

  • nice paper saket, on 06-09-2011 Report Abuse

  • i need this paper Bhushan shirke, on 03-09-2011 Report Abuse

  • I want these paper with answers. Please sir will you mail me this placement paper Sonali Panchal, on 15-08-2011 Report Abuse
Click to See more Comments