Question 1

Extreme focus on syllabus and studying for tests has become such a dominant concern of Indian students that they close their minds to anything _____ to the requirements of the exam

A : related
B : exttraneous
C : outside
D : useful

•
.

Solution :
extraneous -irrelevant or unrelated to the subject being dealt with.

•   Question 2

A function f(x) is linear and has a value of 29 at x = -2 and 39 at x = 3. Find its value at x = 5.

A : 59
B : 45
C : 43
D : 35

•
.

Solution :
f(x)=2x+33

•   Question 3

The Tamil version of ________ John Abraham-starrer Madras café ________ cleared by the Censor Board with no cuts last week but the film’s distributors _________ no takers among the exhibitors for a release in Tamil Nadu _________ this Friday.

A : Mr., was, found, on
B : a, was, found, at
C : the, was, found, on
D : a, being, find at

•
.

Solution :
John-Abraham starrer Madras Café talks about the movie not the person, so Mr. is ruled out. ‘Find no takers’ is not the correct phrase. At this Friday is incorrect. So, option C is correct.

•   Question 4

If ROAD is written as URDG, then SWAN should be written as:

A : VXDQ
B : VZDQ
C : VZDP
D : UXDQ

•
.

Solution :
R+3=U, O+3=R, A+3=D, D+3=G;
S+3=V, W+3=Z, A+3=D, N+3=Q

•   Question 5

Select the pair that best expresses a relationship similar to that expressed in the pair:
Children: Pediatrician

B : Females: Gynaecologist
C : Kidney: Nephrologist
D : Skin: Dermatologist

•
.

Solution :
Community of people: Doctor

•   Question 6

The exports and imports (in crores of Rs.) of a country from the year 2000 to 2007 are given in the following bar chart. In which year is the combined percentage increase in imports and exports the highest?

•
.

Solution :
Increase in exports in 2006= (100-70)/70 = 42.8%
Increase in imports in 2006=(120-90)/90 = 33.3%
which is more than any other year

•   Question 7

The head of a newly formed government desires to appoint five of the six selected members P,Q,R,S,T and U to portfolios of Home, Power, Defense, Telecom, and Finance. U does not want any portfolio if S gets one of the five. R wants either Home or Finance or no portfolio. Q says that if S gets either Power or Telecom, then she must get the other one. T insists on a portfolio if P gets one.
Which is the valid distribution of portfolios?

A : P-Home, Q-Power, R-Defense, S-Telecom, T-Finance
B : R-Home, S-Power, P-Defense, Q-Telecom, T-Finance
C : P-Home, Q-Power, T-Defense, S-Telecom, U-Finance
D : Q-Home, U-Power, T-Defense, R-Telecom, P-Finance

•
.

Solution :
Since U does not want any portfolio, (C) and (D) are ruled out. R wants Home, or Finance or No portfolio, (A) is not valid. Hence option (B) is correct

•   Question 8

Choose the most appropriate equation for the function drawn as a thick line, in the plot below.

A : x=y-|y|
B : x=-(y-|y|)
C : x=y + |y|
D : x= - (y +|y|)

•
.

•   Question 9

Most experts feel that in spite of possessing all the technical skills required to be a batsman of the highest order, he is unlikely to be so due to lack of requisite temperament. He was guilty of throwing away his wicket several times after working hard to lay a strong foundation. His critics pointed out that until he addressed this problem success at the highest level will continue to elude him.
Which of the statement (s) below is/are logically valid and can be inferred from the above passage?
(i) He was already a successful batsman at the highest level
(ii) He has to improve his temperament in order to become a great batsman
(iii) He failed to make many of his good starts count
(iv) Improving his technical skills will guarantee success

A : (iii) and (iv)
B : (ii) and (iii)
C : (i),(ii) and (iii)
D : (ii) only

•
.

•   Question 10

Alexander turned his attention towards India, since he had conquered Persia.
Which one of the statements below is logically valid and can inferred from the above sentence?

A : Alexander would not have turned his attention towards India had he not conquered Persia.
B : Alexander was not ready to rest on his laurels, and wanted to march to India
C : Alexander was completely in control of his army and could command it to move towards India
D : Since Alexander’s kingdom extended to Indian borders after the conquest of Persia, he was keen to mo

•
.

•   Question 11

