### Computer Science (GATE Exam) 2010 - Previous Question Paper Solution

 Description: GATE Exam Previous Year Question Paper Solution Computer Science(CS) - 2010 Number of Questions: 65 Created by: Aliensbrain Bot Tags: Computer Science GATE CS Previous Year Paper
Attempted 0/64 Correct 0 Score 0

Let G=(V, E) be a graph. Define $\xi(G) = \sum\limits_d i_d*d$, where $i_d$ is the number of vertices of degree $d$ in G. If S and T are two different trees with $\xi(S) = \xi(T)$, then

1. $\mid$S$\mid$ = 2$\mid$T$\mid$

2. $\mid$S$\mid$ = $\mid$T$\mid$ - 1

3. $\mid$S$\mid$ = $\mid$T$\mid$

4. $\mid$S$\mid$ = $\mid$T$\mid$ + 1

Correct Option: C
Explanation:

By the given condition, S and T are two different trees.  $\xi(S) = \xi(T)$ So, both S and T have the same number of vertices. Thus, |S| = |T|

Consider the set S = ${1, ω, ω^2}$, where $ω$ and $ω^2$ are cube roots of unity. If * denotes the multiplication operation, the structure (S, *) forms

1. a group

2. a ring

3. an integral domain

4. a field

Correct Option: A

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 in the tree that have exactly one child?

1. 0

2. 1

3. (n − 1) / 2

4. n -1

Correct Option: A

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

1. (C3D8)16

2. (187B)16

3. (F878)16

4. (987B)16

Correct Option: A
Explanation:

Which data structure in a compiler is used for managing information about variables and their attributes?

1. Abstract syntax tree

2. Symbol table

3. Semantic stack

4. Parse table

Correct Option: B
Explanation:

Symbol table is used for storing information about variables and their attributes by compiler.

A main memory unit with a capacity of 4 megabytes is built using 1M × 1-bit DRAM chips. Each DRAM chip has 1K rows of cells with 1K 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 unit is

1. 100 nanoseconds

2. 100*210 nanoseconds

3. 100*220 nanoseconds

4. 3200*220 nanoseconds

Correct Option: D
Explanation:

null

Two alternative packages A and B are available for processing a database having 10k records. Package A requires 0.0001n2 time units and package B requires 10nlog10n time units to process n records. What is the smallest value of k for which package B will be preferred over A?

1. 12

2. 10

3. 6

4. 5

Correct Option: C
Explanation:

Which languages necessarily need heap allocation in the runtime environment?

1. Those that support recursion.

2. Those that use dynamic scoping.

3. Those that allow dynamic data structures.

4. Those that use global variables.

Correct Option: C
Explanation:

Dynamic memory allocation is maintained by heap data structure. So to allow dynamic data structure heap is required

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?

1. It can be used to prioritize packets.

2. It can be used to reduce delays.

3. It can be used to optimize throughput.

4. It can be used to prevent packet looping.

Correct Option: D

Which one of the following is not a client server application?

1. Internet chat

2. Web browsing

3. E-mail

4. Ping

Correct Option: D
Explanation:

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?

1. 1

2. 2

3. 3

4. 4

Correct Option: C
Explanation:

What does the following program print?

#include
void f (int *p, int * g)
{
p = q;
* p = 2;
}
int i = 0, j = 1;
int main ( )
{
f(&amp;i, &amp;j);
print f ("%d%d  n", i, j) ;
return 0;
}

1. 2 2

2. 2 1

3. 0 1

4. 0 2

Correct Option: D
Explanation:

Newton-Raphson method is used to compute a root of the equation x2 − 13 = 0 with 3.5 as the initial value. The approximation after one iteration is

1. 3.575

2. 3.676

3. 3.667

4. 3.393

Correct Option: D
Explanation:

