gatecse7thfeb2ndslotquestionpaper

17

Click here to load reader

Upload: svenkatkumar908464

Post on 17-Jul-2016

220 views

Category:

Documents


6 download

DESCRIPTION

gate

TRANSCRIPT

Page 1: GATECSE7thfeb2ndslotquestionpaper

GATE 2015 CSE on 7th feb, evening session

General aptitude section  Note: if you are changing the existing answer please do write the explanation for your answers. 

1) Which one of the following underline word is correct with reference

to sentence

a) Industrialist owns a personnel jet. b) I daily write my personnel diary. c) All personnel are given day off. d)

Ans-c

2) Which one of the following word is related to clothes like pair of

jeans,shirt,etc

a) fabric

b) textile

c) fibre

d) apparel

Ans-d

3) A triangle PQS ; angle PQS = 60 degree PQ = 'q' QS='r' PS='p' . QR

is angle bisector on PS the 'p' is

a) qr/(q+r)

b) (q+r)/qr

c) (q2 +r2)1/2

d)

Ans-A

Page 2: GATECSE7thfeb2ndslotquestionpaper

4) Fill the blanks

we _________ our friend's birthday and we ________ how to make

up

a) completely forgot, don’t just know

b) forgot completely, don’t just know

c) completely forgot, just don’t know

d) forgot completely, just don’t know

Ans-c

5) Calculate the weight of 10 poles by

I- 1/4th of the weight of the pole is 5 kg.

II-weight of these poles is 160kg more than weight of two poles

a) only I is sufficient.

b) only II is sufficient.

c) Either I or II is sufficient.

d) Neither I nor II are sufficient.

Ans-c

6) Calculate distance between M and P

M is 4km north of N

P is 2 km south of O

N is 1km south-east of O

a) 5.34

b) 6.xx

c) 28.5

d)

Ans-A

Page 3: GATECSE7thfeb2ndslotquestionpaper

7) If p,q,r,s,t is the arithmetic sequence then which of the following

is also an arithmetic sequence

I 2p,2q,2r,2s,2t

II p2,q2,r2,s2,t2

III (p-3),(q-3),(r-3),(s-3),(t-3)

a) I & II

b) I & III

c) I only

d) III only

Ans-B

8)If the function f(x) = 1 - |x| and -1<= x <=1 then what is value at

which the function is maximum and the maximum value.

a) 0,1

b) -1,0

c) 1,1

d) 0,0

Ans-a

9)In a function integer i,j,k,l

f(i,j,k,l)=max(i,j,k,l)

g(i,j,k,l)=Min(i,j,k,l)

h(i,j,k,l)= remainder of (i*j/k*l) if i*j>k*l or (k*l/i*j) if

k*l>i*j

compute the value of fg(h(2,5,3,7),4,6,8)

Ans 8

10)Fill in the blank

Since report lacked information, it was no use to them.

Page 4: GATECSE7thfeb2ndslotquestionpaper

Technical Section

1) Which of the following is not true about HTTP cookies ?

a. It is a small code which can pose a security threat.

b. It can enter the user workspace through HTTP Header.

c. It has expiry date and time.

d. It can be used to track the browsing pattern of the user.

Ans- B

2) Match the following

A. Lexical analysis i. Graph coloring

B. Parsing ii. DFA

C. Expression evaluation iii. Post order traversal

D. Regular expression iv. production tree

Ans- A-ii B-iv C-i D-iii

3)In a bank transaction scenario, read(x); x:=x-50; write(x);

ready(y); y:=y+50; write(y);.

The restriction such that the sum of x and y should always be a

constant will come under which property?

a. Atomicity

b. Consistency

c. Isolation

Page 5: GATECSE7thfeb2ndslotquestionpaper

d. Durability

Ans: A

4) A grammar is given as :

X0 = 1X1 X1 = 0X1 + 1X2 X2 = 0X1 + λ Which of the following regular expressions can correctly represent the

grammar?

a. 10(0*+ (10)*)1

b. 10(0*1(10)*)*1

c. 1(0+10)*1

d. 10(0+10)*1 + 110(0+10)*1

Ans: c.

5) In an unordered list of ‘n’ distinct numbers find the complexity of

an algorithm which search for an element which is neither maximum nor

minimum.

a. Θ(nlogn)

b. Θ(n)

c. Θ(log n)

d. Θ(1)

Ans: d. answer is O(1) because the question said ‘distinct’

6) Consider the statements:

S1: If a candidate is known to be corrupt, he will not be elected.

S2: If a candidate is kind, he will be elected.

Page 6: GATECSE7thfeb2ndslotquestionpaper

Which of the conclusions is TRUE?

a. If a candidate is known to be corrupt he will be kind.

b. If a candidate is not known to be corrupt he is not kind.

c. If a candidate is kind, he is not known to be corrupt.

d. If a candidate is not kind he is not known to be corrupt.

Ans c.

7) Find the largest eigenvalue for the matrix

4 5

2 1

Ans 6

8)Which among the following should not be discussed in SRS?

a. User Interface issues.

b. Non functional requirements.

c. Design specifications.

