# Placement Papers: Persistent Placement Paper Aptitude Technical SectionTab.amp

Examrace Placement Series prepares you for the toughest placement exams to top companies.

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

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

## 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. what is 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. 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

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

2. 1000! How many digits? What is the most significant and Least significant digit?

## Programming Section

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

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