In a room there are only two types of people, namely Type 1 and Type 2. Type 1 people always tell the truth and Type 2 people always lie. Your give a fair coin to a person in that room, without knowing which type he is from and tell him to loss it and hide the result from you till you ask for it. Upon asking, the person replies the following.
“The result of the toss is head if and only if I am telling the truth.”
Which of the following options are correct?

A : The result is head
B : The result is tail
C : If the person is of Type 2, then the result is tail
D : If the person is of Type 1, then the result is tail

•
.

•   Question 12

Consider the relation X(P,Q,R,S,T,U) with the following set of functional dependencies
F {
{ P,R } -> {S,T}
{P,S,U} -> {Q,R}
}
Which of the following is the trivial functional dependency in F+, where F+ is closure of F?

A : {P,R} -> {S,T}
B : {P,R} -> {R,T}
C : {P,S} -> {S}
D : {P,S,U} -> {Q}

•
.

Solution :
X -> Y is trivial if Y X

•   Question 13

Given a has table T with 25 slots that stores 2000 elements, the load factor  for T is ___________.

•
.

Solution :
Load factor = no of elements / no of slots = 2000/25 = 80

•   Question 14

Consider a software project with the following information domain characteristics for calculation of function point metric.
Number of external inputs (I) = 30
Number of external outputs (O) = 60
Number of external inquiries (E) = 23
Number of files (F) = 08
Number of external interfaces (N) = 02
It is given that the complexity weighting factors for I, O, E, F and N are 4,5,4,10 and 7, respectively. It is also given that, out of fourteen value adjustment factors that influence the development effort, four factors are not applicable, each of the other four factors have value 3, and each of the remaining factors have value 4. The computed value of function point metric is _________.

•
.

•   Question 15

Consider the following statements.
I. TCP connections are full duplex
II. TCP has no option for selective acknowledgment
III. TCP connections are message streams

A : Only I is correct
B : Only I and III are correct
C : Only II and III are correct
D : All of I, II and III are correct

•
.

Solution :
S1: TCP allows full – duplex communication. This is TRUE statement. TCP is a full-duplex protocol; it allows both parties to send and receive data within the context of the single TCP connection..
S2: TCP has no option for selective acknowledgments. This is FALSE statement TCP may experience poor performance when multiple packets are lost from one window of data. With the limited information available from cumulative acknowledgments, a TCP sender can only learn about a single lost packet per

•   Question 16

Suppose U is the power set of the set S = {1,2,3,4,5,6}. For any T # U, let |T| denote the number of element in T and T' denote the complement of T. For any T,R # U, let T\R be the set of all elements in T which are not in R. Which one of the following is true?