x1 = x + (f(x)/f'(x)x = 3.5 x 1 = 3.5 + ((3.5*3.5-13)/2*3.5) = 3.393

Which of the following concurrency control protocols ensure(s) both conflict serializability and freedom from deadlock? I. 2-phase locking II. Time-stamp ordering

1. Only I

2. Only II

3. Both I and II

4. Neither I nor II

Correct Option: B
Explanation:

Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?

1. L2 - L1 is recursively enumerable

2. L1 - L3 is recursively enumerable

3. L2 $\cap$ L1 is recursively enumerable

4. L2 $\cup$ L1 is recursively enumerable

Correct Option: B
Explanation:

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?

1. 19

2. 21

3. 20

4. 10

Correct Option: A
Explanation:

What is the value of $\lim_{n \to \infty}\left(1 - \frac{1}{n}\right)^{2n}$ ?

1. 0

2. e-2

3. e-1/2

4. 1

Correct Option: B
Explanation:

null

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 many page faults will occur?

1. 196

2. 192

3. 197

4. 195

Correct Option: A
Explanation:

A relational schema for a train reservation database is given below: Passenger (pid, pname, age)

Table: passenger

pid pname Age
0 Sachin 65
1 Rahul 66
2 Sourav 67
3 Anil 69

Table: Reservation

pid class tid
0 AC 8200
1 AC 8201
2 SC 8201
5 AC 8203
1 SC 8204
3 AC 8202

What pids are returned by the following SQL query for the above instance of the tables?

SELECT           pid
FROM  Reservation
WHERE           class 'AC' AND
EXISTS (SELECT *
FROM Passenger
WHERE age 65 &gt; AND
Passenger. pid = Reservation. pid)

1. 1, 0

2. 1, 2

3. 1, 3

4. 1, 5

Correct Option: C
Explanation:

The sub-query places an equity join between 2 tables and select age > 65. So, pids 1, 2 and 3 are selected. In the main query, from 1, 2 and 3, only 1 and 3 have class AC.

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

1. 1/625

2. 4/625

3. 12/625

4. 16/625

Correct Option: A

Which of the following statements are true?

I. Shortest remaining time first scheduling may cause starvation II. Preemptive scheduling may cause starvation III. Round robin is better than FCFS in terms of response time

1. I only

2. I and III only

3. II and III only

4. I, II and III

Correct Option: D
Explanation:

Consider a company that assembles computers. The probability of a faulty assembly of any computer is p. The company therefore subjects each computer to 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?

1. pq + (1 − p) (1 − q)

2. (1 − q)p

3. (1 − p) q

4. pq

Correct Option: A

Consider the following matrix $$A = \left[\begin{array}{cc}2 & 3\\ x & y \end{array}\right]$$ If the eigenvalues of A are 4 and 8, then

1. x = 4, y = 10

2. x = 5, y = 8

3. x = −3, y = 9

4. x = −4, y = 10

Correct Option: D
Explanation:

null

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 variables S1 and S2 are randomly assigned.

Method used by P1 Method used by P2
while (S1==S2); while (S1!=S2);
Critical Section Critical Section
S1=S2; S2 = not(S1)

Which one of the following statements describes the properties achieved?

1. Mutual exclusion but not progress

2. Progress but not mutual exclusion

3. Neither mutual exclusion nor progress

4. Both mutual exclusion and progress

Correct Option: A
Explanation:

The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph? I. 7, 6, 5, 4, 4, 3, 2, 1 II. 6, 6, 6, 6, 3, 3, 2, 2 III. 7, 6, 6, 4, 4, 3, 2, 2 IV. 8, 7, 7, 6, 4, 2, 1, 1

1. I and II

2. III and IV

3. IV only

4. II and IV

Correct Option: D

What is the appropriate pairing of items in the two columns listing various activities encountered in a software life cycle?

P. Requirements Capture 1. Module Development and Integration
Q. Design 2. Domain Analysis
R. Implementation 3. Structural and Behavioral Modeling
S. Maintenance 4. Performance Tuning
1. P-3, Q-2, R-4, S-1

2. P-2, Q-3, R-1, S-4

3. P-3, Q-2, R-1, S-4

4. P-2, Q-3, R-4, S-1

Correct Option: B
Explanation:

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

1. 210

2. 215

3. 220

4. 225

Correct Option: C
Explanation:

The number of reflexive relations on an n-element set is  $2^{n^2 - n}$

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 $∀x∃y∃t(¬F(x,y,t))$?

1. Everyone can fool some person at some time.

2. No one can fool everyone all the time.

3. Everyone cannot fool some person all the time.

4. No one can fool some person at some time.

Correct Option: D

What is the value printed by the following C program?

#include
int f(int * a, int n) {
if (n &lt;= 0) return 0;
else if ( * a % 2 = = 0) return *a + f(a + 1, n - 1);
else return *a - f(a + 1, n - 1);
}
int main() {
int a[] = {
12,
7,
13,
4,
11,
6
};
print f( % d, f(a, 6));
return 0;
}

1. -9

2. 5

3. 15

4. 19

Correct Option: C
Explanation:

In the sequential circuit shown below, if the initial value of the output Q1Q0 is 00, what are the next four values of Q1Q0?

1. 11,10,01,00

2. 10,11,01,00

3. 10,00,01,11

4. 11,10,00,01

Correct Option: A
Explanation:

there are 2 T-toggle flip flops in the ckt. Truth table for TFF.

The weight of a sequence a0, a1,…, an-1 of real numbers is defined as a + a1 / 2 + …. + an-1 / 2n-1. A subsequence of a sequence is obtained by deleting some elements from the sequence, keeping the order of the remaining elements the same. Let X denote the maximum possible weight of a subsequence of a0, a1, …., an-1. Then X is equal to

1. max (Y, a0 + Y)

2. max (Y, a0 + Y/2)

3. max (Y, a0 +2Y)

4. a0 + Y / 2

Correct Option: D
Explanation:

The grammar S $\rightarrow$ aSa|bS|c is

1. LL(1) but not LR(1)

2. LR(1) but not LR(1)

3. Both LL(1) and LR(1)

4. Neither LL(1) nor LR(1)

Correct Option: C
Explanation:

The following C function takes a simply-linked list as input argument. It modifies 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;
struct node * next;
}Node;

