Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by ShouvikSVK
4
answers
1
GATE CSE 1999 | Question: 1.1
Suppose that the expectation of a random variable $X$ is $5$. Which of the following statements is true? There is a sample point at which $X$ has the value $5$. There is a sample point at which $X$ has value greater than $5$. There is a sample point at which $X$ has a value greater than equal to $5$. None of the above.
Suppose that the expectation of a random variable $X$ is $5$. Which of the following statements is true?There is a sample point at which $X$ has the value $5$.There is a ...
10.2k
views
commented
Nov 12, 2022
Probability
gate1999
probability
expectation
easy
+
–
3
answers
2
GATE CSE 2022 | Question: 53
Consider two files systems $\text{A}$ and $\text{B}$, that use contiguous allocation and linked allocation, respectively. A file of size $100$ blocks is already stored in $\text{A}$ and also in $\text{B}$. Now, consider inserting a new block in the middle of ... $\text{B}$ are $n_{A}$ and $n_{B}$, respectively, then the value of $n_{A} + n_{B}$ is__________________.
Consider two files systems $\text{A}$ and $\text{B}$, that use contiguous allocation and linked allocation, respectively. A file of size $100$ blocks is already stored in...
9.8k
views
commented
Feb 19, 2022
Operating System
gatecse-2022
numerical-answers
operating-system
file-system
2-marks
+
–
2
answers
3
GATE CSE 2022 | Question: 47
Consider a network with three routers $\text{P, Q, R}$ shown in the figure below. All the links have cost of unity. The routers exchange distance vector routing information and have converged on the routing tables, after which the link $\text{Q-R}$ ... off to one decimal place) between $\text{P}$ and $\text{Q},$ leading to count-to-infinity problem, is _______________.
Consider a network with three routers $\text{P, Q, R}$ shown in the figure below. All the links have cost of unity.The routers exchange distance vector routing informatio...
9.8k
views
commented
Feb 19, 2022
Computer Networks
gatecse-2022
numerical-answers
computer-networks
routing
distance-vector-routing
2-marks
+
–
3
answers
4
GATE CSE 2022 | Question: 7
Which one of the following facilitates transfer of bulk data from hard disk to main memory with the highest throughput? $\text{DMA}$ based $\text{I/O}$ transfer Interrupt driven $\text{I/O}$ transfer Polling based $\text{I/O}$ transfer Programmed $\text{I/O}$ transfer
Which one of the following facilitates transfer of bulk data from hard disk to main memory with the highest throughput?$\text{DMA}$ based $\text{I/O}$ transferInterrupt d...
5.2k
views
commented
Feb 18, 2022
CO and Architecture
gatecse-2022
co-and-architecture
dma
1-mark
+
–
1
answer
5
GATE CSE 2022 | Question: 3
Which one of the following statements is $\text{TRUE}?$ The $\textit{LALR}(1)$ parser for a grammar $\textit{G}$ cannot have reduce-reduce conflict if the $\textit{LR}(1)$ parser for $\textit{G}$ does not have reduce-reduce ... Data flow analysis is necessary for run-time memory management. $\textit{LR}(1)$ parsing is sufficient for deterministic context-free languages.
Which one of the following statements is $\text{TRUE}?$The $\textit{LALR}(1)$ parser for a grammar $\textit{G}$ cannot have reduce-reduce conflict if the $\textit{LR}(1)$...
7.4k
views
commented
Feb 18, 2022
Compiler Design
gatecse-2022
compiler-design
parsing
1-mark
+
–
3
answers
6
GATE CSE 2014 Set 3 | Question: 40
Consider a hash table with $100$ slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first $3$ slots are unfilled after the first $3$ insertions? $(97 \times 97 \times 97) / 100^3$ $(99 \times 98 \times 97) / 100^3$ $(97 \times 96 \times 95) / 100^3$ $(97 \times 96 \times 95 / (3! \times 100^3)$
Consider a hash table with $100$ slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first $3$ slots are unfi...
22.1k
views
commented
Feb 3, 2022
DS
gatecse-2014-set3
data-structures
hashing
probability
normal
+
–
2
answers
7
GATE CSE 2021 Set 2 | Question: 27
Assume a two-level inclusive cache hierarchy, $L1$ and $L2$, where $L2$ is the larger of the two. Consider the following statements. $S_1$: Read misses in a write through $L1$ cache do not result in writebacks of dirty lines to the $L2$ $S_2$: Write ... false $S_1$ is false and $S_2$ is true $S_1$ is true and $S_2$ is true $S_1$ is false and $S_2$ is false
Assume a two-level inclusive cache hierarchy, $L1$ and $L2$, where $L2$ is the larger of the two. Consider the following statements.$S_1$: Read misses i...
8.1k
views
comment edited
Feb 2, 2022
CO and Architecture
gatecse-2021-set2
co-and-architecture
cache-memory
2-marks
+
–
3
answers
8
Reducibility
If L1 is reducible to L2 and L1 is recursively enumerable then what can we say about L2?
If L1 is reducible to L2 and L1 is recursively enumerable then what can we say about L2?
799
views
answered
Jan 28, 2022
Theory of Computation
theory-of-computation
+
–
3
answers
9
GATE CSE 2021 Set 2 | Question: 28
Suppose we want to design a synchronous circuit that processes a string of $0$'s and $1$'s. Given a string, it produces another string by replacing the first $1$ in any subsequence of consecutive $1$'s by a $0$ ... $\begin{array}{l} t=s+b \\ y=s \overline{b} \end{array}$
Suppose we want to design a synchronous circuit that processes a string of $0$’s and $1$’s. Given a string, it produces another string by replacing the first $1$ in a...
8.6k
views
commented
Jan 27, 2022
Theory of Computation
gatecse-2021-set2
theory-of-computation
finite-automata
2-marks
+
–
3
answers
10
GATE IT 2008 | Question: 15
A processor that has the carry, overflow and sign flag bits as part of its program status word (PSW) performs addition of the following two $2's$ complement numbers $01001101$ and $11101001$. After the execution of this addition operation, the status of the carry, overflow and sign flags, respectively will be: $1, 1, 0$ $1, 0, 0$ $0, 1, 0$ $1, 0, 1$
A processor that has the carry, overflow and sign flag bits as part of its program status word (PSW) performs addition of the following two $2's$ complement numbers $0100...
14.5k
views
commented
Jan 23, 2022
Digital Logic
gateit-2008
digital-logic
number-representation
normal
+
–
1
answer
11
GATE CSE 1998 | Question: 2.15
Faster access to non-local variables is achieved using an array of pointers to activation records called a stack heap display activation tree
Faster access to non-local variables is achieved using an array of pointers to activation records called a stackheapdisplayactivation tree
8.8k
views
commented
Jan 21, 2022
Compiler Design
gate1998
programming
compiler-design
normal
runtime-environment
+
–
3
answers
12
GATE CSE 2009 | Question: 42
Which of the following statements are TRUE? There exist parsing algorithms for some programming languages whose complexities are less than $\Theta(n^3)$ A programming language which allows recursion can be implemented with static storage allocation. No L-attributed ... both source language and intermediate code level. I and II I and IV III and IV I, III and IV
Which of the following statements are TRUE?There exist parsing algorithms for some programming languages whose complexities are less than $\Theta(n^3)$A programming langu...
18.4k
views
commented
Jan 21, 2022
Compiler Design
gatecse-2009
compiler-design
parsing
normal
+
–
9
answers
13
GATE CSE 2005 | Question: 61
Consider line number $3$ of the following C-program. int main() { /*Line 1 */ int I, N; /*Line 2 */ fro (I=0, I<N, I++); /*Line 3 */ } Identify the compiler’s response about this line while creating the object-module: No compilation error Only a lexical error Only syntactic errors Both lexical and syntactic errors
Consider line number $3$ of the following C-program.int main() { /*Line 1 */ int I, N; /*Line 2 */ fro (I=0, I<N, I++); /*Line 3 */ }Identify the compiler’s response ab...
21.7k
views
commented
Jan 21, 2022
Compiler Design
gatecse-2005
compiler-design
compilation-phases
normal
+
–
8
answers
14
GATE IT 2007 | Question: 63
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a message to the root of the tree. The root then sends the message back down to router $j$ ... mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a mess...
19.0k
views
commented
Jan 15, 2022
Computer Networks
gateit-2007
computer-networks
routing
binary-tree
normal
+
–
2
answers
15
GATE IT 2006 | Question: 80
Let $L$ be a regular language. Consider the constructions on $L$ below: repeat $(L) = \{ww \mid w \in L\}$ prefix $(L) = \{u \mid ∃v : uv \in L\}$ suffix $(L) = \{v \mid ∃u : uv \in L\}$ half $(L) = \{u \mid ∃v : | v | = | u | \text{ and } uv \in L\}$ Which of the constructions could lead to a non-regular language? Both I and IV Only I Only IV Both II and III
Let $L$ be a regular language. Consider the constructions on $L$ below:repeat $(L) = \{ww \mid w \in L\}$prefix $(L) = \{u \mid ∃v : uv \in L\}$suffix $(L) = \{v \mid...
9.4k
views
commented
Jan 13, 2022
Theory of Computation
gateit-2006
theory-of-computation
normal
regular-language
+
–
3
answers
16
GATE CSE 2005 | Question: 85-a
Consider the following floating-point format. Mantissa is a pure fraction in sign-magnitude form. The decimal number $0.239 \times 2^{13}$ has the following hexadecimal representation (without normalization and rounding off): $\text{0D 24}$ $\text{0D 4D}$ $\text{4D 0D}$ $\text{4D 3D}$
Consider the following floating-point format.Mantissa is a pure fraction in sign-magnitude form.The decimal number $0.239 \times 2^{13}$ has the following hexadecimal rep...
18.6k
views
commented
Jan 13, 2022
Digital Logic
gatecse-2005
digital-logic
number-representation
floating-point-representation
normal
+
–
2
answers
17
GATE CSE 1995 | Question: 2.13
A unit vector perpendicular to both the vectors $a=2i-3j+k$ and $b=i+j-2k$ is: $\frac{1}{\sqrt{3}} (i+j+k)$ $\frac{1}{3} (i+j-k)$ $\frac{1}{3} (i-j-k)$ $\frac{1}{\sqrt{3}} (i+j-k)$
A unit vector perpendicular to both the vectors $a=2i-3j+k$ and $b=i+j-2k$ is:$\frac{1}{\sqrt{3}} (i+j+k)$$\frac{1}{3} (i+j-k)$$\frac{1}{3} (i-j-k)$$\frac{1}{\sqrt{3}} (i...
4.2k
views
commented
Jan 9, 2022
Linear Algebra
gate1995
linear-algebra
normal
vector-space
+
–
5
answers
18
GATE CSE 1996 | Question: 2.18
A $1000$ $\text{Kbyte}$ memory is managed using variable partitions but no compaction. It currently has two partitions of sizes $200$ $\text{Kbyte}$ and $260$ $\text{Kbyte}$ respectively. The smallest allocation request in $\text{Kbyte}$ that could be denied is for $151$ $181$ $231$ $541$
A $1000$ $\text{Kbyte}$ memory is managed using variable partitions but no compaction. It currently has two partitions of sizes $200$ $\text{Kbyte}$ and $260$ $\text{Kbyt...
21.2k
views
commented
Jan 9, 2022
Operating System
gate1996
operating-system
memory-management
normal
+
–
4
answers
19
GATE CSE 2007 | Question: 27
Consider the set of (column) vectors defined by$X = \left \{x \in R^3 \mid x_1 + x_2 + x_3 = 0, \text{ where } x^T = \left[x_1,x_2,x_3\right]^T\right \}$ ... independent set, but it does not span $X$ and therefore is not a basis of $X$. $X$ is not a subspace of $R^3$. None of the above
Consider the set of (column) vectors defined by$$X = \left \{x \in R^3 \mid x_1 + x_2 + x_3 = 0, \text{ where } x^T = \left[x_1,x_2,x_3\right]^T\right \}$$.Which of the f...
16.6k
views
commented
Jan 8, 2022
Linear Algebra
gatecse-2007
linear-algebra
normal
vector-space
+
–
14
answers
20
GATE CSE 2021 Set 2 | Question: 24
Suppose that $P$ is a $4 \times 5$ matrix such that every solution of the equation $\text{Px=0}$ is a scalar multiple of $\begin{bmatrix} 2 & 5 & 4 &3 & 1 \end{bmatrix}^T$. The rank of $P$ is __________
Suppose that $P$ is a $4 \times 5$ matrix such that every solution of the equation $\text{Px=0}$ is a scalar multiple of $\begin{bmatrix} 2 & 5 & 4 &3 & 1 \end{bmatrix}^T...
18.7k
views
commented
Jan 7, 2022
Linear Algebra
gatecse-2021-set2
numerical-answers
linear-algebra
matrix
rank-of-matrix
1-mark
+
–
4
answers
21
GATE CSE 2014 Set 1 | Question: 5
The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is ___________
The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is ___________
14.6k
views
comment edited
Jan 6, 2022
Linear Algebra
gatecse-2014-set1
linear-algebra
eigen-value
numerical-answers
normal
+
–
3
answers
22
GATE CSE 2021 Set 2 | Question: 4
The format of the single-precision floating point representation of a real number as per the $\text{IEEE 754}$ ... and mantissa $=0000000000000000000000001$ exponent $=00000001$ and mantissa $=0000000000000000000000000$ exponent $=00000001$ and mantissa $=0000000000000000000000001$
The format of the single-precision floating point representation of a real number as per the $\text{IEEE 754}$ standard is as follows:$$\begin{array}{|c|c|c|} \hline \tex...
10.2k
views
commented
Jan 3, 2022
Digital Logic
gatecse-2021-set2
digital-logic
number-representation
ieee-representation
1-mark
+
–
2
answers
23
GATE CSE 2008 | Question: 4
In the IEEE floating point representation the hexadecimal value $0\text{x}00000000$ corresponds to The normalized value $2^{-127}$ The normalized value $2^{-126}$ The normalized value $+0$ The special value $+0$
In the IEEE floating point representation the hexadecimal value $0\text{x}00000000$ corresponds toThe normalized value $2^{-127}$The normalized value $2^{-126}$The normal...
12.9k
views
commented
Jan 3, 2022
Digital Logic
gatecse-2008
digital-logic
floating-point-representation
ieee-representation
easy
+
–
5
answers
24
GATE CSE 2010 | Question: 51
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 the edge $\{i, j\}$ ... weight of a path $P$ from vertex $1$ to vertex $2$ in this graph such that $P$ contains at most $3$ edges? $7$ $8$ $9$ $10$
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 the edge $\{i, j\}$$$W=\begin{pmatrix} 0...
14.9k
views
commented
Dec 30, 2021
Algorithms
gatecse-2010
normal
algorithms
spanning-tree
+
–
5
answers
25
GATE CSE 2017 Set 1 | Question: 19
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ ...
20.6k
views
commented
Dec 28, 2021
Probability
gatecse-2017-set1
probability
numerical-answers
normal-distribution
+
–
3
answers
26
GATE IT 2006 | Question: 72
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If only the root node does not satisfy the heap property, the algorithm to convert the complete binary tree into a heap has the best asymptotic time complexity of $O (n)$ $O (\log n)$ $O (n \log n)$ $O (n \log \log n)$
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If only the root node does not satisfy...
7.6k
views
commented
Dec 24, 2021
DS
gateit-2006
data-structures
binary-heap
easy
+
–
6
answers
27
GATE CSE 2008 | Question: 46
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient algorithm ... $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ None of the above, as the tree cannot be uniquely determined
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P...
39.1k
views
commented
Dec 24, 2021
DS
gatecse-2008
data-structures
binary-search-tree
normal
+
–
4
answers
28
GATE CSE 1989 | Question: 4-vii
In the graph shown above, the depth-first spanning tree edges are marked with a $’ T’$. Identify the forward, backward, and cross edges.
In the graph shown above, the depth-first spanning tree edges are marked with a $’ T’$. Identify the forward, backward, and cross edges.
2.8k
views
commented
Dec 22, 2021
Algorithms
gate1989
descriptive
algorithms
graph-algorithms
spanning-tree
depth-first-search
+
–
10
answers
29
GATE CSE 2005 | Question: 82a
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$. Consider the edge $e$ having the minimum weight amongst all those edges that ... of $G$ the weighted shortest path from $s$ to $t$ each path from $s$ to $t$ the weighted longest path from $s$ to $t$
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$...
12.8k
views
commented
Dec 21, 2021
Algorithms
gatecse-2005
algorithms
graph-algorithms
normal
+
–
6
answers
30
OS:- Round Robin scheduling
If we have only one process in ready queue with burst time "m", then how many context switching will happen using round robing scheduling with time quantum q ,where q<m.Assume that dispatching the process first time is not counted as a context switch.
If we have only one process in ready queue with burst time "m", then how many context switching will happen using round robing scheduling with time quantum q ,where q<m.A...
4.6k
views
answered
Nov 30, 2021
Operating System
operating-system
round-robin-scheduling
context-switch
process-scheduling
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register