A : ∀ X ∈ U ( |X| = |X|' )
B : ∃ X isin;U ∃ Y∈U ( |X| =5, |Y|=5 and X ∩ Y = ∅
C : ∀X ∈ U ∀ Y∈ U ( |X| =2, |Y| =3 and 3 and X \ Y =∅
D : ∀X ∈ U ∀Y ∈ U(X \ Y = Y'\ X')

•
.

•   Question 17

Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order?

A : SLR, LALR
B : Canonical LR, LALR
C : SLR, canonical LR
D : LALR, canonical LR

•
.

Solution :
In SLR method, we work with LR(0) items where as in CLR(1) we work with LR(1) items. LR(1) item is comprised of two parts-the LR(0) item and a look ahead associated with the item. If we work with LR(1) items instead of using LR(0) items, then every state of the parser corresponds to a set of LR(1) items. When the parser looks ahead in the input buffer to decide whether the reduction is to be done or not the information about the terminals is available in the state of the parser itself which is n

•   Question 18

Consider the following array of elements.
<89,19,50,17,12,15,2,5,7,11,6,9,100>
The minimum number of interchanges needed to convert it into a max-heap is

A : 4
B : 5
C : 2
D : 3

•
.

Solution :
1st swap is : 100 and 15
2nd swap is : 100 and 50
3rd swap is : 100 and 89

•   Question 19

The maximum number of processes that can be in Ready state for a computer system with n CPUs is

A : n
B : n2
C : 2n
D : Independent of n

•
.

Solution :
Number of processes which are in running processes will be atmost n as there are n processors. Maximum number of processes that will be in ready state is independent of number of processors.

•   Question 20

While inserting the elements 71,65,84,69,67,83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is

A : 65
B : 67
C : 69
D : 83

•
.

•   Question 21

Two processes X and Y need to access a critical section. Consider the following synchronization construct used by both the processes.
Here, varP and varQ are shared variables and both are initialized to false. Which one of the following statements is true?

A : The proposed solution prevents deadlock but fails to guarantee mutual exclusion
B : The proposed solution guarantees mutual exclusion but fails to prevent deadlock
C : The proposed solution guarantees mutual exclusion and prevents deadlock
D : The proposed solution fails to prevent deadlock and fails to guarantee mutual exclusion

•
.

Solution :
Var P = Var Q = FALSE Initially.
Assume that, process X is willing to enter into critical section. So it makes ar V P = True, then if processor switches to process Y, then process Y can enter into critical section.
After entering into the critical section, then if processor switches to process X, then process X also can enter into the critical section.
It is clearly showing that both are in critical section at a time which leads to “failing to guarantee material exclusion”
To ent

•   Question 22

Let # be a binary operator defined as
X#Y = X'+ Y' where X and Y are Boolean variables.
Consider the following two statements.
(S1) (P#Q)#R = P#(Q#R)
(S2) Q#R = R#Q
Which of the following is/are true for the Boolean variables P, Q and R?

A : Only S1 is true
B : Only S2 is true
C : Both S1 and S2 are true
D : Neither S1 nor S2 are true

•
.

Solution :
X#Y = X'+ Y'
S1. L.H.S. = (P#Q)#R=(P#Q( '+ R'
(P`+Q`)`+R`
=PR+R`
R.H.S =P#(Q#R)
P' +(Q#R )' = P` + ( Q` + R`)` = P`+QR
=> L.H.S is not equal to R.H.S therefore S1 is false
S2. Q#R = Q`+R`___________(I)
R#Q`= R`+Q` = Q`+R`____________ (II)
I and II both are equal hence S2 is true

•   Question 23

Consider the following relation
Which of the following options will be needed at the end of the SQL query
FROM Cinema P1
Such that it always finds the addresses of theaters with maximum capacity?

A : WHERE P1. Capacity> = All (select P2. Capacity from Cinema P2)
B : WHERE P1. Capacity> = Any (select P2. Capacity from Cinema P2)
C : WHERE P1. Capacity> = All (select max(P2. Capacity) from Cinema P2)
D : WHERE P1. Capacity> = Any (select max (P2. Capacity) from Cinema P2)

•
.

Solution :
Inner query collects capacities of all the theatres and in outer query we are filtering the tuples with the condition “capacity>=All”. So the theatres which are having maximum capacity will be satisfy the conductivity and they will.

•   Question 24

The value of given equation is

A : 0
B : 1/2
C : 1
D :

•
.

•   Question 25

Consider the following C program segment.
#include(stdio.h)
int main()
{
char s[7]='1234',*p;
p=s1+2;
*p='0';
printf("%s",s1);
}
What will be printed by the program?

A : 12
B : 120400
C : 1204
D : 1034

•
.

•   Question 26

The number of 4 digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set {1,2,3} is _____ .

•
.

Solution :
4-digit numbers with first digit ‘1’
1111, 1112, 1113, 1122, 1123, 1133, 1222, 1223, 1233, 1333 i.e., 10
4 digit numbers with first digit 2 : 2222, 2223, 2233, 2333 i.e, 4
4 digit numbers with first digit 3: 3333 i.e, 1

•   Question 27

In the given matrix one of the eigen values is 1. The eigenvectors corresponding to the eigen value 1 are

A : B :
C : D :

•
.

•   Question 28

Consider a machine with byte addressable main memory of 2020 bytes, block size of 16 bytes and a direct mapped cache having 212 cache lines. Let the address of two consecutive bytes in main memory be (E201F)16 and (E2020)16 . What are the tag and cache line address (in hex) for main memory address (E201F)16?

A : E,201
B : F,201
C : E,E20
D : 2,01F

•
.

•   Question 29

Consider the equality Σ i=0n = X and the following choices for X
I. θ (n4)
II. θ ( n5)
III.O(n5)
IV. Ω (n3)
The equality above remains correct if X is replaced by

A : only I
B : only II
C : I or III or IV but not II
D : II or III or IV but not I

•
.

Solution :
X= sum of the cubes of first n natural numbers = (n2(n+1)2)/4

•   Question 30

The result evaluating the postfix expression 10 5 + 60 6 / *8 - is

A : 284
B : 213
C : 142
D : 71

•
.

•   Question 31

Consider a CSMA/CD network that transmits data at a rate of 100 Mbps (108 bits second) over a 1 km(kilometer) cable with no repeaters. If the minimum frame size required for this network is 1250 bytes, what is the signal speed (km/sec) in the cable?

A : 8000
B : 10000
C : 16000
D : 20000

•
.

Solution :
Given L=1250 Bytes
B= 100 mbps d= 1km
V=?
In CSMA/CD, L=2*d*B/v
V= 2dB /L = (2*103*108)/ 104 = V= 20,000 km/sec

•   Question 32

Consider a software program that is artificially seeded with 100 faults. While testing this program, 159 faults are detected, out of which 75 faults are from those artificially seeded faults. Assuming that both are and seeded faults are of same nature and have same distribution, the estimated number of undetected real fault is _____ .

•
.

•   Question 33

Consider a binary tree T that has 200 leaf nodes. Then, the number of nodes in T that have exactly two children are ____ .

•
.

Solution :
Let the number of leaf nodes of a binary tree with ‘n’ vertices be ‘p’ then the tree has
(i) ‘p’ vertices of degree ‘1’
(ii) one vertex (i.e. root of T) of degree ‘2’.
(iii) 'n - p - 1' vertices of degree ‘3’
(iv) 'n - 1' edges
By Handshaking theorem,
p×1+1× 2 + (n - p - 1)×3 = 2(n - 1)
n=2p-1
=399 as p =200
Number of nodes having exactly two children are n - p i.e., 199

•   Question 34

In a web server, ten Webpages are stores with the URLs of the form http:www.yourname.com/var.html; where, var is different number from 1 to 10 for each Webpage. Suppose, the client stores the Webpage with var = 1(say W1) in local machine ,edits and then tests. Rest of the Webpages remains on the web server. W1 contains several relative URLs of the form “var.html” referring to the other webpages. Which one of the following statements needs to be added in W1, so that all the relative URLs in W1 refers to the appropriate Webpages on the web server?

A : < ahref :"http : / / www.yourname.com / ",href :"...var.html" >
B : < base href :"http : / / www.yourname.com / " >
C : < a href :"http : / / www.yourname.com / " >
D : < base href :"http : / / www.yourname.com / ", range :"...var .html" >

•
.

•   Question 35

Let L be the language represented by the regular expression Σ *0011 Σ * where Σ ={0,1}. What is the minimum number of states in a DFA that recognizes L (complement of L)?

A : 4
B : 5
C : 6
D : 8

•
.

•   Question 36

In for non-zero x, af(X) + bf(1/x) = 1/x - 25 where a then 12 f(x)dx is

A : (1/a2 - b2) [a(ln 2-25) + 47b/2 ]
B : (1/a2 - b2) [a(2ln 2-25) - 47b/2 ]
C : (1/a2 - b2) [a(2ln 2-25) + 47b/2 ]
D : (1/a2 - b2) [a(ln 2-25) + 47b/2 ]

•
.

•   Question 37

Consider the following grammar G
S -> F | H
S -> p | c
S -> d | c
where S, F, and H are non-terminal symbols, p, d, and c are terminal symbols. Which of the following statements(s) is/are correct?
S1.LL(1) can parse all strings that are generated using grammar G
S2: LR(1) can parse all strings that are generate using grammar G

A : Only S1
B : Only S2
C : Both S1 and S2
D : Neither S1 nor S2

•
.

•   Question 38

Consider three software items: Program –X, Control Flow Diagram of Program-Y and Control Flow Diagram of Program –Z as shown below .The values of McCabe’s Cyclomatic complexity of Program –X, Program-Y, and Program-Z respectively are

•
.

Solution :
Program-X Complexity = 9-7+2 = 4
Program-Y: Cyclomatic complexity = 10-8+2 = 4
Program Z:Total number of edges = X+Y+1=> 20 Total number of vertices = 15 Hence cyclomatic complexity = 20-15+2 = 7

•   Question 39

Consider the following partial Schedule S involving two transactions T1 and T2. Only the read and write operations have been shown. The read operation on data item P is denoted by read(P) and the write operation on data item P is denoted by write(P).
Suppose that the transaction T1 fails immediately after time instance 9. Which one of the following statements is correct?

A : T2 must be aborted and then both T1 and T2 must be re-started to ensure transaction atomicity
B : Schedule S is non-recoverable and cannot ensure transaction atomicity
C : Only T2 must be aborted and then re-started to ensure transaction atomicity
D : Schedule S is recoverable and can ensure atomicity and nothing else needs to be done

•
.

Solution :
T2 is reading the value written by T1 and getting committed before T1 commits. So it is nonrecoverable schedule.

•   Question 40

Consider a B+ tree in which the search Answeris 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is ____ .

•
.

Solution :
Suppose that ‘k’ is order of the non-leaf node
k(8)+(k-1)12 <= 1024
20k<=1036
k<=|_1036/20_| => k<=51
As the order is 51, maximum we can store 50 keys.

•   Question 41

Suppose Xi for i=1,2,3 ar independent and identically distributed random variables whose probability mass functions are Pr [Xi = 0] = Pr [Xi =1] =1/ 2 for i =1,2,3. Define another random variable Y = X1 X2 X , where denotes XOR.Then Pr [Y = 0| X3 = 0] = _____ .

•
.

•   Question 42

Given the function F = P` + QR, where F is a function in three Boolean variables P,Q and R and P` =!P, consider the following statements
(S1)F = ∑ (4,5,6)
(S2)F= ∑ (0,1,2,3,7)
(S3)F = π (4,5,6)
(S4)F= π (0,1,2,37)
Which of the following is true?

A : (S1)-False, (S2)-True, (S3)-True, (S4)-False
B : (S1)-True, (S2)-False, (S3)-False, (S4)-True
C : (S1)-False, (S2)-False, (S3)-True, (S4) True
D : (S1)-False-True, (S2) True, (S3)-False, (S4)-False

•
.

•   Question 43

The total number of prime implicates of the function
f (w,x, y,z) = ∑ (0,2,4,5,6,10) is ____ .

•
.

Solution :
There are three groups, and all the containing esential-1, so all are prime implicants as well as essential prime implicants also.

•   Question 44

Consider the equation (43)x = (y3)8 where x and y are unknown. The number of possible solution is_______ .

•
.

Solution :
(43)x = (y3)8
3+4x = 3+8y=>  4x = 8y
=> x = 2y
x>=5 and y<= 7
Therefore 5 solutions are possible which are (14,7), (12,6), (10,5), (8,4) and (6,3)

•   Question 45

Let f(n)=n and g(n)=n (1 sin n) , where n is a positive integer. Which of the following statement is/are correct?
I. f (n) = 0(g(n))
II. f (n) = Ω g(n))

A : Only I
B : Only II
C : Both I and II
D : Neither I and II

•
.

Solution :
As -1<=sinx<=1, neither of them is true

•   Question 46

Suppose c = (c[0],....,c[k - 1]) is an array of length k, where all the entries are from the set {0, 1}. For any positive integers a and n, consider the following pseudo code. DOSOMETHING (c, a, n)
z <- 1
for - <- 0 to k-1
do z <- z2 mod n
ifc[i]=1
then z <- (z*a) mod n
return z
If k = 4, c =( 1.0,1,1 ), a=2 and n = 8, then the output of DOSOMETHING (c, a, n) is _____________.

•
.

•   Question 47

Consider the following recursive C function.
Void get (int n)
{
if (n< 1) return;
get (n -1)
get( n- 3) ;
pr intf( "%d",n );
}
If get (6) function is being called in main () then how many times will the get () function be invoked before returning to the main ( ) ?

A : 15
B : 25
C : 35
D : 45

•
.

•   Question 48

Assume that a mergesort algorithm in the worst case takes 30 second for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes?

A : 256
B : 512
C : 1024
D : 2048

•
.

Solution :
O(n log n)=30s
n = 64 O (64 log 64) = 30
Hence will get factor of 12.8 for 6 min= 6×60 = 360s
O (256 log256) = 360
O (512 log 512) = 360
O(1024 log 1024) = 360
O (2048 log 2048) = 360
So for 512 will get 12.8 as a factor

•   Question 49

Consider the following two C code segments. Y and X are one and two dimensional arrays of size n and n × n respectively, where 2 <= n <=10. Assume that in both code segments, elements of Y are initialized to 0 and each element X[i] [j] of array X is initialized to i + j. Further assume that when stored in main memory all elements of X are in same main memory page frame.
Code segment 1:
//initialize element of Y to 0
//initialize elements X[i] [j] of X to 1+j
For (i = 0; i < n; i++)
Y[i] + = x[0] [i];

Code segment 2:
//initialize elements of Y to 0
//initialize elements X[i] [j] of X to 1+j
For (I = 0; i < n; i++)
Y[i] + = x[i] [0];
Which of the following statements is/are correct?
S1: Final contents of array Y will be same in both code segments
S2: Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory
S3: Elements of array X accessed inside the for loop shown in co

A : Only S2 is correct
B : Only S3 is correct
C : Only S1 and S2 are correct
D : Only S1 and S3 are correct

•
.

•   Question 50

The velocity v (in kilometer/minute) of a motorbike which start from rest, is given at fixed intervals of time t (in minutes as follows.
 t 2 4 6 8 10 12 14 16 18 20 10 v 18 25 29 32 20 11 5 2 0

The approximate distance (in kilometers) rounded to two places of decimals covered in 20 minutes using Simpson’s 1/3rd rule is ________.

•
.

Solution :
Let ‘S’ be the distance covered in 20 minutes, then by simpson’s 1/3rd rule
= 2/3[(0+0)+4(10+25+32+11+2)+2(18+29+20+5)]
=309.33km (Here length of each of the subinterval is h = 2)

•   Question 51

Consider the following C program
#include
int main ()
{
static int a =[10, 20, 30 40, 50] ;
static int * p =[a, a+ 3, a+ 4, a +1, a+ 2] ;
int **ptr =p;
ptr++ ;
printf( "%d%d", ptr- p, **ptr) ;
}
The output of the program is __________.

•
.

•   Question 52

Consider the following policies for preventing deadlock in a system with mutually exclusive resources.
I. Processes should acquire all their resources at the beginning of execution. If any resources acquired so far are released.
II. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers.
III. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers.
IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources.
When of the above policies can be used for preventing deadlock?

A : Any one of I and III but not II or IV
B : Any one of I, III, and IV but not II
C : Any one of II and III but not I or IV
D : Any one of I, II, III, and IV

•
.

Solution :
For deadlock prevention we need to dissatisfy any of the necessary condition for deadlock
1. For hold and wait if we r disatisfy it can be hold or wait for hold …before process start os assign all resources. While executing if process making new resource request it has to release all its assign resources that is waiting for release resources
2. If we r dissatisfy circular wait condition suppose there r five resources uniquely numbered r1 to r5 and there five processes p1 to p5 suppose p2

•   Question 53

Let G be a connected undirected graph of 100 vertices and 300 edges. The weight of a minimum spanning tree of G is 500. When the weight of each edge of G is increased by five, the weight of a minimum spanning tree becomes __________.

•
.

Solution :
G has 100 verticles => spanning tree contain 99 edges given, weight of a minimum spanning tree of G is 500 since, each edge of G is increased by five
Weight of a minimum spanning tree becomes 500 + 5 × 99 = 995

•   Question 54

If the following system has non-trivial solution.
px + qy + rz =0
qx + ry + pz = 0
rx + py + qz =0
Then which one of the following options is TRUE?

A : p ? q + r = 0 or p = q = ?r
B : p + q ? r = 0 or p = ?q = r
C : p + q + r = 0 or p = q = r
D : p ? q + r = 0 or p = ?q = ?r

•
.

•   Question 55

Consider a network connected two systems located 8000 kilometers apart. The bandwidth of the network is 500 × 106 bits per second. The propagation speed of the media is 4 × 106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. Then the minimum size in bits of the sequence number field has to be ___________.

•
.

•   Question 56

Language L1 is polynomial time reducible to language L2. Language L3 is polynomial time reducible to L2, which in turn is polynomial time reducible to language L4. Which of the following is/are true?
I. if L4 P, then L2
if L1 P or L3 P , then L2 P
III. L1 P,if and only if L3 P
if L4 P,then L1 P and L3 P

A : II only
B : III only
C : I and IV only
D : I only

•
.

Solution :
L2<= pL4
L1 <= pL2
if L4 P then L2 P hence L1 P, hence option C.

•   Question 57

Consider the following reservation table for a pipeline having three stages S1, S2, and S3.
The minimum average latency (MAL) is ________.

•
.

•   Question 58

In the network 200.20.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is ________.

•
.

Solution :
To find out the loss address in a block, we have to set (32-n) no. of right most bits to 1.
n=27
32 - n = 32 - 27 = 5
200.20.11.10010000
200.20.11.10011111
200.20.11.159
But w.r.t the question, the value of the last octet of last host in this network is 200.10.11.158.

•   Question 59

Which of the following languages are context-free?
L1 = { ambnanbm | m,n >=1 }
L2 = { ambnambn | m,n >=1 }
L3 = { ambn | m=2n+1 }

A : L1 and L2 only
B : L1 and L3 only
C : L2 and L3 only
D : L3 only

•
.

Solution :
ambnanbm => This one is CFL
ambnambn => by pumping lemma this one is not CFL.
{ ambn | m=2n+1 } This is CFL.

•   Question 60

Consider the following C program ( )
#inclue
int main
{
int i, j, k 0;
j= 2*3 /4+ 2.0 / 5 +8 / 5;
k-= - - j;
for (i= 0; i< 5; i + +)
{
Switch (i + k)
{
case1:
case 2 : printf ("\ n%d", i+k);
case 3: printf( "\ n%d", i+ k);
default : printf( "\ n%d", i+ k) ;
}
Return 0:
}
The number of times printf statement is executed is _________.

•
.

Solution :
j and k will be evaluated to 2 and -1 respectively.
In for loop:
When i = 0; 1 time printed (-1)
When i = 1; 1 time printed (0)
When i = 2; 3 times printed (1,1,1)
When i = 3; 3 times printed (2,2,2)
When i = 4; 2 times printed (3,3)
on the whole printf is executed 10 times

•   Question 61

Consider the following C program.
#include
int f1 (void) ;
int f 2 (void)
; int x 10;
int main ()
{
int x 1;
x +=f1()+ f2()+ f3()+ f2() ;
printf( "%d", x) ;
return 0;
}
int f1() { int x 25; x++ ; return x;}
int f2()
{ static int x 50; x++ ; return x;}
int f3(){ x* 10; return x ;}
The output of the program is_________.

•
.

Solution :
static variable in f2() will be initialized only once & it retains value in between function calls.

•   Question 62

Consider the following code sequence having five instructions I1 to I5. Each of these instructions has the following format.
OP Ri, Rj, Rk
Where operation OP is performed on contents of registers Rj and Rk and the results is stored in register Ri.
I2:MUL R7, R1, R3
I3 :SUB R4, R1, R5
I4 :ADD R3, R 2, R 4
I5 :MUL R7,R8, R9
Consider the following three statements.
S1: There is an anti-dependence between instructions I2 and I5
S2: There is an anti-dependence between instructions I2 and I4
S3: Within an instruction pipeline an anti-dependence always creates on or more stalls
Which one of above stamens is/are correct?

A : Only S1 is true
B : Only S2 is true
C : Only S1 and S3 are true
D : Only S2 and S3 are true

•
.

•   Question 63

Two hosts are connected via a packet switch with 107 bits per second links. Each link has a propagation. Delay of 20 microseconds. The switch begins forwarding a packet 35 microseconds after it receives the same. If 1000 bits of data are to be transmitted between the two hosts using a packet size of 5000 bits, the time elapsed between the transmission of the first bit of data and the reception of the last of the data in microsecond is _________.

•
.

•   Question 64

Let R be a relation on the set of ordered pairs of positive integers such that ( ( p , q ) , ( r , s ) ) ∈ R if and only if p - s = q - r. Which one of the following is true about R?

A : Both reflexive and symmetric
B : Reflexive but not symmetric
C : Not reflexive but symmetric
D : Neither reflexive nor symmetric

•
.

Solution :
Since p- q q-p
(p,q)R(p,q)
R is not reflective
Let (p,q) R (r,s) then p- s= q- r
r-q=s-p
(r,s) R (p,q)
R is symmetric

•   Question 65

For the processes listed in the following table, which of the following scheduling schemes will the lowest average turnaround time?
 Process Arrival Time Processing time A 0 3 B 1 6 C 4 4 D 6 2

A : Fir Come First Serve
B : Non-preemptive Shortest Job First
C : Shortest Remaining Time
D : Round Robin with Quantum value two

•
.