Node * move_to_front(Node * head) {
Node * p, * q;
while (p - &gt; next != NULL) {
q = P;
p = p - &gt; next;
}
}


Choose the correct alternative to replace the blank line.

3. head = p; p->next = q; q->next = NULL;

Correct Option: D
Explanation:

Suppose computers A and B have IP addresses 10.105.1.113 and 10.105.1.91 respectively and they both use the same net mask N. Which of the values of N given below should not be used if A and B should belong to the same network?

1. 255.255.255.0

2. 255.255.255.128

3. 255.255.255.192

4. 255.255.255.224

Correct Option: D
Explanation:

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. The PO stage takes 1 clock cycle for ADD and SUB instructions, 3 clock cycles for 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 $t_0: MUL :R_2,R_0,R_1$ $R_2 \gets R_0*R_1$ $t_1: DIV: R_5,R_3,R_4$ $R_5 \gets R_3 / R_4$ $t_2: ADD: R_2,R_5,R_2$ $R_2 \gets R_5 + R_2$ $t_3: SUB :R_5,R_2,R_6$ $R_5 \gets R_2 - R_6$

1. 13

2. 15

3. 17

4. 19

Correct Option: B

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}. W =

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?

1. 7

2. 8

3. 9

4. 10

Correct Option: B
Explanation:

Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram

All the routers use the distance vector based routing algorithm to update their routing tables. Each router 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?

1. 4

2. 3

3. 2

4. 1

Correct Option: D
Explanation:

A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as follows:

