www.LearnEngineering.

in

No part of this publication may be reproduced or distributed in any form or any means, electronic, mechanical,
photocopying, or otherwise without the prior permission of the author.

n
n g.i
GATE SOLVED PAPER
Computer Science Engineering
2010
e eri
gin
Copyright © By NODIA & COMPANY
En
arn

Information contained in this book has been obtained by authors, from sources believes to be reliable. However,
neither Nodia nor its authors guarantee the accuracy or completeness of any information herein, and Nodia nor its
authors shall be responsible for any error, omissions, or damages arising out of use of this information. This book
is published with the understanding that Nodia and its authors are supplying information but are not attempting
.Le

to render engineering or other professional services.

w
ww

NODIA AND COMPANY

B-8, Dhanshree Tower Ist, Central Spine, Vidyadhar Nagar, Jaipur 302039
Ph : +91 - 141 - 2101150
www.nodia.co.in
email : [email protected]

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS

2010

Q. 1 Two alternative package Aand B are available for processing a database having
10k records. Package A requires 0.0001 n2 time units and package B requires 10
n log 10 n time units to process n records. What is the smallest value of k for which

n
package B will be preferred over A ?
(A) 12 (B) 10

g.i
(C) 6 (D) 5

Q. 2 The weight of a sequence a 0, a1 . , an 1- of real numbers is defined as

n
a 0 a1 /2 +. a/n 1- 2n 1-+
. A subsequence of a sequence is obtained by deleting

eri
some elements form the sequence, keeping the order of the remaining elements the
same. Let X denote the maximum possible weight of a subsequence of a 0, a1, . an 1-
and Y the maximum possible weight of a subsequence of a1, a2, . , an 1-. Then X
is equal to
e
(A) max (Y, a 0 Y+) (B) max (Y, a 0 Y +/2)
gin
(C) max (Y, a 0 2+Y) (D) a 0 Y+/2

Common Data For Q. 3 and 4

En

Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in
the matrix W below is the weight of the edge {i, j} .
J0 1 8 1 4N
arn

K O
K1 0 12 4 9O
W K=8 12 0 7 3O
K O
K1 4 7 0 2O
K4 9 3 2 0O
.Le

L P
Q. 3 What is the minimum possible weight of a spanning tree T in this graph such that
vertex 0 is a leaf node in the tree T ?
(A) 7 (B) 8
w

(C) 9 (D) 10
ww

Q. 4 What is the minimum possible weight of a path P from vertex 1 to vertex 2 in

this graph such that P contains at most 3 edges ?
(A) 7 (B) 8
(C) 9 (D) 10

Q. 5 What data structure in a complier is used for managing information about

variables and their attributes?
(A) Abstract syntax tree
(B) Symbol table
(C) Semantic stack
(D) Parse table

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

Q. 6 Which languages necessarily need heap allocation in the runtime environment ?

(A) Those that support recursion
(B) Those that use dynamic scoping
(C) Those that allow dynamic data structure
(D) Those that use global variables

Q. 7 The grammar S "aSA|bS|c is

(A) LL (1) but not LR (1) (B) LR (1) but not LL(1)
(C) Both LL (1) and LR (1) (D) Neither LL (1) nor LR (1)

n
Q. 8 One of the header fields in an IP datagram is the Time-to-Live (TTL) field.
Which of the following statements best explains the need for this field ?

g.i
(A) It can be used to prioritize packets
(B) It can be used to reduce delays

n
(C) It can be used to optimize throughput
(D) It can be used to prevent packet looping

Q. 9
(A) Internet chat
(C) E-mail
e eri
Which one of the following is not a client-server application ?
(B) Web browsing
(D) Ping
gin
Q. 10 Suppose computers A and B have IP addresses 10.105.1.113 and 10.105.1.91
respectively and they both use the same netmask N. Which of the values of N
given below should not be used if A and B should belong to the same network ?
(A) 225.255.255.0
En

(B) 255.255.255.128
(C) 255.255.255.192
arn

(D) 255.255.255.224

Statement Data For Q. 11 and 12

.Le

Consider a network with 6 routers R1 and R6 connected with links having weights
as shown in the following diagram.
w
ww

