Computer Science Engineering

Q. No. 1 – 25 Carry One Mark Each

1. Let X be a Gaussian random variable mean 0 and variance σ 2 .Let Y=max(X, 0) where max
(a,b) is the maximum of a and b. The median of Y is ____________.
Key: (0)
Exp: ‘X’ is Gaussian random variable
X N ( 0, σ 2 ) for −∞ < x < ∞

Given y = max ( x,0 )

0 if − ∞ < x ≤ 0
=
x if 0 < x < ∞,is a random variable
Since median is positional average
Therefore, median of Y is '0'.

2. Consider the Karnaugh map given below, where x represents “don’t care” and blank
represents 0.
ba
dc
00 01 11 10
00 x x

01 1 x

11 1 1

10 x x

( )
Assume for all inputs (a, b, c, d) the respective complements a, b,c,d are also available. The
above logic is implemented 2-input NOR gates only. The minimum number of gates required
is ____________.
Key: (1)
Exp:
ba
dc 00 01 11 10
00 x x
01 1 x
11 1 1
10 x x

www.examrace.com
 F ( a, b,c,d ) = ac a.c = a + c ( x + y = x.y )
=a+c

Only 1 NOR gate required

3. The statement ( ¬p ) ( ¬q ) is logically equivalent to which of the statements below?

I. p q
II. q p
III. ( ¬q ) ∨ p
IV. ( ¬p ) ∨ q
(A) I only (B) I and IV only (C) II only (D) II and III only
Key: (D)
Exp: By rule of contrapositive,
¬p → ¬q ⇔ q → p
q → p ⇔ q∨ p

4. Consider the following table:

Algorithms Design Paradigms

P. Kruskal i. Divide and Conquer
Q. Quicksort ii. Greedy
R. Floyd-Warshall iii. Dynamic Programming
Match the algorithms to the design paradigms they are based on.
(A) P-(ii), Q-(iii),R-(i) (B) P-(iii), Q-(i), R-(ii)
(C) P-(ii), Q-(i), R-(iii) (D) P-(i), Q-(ii), R-(iii)
Key: (C)
Exp: Kruskal’s algorithm follows greedy approach in order to find MST of a connected graph.
Quick sort follows divide and conquer strategy. Floyd Warshal algorithm is used to find the
shortest path between every pair of vertices and it follows dynamic programming strategy.

5. A sender S sends a message m to receiver R, which is digitally signed by S with its

private key. In this scenario, one or more of the following security violations can take
place.
I. S can launch a birthday attack to replace m with a fraudulent message.
II. A third party attacker can launch a birthday attack to replace m with a fraudulent
www.examrace.com
message.
 III. R can launch a birthday attack to replace m with a fraudulent message.
Which of the following are possible security violations?
(A) I and II only (B) I only (C) II only (D) II and III only
Key: (B)
Exp: Sender can launch a Birthday Attack to replace with fraudulent message, because he has the
signature and he can decrypt the signature by his own public key and gets the hash value.
With that same hash value, he can create another message and can be sent instead of original.
Hence option(B) is correct.

6. Consider the following grammar.

P → xQRS
Q → yz z
R→w∈
S→ y

What is FOLLOW (Q) ?

(A) {R} (B) {w} (C) {w, y} (D) {w, $}
Key: (C)
Exp: FOLLOW(Q) is FIRST(R) hence
FIRST(R) = {w, ϵ}
We add ‘w’ in FOLLOW(Q) and for ϵ we calculate FIRST(S)
FIRST(S) ={y}
FOLLOW(Q) is {w ,y}

*
7. Consider the language L given by the regular expression ( a + b ) b ( a+b ) over the alphabet
{a, b}. The smallest number of states needed in a deterministic finite-state automation (DFA)
accepting L is ___________.
Key: (4)
Exp: The regular expression can be described as “All strings over {a, b} ending with “ba” or “bb”.
The minimal DFA accepting L is having 4 states:
a b

b b

a a

8. Consider a two-level cache hierarchy with L1 and L2 caches. An application incurs 1.4
memory accesses per instruction on average. For this application, the miss rate of L1 www.examrace.com
cache
 0.1, the L2 cache experiences, on average, 7 misses per 1000 instructions. The miss rate of L2
expressed correct to two decimal places is ___________.
Key: (0.05)
Number of memory access
Exp: = 1.4 × 1000 = 1,400
in 1000 instructions
7
∴ Miss Rate = = 0.05
1400 × 0.1

9. Consider the following CPU processes with arrival times (in milliseconds) and length of CPU
burst (in milliseconds) as given below:
Process Arrival time Burst time
P1 0 7
P2 3 3
P3 5 5
P4 6 2
If the pre-emptive shortest remaining time first scheduling algorithm is used to schedule the
processes., then the average waiting time across all processes is ________ milliseconds.
Key: (3)
Exp:
PID AT BT CT TAT WT
P1 0 7 12 12 5
P2 3 3 6 3 0
P3 5 5 17 12 7
P4 6 2 8 2 0

Gantt chart:

P1 P2 P2 P4 P1 P3
0 3 5 6 8 12 17
P1 − 7 P1 − 4 P1 − 4 P1 − 4 P1 − 4 P3 − 5

P2 − 3 P2 − 1 P3 − 5 P3 − 5

P3 − 5 P4 − 2

P1 P2 P4 P1 P3

0 3 6 8 12 17
5 + 0 + 7 + 0 12
∴ Average waiting time = = = 3ms
4 4
www.examrace.com
10. Threads of a process share
(A) global variable but not heap.
(B) heap but not global variables.
(C) neither global variables nor heap.
(D) Both heap and global variables.
Key: (D)
Exp: Threads of a process can share all resources except stack and register set.

