Feb 2

CSTest ID: 2223
TarGATE14
www.gateforum.com
Q. No. 1 25 Carry One Mark Each 1. For a complete bipartite graph K 4,5 , lines covering number (B) 1 = 4, 1 = 4 (C) 1 = 5, 1 = 9
independence number ( ) are ____________. (A) 1 = 9, 1 = 4 2.
( 1 )
and line
(D) 1 = 5, 1 = 4
The solution to the recurrence relation T(n) = T(n-1) + n, T(0) = 2 is:
(A) T(n) = n! + n (C) T(n) =
(B) T(n) =
n2 + n + 2 2
n2 + n + 4 2
(D) T(n) = n!
3.
The system of equations x + 4y +8z =16, 3x +2y+4z = 12 and 4x+y+2z = 10 have (A) only one solution (B) Two solutions (C) infinitely many solutions (D) No solution A LAN uses CSMA/CD protocol. The end to end propagation delay between two stations is 125 sec . Find the contention time. (A) 62.5 sec (B) 125 sec (C) 250 sec (D) 187.5 sec
4.
5.
Two processes A and B are operating on counting semaphore variable C and binary semaphore variable M as follows: Initially C = 0 and M = 1;
Pr ocess A while (1) { wait (M) ; produce _ data; si gnal ( C ) ; signal (M) ; }
Statement: I:
Pr ocess B while (1) { wait (M) ; wait ( C ) ; consume _ data; si gnal (M) ; }
It is classical producer consumer problem with bounded buffer.
II: It is classical producer consumer problem with unbounded buffer. III: It may go into deadlock. Which statement is/are true? (A) I only (B) II only (C) I and III
DLP
(D) II and III

TarGATE-All India Test Series
1
ICPIntensive Classroom Program
eGATE-Live Internet Based Classes
All rights reserved by Gateforum Educational Services Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the written permission.
CSTest ID: 2223

6.
TarGATE14
www.gateforum.com
A shift reduce parser carries out the action specified within braces immediately after reducing with the corresponding rule of grammar.
S aaX {Pr int " 2 "} . S b {Pr int" 3 "} X Sc {Pr int"1"} .
What is the translation of aaaabcc using the syntax directed translation scheme described by the above rules? (A) 32311 7. (B) 31212 (C) 12321 (D) 23131
The number of rows returned by SQL query on the given EMP table is ____ SELECT * eno 1 2 3 4 ename a b c d manager 2 3 4 NULL
FROM EMP WHERE eno NOT IN ( SELECT manager FROM EMP);
8.
The number of nodes in B+ tree when we construct it with order of internal node as 3 and order of leaf node as 2 , for the key sequence 5, 8, 1, 7, 3, 12, 9, 6 is________________. Which of the following is true? (A) Maximum size of both sender and receiver window for data transmission using Go back N protocol with n bit frame sequence number is 2n -1 (B) We can use the piggybacking technique to improve the efficiency of unidirectional protocols (C) If the sequence number for Selective Repeat protocol goes from 0 to 63, then the maximum sender window size will be 32 (D) Go back N protocol is more efficient in noisy channel than Selective Repeat protocol
9.
10.
There is a channel with bandwidth 2 MBPS, propagation delay 50 ms and packet size 4KB. What will be the channel utilization? (A) 1.96% (B) 3.84% (C) 4.7% (D) 9.67%
11.
The length of longest common subsequence of
X = 1, 0, 0,1, 0,1, 0,1 and Y = 0,1, 0,1,1, 0,1,1, 0 is ___________

(A) 4 (B) 5 (C) 6 (D) 7
DLP

2
CSTest ID: 2223

