You are on page 1of 15

GATE-CS-2015 7th-EVENING

Q1)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
Q2)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) (q^2 +r^2)^1/2
d) --------Ans-A

3) Fill the blanks


we _________ our friend's birthday and we ________ how to make
up
a) completely forgot,
b) forgot completely,
c) completely forgot,
d) forgot completely,
Ans-C

dont just
dont just
just dont
just dont

know
know
know
know

4) Which one of the following underline word is correct with


reference to sentence
a)
b)
c)
d)

Industrialist owns a personnel jet.


I daily write my personnel diary.
All personnel are given day off.
-------------------------------

Ans5) Calculate the total weight of 10 poles with the help of


following statemetns:1st- 1/4th of the weight of the pole is 5 kg.
2nd- total weight of poles are 160kg more than weight of two
poles.
a) only 1 is sufficient.
b) only 2 is sufficient.
c) Either 1 or 2 is sufficient.
d) Neither 1 nor 2 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
7) If p,q,r,s,t are in arithmetic sequence then which of the
following is also an arithmetic sequence
1st :2p,2q,2r,2s,2t
2nd :p^2,q^2,r^2,s^2,t^2
3rd :(p-3),(q-3),(r-3),(s-3),(t-3)
a) 1 & 2
b) 1 & 3
c) 1 only
d) 3 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
is.
a) 1,1
b) -1,0
c) 0,1
d) 0,0

Ans-C

9)In a function let three integers i,j,k,l if


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
and fgh(i,j,k,l)= f(i,j,k,l)*g(i,j,k,l)*h(i,j,k,l)
then
compute the value of fg(h(2,5,3,7),4,6,8) :Numeric Question:Ans 8
10)Fill in the blank
Sined information, it wce report lacked the need as no use to
them.
Ans.---------------

Technical Section:1) Which of the following is NOT true about HTTP cookies ?
a. It is a small code which can compromise any 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 or Can be A 50%

2) Match the following:A. Lexical analysis


B. Parsing
C. Expression evaluation
D. Register allocation iv.
Ans- A-ii B-iv C-iii D-i

i. Graph coloring
ii. DFA
iii. Post order traversal
production tree

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
d. Durability
Ans:-B
4) A grammar is given as :
X' = 1X
X = 0X' + 1X
X' = 0X + (NULL Transaction)
Which of the following regular expressions corresponding to
this grammar is ?
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
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.
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
Numerical Question
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:--------(C/D)not sure

9)If a binary tree has 20 leaf nodes, then how many nodes will
have two children nodes?
Numeric Question
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
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
in(N.Second) if 80% of time cache hit occurs?
Numeric Question
Ans:-14ns
12)R is a relation aRb such that a and b are distinct and there
is 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:--------

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 option 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
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 2^14
b. 63 ms , 65535 x 2^16
c. 500 ms , 65535 x 2^14
d. 500 ms , 65535 x 2^16
Ans:----15) A bridge is an removel of whichdisconnected the graph. Then
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. consider the following C function:-

void foo(char *a)


{
if(*a && *a != ' ')
{
foo(a+1);
putchar(*a);
}
}
For the Input String ABCD EFGH what will be the Output.?

a. ABCD EFGH
b. ABCD
c. EFGH
d. DCBA
Ans:-D
17. Two operations are performed on given matrix
1. Add third row to second row
2.Subtract third row from first column
then Determinant of the matrix is:3
4
45
7
9
105
13 2
195
Numeric Question
Ans:-0
18. Consider the given code segment:
MUL R5, R0, R1
DIV R6, R2, R3
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:Numerical Question
Ans:-13
19) 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:-D

20)Which of the following statements are true about Abstract


Syntax Tree(AST) and Control Flow graph(CFG)?
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
21) 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(n^2)
Ans:-A
22) A system can communicate in 10^6 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:Numeric Question

Ans:-12ms
23) 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
d. Both q1 and q2 are NP
Ans:-B

24)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)?
Numeric Question
Ans:-51
25)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

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


Numeric Question
Ans:-2048(2^11)