Q. 11 All the routers use the distance vector based routing algorithm to update their
routing tables. Each starts with its routing table initialized to contain an entry
for each neighbour with the weight of the respective connecting link. After all
the routing tables stabilize, how many links in the network will never be used for
carrying any data ?
(A) 4 (B) 3
(C) 2 (D) 1

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

Q. 12 Suppose the weights of all unused links in the previous question are changed to 2
and the distance vector algorithm is used again until all routing tables stabilize.
How many links will now remain unused ?
(A) 0 (B) 1
(C) 2 (D) 3

Q. 13 A main memory unit with a capacity of 4 megabytes is build using

1M # 1 bit- DRAM chips. Each DRAM chip has 1K rows of cells with 1 K cells
in each row. The time taken for a single refresh operation is 100 nanoseconds.
The time required to perform one refresh operation on all the cells in the memory

n
unit is
(A) 100 nanoseconds

g.i
(B) 100)210 nanoseconds
(C) 100)220 nanoseconds

n
(D) 3200)220 nanoseconds

eri
Q. 14 A-5 stage pipelined processor has Instruction Fetch. (IF), Instruction Decode
(ID), Operand Fetch (OF), Perform Operation (PO) and Write Operand (WO)
stages. The IF, ID, OF and WO stages take 1 clock cycle each for any instruction.
e
The PO stage takes 1 clock cycle for ADD and SUB instruction. The PO stage
takes 1 stake clock cycle for ADD and SUB instructions 3 clock cycles for
gin
MUL instruction, and 6 clock cycles for DIV instruction respectively. Operand
forwarding is used in the pipeline. What is the number of clock cycles needed to
execute the following sequence of instructions ?
Instruction Meaning of instruction
En

I 0 : MUL R2, R 0, R1 R2 ! R 0)R1

I1 : DIV R5, R 3, R 4 R 5 ! R 3 /R 4
I2 : ADD R2, R5, R2 R2 ! R5 R +2
arn

I 3 : SUB R5, R2, R6 R5 ! R2 R -6

(A) 13 (B) 15
(C) 17 (D) 19
.Le

Q. 15 The program below uses six temporary variables a, b, c, d, e, f

a = 1
b = 10
c = 20
w

d a =b +
e c =d +
ww

f c =e +
b c =e +
e b =f +
d 5 =e +
Assuming that all operations take their operands from register, what is the
minimum number of registers needed to execute this program without spilling ?
(A) 2 (B) 3
(C) 4 (D) 6

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

Common Data For Q. 16 and 17

A computer system has an L1 and L2 cache, an L2 cache, and a main memory
unit connected as shown below. The block size in L1 cache is 4 words. The block
size is L2 cache is 16 words. The memory access times are 2 nanoseconds, 20
nanoseconds and 200 nanoseconds for L1 cache, L2 cache and main memory unity
respectively.

n
Q. 16 When there is a miss in L1 cache and a hit in L2 cache, a block is transferred form

g.i
L2 cache to L1 cache. What is the time taken for this transfer ?
(A) 2 nanoseconds (B) 20 nanoseconds
(C) 22 nanoseconds (D) 88 nanoseconds

n
Q. 17 When there is a miss in both L1 cache and L2 cache, first a block is transferred

eri
from memory to L2 cache, and then a block is transferred from L2 cache to L1
cache. What is the total time taken for these transfers ?
(A) 222 nanoseconds (B) 888 nanoseconds
e
(C) 902 nanoseconds (D) 968 nanoseconds
gin
+
Q. 18 Consider a B -tree in which the maximum number of keys in a node is 5. What
is the minimum number of keys in any non-root node?
(A) 1 (B) 2
En

(C) 3 (D) 4

Q. 19 A relational schema for a train reservation database is given below.

Passenger (pid, pname, age)
arn

Reservation (pid, class, tid)

Table : passenger

pid pname Age

.Le

0 ‘Sachin’ 65
1 ‘Rahul’ 66
2 Sourav’ 67
w

3 ‘Anil’ 69
Table : Reservation
ww

pid class tid

0 ‘AC’ 8200
1 ‘AC’ 8201
2 ‘SC’ 8201
3 ‘AC’ 8203
4 ‘SC’ 8204
5 ‘AC’ 8202
What pids are returned by the following SQL query for the above instance of the
tables ?

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