12.
TarGATE14
www.gateforum.com
What is the worst-case time complexity for heapsort to sort an array of n elements? (A) O(log n) (B) O(n) (C) O(n log n) (D) O(n2) Which of the following are TRUE? i) ii) iii)
13.
n! = ( (n + 1) !)
n logn 4 = log2
)
(B) (i) & (iii) only (C) (ii) only (D) (i),(ii) and (iii)
logn = O (log log n)
(A) (i) & (ii) only 14.
According to Brooks, if there are 4 programmers in a team, then the total number of communication paths possible is____________. A flow graph for a program is given as follows:
15.
1 2 4
5
6
7
9
10
Which of the following nodes are dominated by node 3? (A) 5, 6,7, 8, 9 (B) 4,5, 6, 7, 8, 9 (C) 4 only (D) 4,5
16.
Match the correct automaton given in Y for the given transition function in X. X I.
Q Q II. Q 2Q III. Q Q {L,R} IV. Q { } 2Q
Y
A. NFA B. DFA C. NFA with null moves D. Turning machine E. F. 2 way DFA PDA
(A) I-B, II-A, III-D, IV-F (C) I-A, II-B, III-E, IV-F
(B) I-B, II-A, III-E, IV-C (D)I-B, II-A, III-F, IV-D
DLP

3
CSTest ID: 2223

17.
TarGATE14
(C) 3 (D) 4
www.gateforum.com
What will be the number of states in the minimal DFA which accepts the language represented by regular expression (a+aaa)* over the alphabet {a}? (A) 1 (B) 2
18.
In a B-Tree, the block size is 512 Bytes, search key is 4 bytes, block pointer size is 8 bytes, and record pointer size is 8 bytes. Every node contains n-1 record pointers, n-1 search keys, n block pointers (where n is the order of the B-tree). The maximum number of search keys that can be accommodated in level 0 of above B-tree (root is at level 0) is ____________. If a 4 to 1 MUX is used to implement F ( X, Y, Z ) = X ' Y + XY ' then which of the following is correct?
S0 S1 S2 S3
4 to 1
F ( X, Y , Z )
19.
MUX
Y Z
(A) S0 = 1 S1 = X S2 = 1 S3 = X ' (C) S0 = X S1 = X ' S2 = X ' S3 = X 20.
(B) S0 = X S1 = X S2 = X ' S3 = X ' (D) Both (B) and (C)
Two cells in the same locations but spread on two maps of a 5 variable K-map differ in their decimal representation by (A) 4 (B) 8 (C) 16 (D) 2 Consider a pipeline with 5 stages. Assume the 1st stage takes 5 units of time, 2nd takes 2 units of time, 3rd takes 3 unit of time, 4th takes 1 unit of time and 5th takes 4 unit of time. The speed up factor of pipeline is ________.
A micro program control unit is required to generate a total 120 control signals. The number of bits required in the control word to achieve maximum parallelism is ________________. The following basic block supports which of DAG?
21.
22.
23.
D=B*C E=A+B B=B+C A=E-D

A
A
+ B
+ A
(A)
+ E
B
(B)
+ E
D + B
(C)
E
B
D +B
(D)
E
B
D + B
DLP

4
CSTest ID: 2223

24.
TarGATE14
(C) 0.2916
www.gateforum.com
A lot had 20% defective items. Ten items are chosen randomly from this lot. The probability that exactly 3 of the chosen items are defective is (A) 0.2013 (B) 0.3915 (D) 0.2561
25.
By assuming that the numbers are in 2s complement notation, evaluate the following product.
1111010 * 00001010
(A) 100 (B) -100 (C) 60 (D) -60
Q. No. 26 51 Carry Two Marks Each

26. 16 line address bus has lines A15-A0, an address of a peripheral is (AFC6)16 and address decoder for that peripheral ignore line A8 and A9. What are the addresses to which this device will respond? (A) ( AFC6 )16 , (BFC6 )16 , ( CFC6 )16 , (DFC6 )16 (B) ( AFC6 )16 , ( AEC6 )16 , ( ADC6 )16 , ( ACC6 )16 (C) ( AFC6 )16 , ( AFC7 )16 , ( AFC8 )16 , ( AFC9 )16 (D) ( AFC6 )16 , (BEC6 )16 , ( CDC6 )16 , (DCC6 )16 27. The following grammar abstracts the dangling-else problem. S -> iEtS | iEtSeS | a E -> b Here i, t and e stand for if, then and else respectively, E and S for Expression and statement. Which of the following represents the left factored form of given grammar?
S iEtSS' a
(A) S' eS
S iES' a
(B) S' tS tSeS
Eb S aS'
(C) S' iE t sS' iEtSeSS'
Eb S iES' a
' '' '' (D) S e SS S S'' tSS''
Eb
Eb
28.
A two-level paging scheme uses a Translation look aside Buffer (TLB). A TLB access takes 10 ns and a main memory access takes 100 ns. What should be the TLB hit ratio (in %), so that effective access time (EAT) is no more than 150 ns ? (A) 60% (B) 70% (C) 80% (D) 90%
DLP

