Placement Papers: Persistent Placement Paper Aptitude Technical Section
Examrace Placement Series prepares you for the toughest placement exams to top companies.
There were six sections and each consist of 5qs.
Computer Algorithms

Time Complexity

Which of the following cannot be implemented efficiently in Linear Linked List

Quicksort

Radix Sort

Polynomials

Insertion Sort

Binary Search


In binary search tree, n = nodes, h = height of tree. What's complexity?

o (h)

o (n * h)

o (nLogn)

o (n * n)

None

C Programs

Printf ( “%d%d” i + +, i + + )

Compiler Dependent

4 4

4 3

3 4

None of Above


void main () { printf ( “persistent” ); main (); }

Till stack overflows

Infinite

65535

34423

None


what is Swapping?

what does it do? void f (int n) { if (n>0) { if (A[i]>A[j]) swap (); } else f (n − 1); }

Swap

Sort in Ascending order

Sort in Descending order

Computes permutation

Given a Fibonacci function
f1 = 1; f2 = 1
fn = f (n − 1) + f (n − 2) which of the following is true?

Every Second element is even

Every third element is odd

The series increases monotonally

For n>2, fn = ceiling (1.6 * f (n − 1) )

None

Operating System

Where the root dir should be located

Anywhere on System disk

Anywhere on Disk

In Main memory

At a fixed location on Disk

At fixed location on System Disk


Problem on Concurrency

Problem on Round Robin Algorithm
General

If x is odd, in which of the following y must be even

X + Y = 5

2 (X + Y) = 7

2X + Y = 6

X + 2Y = 7


1000! How many digits? What is the most significant and Least significant digit?
Programming Section

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.

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