27) 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
28) 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:-----29) A transaction system has been crashed and the log file
recovers is as follows:
start T4;
.. . ..
start T1
.....
commit T4
...
checkpoint;
...
start T2
....
start T3
.....
commit T2
What will be the undo - redo list of transactions?
Ans:30) 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) = i^2 mod 10

b. h(i) = i^3 mod 10


c. h(i) = (11* i^2) mod 10
d. h(i) = (12+i^2) mod 10
Ans:-B
31)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
32) 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 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 but not f,g
b. a,b,c,d,e,f,g
c. e,f,g but not a,b
d. e
Ans:-C
33) Find number of minterms after minimizing the following
function
[D' +AB' +A'C + AC'D +A'C'D]'
Numeric Question
Ans:-1
34)Find the minimum number of states in DFA required to
represent the regular expression: (0+1)*10
Numeric Question
Ans:-3

35) 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?
Numeric Question

Ans:-36 bits
36) Find the maximum number of ONTO relations from {1,2,3,4} to
{a,b,c} ?
Numeric Question
Ans:-36
37) All possible functions are made between set having 2 and 20
distinct elements respectively. Find the probability of
selecting an one to one function.
Numeric Question
Ans:-0.95
38) 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:S1 f(x) is continuous.
S2 f(x) is NOT bounded between [-1,1].
S3. A has a non zero finite value
a)only 1
b)only 2 and 3
c)only 2
d)only 3
Ans:-B
39). 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: {a^m b^n | mn where m,n >0}
L3: {a^p b^q c^r | where p,q,r >0}
Which of these is/are regular?
a.only L1

b.only L3
c. L1 & L3
d.all
Ans:-C
40)Which one of the following is Turing decidable
a)Compliment of turind Decidable is turing Decidable
b)a Language belong to NP may be turing Decidable
c)a language belong to NP Need not be turing Decidable
d)...............
Ans:41)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"
Numeric Question
Ans :-5
42) Cylinder 15000 rpm , avg seek time is twice the Rotational
latency
transfer rate is 32KBps
512 byte sector size.calculate total cylinder access time.
Numeric Question
Ans:-6.++
43) minimum number of JK flipflop required for the counter
sequence
0011223300..
Numeric Question
Ans:-2/3 not sure
44)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?
Numeric Question
Ans:-.......

45) Question on subnet mask


Ans:-.......
46) Which of the following is tautology
A.
B.
C. for all x, for all y (P(x,y) R(x,y)) for all x, for all
y (not P(x,y) v R(x,y))
D.
Ans:-C
47. Question on secant method.
Ans:-

48.Number of Divisors of 2100 is


Numeric Question
Ans:-36
49. Question to find the k_th_smallest element in an array
using partition subroutine.
Some C code is given and we have to find out the currect code
for left part of the blank spaces
A.)kth_smallest_element(a,n,k) and kth_smallest_element(a,nleft_end-1,k-left_end-1)
B.)kth_smallest_element(a,n,k) and
kth_smallest_element(a+left_end+1,n-left_end-1,k-left_end-1)
C.kth_smallest_element(a+left_end+1,n-left_end-1,k-left_end)and
kth_smallest_element(a,n,k)
D.kth_smallest_element(a,n-left_end-1,k-left_end-1)
andkth_smallest_element(a,n,k)
Ans:-B
50) Question on Youngs table, find the minimum number of moves
to delete 1.
Numeric Question

Ans:-5
51) switch case problem in whic c code is given
Numeric Question
Ans:-10+5 = 15

52) Stack top pointer is at (16E)h, find the value of top


pointer after execution of CALL instruction.
memory is word addressable and 1 word = 2 Byte
a)16A
b)16C
c)170
d)172
Ans:-D

53)Match the column


A)Dijkstra
Algorithm 1. Divide and Conquer
B)Floyd Warshall
2. Dynamic programming
C)Binary Search
3. Greedy
D)Backtracking
4. DFS
5. BFS
Ans:-A-3, B-2, C-1, D-4
in option answer is C
54) Find the number of TAG-bit for 128 entries in TLB, having
32-sets
4-way set associative cache, page size = 8KB and physical
address =24bits
Numeric Question
Ans:-

55)..
Ans:-

You might also like