5
CSTest ID: 2223

29. follows Semaphore Sx, Sy
TarGATE14
www.gateforum.com
Implementation of synchronization problem of the two processes P0 & P1 is as
Sx = 1, Sy = 1
P0
P1
wait ( Sx ) wait Sy
( )
wait ( Sx ) wait Sy
( )
critical sec tion signal Sy
critical sec tion signal Sy
( )
( )
signal ( Sx )
signal ( Sx )
Which of the following statement is false for the above implementation? (A) Mutual exclusion exist (B) There is progress in the system (C) There will not be any effect on the system if process P0 reverse order of wait() function (D) None of these 30. In a test, answering a question is a multiple choice. A student either knows the answer or guesses the answer. Let P be the probability that the student knows the answer to a question. (1-p) be the probability that the student guess the answer. Assume that if the student guess the answer to a question will be correct 1 with probability = . What is the conditional probability that if the student knew 5 the answer to a question given that the question is answered correctly? (A) (C)
4p 5p + 1 5p 4p + 1
(B) (D)
4 5 4p + 1 5
DLP

6
CSTest ID: 2223

31.
TarGATE14
N N
www.gateforum.com
What would be the correct relational model for the given E-R Model?
M
(A) MN(M1, M2, N1, N2) (B) M(M1, M2, N1), N(N1, N2) (C) M(M1, M2), N(N1, N2, M1) (D) M(M1, M2), R(M1,N1), N(N1, N2) 32.
Assume that p & q are pointers. What will be the output after performing following sets of operations on a given linked list? struct node { char info; struct node *link; };
a
p
Operations are: q=p link link ; p link = q link link; q link link link=q link; printf (%c, p link link link info); (A) e (B) d
(C) c
(D) b
33.
The following elements are inserted in sequence to create an AVL tree. 31, 36, 40, 19, 14, 24, 50 What is the pre-order traversal of the created AVL tree? (A) 31, 19, 14, 24, 36, 40, 50 (C) 36, 19, 14, 31, 24, 40, 50 (B) 31, 19, 14, 24, 40, 36, 50 (D) None of these
34.
The time complexity of function given below with constants is void fun(int a[], int n) { int i; printf("%d",n); for(i=0; i<n; i++) { printf("%d",a[i]); } printf("n"); } (A) O(1) (B) O(n)
(C) O(logn)
DLP
(D) O(n2)
7
CSTest ID: 2223

35.
TarGATE14
www.gateforum.com
The number of comparisons required to search 28 in hash table with bucketing is pos = x%10
0 1 2 3 4 5 6 7 8 9
(A) 1 36.
0 100 50 20 10 22 32 12
38 18 98 28
(B) 2
(C) 3
(D) 4
Consider a CRC generator polynomial x3+1. Match the following data polynomial and their corresponding remainder. A. x8 + x5 +x3 B. x6 +x3 +x2 +x C. x +x +x (A) (C)
7 5 4
I. x2 +x II. x2 III. 1 (B) (D) A-3, B-2, C-1 A-2, B-1, C-3
A-3, B-1, C-2 A-2, B-3, C-1
37.
In a IPv4 packet, the value of HLEN is 1011 in binary. How many bytes of optional information are carried by the Header of this packet? (A) 0 B (B) 12 B (C) 20 B (D) 24 B
38.
Which of the following statements is/are true? (i) Let (G, *) and Homorphism from (G,*) to (H, ) if for all a,b G, f(a* b) = f(a)f(b) (ii) A group can have more than one identity element. (iii)The inverse of every element of a group is unique. (A)(ii) and (iii) only (C) (i) and (iii) only (B) (i) and (ii) only (D)All are true
(H, )
be two groups. A mapping f : G H
is called Group
39.
What will be the grammar after eliminating left recursion from the following grammar?
S SaSbS ab
(A) S abA, A aSbSA (C) S abSA, A aSbSA
(B) S aSbA, A aSbSA (D) None of these

