Recent activity by Sherrinford / GATE Overflow for GATE CSE

6 answers

1

GATE CSE 2009 | Question: 7, ISRO2015-3
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes? $8$ $32$ $64$ $128$

How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes?$8$$32$$64$$128$

17.6k views

commented Sep 19, 2019

3 answers

2

GATE CSE 2004 | Question: 65
Consider a small two-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently used (LRU) scheme. The number of cache misses for the following sequence of block addresses is: $8, 12, 0, 12, 8$. $2$ $3$ $4$ $5$

Consider a small two-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently used (LRU) scheme. The num...

15.2k views

commented Sep 18, 2019

6 answers

3

GATE CSE 2008 | Question: 72
Consider a machine with a $2$-way set associative data cache of size $64$ Kbytes and block size $16$ bytes. The cache is managed using $32$ bit virtual addresses and the page size is $4$ Kbytes. A program to be run on this machine begins as follows: double ARR[1024][1024]; int i, j; ... $\text{ARR[0][4]}$ $\text{ARR[4][0]}$ $\text{ARR[0][5]}$ $\text{ARR[5][0]}$

Consider a machine with a $2$-way set associative data cache of size $64$ Kbytes and block size $16$ bytes. The cache is managed using $32$ bit virtual addresses and the ...

15.7k views

commented Sep 18, 2019

4 answers

4

GATE CSE 2008 | Question: 71
Consider a machine with a $2$-way set associative data cache of size $64\text{Kbytes}$ and block size $16\text{bytes}$. The cache is managed using $32\;\text{bit}$ virtual addresses and the page size is $4\text{Kbytes}$. A program to be run on this ... total size of the tags in the cache directory is: $32\text{Kbits}$ $34\text{Kbits}$ $64\text{Kbits}$ $68\text{Kbits}$

Consider a machine with a $2$-way set associative data cache of size $64\text{Kbytes}$ and block size $16\text{bytes}$. The cache is managed using $32\;\text{bit}$ virtua...

18.7k views

commented Sep 17, 2019

11 answers

5

GATE CSE 2001 | Question: 2.13
Consider the following data path of a simple non-pipelined CPU. The registers $A, B$, $A_{1},A_{2}, \textsf{MDR},$ the $\textsf{bus}$ and the $\textsf{ALU}$ are $8$-$bit$ wide. $\textsf{SP}$ and $\textsf{MAR}$ are $16$-$bit$ registers. The ... $\textsf{CPU}$ clock cycles are required to execute the "push r" instruction? $2$ $3$ $4$ $5$

Consider the following data path of a simple non-pipelined CPU. The registers $A, B$, $A_{1},A_{2}, \textsf{MDR},$ the $\textsf{bus}$ and the $\textsf{ALU}$ are $8$-$bit$...

21.2k views

commented Sep 16, 2019

7 answers

6

GATE CSE 2018 | Question: 5
Consider the following processor design characteristics: Register-to-register arithmetic operations only Fixed-length instruction format Hardwired control unit Which of the characteristics above are used in the design of a RISC processor? I and II only II and III only I and III only I, II and III

Consider the following processor design characteristics:Register-to-register arithmetic operations onlyFixed-length instruction formatHardwired control unitWhich of the c...

12.0k views

commented Sep 13, 2019

7 answers

7

GATE CSE 2010 | Question: 37
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? $2$ $3$ $4$ $6$

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 + fAssuming tha...

21.8k views

commented Sep 11, 2019

3 answers

8

GATE CSE 2008 | Question: 37, ISRO2009-38
The use of multiple register windows with overlap causes a reduction in the number of memory accesses for: Function locals and parameters Register saves and restores Instruction fetches $\text{I}$ only $\text{II}$ only $\text{III}$ only $\text{I}, \text{II}$ and $\text{III}$

The use of multiple register windows with overlap causes a reduction in the number of memory accesses for:Function locals and parametersRegister saves and restoresInstruc...

19.4k views

commented Sep 11, 2019

14 answers

9