SELECT pid
FROM Reservation
WHERE class= ‘AC’ AND
EXISTS (SELECT)
FROM Passenger
WHERE age>65 AND
Passenger.pid = Reservation.pid)

(A) 1,0 (B) 1, 2

(C) 1, 3 (D) 1, 5

n
Q. 20 Which of the following concurrency control protocols ensure both conflict

g.i
serializability and freedom from deadlock?
I. 2-phase locking
II Time-stamp ordering

n
(A) I only (B) II only

eri
(C) Both I and II (D) Neither I nor II

Q. 21 Consider the following schedule for transactions T1, T2, and T3 :

T1 T2 T3
e
Read (X)
gin
Read (Y)
Read (Y)
Write (X)
Write (X)
En

Read (X)
Write (X)
Which one of the schedules below is the correct serialization of the above ?
arn

(A) T1 " T3 " T2 (B) T2 " T1 " T3

(C) T2 " T3 " T1 (D) T3 " T1 " T2

Q. 22 The following functional dependencies hold for relations R(A,B,C) and S(B,D,E):
.Le

B"A
A"C
The relation R contains 200 tuples and the relation S contains 100 tuples. What
is the maximum number of tuples possible in the natural join R D S ?
w

(A) 100
(B) 200
ww

(C) 300
(D) 2000

Q. 23 The minterm expansion of f (P, Q, R) PQ =QR PR is+ +

(A) m2 m 4 +m6 m1 + + (B) m 0 m1 +m 3 m5 + +
(C) m 0 m1 +m6 m1 + + (D) m2 m 3 +m 4 m5 + +

Q. 24 P is a 16-bit signed integer. The 2’s complement representation of P is (F87B) 16 .

The 2’s complement representation of 8)P is
(A) (C3D8) 16 (B) (187B) 16
(C) (F878) 16 (D) (987B) 16

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

Q. 25 The Boolean expression for the output f of the multiplexer shown below is

(A) P 5 Q 5 R (B) P 5 Q 5 R

n
(C) P Q +R + (D) P Q +R +

g.i
Q. 26 What is the boolean expression for the output f of the combinational logic circuit
of NOR gates given below ?

n
e eri
gin
En

(A) Q +
R (B) P +
Q
(C) P +
R (D) P Q +R +
arn

Q. 27 In the sequential circuit shown below, if the initial value of the output Q1 Q 0 is 00,
what are the next four values of Q1 Q 0 ?
w .Le

(A) 11, 10, 01, 00 (B) 10, 11, 01, 00

ww

(C) 10, 00, 01, 11 (D) 11, 10, 00, 01

Q. 28 Let G =(V, E) be a graph. Define (G) x / id # d, where

= id is the
d
number of vertices of degree d in G. If S and T are two different trees with
(S) =x(T), then x
(A) S =2T (B) S T =1 -
(C) S =T (D) S T =1 +

Q. 29 Newton-Raphson method is used to compare a root of the equation x2 13 - 0 =

with 3.5 as the initial value. The approximation after one iteration is
(A) 3.575 (B) 3.677
(C) 3.667 (D) 3.607

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

Q. 30 What is the possible number of reflexive relations on a set of 5 elements ?

(A) 210 (B) 215
(C) 220 (D) 225

Q. 31 Consider the set S = {1, , w2}, where

w wand 2 ware cube roots of unity. If *
denotes the multiplication operation, the structure {S, *} forms
(A) a group (B) a ring
(C) an integral domain (D) a field

What is the value of lim b1 1 2n ?

nl
Q. 32 -
n"3

n
2-
(A) 0 (B) e
(C) (n 1-) /2 (D) 1

g.i
Q. 33 In a binary tree with n nodes, every node has an odd number of descendants.
Every node is considered to be its own descendant. What is the number of nodes

n
in the tree that have exactly one child ?
(A) 0 (B) 1

Q. 34
(C) (n 1-) /2
eri(D) n 1-

Consider a company that assembles computers. The probability of a faulty

e
assembly of any computer is p. The company therefor subjects each computer to
gin
a testing process. This testing process gives the correct result for any computer
with a probability of q . What is the probability of a computer being declared
faulty ?
(A) pq (1 +p) (1 q)- - (B) (1 q-) p
En