n
11. Let c1 ........c n be scalars, not all zero, such that ci a i = 0 where a i are column vectors in
i=l
Rn. Consider the set of linear equations Ax = b
n
where A = [ a1.......a n ] and b = a i .The set of equations has
i =1

(A) a unique solution at x = J n where J n denotes a n-dimensional vector of all 1

(B) no solution
(C) infinitely many solutions
(D) finitely many solutions
Key: (C)
Exp: Since the scalars are not all zero
∴ The column vectors a i for i = 1, 2..., n are linearly dependent
n
A = 0 and b = ai Ax = b has infinitely many solutions.
i =1

12. Consider the C code fragment given below.

typedef struct node {
int data;
node* next ;
} node;
void join (node* m, node* n) {
node* p=n ;
while (p->next ! =NULL){
p = p –> next ;
}
p–> next = m;
}
Assuming that m and n point to valid NULL- terminated linked lists, invocation of join will
(A) append list m to the end of list n for all inputs.
(B) either cause a null pointer dereference or append list m to the end of list n.
(C) cause a null pointer dereference for all inputs.
www.examrace.com
(D) append list n to the end of list m for all inputs.
Key: (B)
Exp: While loop in Join Procedure moves the pointer ‘p’ to the last node of the list “n”. And at the
last statement, we are initializing the next of the last node of list n to start of list “m”.
But in some cases it may dereference to null pointer.

13. The n-bit fixed-point representation of an unsigned real number real X uses f bits for the
fraction part. Let i = n –f. The range of decimal values for X in this representation is
(A) 2 − f to 2i (B) 2 − f to ( 2i − 2 − f ) (C) 0 to 2i (D) 0 to ( 2i − 2 − f )

Key: (D)
i=n–f . f
Exp:
Max value = 111.....1( i times ) .111........1( f times )

1 1 1 2f − 1
= 2i − 1 + + 2 + ... + f =2i − 1 + f = 2i − 2 − f
2 2 2 2
∴ 0 to ( 2i − 2− f )

14. Consider the following intermediate program in three address code

p =a − b
q=p*c
p=u *v
q=p+q
Which one of the following corresponds to a static single assignment form of the above code
?
(A) p 1= a − b (B) p3 = a − b
q1 = p1 * c q 4 = p3 * c
p1 = u * v p4 = u * v
q 1= p1 + q1 q 5 = p4 + q 4
(C) p1 = a − b (D) p 1= a − b
q1 = p 2 * c q1 = p *c
p3 = u * v p2 = u * v
q 2 = p4 + q3 q 2= p + q
Key: (B)
Exp: a-code violates condition for static single assignment since p1 is initialized twice
c- p 2 , p 4 , &q 3 are not initialized anywhere
d- q 2 = p + q is incorrect code

15. Consider the C struct defined below:

struct data {
int marks [100] ; www.examrace.com
 char grade;
int cnumber;
};
struct data student;
The base address of student is available in register R1. The field student.grade can be
accessed efficiently using
(A) Post-increment addressing mode. (R1)+
(B) Pre-decrement addressing mode, -(R1)
(C) Register direct addressing mode, R1
(D) Index addressing mode, X(R1), where X is an offset represented in 2’s complement 16-
bit representation.
Key: (D)
Exp: Direct access is possible with only index addressing mode.

16. Consider a TCP client and a TCP server running on two different machines. After completing
data transfer, the TCP client calls close to terminate the connectional and a FIN segment is
sent to the TCP server. Server-side TCP responds by sending an ACK which is received by
the client-side TCP. As per the TCP connections state diagram (RFC 793), in which state does
the client-side TCP connection wait for the FIN from the sever-side TCP?
(A) LAST-ACK (B) TIME-WAIT (C) FIN-WAIT-1 (D) FIN-WAIT-2
Key: (D)
Exp: Client* Server*
*or vice-versa, though requests typically originate at clients.

3 syn − sent 2 Listening

Sent connection − request.1 Awaiting connection request.
Awaiting acknowledgement.1
Awaiting connection − request.2
4 Syn − R eceived
Received acknowledgement.1 Received connection − request.1
Received connection − request.2 Sent acknowledgement.1
Sent acknowledgement.2 Sent connection − request.2
Awaiting acknowledgement.2

5 Established 5 Established
The connection is open. Received acknowledgement.2
Data moves both directions. The connection is open.
Data moves both directions.
6 Fin − Wait.1
8 Close − wait
Sent close − request.a
Received close − request.a
Awaiting acknowledgement.a
Sent acknowledgement.a
Awaiting close − request.b
When finished sending data,
Will send close − request.b www.examrace.com
 7 Fin − wait.2
Received acknowledgement.a
Still awaiting close − request.b 9 Last − Ack
Or Sent close − request.b
10 closing Awaiting acknowledgement.b
Received close − request.b
Sent acknowledgement.b
Still awating acknowledgement.a
11 Time − wait
Received acknowledgement.a
Received close − request.b
Sent acknowledgement.b
Allowing time for delivery
Of acknowledgement.b

1 closed 2 Listening
A “fictional” state; Awaiting connection request.
There is no connection.

17. Consider the following context-free grammar over the alphabet = {a, b, c} with S as the start
symbol.
S → abScT abcT
T → bT b
Which one of the following represents the language generated by the above grammar ?
(A) {( ab ) ( cb ) n ≥ 1}
n n

(B) {( ab ) cb cb ...cb }
n m1 m2 mn
n, m1 ,m 2 ,...m n ≥ 1

(C) {( ab ) (cb )
n m n
m, n ≥ 1}
(D) {( ab ) ( cb )
n m
m, n ≥ 1}
n