GATE CSE 2014 Set 1 | Question: 49
A pennant is a sequence of numbers, each number being $1$ or $2$. An $n-$pennant is a sequence of numbers with sum equal to $n$. For example, $(1,1,2)$ is a $4-$pennant. The set of all possible $1-$pennants is ${(1)}$, the set of all possible ... $(1,2)$ is not the same as the pennant $(2,1)$. The number of $10-$pennants is________

A pennant is a sequence of numbers, each number being $1$ or $2$. An $n-$pennant is a sequence of numbers with sum equal to $n$. For example, $(1,1,2)$ is a $4-$pennant. ...

11.5k views

commented Sep 2, 2019

6 answers

10

GATE CSE 2009 | Question: 48
Let $G(x)$ be the generator polynomial used for CRC checking. What is the condition that should be satisfied by $G(x)$ to detect odd number of bits in error? $G(x)$ contains more than two terms $G(x)$ does not divide $1+x^k$, for any $k$ not exceeding the frame length $1+x$ is a factor of $G(x)$ $G(x)$ has an odd number of terms.

Let $G(x)$ be the generator polynomial used for CRC checking. What is the condition that should be satisfied by $G(x)$ to detect odd number of bits in error?$G(x)$ contai...

29.3k views

commented Aug 24, 2019

8 answers

11

GATE IT 2008 | Question: 66
Data transmitted on a link uses the following $2D$ parity scheme for error detection: Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r_3$, and columns $d_7$ through $d_1$) and is padded with a column $d_0$ and row $r_4$ ... received by a receiver and has $n$ corrupted bits. What is the minimum possible value of $n$? $1$ $2$ $3$ $4$

Data transmitted on a link uses the following $2D$ parity scheme for error detection:Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r...

15.5k views

commented Aug 24, 2019

5 answers

12

GATE IT 2006 | Question: 6
Given a boolean function $f (x_1, x_2, \ldots, x_n),$ which of the following equations is NOT true? $f (x_1, x_2, \ldots, x_n) = x_1'f(x_1, x_2, \ldots, x_n) + x_1f(x_1, x_2, \ldots, x_n)$ ... $f (x_1, x_2, \ldots , x_n) = f(0, x_2, , x_n) + f(1, x_2, \ldots, x_n)$

Given a boolean function $f (x_1, x_2, \ldots, x_n),$ which of the following equations is NOT true?$f (x_1, x_2, \ldots, x_n) = x_1'f(x_1, x_2, \ldots, x_n) + x_1f(x_1, x...

6.3k views

commented Aug 4, 2019

7 answers

13

GATE CSE 2005 | Question: 43
Let $f: B \to C$ and $g: A \to B$ be two functions and let $h = f o g$. Given that $h$ is an onto function which one of the following is TRUE? $f$ and $g$ should both be onto functions $f$ should be onto but $g$ need not to be onto $g$ should be onto but $f$ need not be onto both $f$ and $g$ need not be onto

Let $f: B \to C$ and $g: A \to B$ be two functions and let $h = f o g$. Given that $h$ is an onto function which one of the following is TRUE?$f$ and $g$ should both be o...

10.0k views

commented Aug 4, 2019

8 answers

14

GATE CSE 2006 | Question: 28
A logical binary relation $\odot$ ... $(\sim A\odot B)$ $\sim(A \odot \sim B)$ $\sim(\sim A\odot\sim B)$ $\sim(\sim A\odot B)$

A logical binary relation $\odot$, is defined as follows: $$\begin{array}{|l|l|l|} \hline \textbf{A} & \textbf{B}& \textbf{A} \odot \textbf{B}\\\hline \text{True} & \text...

5.9k views

commented Aug 4, 2019

1 answer

15

GATE CSE 1993 | Question: 01.6
Which of the following improper integrals is (are) convergent? $\int ^{1} _{0} \frac{\sin x}{1-\cos x}dx$ $\int ^{\infty} _{0} \frac{\cos x}{1+x} dx$ $\int ^{\infty} _{0} \frac{x}{1+x^2} dx$ $\int ^{1} _{0} \frac{1-\cos x}{\frac{x^5}{2}} dx$

Which of the following improper integrals is (are) convergent?$\int ^{1} _{0} \frac{\sin x}{1-\cos x}dx$$\int ^{\infty} _{0} \frac{\cos x}{1+x} dx$$\int ^{\infty} _{0} \f...