(C) (1 p-) q (D) pq

Q. 35 What is the probability that a divisor of 1099 is a multiple of 1096 ?

(A) 1/625 (B) 4/625
arn

(C) 12/625 (D) 16/625

Q. 36 The degrees sequence of a simple graph is the sequence of the degrees of the nodes
in the graph in decreasing order. Which of the following sequence can not be the
.Le

degree sequence of any graph ?

I 7, 6, 5, 4, 4, 3, 2, 1
II 6, 6, 6, 6, 3, 3, 2, 2
w

III 7, 6, 6, 4, 4, 3, 2, 2
IV 8, 7, 7, 6, 4, 2, 1, 1
ww

(A) I and II (B) III and IV

(C) IV only (D) II and IV

Q. 37 Consider the following matrix.

2 3
A >=
X YH
If the eigenvalues of A are 4 and 8, then
(A) x 4, y = 10 =
(B) x 5, y = 8 =
(C) x =3, y- 9 =
(D) x =4, y- 10 =

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

Q. 38 Suppose the predicate F (x, y, t) is used to represent the statement that person x
can fool person y at time t .Which one of the statements below expresses best the
meaning of the formula 6x7y7t (JF (x, y, t)) ?
(A) Everyone can fool some person at some time
(B) No one can fool everyone all the time
(C) Everyone cannot fool some person all the time
(D) No one can fool some person at some time.

Q. 39 Consider the methods used by processes P1 and P2 for accessing their critical
sections whenever needed, as given below. The initial values of shared boolean

n
variables S1 and S2 are randomly assigned.

g.i
Method used by P1 Method used by P2
While (S1==S2); While (S1!=S2);
Critical Section Critical Section

n
S1=S2; S2=not (S1)

eri
While one of the following statements describes properties achieved ?
(A) Mutual exclusion nut nor progress
(B) Progress but not mutual exclusion
e
(C) Neither mutual exclusion nor progress
gin
(D) Both mutual exclusion and progress

Q. 40 A system uses FIFO policy for page replacement. It has 4 page frames with no
pages loaded to begin with . The system first accesses 100 distinct pages in some
order and then accesses the same 100 pages but now in the reverse order .How
En

many page faults will occur ?

(A) 196 (B) 192
(C) 197 (D) 195
arn

Q. 41 Which of the following statements are true ?

I Shortest remaining time first scheduling may cause starvation
II Preemptive scheduling may cause starvation
.Le

II Round robin in better than FCFS in terms of response time

(A) I only (B) I and III only
(C) II and III only (D) I, II and III
w

Q. 42 The following program consists of 3 concurrent precesses and 3 binary semaphores.

The semaphores are initialized as S 0 1, S1 = 0, S2 0 = =
ww

Process P0 Process P1 Process P2

While (true){ wait (S1 ); wait (S2 )
wait (S 0 ); release (S 0 ); release (S 0 );
print ‘0’
release (S1 );
release (S2 );
}
How many times will precess P0 print ‘0’ ?
(A) At least twice (B) Exactly twice
(C) Exactly thrice (D) Exactly once

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

Q. 43 A system has n resources R 0 ..R n - 1, and k processes P0 ..Pk - 1.The implementation

of the resource request logic of each process Pi , is as follows:
if (i%2==0){
if(i<n)request Ri;
if(i+2<n)request Ti+2;
}
else {
if (i<n)request Rn-1;
if (i+2<n)request Rn-i-2;
}

n
In which one of the following situations is a deadlock possible ?

g.i
(A) n 40, k = 26 =
(B) n 21, k = 12 =
(C) n 20, k = 10 =

n
(D) n 41, k = 19 =

Q. 44

eri
The cyclomatic complexity of each of the modules A and B shown below is 10.
What is the cyclomatic complexity of the sequential integration shown on the
right hand side ?
e
gin
En
arn

(A) 19
(B) 21
(C) 20
.Le

(D) 10

Q. 45 What does the following program print ?

#include<stdio.h>
w

void f(int *p, int *q){

p = q;
ww

)
p = 2;
}
int i=0,j=1;
int main(){
f(&i,&j);
printf(“%d%d\n”,i,j);
return 0;
}
(A) 22 (B) 21
(C) 01 (D) 02

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