Key: (B)
Exp: The given Grammar over Σ = {a, b, c} with S as the start symbol is
S → abScT | abcT
T→ bT | b
The minimum length string generated by the grammar is 1:
S→abcT→abcb ; hence all variable greater than 1.
Other cases
S → abScT→ ab abScT cT → ab ab abScT cT cT →........→ (ab)n (cT)n .
Here T can generate any number of b’s starting with single b.
Hence The language is L = {(ab)n cb m1 cb m2 cb m3 cb m4 ...............cb mn | m1,m2,m3,m4……m n n
www.examrace.com
≥1}
18. Consider the first-order logic sentence F :∀ z ( ∃yR ( x, y ) ) . Assuming non-empty logical
domains, which of the sentences below are implied by F?
I. ∃y ( ∃xR ( x, y ) ) II. ∃y ( ∀xR ( x, y ) )

III. ∀y ( ∃xR ( x, y ) ) IV. ¬∃x ( ∀y¬R ( x, y ) )

(A) IV only (B) I and IV only (C) II only (D) II and III only
Key: (B)
Exp: ∀x ( ∃yR ( x, y ) ) ∃y∃xR ( x, y )
∃y∀x R ( x, y ) ∀x∃yR ( x, y )

∀x∃yR ( x, y ) ∃y∀x R ( x, y )
¬∃x ( ∀y¬R ( x, y ) ) ⇔ ∀x∃y R ( x, y )

19. When two 8-bit numbers A 7 ....A 0 and B7 .....B0 in 2’s complement representation (with A0
and B0 as the least significant bits ) are added using a ripple-carry adder, the sum bits
obtained are S7….S0 and the carry bits are C7….C0. An overflow is said to have occurred if
(A) the carry bit C7 is 1 (B) all the carry bits (C7….C0) are 1
(C) (A 7 B7 .S7 + A 7 .B7 .S7 ) is 1 (D) (A 0 .B0 .S0 + A 0 .B0 .S0 ) is 1
Key: (C)
Exp: Overflow flag indicates an over flow condition for a signed operation. Some points to
remember in a signed operation:
* MSB is always reserved to indicate sign of the number.
* Negative numbers are represented in 2’s – complement.
* An overflow results in invalid operation.
2's complement overflow rules:
* If the sum of two positive numbers yields a negative result, the sum has- overflowed.
* If the sum of two negative number yields a positive result, the sum has overflowed.
* Otherwise, the sum has not overflowed.
Overflow for signed numbers occurs when the carry-in into the MSB (most significant bit) is
not equal to carry-out. Conveniently, an XOR-operation on these two bits can quickly
determine if an overflow condition exists.
Therefore, ( ( A .B )) ⊕ S
7 7 7 = A 7 .B7 .S7 + A7 .B7 .S7 = 1) has overflowed.

20. Consider a database that has the relation schema EMP (EmpId, EmpName, and DeptName).
An instance of the schema EMP and a SQL query on it are given below.
EMP
EmpId EmpName DeptName
1. XYA AA
2. XYB AA www.examrace.com
 3. XYC AA
4. XYD AA
5. XYE AB
6. XYF AB
7. XYG AB
8. XYH AC
9. XYI AC
10 XYJ AC
11. XYK AD
12. XYL AD
13. XYM AE

SELECT AVG(EC.Num)
FROM EC
WHERE(DeptName, Num)IN
(SELECTDeptName,COUNT(EmpId)AS
EC( DeptName, Num)
FROMEMP
GROUPBYDeptName)

The output of executing the SQL query is _____.

Key: (2.6)
Exp:
EC
Dept Name Num
AA 4
AB 3
AC 3
AD 2
AE 1

13
Avg ( NUM ) = = 2.6
5

21. The following functional dependencies hold true for the relational schema R{V,W,X,Y,Z}:
V→W
VW → X
Y → VX
Y→Z www.examrace.com
 Which of the following is irreducible equivalent for this set of functional dependencies ?
(A) V → W (B) V → W (C) V → W (D) V → W
V→X W→X V→X W→X
Y→V Y→V Y→V Y→V
Y→Z Y→Z Y→X Y→X
Y→Z Y→Z
Key: (A)
Exp: V → W, VW → X, Y → V, Y → X,Y → Z ( W is extraneous )
V → W, V → X, Y → V, Y → X, Y → Z
∴ Y → X is redundant
∴{V → W, V → X, Y → V, Y → Z}

22. Consider the following functions from positive integers to real numbers:
100
10, n , n,log 2 n,
n
The CORRECT arrangement of the above functions in increasing order of asymptotic
complexity is:
100 100
(A) log 2 n, ,10, n , n (B) ,10,log 2 n , n ,n
n n
100 100
(C) 10, , n ,log 2 n, n (D) , log 2 n ,10, n, n
n n
Key: (B)
100
Exp: < 10 < log 2 n < n , n
n

23. Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _________.
Key: (18)
Exp: A tree with 10 vertices has 9 edges.
As d ( vi ) = 2 E
d ( vi ) = 2 × 9 = 18

24. Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of
T are :
Note: The height of a tree with a single node is 0.
(A) 4 and 15 respectively
(B) 3 and 14 respectively
(C) 4 and 14 respectively
(D) 3 and 15 respectively
www.examrace.com
Key: (B)
Exp:

min max
height height
15nodes total

Min height = floor(log2 N) = floor( log 15)= 3

Max height= 14, when the tree is either left skewed or right skewed.

25. Consider the following C code:

# include <stdio.h>
int * assignval (int *x, int val) {
*x = val;
return x;
}
void main ( ) {
int * x= malloc (sizeof (int));
if (NULL = = x) return;
x = assignval (x,0);
if(x) {
x=(int *) malloc (sizeof (int));
if (NULL = = x) return;
x = assignval (x, 10);
}
printf(“%d\n”, *x);
free (x);
}
The code suffers from which one of the following problems:
(A) compiler error as the return of malloc is not typecast appropriately.
(B) compiler error because the comparison should be made as x==NULL and not as
shown.
(C) compiles successfully but execution may result in dangling pointer.
(D) compiles successfully but execution may result in memory leak.
Key: (D)
Exp: (A) is wrong. We don’t need to cast the result as void * is automatically and safely promoted
to any other pointer type in this case.
(B) It is discarded for obvious reason.
www.examrace.com
 (C) o b d ng th b t e po t r c pointing to non-
x i m ry (d a l t m o ic s t h p ni here.
(D) nswe n yo a e c li i c on iss assigned to x
n p v u m ry l c tio s n e n o f r ce tto that location
re lt ng i em ry leak.
l a

N 26 – 55 Carry Two Marks Each

Q No.

26. Con der ombi a i f T and D flip- ne d e ow he output of the D

flip-f op i c ne t t the
t input of the T flip- l p n t ut u t e T Flip-flop is
co ne t d t he npu f the
h D Flip-flop.

Initially, both Q0 and Q1 are set to 1 ( before the 1st clock cycle). The outputs
rd th
(A) Q1Q0 after the 3 cy le
l are 11 and after the 4 cycle are 00 respectively
rd th
(B) Q1Q0 after the 3 cycle are 11 and after the 4 cycle are 01 respectively
(C) Q1Q0 after the 3rd cycle are 00 and after the 4 th cycle are 11 respectively
th
cycle are 01 respectively
(D) Q1Q0 after the 3rdl c
Key: (B)
Exp:

CLK Q1 Q0
0 1 1
1 0 1
2 1 0
3 1 1
4 0 1

After 3rd oc l :11

1
th
After 4 c ock pul : 01
0

27. f n e we d n v re i l by 3 or 5 or 7 is
______________.
Key: (271)
Exp: D3 = { ntegers t en 1 to 500 divisible by 3}

D5 = {i egers betw en 1 tto 500 divisible by 5}

www.examrace.com
D7 = {i teg r bet n 1 to 500 divisible by 7}
 To find number of integers between 1 to 500 that are divisible by 3 or 5 or 7 is to find
D3 ∪ D 5 ∪ D 7
= D3 + D5 + D7 − D3 ∩ D5 + D3 ∩ D7 + D5 ∩ D 7 + D3 ∩ D5 ∩ D7

500 500 500 500 500 500 500

= + + − + + +
3 5 7 15 21 35 105
= (166 + 100 + 71) − ( 33 + 23 + 14 ) + 4
= 337 − 70 + 4 = 271

28. Consider a RISC machine where each instruction is exactly 4 bytes long. Conditional and
unconditional branch instructions use PC- relative addressing mode with Offset specified in
bytes to the target location of the branch instruction. Further the Offset is always with respect
to the address of the next instruction in the program sequence. Consider the following
instruction sequence.
Instr. No. Instruction
i: add R2, R3, R4
i +1: sub R5, R6, R7
i + 2: cmp R1, R9, R10
i+3 beq R1, Offset
If the target of the branch instruction is i, then the decimal value of the Offset is __________.
Key: (-16)
Exp: I1 0−3
I2 4−7
I3 8 − 11
I4 12 − 15
16 −
I4 is the branch instruction & I1 is the target.
0 = 16+ relative value
∴ relative value = -16

29. Consider the C functions foo and bar given below:

int foo (int val ) {
int x = 0;
while (val > 0) {
x = x + foo ( val --);
}
return val ;
}
int bar (int val ) {
int x = 0;
while (val > 0) { www.examrace.com
x = x + bar (val – 1) ;
 }
return val ;
}
Invocations of foo (3) and bar (3) will result in:
(A) Return of 6 and 6 respectively.
(B) Infinite loop and abnormal termination respectively.
(C) Abnormal termination and infinite loop respectively.
(D) Both terminating abnormally
Key: (B)
Exp: Foo (3) calls foo (3) which in turn calls foo(3). This goes on infinite number of times which
causes memory overflow and causes abnormal termination.
Bar(3) → bar (2) → bar (1) → bar (0) (return 0) from here onwards bar (1) will call bar (0)
and bar (0) will return 0 to bar (1) & this goes on forever without causing memory overflow.

30. In a RSA cryptosystem a participant A uses two prime numbers p = 13 and q =17 to generate
her public and private keys. If the public key of A is 35. Then the private key of A is
__________.
Key: (11)
Exp:
Given Data As per RSA Algorithm
p=13 Step1:Calculate n = p × q = 13 × 17 = 221

q=17 Step 2: Calculate φ ( n ) = ( p − 1)( q − 1) = (12 )(16 ) = 192

e=35 Step 3: de mod φ ( n ) = 1 ( or ) de = 1mod φ ( n )

d=? d × 35 mod192 = 1 d = 11

31. Let A be an array of 31 numbers consisting of sequence of 0’s followed by a sequence of 1’s.
The problem is to find the smallest index i that A[i] is 1 by probing the minimum numbers of
locations in A. The worst case number of probes performed by an optimal algorithm is
_____________.
Key: (5)
Exp: In the given array the elements are 0’s followed by 1’s , which means array is already sorted.
low + high
So we can apply binary search. At each stage, we compare A .
2
[Assuming ‘A’ is an array of 31 elements] with ‘1’ and if it is 1 we check the left part
recursively and if it is ‘0’ we check the right part of the array recursively, which takes log 2 31
comparisons in the worst case.

32. If G is grammar with productions

S → SaS aSb bSa SS ∈

where S is the start variable, then which one of the following is not generated by G? www.examrace.com
 (A) abab (B) aaab (C) abbaa (D) babba
Key: (D)
Exp: 1. S → SS → aSbS → abS → abaSb → abab
2. S → aSb → aSaSb → aaaSb → aaab
3. S → SS → aSbS → abS → abbSa → abbSaSa → abbaa
Given grammar generates all strings where n ( a ) ≥ n ( b )

x 7 − 2x 5 + 1
33. The value of lim
x →1 x 3 − 3x 2 + 2

(A) is 0 (B) is -1 (C) is 1 (D) does not exist

Key: (C)
x 7 − 2x 5 + 1 7x 6 − 10x 4
Exp: lim = lim = 1. ( Using L − Hospital’s rule )
x →1 x 3 − 3x 2 + 2 x →1 3x 2 − 6x

34. Instructions execution in a processor is divided into 5 stages. Instruction Fetch (IF),
Instruction Decode (ID) , Operand Fetch (OF), Execute (EX), and Write Back (WB), These
stages take 5,4,20, 10 and 3 nanoseconds (ns) respectively. A pipelined implementation of
the processor requires buffering between each pair of consecutive stages with a delay of 2ns.
Two pipelined implementations of the processor are contemplated.
(i) a naïve pipeline implementation (NP) with 5 stages and
(ii) an efficient pipeline (EP) where the OF stage id divided into stages OF1 and OF2
with execution times of 12 ns and 8 ns respectively.
The speedup (correct to two decimals places) achieved by EP over NP in executing 20
independent instructions with no hazards is ________________.
Key: (1.508)
Exp: Given,
For Navie pipeline (NP)
Number of stages (k) = 5
Tp = max (stage delay + buffer delay)

Tp = max ( 7, 6, 22,12,5 ) = 22 n sec.

Number of instructions (n) = 20
So, erection time for navie pipeline
ETNP = ( k + n − 1) × TP = ( 5 + 20 − 1) × 22 = 528n sec
Now, for efficient pipeline
k = 6, n = 20, TP = 14 n sec.
E EP = ( k + n − 1) × TP = ( 6 + 20 − 1) × 14 = 350 n sec.
ETNP 528
Therefore, Speedup ( s ) = =
E EP 350
Speedup ( s ) = 1.508 www.examrace.com
35. Consider a database that has the relation schemas EMP(EmpId, EmpName, DepId). And
DEPT(DeptName, DeptId). Note that the DeptId can be permitted to be NULL in the relation
EMP. Consider the following queries on the database expressed in tuple relational calculus.
(I) {t ∃u ∈ EMP(t[EmpName] = u[EmpName] ∧ ∀v ∈ DEPT(t[DeptId] ≠ v[DeptId]))}

(II) {t ∃u ∈ EMP(t[EmpName] = u[EmpName] ∧ ∃v ∈ DEPT(t[DeptId] ≠ v[DeptId]))}

(III) {t ∃u ∈ EMP(t[EmpName] = u[EmpName] ∧ ∃v ∈ DEPT(t[DeptId] ≠ v[DeptId]))}

Which of the above queries are safe?
(A) (I) and (II) only (B) (I) and (III) only
(C) (II) and (III) only (D) (I), (II) and (III)
Key: (D)
Exp: Query which generates infinite number of tuples is called unsafe query. In the given question
all the given queries generate finite number of tuples.

36. Recall that Belady’s anomaly is that the pages-fault rate may increase as the number of
allocated frames increases. Now consider the following statements:
S1: Random page replacement algorithm (where a page chosen at random is replaced)
suffers from Belady’s anomaly
S2: LRU page replacement algorithm suffers from Belady’s anomaly
Which of the following is CORRECT ?
(A) S1 is true, S2 is true (B) S1 is true, S2 is false
(C) S1 is false , S2 is true (D) S1 is false, S2 is false
Key: (B)
Exp: Statement 1 is “TRUE”. Because there can be a case when page selected to be replaced is by
FIFO policy.
Statement 2 is “FALSE”. Because LRU page replacement algorithm does not suffers
from Belady’s Anomaly. Only FIFO page replacement algorithm suffers from Belady’s
Anomaly.

37. The output of executing the following C program is ________.

# include <stdio.h>
int total (int v) {
while (v) {
count + = v & 1;
v>> = 1;
}
return count;
}
void main ( ) {
static int x = 0;
int i = 5;
www.examrace.com
for (; i> 0; i--) {
 x=x + total (i) ;
}
printf (“%d\n”, x) ;
}
Key: (23)
Exp: Count in the function total is static .
i Count total ( i )
5 0 2
4 2 3 ( 2 + 1)
3 3 5 (3 + 2)
2 5 6 ( 5 + 1)
1 6 7 ( 6 + 1)
= 23

38. Consider the following C program.

#include <stdio.h>
#include<string.h>
void printlength (char *s, char *t) {
unsigned int c = 0;
int len = ((strlen(s) – strlen (t)) > c) ? strlen(s): strlen(t);
printf (“%d\n”, len);
}
void main ( ) {
char *x = “abc”;
char *y =”defgh”;
printlength (x,y);
Recall that strlen is defined in string.h as returning a value of type size_t, which is an
unsigned int. The output of the program is _____________.
Key: (3)
Exp: x is pointer of string “abc” which is length 3.
S is pointer, that pointed x.
y is pointer of string “defgh” which is length 5.
t is pointer that pointed y.
Now, ( (strlen ( s ) − strlen ( t )) > c ) is ( ( 3 − 5) > 0) is returns true, since ( 3 − 5 = −2 ) is non-
zero value so, ternary operator ‘?’ is returned strlen(s) which is 3 and assigned to len because
ternary- operator returns first if condition is true else second. Therefore, final value is printed
3.

39. Consider the following languages over the alphabet = {a, b, c}

www.examrace.com
 Let L1 = {a n b n c m m, n ≥ 0} and L 2 = {a m b n c n m, n ≥ 0}
Which of the following are context-free languages ?
I. L1 ∪ L 2 II. L1 ∩ L 2
(A) I only (B) II only (C) I and II (D) Neither I nor II
Key: (A)
Exp: The language given over alphabets Σ = {a, b, c} as L1 ={anbncm|n,m≥0} and L2= {
ambncn|n,m≥0}.
L1 ∪ L2 = { anbmck|n=m or m =k , n,m≥0}is a context free language. The context free grammar
is:
S→AB|CD
A→aAb|ϵ
B→cB|ϵ
C→aC|ϵ
D→bSc|ϵ
L1 ∩ L2 ={ anbmck|n=m and m =k , n,m≥0}or { anbncn| n ≥0}is a non context free language.

40. Consider a 2-way set associative cache with 256 blocks and uses LRU replacement, Initially
the cache is empty. Conflict misses are those misses which occur due the contention of
multiple blocks for the same cache set. Compulsory misses occur due to first time access to
the block. The following sequence of accesses to memory blocks.
(0,128,256,128,0,128,256,128,1,129,257,129,1,129,257,129)
is repeated 10 times. The number of conflict misses experienced by the cache is ___________.
Key: (76)
Exp: A miss is not considered a conflict miss if the block is accessed for the first time.
1st round: (2+2) misses
2nd round: (4+4) misses
∴ Total = 4 + ( 8 × 9 ) = 76 conflict misses

41. Let u and v be two vectors in R2 whose Euclidean norms satisfy u = 2 v . What is the value
of α such that w = u + αv bisects the angle between u and v ?
(A) 2 (B) 1/2 (C) 1 (D) -1/2
Key: (A)
2 0
Exp: Let u = and v =
0 1
2
u = z. v and w =
α

Now cos ( u, w ) = cos ( v, w )

4 α
= α=2
( 2) α +42
(1) α2 + 4 www.examrace.com
42. Consider the following grammar:
stmt → if exp r then else exp r;stmt 0
exp r → term relop term term
term → id | number
if → a | b | c
number → [0 − 9]
where relop is a relational operate (e.g <, >,….) ---O refers to the empty statement, and if
,then, else are terminals.
Consider a program P following the above grammar containing ten if terminals. The number
of control flows paths in P is ____________. For example the program
if e1 then e2 else e3
has 2 controls flow paths e1 → e 2 and e1 → e3
Key: (1024)
Exp: For 2 “if statements”, 22=4 control flow paths are possible:
if
e1

e2 e3
if if
e4 e4

e5 e5 e5 e5

So for 10 “If statements”, 210 control flow paths will be there.

43. In a database system, unique time stamps are assigned to each transaction using Lamport’s
logical clock . Let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2
respectively. Besides, T1 holds a lock on the resource R, and T2 has requested a conflicting
lock on the same resource R. The following algorithm is used to prevent deadlocks in the
database system assuming that a killed transaction is restarted with the same timestamp.
if TS(T2 ) < TS ( T1 ) then
T1 is killed
elseT2 waits.
Assume any transactions that is not killed terminates eventually. Which of the following is
TRUE about the database system that uses the above algorithm to prevent deadlocks?
(A) The database system is both deadlock-free and starvation- free.
(B) The database system is deadlock- free, but not starvation-free.
(C) The database system is starvation-free but not deadlock- free.
(D) The database system is neither deadlock- free nor starvation-free.
Key: (A)
Exp: Elder kills younger and youngers waits on elder. So both are not waiting for each other. Hence
no deadlock and there won’t be any starvation as well because the transaction who got killed
www.examrace.com
will be starting with same time stamp.
44. Let A and B be infinite alphabets and let # be a symbol outside both A and B. Let f be a total
functional from A* to B*. We say f is computable if there exists a Turning machine M which
given an input x in A*, always halts with f(x) on its tape. Let Lf denote the language
{x #f (x) x ∈ A } .Which of the following statements is true:
*

(A) f if computable if and only if Lf is recursive.

(B) f is computable if and only Lf recursively enumerable.
(C) If f is computable then Lf is recursive, but not conversely.
(D) If f is computable then Lf is recursively enumerable, but not conversely.
Key: (A)
Exp: A TM is recursive iff it halts for every input string (either in accept or reject state).
Here, a computable function is defined in a similar way.

*
45. Consider the expression ( a − 1) ( ( (b + c ) / 3) + d) ) . Let X be the minimum number of
registers required by an optimal code generation (without any register spill) algorithm for a
load/store architecture in which (i) only loads and store instructions can have memory
operands and (ii) arithmetic instructions can have only register or immediate operands. The
value of X is _________.
Key: (2)
Exp: 2
*

− 1 + 1

a 1 1 1 d
1 0 0
+
1 3
0
b c
1 0

The given expression is (a-1)*(((b+c)/3)+d))

The optimal generated code is :
LOAD R1 b R1← b
LOAD R2 C R2← c
ADD R1 R2 R1← R1+R2
DIV R1 3 R1←R1/3
LOAD R2 d R2←d
ADD R1 R2 R1←R1+R2
LOAD R2 a R2←a
SUB R2 1 R2←R2-1
MUL R2 R1 R2←R2*R1
www.examrace.com
46. Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in
E are positive and distinct. Consider the following statements:
(I) Minimum spanning tree of G is always unique.
(II) Shortest path between any two vertices of G is always unique.
Which of the above statements is/are necessarily true?
(A) (I) only (B) (II) only
(C) Both (I) and (II) (D) Neither (I) nor (II)
Key: (A)
Exp: A 1 B

2 3 5

C 4 D
Shortest path from B to C are two B-A-C and B-C both of weight '3'

47. A multithreaded program P executes with x number of threads and uses y number of locks for
ensuring mutual exclusion while operating on shared memory locations. All locks in the
program are non-reentrant, i.e., if a thread holds a lock l, then it cannot re-acquire lock l
without releasing it. If a thread is unable to acquire a lock, it blocks until the lock becomes
available. The minimum value of x and the minimum value of y together for which execution
of P can result in a deadlock are:
(A) x = 1, y = 2 (B) x =2, y=1 (C) x = 2,y=2 (D) x = 1, y = 1
Key: (C)
Exp: As per given question, there 'x' number of threads and 'y' number of locks for ensuring mutual
exclusion while operating on shared memory locations
Option (A): x=1;y=2
Means that 1 thread and 2 locks clearly showing that no deadlock situation
Option (B): x=2;y=1
Means that 2 threads and 1 lock → No deadlock situation
After usage of lock by 1 thread, it can release that lock and then 2nd thread can be used that
lock. So no deadlock
Option(C):x=2;y=2
Means that 2 threads and 2 locks → Deadlock can arise
Both threads can hold 1 lock and can wait for release of another lock
Option(D) x=1; y=1
Means that 1 thread and 1 lock → No deadlock situation
Hence Option(C) is correct.

48. The values of parameters for the Stop-and – Wait ARQ protocol are as given below:
Bit rate of the transmission channel = 1Mbps
Propagation delay from sender to receiver = 0.75 ms
Time to process a frame = 0.25ms
Number of bytes in the information frame =1980
www.examrace.com
Number of bytes in the acknowledge frame = 20
 Number of overhead bytes in the information frame = 20
Assume that there are no transmission errors. Then the transmission efficiency ( expressed in
percentage) of the Stop-and – Wait ARQ protocol for the above parameters is _________(
correct to 2 decimal places)
Key: (89.33)
Exp: Given Data:
B= 1Mbps
Tproc=0.25ms
Tp = 0.75 ms
L=1980 Bytes
L OH = 20 Bytes
L A = 20 Bytes
Efficiency ( η) = ?

L (1980 + 20 ) × 8 2 × 8 × 103
(i) Tx = = = = 16 ms
B 106 106
L A 20 × 8
(ii) TACK = = = 0.16 ms
B 106
In stop-and-wait ARQ, efficiency
Tx 16 ms
η= = = 0.8933 ≈ 89.33%
Tx + TACK + 2TP + Tproc 17.91ms

49. A computer network uses polynomials over GF(2) for error checking with 8 bits as
information bits and uses x 3 + x + 1 as the generator polynomial to generate the check bits. In
this network, the message 01011011 is transmitted as
(A) 01011011010 (B) 01011011011 (C) 01011011101 (D) 01011011100
Key: (C)
Exp: Given generator polynomial G ( x ) = x 3 + x + 1 1011
message m ( x ) = 01011011
1011) 0 1 0 1 1 0 11 0 0 0 ( 01000011
0000
0 1 0 11
1 0 11
0 0000
0000
0 0 0 01
0000
0 0 0 11
0000
0 0 11 0
0000
0 11 0 0
1 0 11
0 111 0
1 0 11
www.examrace.com
0 101
50. Let p, q, and r be propositions and the expression ( p → q ) → r be a contradiction. Then, the
expression ( r → p ) → q is
(A) a tautology (B) a contradiction
(C) always TRUE when p is FALSE (D) always TRUE when q is TRUE
Key: (D)
Exp: (p → q) → r is contradiction only when

p q r
T T F
F T F
F F F
And now for the above combination, the expression ( r → p ) → q is always true when q is
true. When q is false in the above combination (third one) ( r → p ) → q will be false.

51. A cache memory unit with capacity of N words and block size of B words is to be designed.
If it is designed as a direct mapped cache, the length of the TAG field is 10 bits. If the cache
unit is now designed as a 16-way set-associative cache, the length of the TAG field is
______bits.
Key: (14)
N
Exp: Total bits = 10 + log 2 + log 2 B
B
Offset
# of blocks

N
10 + log 2 ( N ) = log 2 +T
16
where T is the required length of TAG field
∴ T = 14

52. Consider the following two functions.

void funl (int n) { void fun2 (int n) {
if (n = =0 ) return; if (n = = 0) return ;
printf (“%d” , n); printf (“%d” , n);
fun2 (n - 2); fun1(++n) ;
printf (“%d” , n); printf (“%d” , n);
} }
The output printed when fun1 (5) is called is
(A) 53423122233445 (B) 53423120112233
(C) 53423122132435 (D) 53423120213243
Key: (A)
Exp: In this the fun1() is calling fun2() after printing value and after returning from fun2(),it prints
the same value. In the fun2() also the same thing happens So by looking options we can www.examrace.com
judge
the correct sequence of output.
53. Consider a database that has the relation schema CR (StudentName, CourseName). An
instance of the schema CR is as given below.

CR
Student Name Course Name
SA CA
SA CB
SA CC
SB CB
SB CC
SC CA
SC CB
SC CC
SD CA
SD CB
SD CC
SD CD
SE CD
SE CA
SE CB
SF CA
SF CB

SF CC

The following query is made on the database.

T1 ← πCourseName ( σStudentName='SA ' ( CR ) )
T2 ← CR ÷ T1
The number of rows in T2 is ____________.
Key: (4)
Exp: T1 = {CA, CB, CC}
T 2 = {SA, SC, SD, SF}

n n
54. Let A be n × n real valued square symmetric matrix of rank 2 with A ij2 = 50 . Consider
i =1 j=1

the following statements.

(I) One eigen value must be in [-5, 5] www.examrace.com
 (II) The eigen value with the largest magnitude must be strictly greater than 5.
Which of the above statements about eigen values of A is/are necessarily CORRECT?
(A) Both (I) and (II) (B) (I) only
(C) (II) only (D) Neither (I) nor (II)
Key: (B)
Exp: ρ(A) < n A =0 one eigen value must be '0' ∈ [ −5,5]
∴ (I) is true
5 0 0 3 3
Let A = 0 −5 0 Aij2 = 50 and ρ ( A ) = 2
i =1 j=1
0 0 0
but eigen values of A are 0, −5,5
∴ The eigen value with the largest magnitude is not greater than 5
5 0
For n=2 and Let A = eigen values= 5,5
0 5

∴One eigen value must be in [ −5,5] and largest eigen value magnitude is not greater than 5

∴ (II) is false

55. Consider the context-free grammars over the alphabet {a,b,c} given below. S and T are non-
terminals
G1 : S → aSb T,T → cT ∈
G 2 :S → bSa T,T → cT ∈

The language L ( G1 ) ∩ L ( G 2 ) is
(A) Finite. (B) Not finite but regular.
(C) Context-free but not regular. (D) Recursive but not context-free.
Key: (B)
Exp: The Context free grammar given over alphabets Σ ={ a, b, c} with S and T as non terminals
are:
G1 : S→aSb | T, T→ cT | ϵ
G2 : S→bSa | T, T→ cT |ϵ
Lets L(G1) is the language for grammar G1 and L(G2) is the language for grammar G2
L(G1) = {ancmbn| n, m ≥0}
L(G1) = {bncman| n ,m≥0}
L1 ∩ L2 ={ cm|m ≥ 0 }; which is infinite and regular

www.examrace.com
 General Aptitude
Q. No. 1 - 10 Carry One Mark Each

1. Research in the workplace reveals that people work for many reason ___________.
(A) money beside (B) beside money (C) money besides (D) besides money
Key: (D)

2. After Rajendra chola returned from his voyage to Indonesia, he _______ to visit the temple in
Thanjavur.
(A) was wishing (B) is wishing (C) wished (D) had wished
Key: (C)

3. Rahul Murali, Srinivas and Arul are seated around a square table. Rahul is sitting to the left of
Murali. Srinivas is sitting to the right of Arul. Which of the following pairs are seated
opposite each other ?
(A) Rahul and Murali (B) Srinivas and Arul
(C) Srinivas and Murali (D) Srinivas and Rahul
Key: (C)
Exp:
Srinivas

Rahul Arul

Murali

4. Find the smallest number y such that y ×162 is a perfect cube.

(A) 24 (B) 27 (C) 32 (D) 36
Key: (D)
Exp:
Factorization of 162 is 2 × 3 × 3 × 3 × 3
y ×162 is a perfect cube
y × 2 × 3 × 3 × 3 × 3 = Perfect cube
For perfect cube 2's & 3's are two more required each.

5. The probability that a k-digit number does NOT contain the digits 0,5,or 9 is
(A) 0.3k (B) 0.6k (C) 0.7k (D) 0.9k
Key: (C)
Exp:

k digits
www.examrace.com
 Each digit can be filled in 7 ways as 0, 5 and 9 are not allowed. So each of these places can be
filled by 1, 2, 3, 4, 6, 7, 8.
k
7
So required probability is or 0.7 k .
10

Q. No. 6 – 10 Carry Two Marks Each

6. A contour line joins locations having the same height above the mean sea level. The following
is a contour plot of a geographical region. Contour lines are shown at 25m intervals in this
plot. If in a flood, the water level rises to 525m, which of villages P,Q, R, S,T get submerged
?

(A) P,Q (B) P,Q,T (C) R,S,T (D) Q,R,S

Key: (C)
Exp: The given contour is a hill station, the peak point of this hill station is P, it is under a contour
of 550 . At floods, the water level is 525m. So the village of R, S and T are under a contour of
500. Therefore these villages are submerged.

7. “The hold of the nationalist imagination on our colonial past is such that anything
inadequately or improperly nationalist is just not history”
Which of the following statements best reflects the author’s opinion ?
(A) Nationalists are highly imaginative.
(B) History is viewed through the filter of nationalism.
(C) Our colonial past never happened.
(D) Nationalism has to be both adequately and properly imagined.
Key: (B)

( x + y) − x − y
8. The expression is equal to
2
(A) the maximum of x and y (B) the minimum of x and y
(C) 1 (D) None of the above

Key: (B) www.examrace.com

Exp: If x > y; then x − y = x − y
x + y − (x − y)
Exp = = y min
2
If x < y; then x − y = − ( x − y ) = y − x
x + y − (y − x)
Exp = = x min
2
( x + y) − x − y
∴ The expression is equal to min imum of x & y
2

9. Six people are seated around a circular table. There are at least two men and two women .
There are at least three right-handed persons. Every woman has a left-handed person to her
immediate right. None of the women are right-handed. The number of women at the table is
(A) 2 (B) 3
(C) 4 (D) Cannot be determined
Key: (A)
Exp: Out of six people, 3 place definitely occupied by right handed people as atleast 2 women are
there so these two will sit adjacently. Now as only one seat is left it will be occupied by a left
handed man because on right side of this seat is sitting an right handed man.

R (m)
R (m) R (m)

?
L(w)
L(w)
Therefore, answer should be 2 women.

10. Arun, Gulab, Neel and Shweta must choose one shirt each from a pile of four shirts coloured
red, pink, blue and white respectively. Arun dislikes the colour red and Shweta dislikes the
colour white. Gulab and Neel like all the colours. In how many different ways can they
choose the shirts so that no one has a shirt with a colour he or she dislikes ?
(A) 21 (B) 18 (C) 16 (D) 14
Key: (D)
Exp: As there are 4 people A,G,N,S and 4 colours so without any restriction total ways have to be
4 × 4 = 16
Now, Arun → dislikes Red and
Shweta → dislikes white
So 16-2=14 ways

www.examrace.com