Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
anshu
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by anshu
2
answers
1
GATE CSE 2015 Set 2 | Question: 32
Consider two relations $R_1(A,B)$ with the tuples $(1,5), (3,7)$ and $R_2(A,C) = (1,7),(4,9)$. Assume that $R(A,B,C)$ is the full natural outer join of $R_1$ and $R_2$. Consider the following tuples of the form $(A,B,C):$ ... contains all $a, b, c, d, e, f, g$. $R$ contains $e, f, g$ but not $a, b$. $R$ contains $e$ but not $f, g$.
Consider two relations $R_1(A,B)$ with the tuples $(1,5), (3,7)$ and $R_2(A,C) = (1,7),(4,9)$.Assume that $R(A,B,C)$ is the full natural outer join of $R_1$ and $R_2$. Co...
8.9k
views
commented
Feb 12, 2015
Databases
gatecse-2015-set2
databases
normal
natural-join
+
–
7
answers
2
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.1k
views
answered
Feb 12, 2015
Calculus
gatecse-2015-set2
continuity
functions
normal
+
–
1
answer
3
Number of onto function
Total onto function from a to b with cardinality 4 and 3 respectively??
Total onto function from a to b with cardinality 4 and 3 respectively??
834
views
commented
Feb 8, 2015
Set Theory & Algebra
discrete-mathematics
functions
+
–
7
answers
4
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.7k
views
answered
Feb 6, 2015
Algorithms
gatecse-2004
algorithms
p-np-npc-nph
easy
isro2017
out-of-gate-syllabus
+
–
6
answers
5
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.7k
views
answered
Feb 6, 2015
Set Theory & Algebra
gatecse-2004
set-theory&algebra
easy
relations
+
–
4
answers
6
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.0k
views
answered
Feb 6, 2015
CO and Architecture
gatecse-2004
co-and-architecture
addressing-modes
easy
+
–
3
answers
7
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.4k
views
answered
Feb 6, 2015
DS
gatecse-2004
data-structures
tree
easy
+
–
8
answers
8
GATE CSE 2005 | Question: 50
Let $G(x) = \frac{1}{(1-x)^2} = \sum\limits_{i=0}^\infty g(i)x^i$, where $|x| < 1$. What is $g(i)$? $i$ $i+1$ $2i$ $2^i$
Let $G(x) = \frac{1}{(1-x)^2} = \sum\limits_{i=0}^\infty g(i)x^i$, where $|x| < 1$. What is $g(i)$?$i$$i+1$$2i$$2^i$
8.1k
views
commented
Feb 6, 2015
Combinatory
gatecse-2005
normal
generating-functions
+
–
4
answers
9
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.1k
views
commented
Feb 6, 2015
Set Theory & Algebra
gatecse-2005
set-theory&algebra
lattice
normal
+
–
4
answers
10
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.0k
views
answered
Feb 6, 2015
Set Theory & Algebra
gatecse-2005
set-theory&algebra
normal
relations
+
–
4
answers
11
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.1k
views
answered
Feb 6, 2015
Algorithms
gatecse-2005
algorithms
identify-function
recursion
normal
+
–
5
answers
12
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
19.9k
views
answered
Feb 6, 2015
Operating System
gatecse-2005
operating-system
disk
easy
+
–
7
answers
13
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...
20.9k
views
answered
Feb 6, 2015
Operating System
gatecse-2005
operating-system
io-handling
normal
+
–
3
answers
14
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
Set Theory & Algebra
gatecse-2005
set-theory&algebra
normal
group-theory
+
–
5
answers
15
GATE CSE 2007 | Question: 8, ISRO2011-31
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates? $7$ $8$ $9$ $10$
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates?$7$$8$$9$$10$
21.1k
views
commented
Feb 6, 2015
Digital Logic
gatecse-2007
digital-logic
normal
isro2011
decoder
+
–
6
answers
16
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.4k
views
answered
Feb 5, 2015
Operating System
gatecse-2006
operating-system
process-synchronization
normal
+
–
4
answers
17
GATE CSE 2006 | Question: 59
Consider the following translation scheme. $ S\rightarrow ER$ $ R\rightarrow *E\left \{ \text{print}(\text{ }*\text{'}); \right \} R\mid \varepsilon $ $ E\rightarrow F+E\left \{ \text{print}(\text{ }+\text{'}); \right \}\mid F $ ... $2 * 3 + 4$ $2 * +3 \ 4$ $2 \ 3 * 4 +$ $2 \ 3 \ 4+*$
Consider the following translation scheme. $ S\rightarrow ER$$ R\rightarrow *E\left \{ \text{print}(\text{‘}*\text{’}); \right \} R\mid \varepsilon $$ E\rightarrow F+...
10.9k
views
commented
Feb 5, 2015
Compiler Design
gatecse-2006
compiler-design
grammar
normal
+
–
8
answers
18
GATE CSE 2006 | Question: 46
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets are ready and immediately available for transmission. If every $5$th packet that $A$ ... what is the number of packets that $A$ will transmit for sending the message to $B$? $12$ $14$ $16$ $18$
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets ...
40.8k
views
commented
Feb 5, 2015
Computer Networks
gatecse-2006
computer-networks
sliding-window
normal
+
–
7
answers
19
GATE CSE 2006 | Question: 40
Consider numbers represented in 4-bit Gray code. Let $ h_{3}h_{2}h_{1}h_{0}$ be the Gray code representation of a number $n$ and let $ g_{3}g_{2}g_{1}g_{0}$ be the Gray code of $ (n+1)(modulo 16)$ ... $ g_{3}(h_{3}h_{2}h_{1}h_{0})=\sum (0,1,6,7,10,11,12,13) $
Consider numbers represented in 4-bit Gray code. Let $ h_{3}h_{2}h_{1}h_{0}$ be the Gray code representation of a number $n$ and let $ g_{3}g_{2}g_{1}g_{0}$ be the Gray...
20.3k
views
commented
Feb 5, 2015
Digital Logic
gatecse-2006
digital-logic
number-representation
binary-codes
normal
+
–
6
answers
20
GATE IT 2007 | Question: 40
What is the final value stored in the linear feedback shift register if the input is $101101$? $0110$ $1011$ $1101$ $1111$
What is the final value stored in the linear feedback shift register if the input is $101101$?$0110$$1011$$1101$$1111$
6.4k
views
commented
Feb 5, 2015
Digital Logic
gateit-2007
digital-logic
circuit-output
normal
+
–
10
answers
21
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.5k
views
comment edited
Feb 5, 2015
Compiler Design
gatecse-2003
compiler-design
syntax-directed-translation
normal
+
–
6
answers
22
GATE CSE 2006 | Question: 63, UGCNET-June2012-III: 45
A computer system supports $32$-bit virtual addresses as well as $32$-bit physical addresses. Since the virtual address space is of the same size as the physical address space, the operating system designers decide to ... more efficient now Hardware support for memory management is no longer needed CPU scheduling can be made more efficient now
A computer system supports $32$-bit virtual addresses as well as $32$-bit physical addresses. Since the virtual address space is of the same size as the physical address ...
25.6k
views
commented
Feb 5, 2015
Operating System
gatecse-2006
operating-system
virtual-memory
normal
ugcnetcse-june2012-paper3
+
–
9
answers
23
GATE CSE 2006 | Question: 42
A CPU has a five-stage pipeline and runs at $1$ GHz frequency. Instruction fetch happens in the first stage of the pipeline. A conditional branch instruction computes the target address and evaluates the condition in the third stage of the pipeline. The processor stops fetching new ... : $\text{1.0 second}$ $\text{1.2 seconds}$ $\text{1.4 seconds}$ $\text{1.6 seconds}$
A CPU has a five-stage pipeline and runs at $1$ GHz frequency. Instruction fetch happens in the first stage of the pipeline. A conditional branch instruction computes the...
20.9k
views
commented
Feb 4, 2015
CO and Architecture
gatecse-2006
co-and-architecture
pipelining
normal
+
–
6
answers
24
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.1k
views
answered
Feb 4, 2015
Mathematical Logic
gatecse-2006
mathematical-logic
normal
first-order-logic
+
–
5
answers
25
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...
14.7k
views
answered
Feb 4, 2015
Probability
gatecse-2006
probability
expectation
normal
+
–
7
answers
26
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.6k
views
answered
Feb 4, 2015
Algorithms
gatecse-2006
algorithms
spanning-tree
normal
+
–
11
answers
27
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...
15.9k
views
answered
Feb 4, 2015
CO and Architecture
gatecse-2006
co-and-architecture
machine-instruction
easy
isro2009
+
–
4
answers
28
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.8k
views
answered
Feb 4, 2015
Operating System
gatecse-2006
operating-system
process-scheduling
normal
isro2009
+
–
5
answers
29
GATE CSE 2006 | Question: 3
The set $\{1,2,3,5,7,8,9\}$ under multiplication modulo $10$ is not a group. Given below are four possible reasons. Which one of them is false? It is not closed $2$ does not have an inverse $3$ does not have an inverse $8$ does not have an inverse
The set $\{1,2,3,5,7,8,9\}$ under multiplication modulo $10$ is not a group. Given below are four possible reasons. Which one of them is false?It is not closed$2$ does no...
9.7k
views
commented
Feb 4, 2015
Set Theory & Algebra
gatecse-2006
set-theory&algebra
group-theory
normal
+
–
5
answers
30
GATE CSE 2007 | Question: 33
Define the connective $*$ for the Boolean variables $X$ and $Y$ as: $X * Y = XY + X'Y'.$ Let $Z = X * Y$. Consider the following expressions $P$, $Q$ and $R$. $P : X = Y * Z, \\ Q :Y = X * Z, \\ R : X *Y * Z = 1$ Which of the following is TRUE? Only $P$ and $Q$ are valid. Only $Q$ and $R$ are valid. Only $P$ and $R$ are valid. All $P$, $Q$, $R$ are valid.
Define the connective $*$ for the Boolean variables $X$ and $Y$ as: $$X * Y = XY + X'Y'.$$ Let $Z = X * Y$. Consider the following expressions $P$, $Q$ and $R$.$$P : X = ...
8.8k
views
commented
Feb 4, 2015
Digital Logic
gatecse-2007
digital-logic
normal
boolean-algebra
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register