Q. 46 What is the appropriate paring of items in the two columns listing various
activities encountered in a software life cycle ?
P. Requirement Capture 1. Module Development and Integration
Q. Design 2. Domain Analysis
R. Implementation 3. Structural and Behavioral Modeling
S. Maintenance 4. Performance Tuning
(A) P-3 Q-2, R-4 S-1 (B) P-2 Q-3 R-1 S-4
(C) P-3 Q-2 R-1 S-4 (D) P-2 Q-3 R-4 S-1

n
Q. 47 What is the value printed by the following C program ?
#include<stdio.h>

g.i
int f(int *a, int n)
{
if (n<=0) return 0;

n
else if (*a%2==0) return *a+f(a+1,n-1);

eri
else return *a-f(a+1,n-1);
}
int main()
{
e
int a[]={12, 7, 13, 4, 11, 6};
gin
printf(“%d”,f(a,6));
return 0;
}
(A) 9- (B) 5
En

(C) 15 (D) 19

Q. 48 The following C function takes a singly-linked list as input argument. It modified

arn

the list by moving the last element to the front of the list and returns the modified
list. Some part of the code is left blank.
typedef struct node {
int value;
.Le

struct node *next

} Node;
Node *mode_to_front(Node *head){
Node*p,*q;
w

if((head==NULL)<(head->next==NULL))return head;
q=NULL;p=head;
ww

while(p->next!=NULL){
q=p;
p=q->next;
}
________________________
return head;
}
Choose the correct alternative to replace the blank line.
(A) q=NULL;p->next=head;head=p;
(B) q->next=NULL;head=p;p->next=head;
(C) head=p;p->next=q;q->next=NULL;
(D) q->next=NULL;p-next=head;head=p;

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

Q. 49 The following program is to be tested for statement coverage :

begin
if(a==b){S1;exit}
else if(c==d){S2;}
else {S3;exit;}
S4;
end
The test cases T1, T2, T3, and T4 given below are expressed in terms of the
properties satisfied by the values of variables a b c and d. The exact values
are not given.

n
T1 : a,b,c and d are all equal
T2 : a,b,c and d are all distinct

g.i
T3 : a=b and c!
T4 : a!=b and c=d
Which of the test suites given below ensures coverage of statements S1, S2, S3

n
and S4 ?

eri
(A) T1, T2, T3
(B) T2, T4
(C) T3, T4
e
(D) T1, T2, T4
gin

Statement Data For Q. 50 and 51

A has table of length 10 uses open addressing with hash function h(k)=k mod 10,
En

and linear probing. After inserting 6 values into an empty has table, the table is
as shown below.

0
arn

1
2 42
3 23
.Le

4 34
5 52
6 46
7 33
w

8
9
ww

Q. 50 Which one oft he following choices gives a possible order in which the key values
could have been inserted in the table ?
(A) 46, 42, 34, 52, 23, 33 (B) 34, 42, 23, 52, 33, 46
(C) 46, 34, 42, 23, 52, 33 (D) 42, 46, 33, 23, 34, 52

Q. 51 How many different insertion sequences of the key values using hte same hash
function and linear probing will result in the hash table shown above ?
(A) 10 (B) 20
(C) 30 (D) 40

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

Q. 52 Let L1 be a recursive language. Let L2 and L3 be language that are recursively

enumerable but not recursive. What of the following statements is not necessarily
true ?
(A) L1 L -1 is recursively enumerable (B) L1 L -3 is recursively enumerable
(C) L2 + L3 is recursively enumerable (D) L2 + L3 is recursively enumerable

Q. 53 Let L { ! (0 =1)) w has even number + of 1s}, i.e.,

w L is the set of all bit
strings with even number of 1s. Which one of the regular expressions below
represents L ?
(A) (0)10)1)) (B) 0)(10)10)))

n
(C) 0)(10)1))0) (D) 0)1 (10)1))10)

g.i
Q. 54 Consider the language L1 {0i 1 j i Y= j}, L2 {0i 1 j i ==j}, L3 {0i 1 j i ==2j 1} =
L4 {0i 1 j i Y= 2j}.Which one of =
the following statements is true ?
(A) Only L2 is context free (B) Only L2 and L3 are context free

