Details of Technical - C & C++ by Persistent conducted by Persistent for job interview.

Share Us With Others

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.

- Indian Overseas Bank Recruitment
- Oriental Bank of Commerce Recruitment
- YES Bank Recruitment
- UCO Bank Recruitment
- Bank of India Recruitment
- Andhra Bank Bank Recruitment
- HDFC Bank Recruitment
- Repco Bank Recruitment
- Axis Bank Recruitment
- Gramin Bank Recruitment
- IDBI Bank Recruitment
- ICICI Bank Recruitment
- Syndicate Bank Recruitment
- SBI Recruitment
- Bank Of Baroda Recruitment
- PNB Recruitment
- Central Bank Of India Recruitment
- Canara Bank Recruitment
- SBI Clerical Recruitment
- Bandhan Bank Recruitment
- Union Bank of India Recruitment
- NICL Recruitment
- IDFC Bank Recruitment
- RRC Allahabad