Placement Papers: Sasken Computer science
Download PDF of This Page (Size: 133K) ↧
Examrace Placement Series prepares you for the toughest placement exams to top companies.

Deadlock occur when

Some resources are held up by some process.

Not Known

Not Known

None of these


A prefix expression can be equal to a postfix expression reversed only if

It is left associative

It is commutative

It is right associative


How many lines will be printed in the following Pascal pgm [I don't remember the Pascal version, so I am giving C version] void print (int n) { if (n>0) { print (n − 1); printf ( “%d” n);//println (n) in Pascal version. Print (n − 1); } }

3

7

15

31


Maximum number of nodes in a tree with n levels.

2^ (n − 1)

(2^{n}) 1

2^ (n − 1) 1


Complete graphwith n nodes have

n − 1 edges

n (n − 1)/2


If d is the degree of a node in a graph and n is number of vertices then number of edges in that graph is

Edi^{n}

0.25Edi

0.5Edi


A grammar was given and 4 strings was given and the one which was not possible was to be chosen.

A problem related to ethernet in which a station sending a frame is of p probablity. There are m stations to send pckts. 4 option was given. It was a mathematical kind of question related to probablity.

Which of the following layer in the OSI model does error handling

Data link

Network

Transport

a & c


A network problem in which Data rate, Propagation
delay, and distance was given and it was to find how
many packets will be in the line.
Choices where

5000

Not possible to find with given data

1000