2.1k views

commented Aug 2, 2019

5 answers

16

GATE CSE 2014 Set 3 | Question: 2
Let $X$ and $Y$ be finite sets and $f:X \to Y$ be a function. Which one of the following statements is TRUE? For any subsets $A$ and $B$ of $X, |f(A \cup B)| = |f(A)| + |f(B)|$ For any subsets $A$ and $B$ of $X, f(A \cap B) = f(A) \cap f(B)$ For any subsets $A$ ... $S$ and $T$ of $Y, f^{-1}(S \cap T) = f^{-1}(S) \cap f^{-1}(T)$

Let $X$ and $Y$ be finite sets and $f:X \to Y$ be a function. Which one of the following statements is TRUE?For any subsets $A$ and $B$ of $X, |f(A \cup B)| = |f(A)| + |f...

14.1k views

commented Jul 31, 2019

9 answers

17

GATE CSE 2006 | Question: 25
Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is the number of sets $X_j$ that contain the element $i.$ That is $f(i)=\left | \left\{j \mid i\in X_j \right\} \right|$ then $ \sum_{i=1}^{m} f(i)$ is: $3m$ $3n$ $2m+1$ $2n+1$

Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is...

11.1k views

commented Jul 31, 2019

6 answers

18

GATE CSE 2003 | Question: 37
Let $f : A \to B$ be an injective (one-to-one) function. Define $g : 2^A \to 2^B$ as: $g(C) = \left \{f(x) \mid x \in C\right\} $, for all subsets $C$ of $A$. Define $h : 2^B \to 2^A$ as: $h(D) = \{x \mid x \in A, f(x) \in D\}$, for all ... always true? $g(h(D)) \subseteq D$ $g(h(D)) \supseteq D$ $g(h(D)) \cap D = \phi$ $g(h(D)) \cap (B - D) \ne \phi$

Let $f : A \to B$ be an injective (one-to-one) function. Define $g : 2^A \to 2^B$ as:$g(C) = \left \{f(x) \mid x \in C\right\} $, for all subsets $C$ of $A$.Define ...

8.2k views

commented Jul 27, 2019

6 answers

19

GATE CSE 2003 | Question: 39
Let $\Sigma = \left\{a, b, c, d, e\right\}$ be an alphabet. We define an encoding scheme as follows: $g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11$. Let $p_i$ denote the i-th prime number $\left(p_1 = 2\right)$ ... numbers is the encoding, $h$, of a non-empty sequence of strings? $2^73^75^7$ $2^83^85^8$ $2^93^95^9$ $2^{10}3^{10}5^{10}$

Let $\Sigma = \left\{a, b, c, d, e\right\}$ be an alphabet. We define an encoding scheme as follows:$g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11$.Let $p_i$ denote t...

7.6k views

commented Jul 27, 2019

1 answer

20

Problem in gate1998-10 part b -
Can someone help me in "part b" of this question- https://gateoverflow.in/1724/gate1998-10 . I am still not able to understand why $R^0$ is considered here ? and what is $R^0 $? Is it Equality relation? Do we have to consider it in every question of this type ?

Can someone help me in "part b" of this question- https://gateoverflow.in/1724/gate1998-10 .I am still not able to understand why $R^0$ is considered here ? and what is $...

1.2k views

commented Jul 27, 2019

4 answers

21

GATE CSE 1998 | Question: 10b
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m < n$ and $R^m = R^n$.

Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m <...

4.2k views

commented Jul 27, 2019

6 answers

22

GATE CSE 1998 | Question: 10a
Prove by induction that the expression for the number of diagonals in a polygon of $n$ sides is $\frac{n(n-3)}{2}$

Prove by induction that the expression for the number of diagonals in a polygon of $n$ sides is $\frac{n(n-3)}{2}$

3.8k views

commented Jul 27, 2019

3 answers

23

GATE CSE 1991 | Question: 01,xiv
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.

If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.

5.8k views

commented Jul 26, 2019

3 answers

24

GATE CSE 1993 | Question: 8.5
The less-than relation, $<,$ on reals is a partial ordering since it is asymmetric and reflexive a partial ordering since it is antisymmetric and reflexive not a partial ordering because it is not asymmetric and not reflexive not a partial ordering because it is not antisymmetric and reflexive none of the above