d. Interface with third party software.

Ans D

9)If a binary tree has 20 leaf nodes, then how many nodes will have

two children nodes?

Ans 19

10)In a typical server in which order the operations- accept, bind,

listen and recv - will be executing?

a)listen,bind,accept,recv

b)bind,listen,accept,recv

c)listen,accept,bind,recv

Page 7: GATECSE7thfeb2ndslotquestionpaper

d)accept,listen,bind,recv

Ans B 11) A cache memory will take 50 ns in case of cache miss and 5 ns in

case of cache hit. What is the average cache time if 80% of time cache

hit occurs?

Ans 14ns

12)R is a relation aRb such that a and b are distinct and there is a

14) If a connection has speed f 104560 bits per second and works in

TCP connection. If 'α' is the RTT before TCP scaling and 'β' is the window size after TCP scaling then value of α and β will be: a. 63 ms , 65535 x 214

b. 63 ms , 65535 x 216

c. 500 ms , 65535 x 214

d. 500 ms , 65535 x 216

15) The edge which causes graph disconnected on deleting it is called

bridge. Which of the following is true about bridge?

a. There will be no bridge in a tree.

b. Bridge can never be a part of a simple cycle.

c. Every edge in a clique having more than 3 nodes is a bridge.

d. If a graph has bridge there will be no cycle in it.

Ans B

16. What will the following code print if input is given as

“ABCD EFGH” ?

void foo(char *a)divisor other than 1 . Then R can be a) Reflexive and symmetric but not transitive

b) Neither Reflexive nor symmetric but transitive

c) Symmetric but not reflexive, not transitive

d) Reflexive but not symmetric, not transitive

Ans C

Page 8: GATECSE7thfeb2ndslotquestionpaper

13) A data of 8800 byte has to be sent using UDP protocol through IP

packets. if MTU of network is 1500 bytes. UDP header is 8 bytes and IP

header is 20 bytes and no options are using. In this scenario find the

number of fragments and offset value:

a. 6, 925

b. 6, 7400

c. 7, 1100

d. 7, 8800

Ans C

{

if(*a && *a != ' '){

foo(a+1);

putchar(*a);

}

}

a. ABCD EFGH

b. ABCD

c. EFGH

d. DCBA

Ans D

17. Two operations are performed on given matrix

I Add third row to second row

II Subtract third row from first column

then Determinant is

3 4 45

7 9 105

13 2 195

Ans 0

18. Consider the given code segment:

MUL R5, R0, R1

DIV R6, R2, R3

Page 9: GATECSE7thfeb2ndslotquestionpaper

ADD R7, R3, R4

SUB R8 , R5, R4

In a microprocessor system, first operand will store the value

computed between second and third operands sing pipelining. Each

instruction will go through four stages: Instruction Fetching (IF),

Operand Fetching (OF), Operation Execution (OE) and Write Back (WB).

All operations except OE will take one cycle time. MUL instruction

will take 3 clock cycles for OE, DIV instruction will take 5 clock

cycles for OE while ADD and SUB instruction will take 1 clock cycle

for OE. Calculate the number of clock cycles required for the code

segment given above:

Ans 13

19. Consider the statements:

S1: If a candidate is corrupted, he will not be elected.

S2: If a candidate is kind, he will be elected.

Which of the conclusions is TRUE?

a. If a candidate is corrupted he will be kind.

b. If a candidate is not corrupted he is not kind.

c. If a candidate is kind, he is not corrupted.

d. If a candidate is not kind he is not corrupted.

Ans

20. A system has 6 resources and N processes . Each process can demand

for 2 resources n maximum. For what value of n deadlock will

definitely occur?

a. 1

b. 2

c. 3

d. 4

Ans wrong question but marked d

21. Which of the following statements are true about Abstract Syntax

Tree(AST) and Control Flow graph(CFG)?

Page 10: GATECSE7thfeb2ndslotquestionpaper

a. If N2 is a successor of N1 in AST and CFG the code implementing N2

will always be after the code implementing N1.

b. Neither AST nor CFG will carry a cycle.

c. The maximum number of successors in AST and CFG depends on input

program.

d. In AST and CFG each node represents one statement in code.

Ans

22. If left and right subtrees of a tree are max heaps, then find the

time complexity to convert the tree into heap?

a. O(logn)

b. O(n)

c. O(nlogn)

d. O(n2)

Ans A

23. A system can communicate in 106 bits per second speed, each frame

has fixed length of 1000 bits. It is observed that the efficiency is

25% when Stop and wait protocol is used. Find the propagation delay:

Ans 12ms

24) Given that q1 and q2 are two problems. If q1 can be reduced to 3

SAT problem and 3 SAT problem can be reduced to q2, which of the

following is true?

a. q1 is NP hard and q2 is NP

b. q2 is NP hard and q1 is NP

c. Both q1 and q2 are NP hard

Page 11: GATECSE7thfeb2ndslotquestionpaper

d. Both q1 and q2 are NP

Ans b

25)Consider the function:

int f(n){

int x=1,k;

if(n==1) return x;

for(k=1;k<n;k++)

x = x + f(k)*f(n-k);

return x;

}