n
(C) Only L1 and L2 are context free (D) All are context free

Let w

eri
by any string of length n in{0, 1}). Let L be the set of all substring so . w
Q. 55
What is the minimum number of states in a non-deterministic finite automation
that accepts L ?
e
(A) n 1- (B) n
gin
(C) n 1+ (D) 2n 1+

Q. No. 56 - 60 Carry One Mark Each

En

Q. 56 Choose the most appropriate word from the options given below to the complete
the following sentence:
His rather casual remarks on politics _____ his lack of seriousness about the
arn

subject.
(A) masked (B) belied
(C) betrayed (D) suppressed
.Le

Q. 57 Which of the following options is closest in meaning to the word Circuitous.

(A) cyclic (B) indirect
(C) confusing (D) crooked
w

Q. 58 Choose the most appropriate word from the options given below to complete the
following sentence:
ww

It we manage to ______ our natural resources, we would leave a better planet

for our children.
(A) uphold (B) restrain
(C) cherish (D) conserve

Q. 59 25 persons are in a room. 15 of them play hockey, 17 of them play football and
10 of them play both hockey and football. Then the number of persons playing
neither hockey nor football is:
(A) 2 (B) 17
(C) 13 (D) 3

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

Q. 60 The question below consists of a pair of related words followed by four pairs of
words. Select the pair that best expresses the relation in the original pair.
Unemployed : Worker
(A) fallow : land (B) unaware : sleeper
(C) wit : jester (D) renovated : house

Q. No. 61 - 65 Carry Two Marks Each

Q. 61 If 137 276 + 435 how much
= is 731 672 + ? =

n
(A) 534 (B) 1403
(C) 1623 (D) 1513

g.i
Q. 62 Hari (H), Gita (G), Irfan (I) and Saira (S) are siblings (i.e. brothers and sisters).
All were born on 1st january. The age difference between any two successive

n
siblings (that is born one after another) is less than 3 years. Given the following
facts:

eri
I. Hari’s agae + Gita’s age > Irfan’s age + Saira’s age
II. The age difference between Gita and Saira is 1 year. However Gita is not
the oldest and Saira is not the youngest.
III. There are no twins.
e
gin
In what order were they born (oldest first)?
(A) HSIG (B) SGHI
(C) IGSH (D) IHSG
En

Q. 63 5 skilled workers can build a wall in 20 days: 8 semi-skilled workers can build a
wall in 25 days; 10 unskilled workers can build a wall in 30 days. If a team has 2
skilled, 6 semi-skilled and 5 unskilled workers, how long will it take to build the
arn

wall?
(A) 20 (B) 18
(C) 16 (D) 15
.Le

Q. 64 Modern warfare has changed from large scale clashes of armies to suppression of
civilian populations. Chemical agents that do their work silently appear to be
suited to such warfare; and regretfully, there exist people in military establishments
who think that chemical agents are useful tools for their cause.
w

Which of the following statements best sums up the meaning of the above passage:
(A) Modern warfare has resulted in civil strife
ww

(B) Chemical agents are useful in modern warfare

(C) Use of chemical agents in warfare would be undesirable
(D) People in military establishments like to use chemical agents in war.

Q. 65 Given digits 2, 2, 3, 3, 4, 4, 4, 4 how many distinct 4 digit numbers greater than

3000 can be formed?
(A) 50 (B) 51
(C) 52 (D) 54

**********

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2010

ANSWER KEY
2010
1 2 3 4 5 6 7 8 9 10
() () () () (B) (C) (C) (D) (D) (D)
11 12 13 14 15 16 17 18 19 20
(C) (B) (D) (C) (B) (D) (D) (B) (C) (B)
21 22 23 24 25 26 27 28 29 30
(A) (A) (A) (A) (B) (A) (A) () () ()

n
31 32 33 34 35 36 37 38 39 40

g.i
() () () () () () () () (A) (A)
41 42 43 44 45 46 47 48 49 50
(D) (A) (B) (D) (A) (B) (C) (D) (D) (C)

n
51 52 53 54 55 56 57 58 59 60
(C)
61
()
(B)
62
()
(B)
63
()
(D)
64
()
(C)
65
()
e ()

eri
() () () ()
gin
En
arn
w .Le
ww

www.LearnEngineering.in