if (i%2==0) {
if (i

1. n = 40, k = 26

2. n = 21, k = 12

3. n = 20, k = 10

4. n = 41, k = 19

Correct Option: B
Explanation:

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

a = 1
b = 10
c = 20
d = a + b
e = c + d
f = c + e
b = c + e
e = b + f
d = 5 + e
return d + f

Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling?

1. 2

2. 3

3. 4

4. 6

Correct Option: B

A computer system has an L1 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 in 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 unit, respectively.

When there is a miss in L1 cache and a hit in L2 cache, a block is transferred from L2 cache to L1 cache. What is the time taken for this transfer?

1. 2 nanoseconds

2. 20 nanoseconds

3. 22 nanoseconds

4. 88 nanoseconds

Correct Option: D
Explanation:

Memory access time for L1 = 2 ns. Memory access time for L2 = 20 ns. Memory access time for L3 = 200 ns. If there is a miss in L1, then transfer will go to L2. So, total time in this transfer = 20 + 2 = 22 ns. The block size in L1 = 4 words. So, the time taken in transfer from L2 to L1 = 22 * 4 = 88 ns. So, this option is correct.

A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is as shown below

0
1
2 42
3 23
4 34
5 52
6 46
7 33
8
9

How many different insertion sequences of the key values using the same hash function and linear probing will result in the hash table shown above?

1. 10

2. 20

3. 30

4. 40

Correct Option: C
Explanation:

A computer system has an L1 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 in 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 unit respectively.

When there is a miss in both L1 cache and L2 cache, first a block is transferred from main 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?

1. 222 nanoseconds

2. 888 nanoseconds

3. 902 nanoseconds

4. 968 nanoseconds

Correct Option: A
Explanation:

null

The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0.

Process P0 Process P1 Process P2
while (true) { wait (S1); wait (S2);
wait (S0); release (S0); release (S0);
print '0';
release (S1);
release (S2);
}

How many times will process P0 print ‘0’?

1. At least twice

2. Exactly twice

3. Exactly thrice

4. Exactly once

Correct Option: A
Explanation:

Directions: 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 subject.

2. belied

3. betrayed

4. suppressed

Correct Option: C
Explanation:

From the casual marks we can get to know the views of the speaker......the views were exposed. So, betrayed is the correct option.

Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram

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?

1. 0

2. 1

3. 2

4. 3

Correct Option: A
Explanation:

Directions: Choose the most appropriate word from the options given below to complete the following sentence.

If we manage to ____________ our natural resources, we would leave a better planet for our children.

1. uphold

2. restrain

3. cherish

4. conserve

Correct Option: D

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

1. fallow : land

2. unaware : sleeper

3. wit : jester

4. renovated : house

Correct Option: A

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. Which of the following statements best sums up the meaning of the above passage?

1. Modern warfare has resulted in civil strife.

2. Chemical agents are useful in modern warfare.

3. Use of chemical agents in warfare would be undesirable

4. People in military establishments like to use chemical agents in war.

Correct Option: C

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

1. 534

2. 1403

3. 1623

4. 1513

Correct Option: C

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

1. cyclic

2. indirect

3. confusing

4. crooked

Correct Option: B

A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is as shown below

0
1
2 42
3 23
4 34
5 52
6 46
7 33
8
9

Which one of the following choices gives a possible order in which the key values could have been inserted in the table?

1. 46, 42, 34, 52, 23, 33

2. 34, 42, 23, 52, 33, 46

3. 46, 34, 42, 23, 52, 33

4. 42, 46, 33, 23, 34, 52

Correct Option: C
Explanation:

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

$\underline {T1}$ $\underline{T2}$ $\underline{T1}$ Read(X) Read(Y) Read(Y) Write(Y) Write(X) Write(X) Read(X) Write(X)

Which one of the schedules below is the correct serialization of the above?

1. T1 $\rightarrow$ T3 $\rightarrow$ T2

2. T2 $\rightarrow$ T1 $\rightarrow$ T3

3. T2 $\rightarrow$ T3 $\rightarrow$ T1

4. T3 $\rightarrow$ T1 $\rightarrow$ T2

Correct Option: A
Explanation:

Drawing the dependency graph where an edge between two transactions exits if there is read write or write-write conflict between them

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

1. 20

2. 18

3. 16

4. 15

Correct Option: D
Explanation:

For skilled: men -> days -> amount of wall

5 -> 20  -> 1
1 -> 100 -> 1
1 -> 1   -> 1/100
For semi-skilled: men -> days -> amount of wall

8 -> 25  -> 1

1 -> 200 -> 1
1 -> 1   -> 1/200
For unskilled: men -> days -> amount of wall

10 -> 30  -> 1

1  -> 300 -> 1
1  -> 1   -> 1/300
Amount of work 2 skilled in 1 day = 2/100 Amount of work 6 semi-skilled in 1 day = 6/200 Amount of work 5 unskilled in 1 day = 5/300

Total work in 1 day

= 2/100+6/200+5/300
= 12/600+18/600+10/600
= 1/15

So complete work will take 15 days

Let w be any string of length n in {0, 1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?

1. n - 1

2. n

3. n + 1

4. 2n-1

Correct Option: C
Explanation:

Consider the languages L1 = {0i1j | i $\ne$ j}. L2 = {0i1j | i = j}. L3 = {0i1j | i = 2j +1}. L4 = {0i1j | i $\ne$2j}. Which one of the following statements is true?

1. Only L2 is context free

2. Only L2 and L3 are context free

3. Only L1 and L2 are context free

4. All are context free

Correct Option: D
Explanation:

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}. W =

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?

1. 7

2. 8

3. 9

4. 10

Correct Option: A
Explanation:

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 siblings (that is born one after another) is less than 3 years. Given the following facts: i. Hari's age + 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.

In what order were they born (oldest first)?

1. HSIG

2. SGHI

3. IGSH

4. IHSG

Correct Option: B

Given digits 2, 2, 3, 3, 4, 4, 4, 4 how many distinct 4 digit numbers greater than 3000 can be formed?

1. 50

2. 51

3. 52

4. 54

Correct Option: B

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. T1 : a, b, c and d are all equal T2 : a, b, c and d are all distinct T3 : a=b and c !=d T4 : a !=b and c=d

Which of the test suites given below ensures coverage of statements S1, S2, S3 and S4?

1. T1, T2, T3

2. T2, T4

3. T3, T4

4. T1, T2, T4

Correct Option: D
Explanation:

The following functional dependencies hold for relations R(A, B, C) and S(B, D, E) B $\rightarrow$A, A $\rightarrow$C The relation R contains 200tuples and the relation S contains 100tuples. What is the maximum number of tuples possible in the natural join $R \bowtie S$

1. 100

2. 200

3. 300

4. 2000

Correct Option: A
Explanation:

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

1. 2

2. 17

3. 13

4. 3

Correct Option: D

The minterm expansion of f (P, Q, R) = PQ + Q$\bar R$ + P$\bar R$ is

1. m2 + m4 + m6 + m7

2. m0 + m1 + m3 + m5

3. m0 + m1 + m6 + m7

4. m2 + m3 + m4 + m5

Correct Option: A
Explanation:

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

1. $\overline{P \oplus Q \oplus R }$

2. ${P \oplus Q \oplus R }$

3. P + Q + R

4. $\overline{P + Q + R }$

Correct Option: B
Explanation:

What is the Boolean expression for the output f of the combinational logic circuit of NOR gates given below?

1. $\overline{Q + R }$

2. $\overline{P + Q }$

3. $\overline{P + R }$

4. $\overline{P + Q + R }$

Correct Option: A
Explanation:

- Hide questions