Answers by anshu / GATE Overflow for GATE CSE

4 votes

1

GATE CSE 2015 Set 2 | Question: 26
Let $f(x)=x^{-\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the X-axis, when $x$ varies from $-1$ to $1$. Which of the following statements is/are TRUE? $f$ is continuous in $[-1, 1]$ $f$ is not bounded in $[-1, 1]$ $A$ is nonzero and finite II only III only II and III only I, II and III

Let $f(x)=x^{-\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the X-axis, when $x$ varies from $-1$ to $1$. Which of the following stat...

17.3k views

answered Feb 12, 2015

11 votes

2

GATE CSE 2004 | Question: 30, ISRO2017-10
The problem $\text{3-SAT}$ and $\text{2-SAT}$ are both in $\text{P}$ both $\text{NP}$ complete $\text{NP}$-complete and in $\text{P}$ respectively undecidable and $\text{NP}$ complete respectively

The problem $\text{3-SAT}$ and $\text{2-SAT}$ are both in $\text{P}$both $\text{NP}$ complete$\text{NP}$-complete and in $\text{P}$ respectivelyundecidable and $\text{NP}...

11.8k views

answered Feb 6, 2015

20 votes

3

GATE CSE 2004 | Question: 24
Consider the binary relation: $S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$ The reflexive transitive closure is $S$ ... $\left\{\left(x, y\right) \mid y \leq x \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$

Consider the binary relation:$S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$The reflexive transitive closure is $S$ is$\lef...

9.9k views

answered Feb 6, 2015

10 votes

4

GATE CSE 2004 | Question: 20
Which of the following addressing modes are suitable for program relocation at run time? Absolute addressing Based addressing Relative addressing Indirect addressing I and IV I and II II and III I, II and IV

Which of the following addressing modes are suitable for program relocation at run time?Absolute addressingBased addressingRelative addressingIndirect addressingI and IVI...

12.1k views

answered Feb 6, 2015

24 votes

5

GATE CSE 2004 | Question: 6
Level order traversal of a rooted tree can be done by starting from the root and performing preorder traversal in-order traversal depth first search breadth first search

Level order traversal of a rooted tree can be done by starting from the root and performingpreorder traversalin-order traversaldepth first searchbreadth first search

6.5k views

answered Feb 6, 2015

27 votes

6

GATE CSE 2005 | Question: 42
Let $R$ and $S$ be any two equivalence relations on a non-empty set $A$. Which one of the following statements is TRUE? $R$ $∪$ $S$, $R$ $∩$ $S$ are both equivalence relations $R$ $∪$ $S$ is an equivalence relation $R$ $∩$ $S$ is an equivalence relation Neither $R$ $∪$ $S$ nor $R$ $∩$ $S$ are equivalence relations

Let $R$ and $S$ be any two equivalence relations on a non-empty set $A$. Which one of the following statements is TRUE?$R$ $∪$ $S$, $R$ $∩$ $S$ are both equivalence r...

9.1k views

answered Feb 6, 2015

31 votes

7

GATE CSE 2005 | Question: 31
Consider the following C-program: void foo (int n, int sum) { int k = 0, j = 0; if (n == 0) return; k = n % 10; j = n/10; sum = sum + k; foo (j, sum); printf ("%d,",k); } int main() { int a = 2048, sum = 0; foo(a, sum); printf("%d\n", sum); } What ... print? $\text{8, 4, 0, 2, 14}$ $\text{8, 4, 0, 2, 0}$ $\text{2, 0, 4, 8, 14}$ $\text{2, 0, 4, 8, 0}$

Consider the following C-program:void foo (int n, int sum) { int k = 0, j = 0; if (n == 0) return; k = n % 10; j = n/10; sum = sum + k; foo (j, sum); printf ("%d,",k); } ...

13.2k views

answered Feb 6, 2015

5 votes

8

GATE CSE 2005 | Question: 21
What is the swap space in the disk used for? Saving temporary html pages Saving process data Storing the super-block Storing device drivers

What is the swap space in the disk used for?Saving temporary html pagesSaving process dataStoring the super-blockStoring device drivers

20.0k views

answered Feb 6, 2015

–5 votes

9

GATE CSE 2005 | Question: 19
Which one of the following is true for a CPU having a single interrupt request line and a single interrupt grant line? Neither vectored interrupt nor multiple interrupting devices are possible Vectored interrupts are not possible ... and multiple interrupting devices are both possible Vectored interrupts are possible but multiple interrupting devices are not possible

Which one of the following is true for a CPU having a single interrupt request line and a single interrupt grant line?Neither vectored interrupt nor multiple interrupting...

21.0k views

answered Feb 6, 2015

27 votes

10

GATE CSE 2005 | Question: 13
The set $\{1, 2, 4, 7, 8, 11, 13, 14\}$ is a group under multiplication modulo $15$. The inverses of $4$ and $7$ are respectively: $3$ and $13$ $2$ and $11$ $4$ and $13$ $8$ and $14$

The set $\{1, 2, 4, 7, 8, 11, 13, 14\}$ is a group under multiplication modulo $15$. The inverses of $4$ and $7$ are respectively:$3$ and $13$$2$ and $11$$4$ and $13$$8...

7.1k views

answered Feb 6, 2015

30 votes

11

GATE CSE 2005 | Question: 9
The following is the Hasse diagram of the poset $\left[\{a,b,c,d,e\},≺\right]$ The poset is : not a lattice a lattice but not a distributive lattice a distributive lattice but not a Boolean algebra a Boolean algebra

The following is the Hasse diagram of the poset $\left[\{a,b,c,d,e\},≺\right]$The poset is :not a latticea lattice but not a distributive latticea distributive lattice ...

9.3k views

answered Feb 6, 2015

0 votes

12

GATE CSE 2006 | Question: 61
The atomic fetch-and-set $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening access to the memory location $x$ ... a pair of normal load/store can be used The implementation of $V$ is wrong The code does not implement a binary semaphore

The atomic fetch-and-set $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening a...

27.6k views

answered Feb 5, 2015

5 votes

13

GATE CSE 2006 | Question: 26
Which one of the first order predicate calculus statements given below correctly expresses the following English statement? Tigers and lions attack if they are hungry or threatened. ...

Which one of the first order predicate calculus statements given below correctly expresses the following English statement? Tigers and lions attack if they are hungry or ...

9.3k views

answered Feb 4, 2015

–2 votes

14

GATE CSE 2006 | Question: 18
We are given a set $X = \{X_1,\ldots,X_n\}$ where $X_i=2^i$. A sample $S\subseteq X$ is drawn by selecting each $X_i$ independently with probability $P_i = \frac{1}{2}$ . The expected value of the smallest number in sample $S$ is: $\left(\frac{1}{n}\right)$ $2$ $\sqrt n$ $n$

We are given a set $X = \{X_1,\ldots,X_n\}$ where $X_i=2^i$. A sample $S\subseteq X$ is drawn by selecting each $X_i$ independently with probability $P_i = \frac{1}{2...

16.0k views

answered Feb 4, 2015

40 votes

15

GATE CSE 2006 | Question: 11
Consider a weighted complete graph $G$ on the vertex set $\{v_1,v_2,.....v_n\}$ such that the weight of the edge $(v_i, v_j)$ is $2|i-j|$. The weight of a minimum spanning tree of $G$ is: $n-1$ $2n-2$ $\begin{pmatrix} n \\ 2 \end{pmatrix}$ $n^2$

Consider a weighted complete graph $G$ on the vertex set $\{v_1,v_2,.....v_n\}$ such that the weight of the edge $(v_i, v_j)$ is $2|i-j|$. The weight of a minimum spanni...

14.8k views

answered Feb 4, 2015

45 votes

16

GATE CSE 2006 | Question: 09, ISRO2009-35
A CPU has $24$-$bit$ instructions. A program starts at address $300$ (in decimal). Which one of the following is a legal program counter (all values in decimal)? $400$ $500$ $600$ $700$

A CPU has $24$-$bit$ instructions. A program starts at address $300$ (in decimal). Which one of the following is a legal program counter (all values in decimal)?$400$$500...

16.1k views

answered Feb 4, 2015

6 votes

17

GATE CSE 2006 | Question: 06, ISRO2009-14
Consider three CPU-intensive processes, which require $10$, $20$ and $30$ time units and arrive at times $0$, $2$ and $6$, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. $1$ $2$ $3$ $4$

Consider three CPU-intensive processes, which require $10$, $20$ and $30$ time units and arrive at times $0$, $2$ and $6$, respectively. How many context switches are nee...

15.9k views

answered Feb 4, 2015

6 votes

18

GATE CSE 2003 | Question: 84
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5$ packets each. Data packets (sent only from $A$ to $B$) are all $1000$ bytes long and the ... ? $7.69 \times 10^6$ Bps $11.11 \times 10^6$ Bps $12.33 \times 10^6$ Bps $15.00 \times 10^6$ Bps

Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5...

28.0k views

answered Feb 4, 2015

–2 votes

19

GATE CSE 2003 | Question: 65
Consider the following $2-3-4$ tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in constructing the tree. What is the result of inserting $G$ in the above tree? None of the above

Consider the following $2-3-4$ tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in...

10.1k views

answered Feb 4, 2015

0 votes

20

GATE CSE 2003 | Question: 61
In a permutation $a_1 ... a_n$, of n distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i > a_j$. If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of $1. . . n$? $\frac{n(n-1)}{2}$ $\frac{n(n-1)}{4}$ $\frac{n(n+1)}{4}$ $2n[\log_2n]$

In a permutation $a_1 ... a_n$, of n distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i a_j$.If all permutations are equally likel...

22.0k views

answered Feb 4, 2015

13 votes

21

GATE CSE 2003 | Question: 30
Consider the following SQL query Select distinct $a_1, a_2, , a_n$ from $r_1, r_2, , r_m$ ... $\Pi_{a_1, a_2, a_n} \sigma_p \left(r_1 \cap r_2 \cap \dots \cap r_m \right)$

Consider the following SQL querySelect distinct $a_1, a_2, …, a_n$from $r_1, r_2, …, r_m$where PFor an arbitrary predicate P, this query is equivalent to which of the...

9.0k views

answered Feb 3, 2015

–6 votes

22

GATE CSE 2003 | Question: 27
Which of the following assertions is FALSE about the Internet Protocol (IP)? It is possible for a computer to have multiple IP addresses IP packets from the same source to the same destination can take different routes in the network IP ensures that a ... set the route of an outgoing packets; the route is determined only by the routing tables in the routers on the way

Which of the following assertions is FALSE about the Internet Protocol (IP)?It is possible for a computer to have multiple IP addressesIP packets from the same source to ...

16.3k views

answered Feb 3, 2015

–4 votes

23

GATE CSE 2003 | Question: 26
In a system with $\text{32 bit}$ virtual addresses and $\text{1 KB}$ page size, use of one-level page tables for virtual to physical address translation is not practical because of the large amount of internal ... large amount of external fragmentation the large memory overhead in maintaining page tables the large computation overhead in the translation process

In a system with $\text{32 bit}$ virtual addresses and $\text{1 KB}$ page size, use of one-level page tables for virtual to physical address translation is not practical ...

15.3k views

answered Feb 3, 2015

–1 votes

24

GATE CSE 2003 | Question: 24
Which of the following statements is FALSE? In statically typed languages, each variable in a program has a fixed type In un-typed languages, values do not have any types In dynamically typed languages, variables have no types In all statically typed languages, each variable in a program is associated with values of only a single type during the execution of the program

Which of the following statements is FALSE?In statically typed languages, each variable in a program has a fixed typeIn un-typed languages, values do not have any typesIn...

9.1k views

answered Feb 3, 2015

5 votes

25

GATE CSE 2003 | Question: 21
Consider the following graph: Among the following sequences: abeghf abfehg abfhge afghbe Which are the depth-first traversals of the above graph? I, II and IV only I and IV only II, III and IV only I, III and IV only

Consider the following graph: Among the following sequences:abeghfabfehgabfhgeafghbeWhich are the depth-first traversals of the above graph?I, II and IV onlyI and IV only...

13.1k views

answered Feb 3, 2015

7 votes

26

True or False: Relational algebra cannot perform aggregate function
True or False: Relational algebra cannot perform aggregate function

True or False: Relational algebra cannot perform aggregate function

2.3k views

answered Feb 3, 2015

0 votes

27

GATE CSE 2003 | Question: 18
In a bottom-up evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is L-attributed be evaluated only if the definition has synthesized attributes never be evaluated

In a bottom-up evaluation of a syntax directed definition, inherited attributes canalways be evaluatedbe evaluated only if the definition is L-attributedbe evaluated only...

36.9k views

answered Feb 3, 2015

–1 votes

28

GATE CSE 2003 | Question: 9
Assuming all numbers are in $2’s$ complement representation, which of the following numbers is divisible by $11111011$? $11100111$ $11100100$ $11010111$ $11011011$

Assuming all numbers are in $2’s$ complement representation, which of the following numbers is divisible by $11111011$?$11100111$$11100100$$11010111$$11011011$

10.4k views

answered Feb 3, 2015

–2 votes

29

GATE CSE 2003 | Question: 10, ISRO-DEC2017-41
For a pipelined CPU with a single ALU, consider the following situations The ${j+1}^{st}$ instruction uses the result of the $j^{th}$ instruction as an operand The execution of a conditional jump instruction The $j^{th}$ and ${j+1}^{st}$ ... ALU at the same time. Which of the above can cause a hazard I and II only II and III only III only All the three

For a pipelined CPU with a single ALU, consider the following situationsThe ${j+1}^{st}$ instruction uses the result of the $j^{th}$ instruction as an operandThe executio...

9.5k views

answered Feb 3, 2015

–3 votes

30

GATE CSE 2003 | Question: 8, ISRO2009-53
Let $\text{G}$ be an arbitrary graph with $n$ nodes and $k$ components. If a vertex is removed from $\text{G}$, the number of components in the resultant graph must necessarily lie down between $k$ and $n$ $k-1$ and $k+1$ $k-1$ and $n-1$ $k+1$ and $n-k$

Let $\text{G}$ be an arbitrary graph with $n$ nodes and $k$ components. If a vertex is removed from $\text{G}$, the number of components in the resultant graph must neces...

15.4k views

answered Feb 3, 2015

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true