GATE CSE 2010

## GATE CSE

Two alternate packages A and B are available for processing a database having 10k records. Package A requires 0.0001n2 t

View Question
Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry W(ij) in the matrix W below is the weight of

View Question
Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry W(ij) in the matrix W below is the weight of

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

View Question
The grammar $$S \to aSa\,|\,\,bS\,|\,\,c$$ is

View Question
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

View Question
Which languages necessarily need heap allocation in the runtime environment?

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

View Question
One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the following statements best expla

View Question
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 mas

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

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

View Question
A main memory unit with a capacity of $$4$$ megabytes is built using $$1M \times 1$$-bit $$DRAM$$ chips. Each $$DRAM$$ c

View Question
A computer system has an $$L1$$ cache, an $$L2$$ cache, and a main memory unit connected as shown below. The block size

View Question
A computer system has an $$L1$$ cache, an $$L2$$ cache, and a main memory unit connected as shown below. The block size

View Question
A $$5$$-stage pipelined processor has Instruction Fetch $$(IF),$$ Instruction Decode $$(ID),$$ Operand Fetch $$(OF),$$ P

View Question
The following C function takes a simply-linked list as input argument. It modifies the list by moving the last element t

View Question
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 e

View Question
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 e

View Question
A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 v

View Question
A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 v

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

View Question
The following functional dependencies hold for relations R(A, B, C) and S(B, D, E):
$$$\eqalign{
& B \to A \cr

View Question
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?
I.

View Question
Consider the following schedule for transactions T1, T2 and T3:
Which one of the schedules below is the correct seriali

View Question
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-ro

View Question
$$P$$ is a $$16$$-bit signed integer. The $$2's$$ complement representtation of $$P$$ is $${\left( {F87B} \right)_{16}}$

View Question
The minters expansion of $$f\left( {P,Q,R} \right) = PQ + Q\overline R + P\overline R $$ is

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

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

View Question
What is the probability that divisor of $${10^{99}}$$ is a multiple of $${10^{96}}$$ ?

View Question
Suppose the predicate $$F(x,y,t)$$ is used to represent the statements that person $$x$$ can fool person $$y$$ at time

View Question
Consider a company that assembles computers. The probability of a faulty assembly of any computer is P. The company ther

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

View Question
Consider the set $$S = \left\{ {1,\,\omega ,\,{\omega ^2}} \right\},$$ where $$\omega $$ and $${{\omega ^2}}$$, are cube

View Question
Let $$G$$ $$\,\,\,\,\, = \,\,\,\left( {V,\,\,\,\,\,E} \right)$$ be a graph. Define $$\xi \left( G \right) = \sum\limits_

View Question
What is the value of $$\mathop {\lim }\limits_{n \to \infty } {\left[ {1 - {1 \over n}} \right]^{2n}}?$$

View Question
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Whic

View Question
Consider the following matrix $$A = \left[ {\matrix{
2 & 3 \cr
x & y \cr
} } \right]\,\,$$ If the ei

View Question
Consider the following matrix $$A = \left[ {\matrix{
2 & 3 \cr
x & y \cr
} } \right].$$
If the eige

View Question
Which of the following statements are true?
$${\rm I}.$$ Shortest remaining time first scheduling may cause starvation
$

View Question
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below.

View Question
The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0=1

View Question
A system uses FIFO policy for page replacement. It has $$4$$ pages frames with no pages loaded to begin with. The system

View Question
A system has n resources R0,.....,Rn-1, and k processes P0,.....,Pk-1. The
implementation of the resource request logic

View Question
Which languages necessarily need heap allocation in the runtime environment?

View Question
What does the following program print?
#include < stdio.h >
void f (int *p, int *q) {
p = q;
*p = 2;
}
in

View Question
The Cyclomatic complexity of each of the module $$A$$ & $$B$$ shown below is $$10.$$ What is the cyclomatic complexi

View Question
What is the appropriate pairing of items in the two columns using listing various activities encountered in a software u

View Question
The following program is to be tested for statement coverage:
begin
if $$\left( {a = \,\, = b} \right)\,\,\left\{ {S1;\,

View Question
Let $${L_1}$$ recursive language. Let $${L_2}$$ and $${L_3}$$ be languages that are recursively enumerable but not recur

View Question
Let $$L = \left\{ {w \in {{\left( {0 + 1} \right)}^ * }\left| {\,w} \right.} \right.$$ has even number of $$\,\left. {1'

View Question
Let $$w$$ be any string of length $$n$$ in $${\left\{ {0,1} \right\}^ * }$$. Let $$L$$ be the set of all substrings of $

View Question
Consider the languages
$$$\eqalign{
& {L_1} = \left\{ {{0^i}{1^j}\,\left| {i \ne j} \right.} \right\},\,{L_2} = \

View Question