The less-than relation, $<,$ on reals isa partial ordering since it is asymmetric and reflexivea partial ordering since it is antisymmetric and reflexivenot a partial ord...

9.1k views

commented Jul 26, 2019

4 answers

25

GATE CSE 2015 Set 2 | Question: GA-8
In a triangle $PQR, PS$ is the angle bisector of $\angle QPR \text{ and } \angle QPS =60^\circ$. What is the length of $PS$ ? $\left(\dfrac{(q+r)} {qr}\right)$ $\left(\dfrac {qr} {q+r}\right)$ $\large \sqrt {(q^2 + r^2)}$ $\left(\dfrac{(q+r)^2} {qr}\right)$

In a triangle $PQR, PS$ is the angle bisector of $\angle QPR \text{ and } \angle QPS =60^\circ$. What is the length of $PS$ ?$\left(\dfrac{(q+r)} {qr}\right)$$\left(\dfra...

11.1k views

commented Jul 26, 2019

5 answers

26

GATE CSE 2016 Set 2 | Question: GA-10
$f(x) = 1 - |x - 1|$ $f(x) =1 + |x - 1|$ $f(x) = 2 - |x - 1|$ $f(x) = 2 + |x - 1|$

$f(x) = 1 - |x - 1|$$f(x) =1 + |x - 1|$$f(x) = 2 - |x - 1|$$f(x) = 2 + |x - 1|$

4.7k views

commented Jul 25, 2019

7 answers

27

GATE CSE 2016 Set 1 | Question: GA08
Consider the following statements relating to the level of poker play of four players $P,Q,R \ and \ S$. $P$ always beats $Q$ $R$ always beats $S$ $S$ loses to $P$ only sometimes. $R$ always loses to $Q$ Which of the following can be logically ... $S$ is the absolute worst player in the set (i). only (ii) only (i) and (ii) only' neither (i) nor (ii)

Consider the following statements relating to the level of poker play of four players $P,Q,R \ and \ S$.$P$ always beats $Q$$R$ always beats $S$$S$ loses to $P$ only som...

7.9k views

commented Jul 25, 2019

6 answers

28

GATE CSE 2015 Set 2 | Question: GA-7
Four branches of a company are located at $\text{M, N, O}$ and $\text{P. M}$ is north of $\text{N}$ at a distance of $4\;\text{km; P}$ is south of $\text{O}$ at a distance of $2\;\text{km; N}$ is southeast of $\text{O}$ by $1\;\text{km}$. What is the distance between $\text{M}$ and $\text{P}$ in $\text{km}$? $5.34$ $6.74$ $28.5$ $45.49$

Four branches of a company are located at $\text{M, N, O}$ and $\text{P. M}$ is north of $\text{N}$ at a distance of $4\;\text{km; P}$ is south of $\text{O}$ at a distan...

13.4k views

commented Jul 25, 2019

3 answers

29

GATE CSE 2015 Set 1 | Question: GA-10
The probabilities that a student passes in mathematics, physics and chemistry are $m,p$ and $c$ respectively. Of these subjects, the student has $75\%$ chance of passing in at least one, a $50\%$ ... Only relation I is true. Only relation II is true. Relations II and III are true. Relations I and III are true.

The probabilities that a student passes in mathematics, physics and chemistry are $m,p$ and $c$ respectively. Of these subjects, the student has $75\%$ chance of passing ...

12.5k views

commented Jul 24, 2019

4 answers

30

GATE CSE 2015 Set 2 | Question: GA-6
If the list of letters $P$, $R$, $S$, $T$, $U$ is an arithmetic sequence, which of the following are also in arithmetic sequence? $2P, 2R, 2S, 2T, 2U$ $P-3, R-3, S-3, T-3, U-3$ $P^2, R^2, S^2, T^2, U^2$ I only I and II II and III I and III

If the list of letters $P$, $R$, $S$, $T$, $U$ is an arithmetic sequence, which of the following are also in arithmetic sequence?$2P, 2R, 2S, 2T, 2U$$P-3, R-3, S-3, T-3, ...

4.4k views

commented Jul 24, 2019

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