DLP TarGATE-All India Test Series
8
CSTest ID: 2223

40.
TarGATE14
0
www.gateforum.com
Find out the regular expression corresponding to the given DFA.
q0
0
1
q1
q2 0,1
0
1 q3
(A) ( 00 * 1 + 11 * 0 ) ( 0 + 1) * (C)
(B) (11) * ( 0 * 1 + 1 * 0 ) ( 0 + 1) * (D) (11) * ( 00 * 1 + 10 ) ( 0 + 1) * with the probability of their
( (11) * 0 + 00 * 1) (0 + 1) *
41.
Consider a set of messages
M1 , M2 , M3 & M4
occurrence in a transmission as 0.05, 0.3, 0.15 & 0.5 respectively. What is the average number of bits per message required using Huffman coding? (A) 2 (B) 2.25 (C) 1.7 (D) None of these
42.
An experiment yield three mutually exclusive events A, B, C such that P(A) = 2P(B) = 3P(C). Then P(A) = (A)
6 11
(B)
5 11
(C)
3 11
(D)
4 11
43.
Which of the following is not the correct implementation for the Boolean function F ( A,B, C ) = m ( 0,1,3, 4,5, 7 ) using 4 : 1 multiplexer?
(A)
1 1 0 1 I0 I1 I2 I3 B C F
(B)
1
A
I0 I1
I2 I3 F
0 1
(C)
I0 I1 F
C
C 1
(D) Both (B) and (C)
I2 I3
A
DLP

9
CSTest ID: 2223

44.
TarGATE14
www.gateforum.com
Which of the following is false? (A) All the schedules which are allowed under basic time stamp ordering protocols are also allowed under Thomas write rule. (B) Schedule which are allowed under Thomas write rule are also allowed under multi version time stamp ordering protocol. (C) All the schedules which are not allowed under Thomas write rule are also not allowed under multiversion time stamp ordering protocol. (D) None of these
1 0 3 If A = 2 1 1 , then 1 1 1
45.
(A)A3 + 3A2 + A 9I = 0 (C)A3 - 3A2 + A + 9I = 0 46.
(B)
A3 - 3A2 - A + 9I = 0
(D) A3 + 3A2 - A + 9I = 0
The Conjunctive Normal form of the formula X is
(P Q P ) (P Q Q ) ( P Q P ) ( P Q Q ) .
(A) T (B) (P Q ) (P Q )
Then find the X value?
(C) (P Q ) (P Q ) (D) (P Q ) (P Q )
47.
f1 f2 f3
If f ( x, y, z )
f1 ( x, y, z ) = ( 0,1,3,5) , f2 ( x, y, z ) = ( 4,5) and f ( x, y, z ) = (1, 4,5) f3 ( x, y, z ) = ___?

(B)
then find (A)
(1, 4,5)
(1, 4,5)
(C)
( 0,1,3,5)
(D)
( 0,1,5)
DLP

10
CSTest ID: 2223
TarGATE14
www.gateforum.com
Common Data Questions: 48 & 49

Consider the Hasse diagram given below for some poset:
a
i d
48.
Find the lower bound and upper bound for the set A1 = {e, f, g} , respectively (A) {h} , {b, c, d} (C) {h, e, f, g} , {a,b, d,i} (B) {h} , {a,b, d,i} (D) {h} , {a,b, c, d}
Consider the Hasse diagram given below for some poset:

a
i d
49.
What is the number of maximal elements of the given poset and identify the infimum element for the set {c, d} , respectively? (A) 2, {f} (B) 1, {a} (C) 2, {h} (D) 2, does not exist
DLP