What will be the return value for f(5)?

Ans 51

26)Equation to find duration for software development using COCOMO

Model where a,b,c,d are usual constants

a. E=a(KLOC)exp(b) D=c(E)exp(d)

b. E=a(KLOC)exp(b) D=c(KLOC)exp(d)

c. E=a exp(b) D=c exp(d)

d. E=c exp(d) D=a exp(b)

Ans A

27)Find the cardinality of power set of {0 , 1 , 2 , ...., 10}

Ans: 2048

Page 12: GATECSE7thfeb2ndslotquestionpaper

28) A graph is self complementary if it is isomorphic to its

complementary graph. For a self complementary graph of n vertices

which of the following is correct?

a. n is a multiple of 4

b. n is odd

c. n is even

d. n is congruent to 0 mod 4 or 1 mod 4

Ans D

29) Which of the following is correct?

a. Code inspection is done after unit testing is completed.

b. Code walk through and Code inspection are synonymous.

c. Coding standards are evaluated during code inspection

d. Code walkthrough is done by an independent team.

Ans

30) A transaction system has been crashed and the log file recovers

is as follows:

start T4;

.. . ..

start T1

.....

commit T4

...

checkpoint;

...

start T2

....

Page 13: GATECSE7thfeb2ndslotquestionpaper

start T3

.....

commit T2

What will be the undo - redo list of transactions?

Ans

31) If there are ten buckets numbered from 0 to 9 and input values can

be in between 0 and 2020, which of the following function can fairly

distribute values among buckets?

a. h(i) = i2 mod 10

b. h(i) = i3 mod 10

c. h(i) = (11* i2) mod 10

d. h(i) = (12* i2) mod 10

Ans B

32)A system has memory segments of size 200, 400, 600, 500, 300 and

250

respectively. If the processes of size 357, 210, 468, and 491 are

allocated in segments using best fit algorithm, what segments will be

left unused?

a. 200 & 300

b. 250 & 300

c. 200 & 400

d. 200 & 250

Ans A

33) Given two relations: R1(A,B)= {(1,5), (3,7)} and R2(A, C) = {(1 ,

7),(4,9)}. R is a relation obtained the doing FULL NATURAL OUTER JOIN

Page 14: GATECSE7thfeb2ndslotquestionpaper

between R1 and R2. Find the tuples that cannot be a member of R a =

(1,5,NULL) b = (1,5,9) c = (1,3,7) d = (4,3,9) e = (1,5,7) f=

(3,7,NULL) g = (4,NULL,9)

a. a,b,c,d,e not f,g

b. a,b,c,d,e,f,g

c. e,f,g not a,b

d. e

Ans C

34) Find number of minterms from the function

[D' +AB' +A'C + AC'D +A'C'D]'

Ans 1

35)Find the minimum number of states in DFA required to represent the

regular expression: (0+1)*10

Ans 3

36) Physical address is of 32 bits, page is of size 8KB and page table

entry contains 1 bit for dirty bit ,1 bit for valid bit,3 bits for permission bit other than translation. Given 24MB is maximum page table size, then what is the virtual address size in bits?

Ans 36 bits

37) Find the maximum number of ONTO relations from {1,2,3,4} to

{a,b,c} ?

Page 15: GATECSE7thfeb2ndslotquestionpaper

Ans 36

38) All possible functions are made between set having 2 and 20

distinct elements respectively. Find the probability of selecting an

one to one function.

Ans 0.95

39) Let f(x) = x -1/3 for the values -1<x<1 and the A be the area

covered between this function and X axis. Which of the following

statements are correct:

a. f(x) is continuous.

b. f(x) is bounded.

c. A has a non zero finite value

d. None of these

Ans: c

40). Consider the three languages given:

L1 = {wxwR| where wR is reversal of w | w,x belongs to (a,b)* and |w|>1, |x|>1}

L2: {am bn | m≠n where m,n >0}

L3: {ap bq cr | where p,q,r >0}

Which of these is/are regular?

a. L1

b. L3

c. L1 & L3

d. L1 , L2 & L3

Ans C

Page 16: GATECSE7thfeb2ndslotquestionpaper

41)Which one of the following is Turing decidable * can't recall the options

42)For a given B+ tree of order 1 ,minimum number of nodes to be

fetched for a given query

"X greater than or equal to 7 and less than 15"

Ans 5

43) Cylinder 15000 rpm , avg seek time is twice the Rotational latency

transfer rate is 32KBps

512 byte sector size.calculate total cylinder access time.

Ans 6.00-6.11

44) minimum number of JK flipflop required for the counter sequence 0011223300..

Ans 3 (Please justify.)

45)Propogation delay of AND/OR gate in 1.2 ns and XOR gate is twice

the AND/OR delay.

then total propogation delay of 4 bit binary adder is?

Ans 19.2 micro seconds

46) Question on subnet mask

47) Question on tautologies(Logic)

Page 17: GATECSE7thfeb2ndslotquestionpaper

48. Question on secant method.

49. Divisors of 2100

Ans: 36