GATE PYQ

GATE CSE 1993

Q1.
\sum_{1\leq k\leq n} O(n), where O(n) stands for order n is:

Q2.
What does the following code do? var a, b: integer; begin a:=a+b; b:=a-b; a:a-b; end;

Q3.
Consider a system having m resources of the same type. These resources are shared by 3 processes A,B, and C which have peak demands of 3, 4 and 6 respectively. For what value of m deadlock will not occur?

Q4.
The root directory of a disk should be placed

Q5.
Let A and B be sets with cardinalities m and n respectively. The number of one-one mappings from A to B, when m \lt n, is

Q6.
Identify the logic function performed by the circuit shown in figure.

Q7.
A simple two-pass assembler does the following in the first pass:

Q8.
Assume that each character code consists of 8 bits. The number of characters that can be transmitted per second through an asynchronous serial line at 2400 baud rate, and with two stop bits is

Q9.
Simpson's rule for integration gives exact result when f(x) is a polynomial of degree

Q10.
The less-than relation, \lt, on reals is