11
CSTest ID: 2223
TarGATE14
0
www.gateforum.com
Consider the following incomplete DFA.

1 0 B
1 C 0 D
50.
What will be the transitions for state D such that automata will accept the set of all binary strings ending with 010? (A) (D,0)=B (C) (D,0)=A
(D,1)=C (D,1)=A
(B) (D,0)=A (D) (D,0)=D
(D,1)=C (D,1)=D
Consider the following incomplete DFA.

1 0 B 0 1 C 0 D
51.
What will be the transitions of state D such that automata will accept the set of all binary strings containing 010 as substring? (A) (D,0)=A (C) (D,0)=B
(D,1)=A (D,1)=A
(B) (D,0)=D (D) (D,0)=C
(D,1)=D (D,1)=B
Linked Answer Questions: Q.52 to Q.55 Carry Two Marks Each Statement for Linked Answer Questions: 52 & 53
A project team Vision works on a project named Online Grievances Redressal System for one year. The size of team is 10 and team works on the project for about 200 working days. ( Assume size of program is 1000 KLOC ) 52. What is the productivity of the given project? (A) 500 LOC Pr ogrammer day (C) 50 LOC Pr ogrammer day
(B) 100 LOC Pr ogrammer day (D) 1000 LOC Pr ogrammer day
DLP TarGATE-All India Test Series
12
CSTest ID: 2223
TarGATE14
www.gateforum.com
A project team Vision works on a project named Online Grievances Redressal System for one year. The size of team is 10 and team works on the project for about 200 working days. ( Assume size of program is 1000 KLOC ) . 53. If team size is 25 , then what is the difference of productivity of the given project achieved now when compare to the one achieved in previous question? (A) 200 LOC Pr ogrammer day (C) 400 LOC Pr ogrammer day (B) 300 LOC Pr ogrammer day (D) 500 LOC Pr ogrammer day
Statement for Linked Answer Questions: 54 & 55

Consider the following syntax tree.
Pr e increment
unany minus
54.
To which of the following expression this syntax tree belongs to? (A) ( + + a b c ) ( a ( b ) c cd e )
(C) ( a + + b c ) ( a b c ( d e ) )
) ( (a ( b ) ) ( c ( d e ) ) ) (D) ( + + a (b c ) ) ( a ( b ) c ( d e ) )
(B) + + a (b c )
55.
The Post fix notation for the above derived expression is? (A) a + +bc ab cde (C) a + +bc ab cd e (B) a + +bc ab cde (D) a + +bc c ab cde
DLP

13
CSTest ID: 2223
TarGATE14
www.gateforum.com
Q. No. 56 60 Carry One Mark Each Choose the appropriate antonyms for the given words given below:
56. Tedious (A) unlimited (C) appetizing (B) confined (D) enthralling
Choose grammatically wrong sentences:

57. (A) The scenery of Kashmir is awesome (B) I need three hairs of a black horse (C) The furnitures in the shop are expensive (D) I have no information more than this
Spot the error part of the sentences given below:

58. (A) the horse is (C) so small to (B) quite good but (D) accommodate
Find the proper meaning of the word given in bold letters:

59. APP won the election fair and square. (A) Honestly 60. (B) Falsely (C) Corruptedly (D) Unexpectedly
Tickets numbered 1 to 20 are mixed up & then a ticket is drawn at random. What is the probability that ticket drawn as a number of which is multiple of 3 or 5? (A) 3
20
(B) 9
20
(C) 5
21
(D) 7
20
Q. No. 61 65 Carry Two Marks Each Fill in the blanks with appropriate words:
61. None but the rich can afford air travel. Some of those who travel by air become sick. Some of those who become sick require treatment. Choose the best conclusion: (A) All the rich travel by air (B) All the persons who travel by air become sick (C) All sick persons travel by air (D) Only rich can travel by air 62. What is the unit digit in
{(3474)
(A) 2
1793
(225)
317
( 451)
491
}
(C) 3
DLP
(B) 5
(D) 0
14
CSTest ID: 2223

63. Consider the below data:
TarGATE14
www.gateforum.com
35
Trends of FDI in India

3 1 .3 6
30
25
2 4 .2 3
20
15 1 0 .1 5
10 5 .7
1 2 .1 6 1 0 .2 2
92
93
94
95
96
97
years
What is the percentage increment in FDI in 1997 over 1995? (A) 106 64. (B) 150 (C) 207 (D) 100
Rs. 540 is divided among A, B and C so that if Rs. 15, Rs.60, and Rs.30 be subtracted from their respective share the remainders may be in the ratio 3:8:4. What was the initial share of C? (A) 102 (B) 292 (C) 146 (D) 210
65.
A boat is moving downstream and reaches its destination in 25 hr. while moving at a speed of 50 km/hr (given speed in still water) one particular day due to engine problem at mid-point, ships speed is reduced by 20% of the original. It reaches the destination 2.5 hr late. Find out the speed of the river. (Assume its speed to be uniform). (A) 10 (B) 20 (C) 15 (D) 5
DLP

15

Feb 2

Uploaded by

Copyright:

Available Formats

Feb 2

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Feb 2

Uploaded by

Copyright:

Available Formats

CSTest ID: 2223

independence number ( ) are ____________. (A) 1 = 9, 1 = 4 2.

The solution to the recurrence relation T(n) = T(n-1) + n, T(0) = 2 is:

(A) T(n) = n! + n (C) T(n) =

It is classical producer consumer problem with bounded buffer.

(D) II and III

ICPIntensive Classroom Program

eGATE-Live Internet Based Classes

CSTest ID: 2223

FROM EMP WHERE eno NOT IN ( SELECT manager FROM EMP);

The length of longest common subsequence of

X = 1, 0, 0,1, 0,1, 0,1 and Y = 0,1, 0,1,1, 0,1,1, 0 is ___________

ICPIntensive Classroom Program

eGATE-Live Internet Based Classes

TarGATE-All India Test Series

CSTest ID: 2223

logn = O (log log n)

(A) (i) & (ii) only 14.

(B) I-B, II-A, III-E, IV-C (D)I-B, II-A, III-F, IV-D

eGATE-Live Internet Based Classes

TarGATE-All India Test Series

CSTest ID: 2223

(A) S0 = 1 S1 = X S2 = 1 S3 = X ' (C) S0 = X S1 = X ' S2 = X ' S3 = X 20.

(B) S0 = X S1 = X S2 = X ' S3 = X ' (D) Both (B) and (C)

D=B*C E=A+B B=B+C A=E-D

ICPIntensive Classroom Program

eGATE-Live Internet Based Classes

TarGATE-All India Test Series

CSTest ID: 2223

Q. No. 26 51 Carry Two Marks Each

ICPIntensive Classroom Program

eGATE-Live Internet Based Classes

TarGATE-All India Test Series

CSTest ID: 2223

Implementation of synchronization problem of the two processes P0 & P1 is as

critical sec tion signal Sy

critical sec tion signal Sy

ICPIntensive Classroom Program

eGATE-Live Internet Based Classes

TarGATE-All India Test Series

CSTest ID: 2223

eGATE-Live Internet Based Classes

CSTest ID: 2223

A-3, B-1, C-2 A-2, B-3, C-1

be two groups. A mapping f : G H

(B) S aSbA, A aSbSA (D) None of these

eGATE-Live Internet Based Classes

CSTest ID: 2223

Find out the regular expression corresponding to the given DFA.

(B) (11) * ( 0 * 1 + 1 * 0 ) ( 0 + 1) * (D) (11) * ( 00 * 1 + 10 ) ( 0 + 1) * with the probability of their

Consider a set of messages

(D) Both (B) and (C)

ICPIntensive Classroom Program

eGATE-Live Internet Based Classes

TarGATE-All India Test Series

CSTest ID: 2223

(A)A3 + 3A2 + A 9I = 0 (C)A3 - 3A2 + A + 9I = 0 46.

The Conjunctive Normal form of the formula X is