Gate Cs

CSTest ID: 162263
TarGATE16
www.gateforum.com
Q. No. 1 5 Carry One Mark Each

1.
Choose the word that does NOT belong to the group

A. Ecstasy
2.
B. Cove
C. Grim
D. Rapture
Choose the word which is most nearly the SAME in meaning as the word given in bold
DEBUNK
(A) Misrepresent
(B) Demystify
(C) Dubious
(D) Sporadic
3.
Sohail scored 33 marks in English, 37 marks in science, 28 marks in mathematics, 26 marks

in Hindi, 32 marks in social studies. The maximum marks a student can score in each subject
is 60. How much percent did Sohail get in this exam?
4.
A truck covers 448 km in 8 hours. The average speed of bicycle is
1
th of average speed of
4
truck. How much distance will the bicycle cover in 7 hours?

(A) 92km
5.
(B) 98 km
(C) 95 km
(D) 96 km
Given below are three statements followed by three conclusions. Assuming these statements
to be true, decide which one logically follows:
Statements:
I. All trash barrels are filthy.
II. No container is filthy.
III. All baskets are containers.
Conclusions:
I. Some baskets are filthy.
II. No basket is a trash barrel.
III. Some baskets are containers
(A) Only III
(B) II and I
(C) II and III
(D) Only II
Q. No. 6 10 Carry Two Mark Each
6.
Given below are four sentences. Find out the odd sentence.
(A) There never has been in the history of the world a time when the spoken word has been
All rights reserved by Gateforum Educational Services Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the
1
written permission. Discuss this question paper at www.gatementor.com.
CSTest ID: 162263
TarGATE16
www.gateforum.com
equaled in value and importance by any other means of communication.

(B) If one traces the development of mankind from what he considers its earliest stage he will
find that the wandering family of savages depended entirely upon what its members said
to one another.
(C) A little later when a group of families made a clan or tribe the individuals still heard the
commands of the leader, or in tribal council voiced their own opinions.
(D) Drama, in all primitive societies is a valuable spreader of knowledge, entertainment, and
religion.
7.
It was intrinsic to their grand passion that there should be _______; both were adept at
slamming doors and _____ off into the night.
(A) marches, muttering
(B) Offers, overrunning
(C) rows, storming
(D) records, snapping
8.
How many positive integers less than 10,000 are such that the product of their digits is 210?
9.
Each day after an item is lost the probability of finding that item is halved. If 3 days after a
certain item is lost the probability 1/64, what was the initial probability of finding the item?
(A) 1/32
(B) 1/8
(C) 1/4
(D) 1/2
10.
Solution Y is 30 percent liquid X and 70 percent water. If 2 kilograms of water evaporate

from 8 kilograms of solution Y and 2 kilograms of solution Y are added to the remaining 6
kilograms of liquid, what percent of this new solution is liquid X?
(A) 30%
(B) 30.3%
(C) 37.5%
(D) 40%
(E) 50%
Q. No. 1 25 Carry One Mark Each

1.
Consider a list containing n distinct elements. Let us say we want to find the second largest
element from the list. Find the number of comparisons required in worst case for a brute force
method.
(A) n
(B) n-2
(C) 2n-1
(D) 2n-3
2.
Express the following recurrence relation in asymptotic notation:

n
T ( n ) = 16T + n
4
(A) ( n 2 )
(B) ( n )
(C) ( n log n )
(D) None of these
2
CSTest ID: 162263
TarGATE16
www.gateforum.com
3.
Let A, B, C are three matrices of sizes 4X6, 6X3, 3X4 respectively. The minimum
number of multiplications required to perform AXBXC is ______
4.
Find the odd one out with respect to the worst case time complexity.
(A) Quick sort
(B) Selection sort
(C) Insertion sort
(D) Merge sort
5.
What is the running time of the following program?

function ( int n )
{
for ( i = 1; i<=n; i++ )
for ( j = 1; j<=n; j=j* 2 )
pr int f ( "GATE") ;
}
(A) O(n2)
(B) O(n)
(C) O(n logn)
6.
Which of the following is undecidable?

(A) To prove certain languages are non regular
(B) To prove certain languages are non-CFL
(C) To prove that the given CFG is ambiguous
(D) To prove that the given CFG is finite or infinite
7.
Consider the CFG: S abS baS
(D) None of these
The language recognized by the given grammar is

(A) ( ab ) * + ( ba ) *
8.
(B) ( ab + ba ) *
(C) ( aa + ba ) *
(D) ( a + b ) *
Which one of the following is true?

(A) The complement of recursive enumerable is recursive enumerable
(B) The complement of recursive language is not a recursive language
(C) Union of two recursive languages is recursive
(D) None of these
9.
A graph G and its complement G have 8 and 7 edges respectively. Then the number of
vertices in G is
(A) 6
(B) 5
(C) 8
(D) none of these
3
CSTest ID: 162263
10.
TarGATE16
www.gateforum.com
Consider the following C program:

main (
{
in / *this program has error */ x;
float / *no error* / y;
pr int f ( "its very simple") ;
}
Identify the error produced by the above code.
(A) Lexical
11.
(B) Syntax
(D) None of these
What will be the output frequency of a mod-8 counter which is clocked at 16 MHz clock
input signal?
(A) 2 MHz
12.
(C) Both (A) & (B)
(B) 4 MHz
(C) 8 MHz
(D) 128 MHz
If the initial state of this asynchronous counter is 100, what will be the state after 2 clock
pulses?
1
T0
Q0
T1
Q1
Clock
MSB
Q0
(A) 001
Q2
T2
(B) 111
Q1
(C) 010
Q2
(D) 110
13.
Which one of the following addressing modes is/are used for program loops?
(A) Register Indirect
(B) Auto Increment
(C) Auto decrement
(D) Both (B) and (C)
14.
A processor is clocked at a rate of 5 GHz, then how long is the clock cycle?
(D) 1/5 ms
(A) 1/5 ns
(B) 5 ns
(C) 5 s
4
TarGATE16
CSTest ID: 162263
15.
www.gateforum.com
Consider the following set of interacting processes, which can access two semaphore
variables A and B.
A and B are initialized to 4 and 0 respectively.
P1
P2
L1 : wait ( A )
P3
L3 : wait ( B )
L 2 : wait ( B )
pr int ("x ")
pr int ("y")
pr int ("z")
signal ( B )
signal ( B )
goto L3
goto L1
goto L 2
Which of the following is/are not a possible output sequence when these set of processes run?
I. x x x x
II. x x x x x
III. x y y z x
IV. x y y z z x
(A) I and III
16.
(B) II and IV
(C) II, III and IV
(D) I, II, III and IV
A channel connecting source and destination has data rate of 1 Mbps and one way
propagation delay of 250 ms. Network uses Go Back-N flow control strategy.
Headers are very short and acknowledgements are always piggybacked onto data frames.
Assume transmission time of ACK is negligible.
If frame size is of 125B and if three bit sequence number is used, then determine the
maximum achievable channel utilization(in %).
17.
Consider the class C address as 212.88.22.0 which is divided into 16 subnets using 4 subnet
bits.
Determine the first host address of the first subnet.
(B) 212.88.22.16
(C) 212.88.22.17
(D) 212.88.22.1
(A) 212.88.22.0
18.
The efficiency of Ethernet

(A) increases when Propagation delay and transmission delay are low
(B) increases when Propagation delay is low and transmission delay is high
(C) increases when Propagation delay is high and transmission delay is low
(D) increases when Propagation delay and transmission delay are high
19.
If the transmission delay is 200ms & throughput is 50% then what is RTT for the Ethernet.
(A) 40ms
20.
(B) 80ms
(C) 20ms
(D) None
Consider a relation R(ABCDEF) with the FD set F={AB,BC,CD, DE}. The number
of super keys of R is
(A) 8
(B) 6
(C) 16
(D) None of these
5
CSTest ID: 162263
21.
TarGATE16
www.gateforum.com
Map the following statements to True (T) or False (F) respectively.

S1: Count includes null values when it is applied on an attribute of a table.
S2: Average includes null values in its calculation.
S3: Projection operation of relation algebra is equivalent to select clause of SQL.
(A) FFF
22.
23.
(C) TFT
(D) TTF
If every element of a group ( G,.) is its own inverse, then ( G,.) is

(A) a group only
(B) an abelian group
(C) cannot say
(D) semi group
In a semester examination there are 5 different subjects. A particular student is required to

pass all the 5 subjects. Then the number of ways he can fail is
(A) 5!
24.
(B) TFF
(B) 5
(C) 1
(D) 31
The probability function, p(x) for a random variable x is given by p(x) = esin x
The probability that x lies between x1 = 0 & x 2 = / 2 is [use single step trapezoidal rule]
(A) 2.62
25.
(B) 2.72
(C) 2.82
(D) 2.92
(C) 15
(D) 12
The number of perfect matchings of K 6 is

(A) 9
(B) 6
Q. No. 26 51 Carry Two Marks Each

26.
Consider the following set of process with their corresponding arrival and cpu burst time:
Process
Arrival time
Burst time(ms)
P1
P2
P3
What is the waiting time(in ms) for process P3 if round-robin scheduling with time quantum
5 ms is used?
27.
Let P and Q be two stations attempting to transmit on an Ethernet. Each has a steady queue of
frames to send. After each frame is sent (from both sides), they collide for the first time and
contend for the channel, using the binary exponential back off algorithm.
What is the probability that the contention ends after 3 successful transmissions?
15
7
1
15
(A)
(B)
(C)
(D)
1024
8
4
26
6
CSTest ID: 162263
TarGATE16
www.gateforum.com
28.
Construct a Binary Search Tree by inserting the numbers between 1 and 100. Which of the
following could not be sequence of nodes examined when you are searching for an element
48?
(A) 36, 75, 39, 70, 69, 44, 47
(B) 9, 84, 69, 61, 53, 45, 47
(C) 26, 65, 29, 60, 59, 34, 47
(D) 15, 99, 65, 75, 70, 55, 47
29.
Given an array F = {10, 5, 100, 60, 25, 11}. Assume the array content F[i] indicates the
length of the ith file and we want to merge all these files into one single file. Find the total
number of record moves in the optimal solution.
30.
Find the output of the following C program:

int main( )
{
char str[ 10 ]={0, 1, 2, 3, 4, 5, 6, 7, 8 ,9};
char *ptr;
int i;
ptr = str;
for(i=0;i<=9;i++)
{
if(*ptr)
{
printf("%c",*ptr);
ptr++;
}
}
return 0;
}
(A) 0 1 2 3 4 5 6 7 8 9
(C) Compiler error
31.
(B) 0 0 0 0 0 0 0 0 0 0
(D) None of these
Consider a two dimensional array A of integers declared as int A[-5..5][1..10]. First

element is stored at the location 1500. Assume that each integer takes 4 memory locations.
What is the address of element A[4][5] if the array is stored in column major order?
(A) 1774
(B) 1668
(C) 1712
(D) 1096
7
CSTest ID: 162263
32.
TarGATE16
www.gateforum.com
What will be the output of the following C code?

main ( )
{
static int a [
] = {0,1,2,3,4} ;
static int * p [ ] = {a,a + 1,a + 2,a + 3,a + 4} ;
int **ptr = p;
*ptr + +;
pr intf ("\ n % d % d % d", ptr p,*ptr a,** ptr ) ;

* ptr + +;
* + + ptr;
+ + * ptr;
pr intf ("\ n % d % d % d", ptr p,* ptr a,** ptr ) ;
}
33.
(A) 111
(B) 111
(C) 111
(D) 111
222
233
222
233
333
344
333
444
344
455
344
455
How many states are required in DFA with minimum states to accept the
language:
L = a b c i, j, k 1 ?
i
j k
(A) 4
34.
(B) 5
(C) 3
(D) 6
Consider the following languages:
{
}
= {a b c d i, j 1}
= {a b c n 1}
= {a b c n, m 1}
L1 = a i b jci d j i 1, j 1
L2
L3
L4
j j
n 2n
m 2m
Which of the statements given below are correct?

(A) L1 and L3 are not CFL but L 2 and L 4 are CFLs
(B) Only L1 and L 2 are CFL
(C) Only L3 and L 4 are CFL
(D) None of these are CFL
8
TarGATE16
CSTest ID: 162263
35.
36.
The language accepted by the following Turing Machine is
q0
( q1 ,0, R )
Halt
Halt
q1
( q1 ,0, R )
( q 2 ,1, R )
Halt
q2
Halt
( q 2 ,1, R )
( q f ,B, R )
q f ( final )
Halt
Halt
Halt
(A) Strings ending in 01 (B)
Accepts 00* 11*
(C) Strings with alternate 0s and 1s
(D) Strings ending with 10
Consider the expression a * b * a ^ b ^ c (where ^ and * are exponential and multiplication

operators respectively). The equivalent triple form of the given equation is
( A ) (1) ( ^, a, b ) ( B) (1) ( ^, b,c ) ( C )

( 2 ) ( ^, (1) ,c ) ( 2 ) ( ^, a, (1) )
( 3) (*, b, ( 2 ) ) ( 3) (*, b, ( 2 ) )
( 4 ) (*, a, ( 3) ) ( 4 ) (*, a, ( 3) )
37.
www.gateforum.com
(1) ( ^, b,c )
( 2 ) ( ^, a, (1) )
( 3) (*, a, b )
( 4 ) (*, ( 3) , ( 2 ) )
( D ) (1) ( ^, a, b )
( 2 ) ( ^, (1) ,c )
( 3) (*, a,b )
( 4 ) (*, ( 3) , ( 2 ) )
Consider the following program:

int gate ( int rank )
{
int i;
for ( i = 1;i < 10;i + + )
pr int f ( "Gate rank = %d", rank ) ;
return1;
}
Which of the following code optimization can be applied on the above C-code?
38.
(A) Code motion on loop invariant
(B) Strength reduction
(C) Loop unrolling
(D) None of these
R is a relation defined over the set of integers Z as follows

aRb iff a is a factor of b. Then R is
(A) Reflexive, Symmetric but not Transitive
(B) Symmetric, Transitive but not Reflexive
(C) Reflexive, Transitive but not Symmetric
(D) Reflexive, Symmetric and Transitive
9
TarGATE16
CSTest ID: 162263
39.
www.gateforum.com
Consider the following network represented as graph in which each node is a station and each
edge is link between the stations. Find the maximum number of links that can be deleted still
allowing the station to communicate with each other.
a
f
d
(A) 4
40.
(B) 3
(C) 5
(D) None of these
The mass function f(x) is defined as below,
1
4
f (x) =
1
for x = 1
for x = 0
for x = 2
other wise
The value of E ( x ) is ______
(A) 1
41.
(B) 1
5
4
(D)
4
5
The real value of for which the following system of linear equations has non-zero solution
is ______
2
3
1
3
1
2
2
3
1
42.
(C)
x
y =

z
0
0

0
Consider a relation R ( A B C D E ) with the FD set

F = {A BC, CD E, B D, E A} decomposed into D = {ABC, CDE} . Which of the
following is true regarding the decomposition D?
(A) It is lossless but not dependency preserving
10
CSTest ID: 162263
TarGATE16
www.gateforum.com
(B) It is lossy but dependency preserving

(C) It is neither lossless nor dependency preserving
(D) It is both lossless and dependency preserving
43.
Consider the following time ordered sequence of actions performed by the

transactions T1 , T2 , T3 and T4 . [Suffix indicates transaction number and timestamp value,
BTS: Basic Time stamp, TWR:Thomas Write Rule, MVTS: Multiversion Time Stamp]
W1 ( A ) , W2 ( A ) , W3 ( A ) , r2 ( A ) , r4 ( A ) .
Which of the following is true?
(A) T1 is rolled back in both BTS and TWR
(B) T2 is rolled back in TWR, whereas T1 is rolled back in BTS
(C) T2 is rolled back in both TWR and BTS
(D) It is not allowed under BTS, TWR and MVTS as T2 is rolled back in all
44.
A set associative cache consists of 64 lines, or slots, divided into four lines sets. Main
memory consists of 4K blocks of 128 words each. What are the number of bits of TAG, set
offset and word offset respectively?
(A) 8, 4, 7
(B) 7, 5, 7
(C) 7, 5, 8
(D) 8, 5, 6
45.
Consider the following program segment:

I1 : MOV R 3 ,R 7
; R 3 (R 7 )
I2 : Load R 8 , (R 3 )
; R 8 Mem (R 3 )
I3 : Add R 3 ,R 3 , 4
; R 3 (R 3 ) + 4
I4 : Load R 9 , (R 3 )
; R 9 Mem (R 3 )
I5 : BLE R 8 ,R 9 ,L 3
; Branch if (R 9 ) > (R 8 )
What types of dependencies were included in the above program?

(A) Write after write and read after write
(B) Write after write and write after read
(C) Read after write and write after read
(D) Write after write, read after write, and write after read
46.
Consider a memory system with 32-bit address. Cache size is 512KB and cache uses line size
of 64 Bytes. Cache is 4-way set associative.
Determine the number of TAG bits in the main memory address bits.
(A) 15
(B) 16
(C) 14
(D) 17
11
CSTest ID: 162263
47.
TarGATE16
www.gateforum.com
Consider the following circuit. What is the functionalities of block P and Q as functions of B
and C respectively?
B C
0
2 1
MUX
F ( A, B, C ) = (1, 2, 4, 7 )
A selection line
48.
(A) AND, OR
(B) OR, AND
(C) EX-NOR, EX-OR
(D) EX-OR, EX-NOR
A 3-variable function is realized using the following decoder. Identify the correct answer.
0
A
S2
S1
S0
f ( A, B, C )
3 8
decoder
4
49.
(A) F is free from A, B
(B) F is free from A, C
(C) F is free from B, C
(D) F is free from A, B, C
Consider the following circuit. What is the frequency at Q?

A
B
1MHz
12
TarGATE16
CSTest ID: 162263
(A) 1 MHz
50.
(B) 2 MHz
(C) 0.5 MHz
www.gateforum.com
(D) None of these
Assume that the following jobs are to be executed on a single processor system
Process ID
Burst Time
(in sec)
The jobs are assumed to have arrived at the time 0 in the same order. Calculate the departure
time for job P(in secs), if Round Robin scheduling is used with time quantum of 1 sec.
51.
Given a memory system with virtual address space of 16 pages each of 1024 bytes size,
mapped on to a physical memory of 64 frames. How many bits are there in physical address?
______________ .
52.
Lets assume that after scanning a file, we have found the following character frequency:
Character
Frequency
a
10
b
6
c
3
d
15
e
43
f
83
Since we have 6 characters, lets assume each character is stored with a three bit code.
Suppose that Huffman coding technique is employed to compress the file for transmission.
Calculate the number of bits saved after employing Huffman coding.
(A) 190
(B) 207
(C) 181
(D) 243
53.
Consider the given in-order and pre-order traversal of a binary tree

Preorder: A B D E H J C F I G
In order: D B H J E A I F C G
13
CSTest ID: 162263
TarGATE16
www.gateforum.com
The number of leaf nodes in the above binary tree is _______ .
54.
a11 h
Consider the matrix A = h a 22
g
f
g
f where a11 = a 22 = a 33 = 0
a 33
Then sum of the cofactors of the leading diagonal elements

is ______
55.
(A) 0
(B) f + g + h
(C) f 2 + g 2 + h 2
(D) ( f 2 + g 2 + h 2 )
If Runge-Kutta method of order 4 is used to solve the D.E
dy
= f (x), y(0) = 0 in the interval
dx
[0, h] with step size h, then the value of the expression.

k1 + k 2 + k 3 + k 4 is ____ .
(A) h f (0) + f ( h / 2 ) + f (h)
(C)
h f (0) + 3f ( h / 2 ) + f (h)
(B)
h [ f (0) + 2f(h/ 2) + f(h) ]
(D)
h [ f (0) + 4f(h/ 2) + f(h) ]
14

Gate Cs

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Gate Cs

Hochgeladen von

Copyright:

Verfügbare Formate

CSTest ID: 162263

Q. No. 1 5 Carry One Mark Each

Choose the word that does NOT belong to the group

Sohail scored 33 marks in English, 37 marks in science, 28 marks in mathematics, 26 marks

A truck covers 448 km in 8 hours. The average speed of bicycle is

truck. How much distance will the bicycle cover in 7 hours?

(C) II and III

Q. No. 6 10 Carry Two Mark Each

CSTest ID: 162263

equaled in value and importance by any other means of communication.

(B) Offers, overrunning

(C) rows, storming

(D) records, snapping

Solution Y is 30 percent liquid X and 70 percent water. If 2 kilograms of water evaporate

Q. No. 1 25 Carry One Mark Each

Express the following recurrence relation in asymptotic notation:

(D) None of these

CSTest ID: 162263

What is the running time of the following program?

(C) O(n logn)

Which of the following is undecidable?

Consider the CFG: S abS baS

(D) None of these

The language recognized by the given grammar is

Which one of the following is true?

(D) none of these

CSTest ID: 162263

Consider the following C program:

(D) None of these

(C) Both (A) & (B)

(D) 128 MHz

CSTest ID: 162263

pr int ("x ")

(C) II, III and IV

(D) I, II, III and IV

The efficiency of Ethernet

(D) None of these

CSTest ID: 162263

Map the following statements to True (T) or False (F) respectively.

If every element of a group ( G,.) is its own inverse, then ( G,.) is

(B) an abelian group

(C) cannot say

(D) semi group

In a semester examination there are 5 different subjects. A particular student is required to

The number of perfect matchings of K 6 is

Q. No. 26 51 Carry Two Marks Each

CSTest ID: 162263

Find the output of the following C program:

Consider a two dimensional array A of integers declared as int A[-5..5][1..10]. First

CSTest ID: 162263

What will be the output of the following C code?

pr intf ("\ n % d % d % d", ptr p,*ptr a,** ptr ) ;

Consider the following languages:

Which of the statements given below are correct?

CSTest ID: 162263

The language accepted by the following Turing Machine is

(A) Strings ending in 01 (B)

Accepts 00* 11*

(C) Strings with alternate 0s and 1s

(D) Strings ending with 10

Consider the expression a * b * a ^ b ^ c (where ^ and * are exponential and multiplication

( A ) (1) ( ^, a, b ) ( B) (1) ( ^, b,c ) ( C )

Consider the following program: