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 ayush3298
3
answers
1
GATE CSE 1999 | Question: 13
An instruction pipeline consists of $4$ stages - Fetch $(F)$, Decode field $(D)$, Execute $(E)$ and Result Write $(W)$. The $5$ instructions in a certain instruction sequence need these stages for the different number of clock cycles as shown by the ... $5$ instructions.
An instruction pipeline consists of $4$ stages – Fetch $(F)$, Decode field $(D)$, Execute $(E)$ and Result Write $(W)$. The $5$ instructions in a certain instruction se...
10.5k
views
commented
Dec 13, 2021
CO and Architecture
gate1999
co-and-architecture
pipelining
normal
numerical-answers
+
–
6
answers
2
GATE IT 2007 | Question: 81
Let $P_1, P_2,\dots , P_n $be $n$ points in the $xy$-plane such that no three of them are collinear. For every pair of points $P_i$ and $P_j$, let $L_{ij}$ be the line passing through them. Let $L_{ab}$ ... $\Theta\left(n\right)$ $\Theta\left(n\log n\right)$ $\Theta\left(n\log^2 n\right)$ $\Theta\left(n^2\right)$
Let $P_1, P_2,\dots , P_n $be $n$ points in the $xy$-plane such that no three of them are collinear. For every pair of points $P_i$ and $P_j$, let $L_{ij}$ be the line pa...
6.3k
views
commented
Nov 26, 2021
Algorithms
gateit-2007
algorithms
time-complexity
normal
+
–
10
answers
3
GATE CSE 2017 Set 1 | Question: 48
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i ...
21.8k
views
commented
Nov 22, 2021
Algorithms
gatecse-2017-set1
algorithms
normal
numerical-answers
searching
+
–
1
answer
4
GATE CSE 1993 | Question: 15
Consider the recursive algorithm given below: procedure bubblesort (n); var i,j: index; temp : item; begin for i:=1 to n-1 do if A[i] > A[i+1] then begin temp := A[i]; A[i] := A[i+1]; A[i+1] := temp; end; bubblesort (n-1) ... executed when the algorithm is run with value $n$. Set up the recurrence relation by defining $a_n$ in terms of $a_{n-1}$. Solve for $a_n$.
Consider the recursive algorithm given below:procedure bubblesort (n); var i,j: index; temp : item; begin for i:=1 to n-1 do if A[i] A[i+1] then begin temp := A[i]; A[i]...
2.8k
views
commented
Nov 15, 2021
Algorithms
gate1993
algorithms
recurrence-relation
normal
descriptive
+
–
4
answers
5
GATE CSE 2004 | Question: 40
Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among $\text{union, intersection, membership, cardinality}$ will be the slowest? $\text{union}$ only $\text{intersection, membership}$ $\text{membership, cardinality}$ $\text{union, intersection}$
Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among $\text{union, intersection, membership, cardinality}$ wil...
19.2k
views
commented
Oct 22, 2021
DS
gatecse-2004
data-structures
linked-list
normal
+
–
2
answers
6
GATE CSE 1999 | Question: 11b
Write a constant time algorithm to insert a node with data $D$ just before the node with address $p$ of a singly linked list.
Write a constant time algorithm to insert a node with data $D$ just before the node with address $p$ of a singly linked list.
3.2k
views
commented
Oct 22, 2021
DS
gate1999
data-structures
linked-list
descriptive
+
–
3
answers
7
GATE CSE 2012 | Question: 53
For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\varepsilon$ is the empty string, \$ indicates end of input, and, $ ... $ E2 : B \rightarrow S, S \rightarrow \varepsilon$ $ E3 : B \rightarrow S$
For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\var...
17.4k
views
commented
Jan 23, 2021
Compiler Design
normal
gatecse-2012
compiler-design
parsing
+
–
3
answers
8
GATE CSE 2014 Set 1 | Question: 3
Let $G=(V,E)$ be a directed graph where $V$ is the set of vertices and $E$ the set of edges. Then which one of the following graphs has the same strongly connected components as $G$ ? $G_1$ = $(V,E_1)$ ... $u$ to $v$ in $E\}$ $G_4$ = $(V_4,E)$ where $V_4$ is the set of vertices in $G$ which are not isolated
Let $G=(V,E)$ be a directed graph where $V$ is the set of vertices and $E$ the set of edges. Then which one of the following graphs has the same strongly connected compon...
16.9k
views
commented
Jan 20, 2021
DS
gatecse-2014-set1
data-structures
graph-theory
ambiguous
+
–
7
answers
9
GATE CSE 2001 | Question: 2.14
Consider an undirected, unweighted graph $G$. Let a breadth-first traversal of $G$ be done starting from a node $r$. Let $d(r,u)$ and $d(r,v)$ be the lengths of the shortest paths from $r$ to $u$ and $v$ respectively in $G$. If $u$ is visited before $v$ during the breadth- ... correct? $d(r,u) < d(r,v)$ $d(r,u) > d(r,v)$ $d(r,u) \leq d(r,v)$ None of the above
Consider an undirected, unweighted graph $G$. Let a breadth-first traversal of $G$ be done starting from a node $r$. Let $d(r,u)$ and $d(r,v)$ be the lengths of the short...
14.1k
views
commented
Jan 9, 2021
Algorithms
gatecse-2001
algorithms
graph-algorithms
normal
graph-search
+
–
5
answers
10
GATE IT 2008 | Question: 23
What is the probability that in a randomly chosen group of $r$ people at least three people have the same birthday? $1-\dfrac{365-364 \dots (365-r+1)}{365^{r}}$ ... $\dfrac{365 \cdot 364 \dots (365-r+1)}{365^{r}}$
What is the probability that in a randomly chosen group of $r$ people at least three people have the same birthday?$1-\dfrac{365-364 \dots (365-r+1)}{365^{r}}$$\dfrac{365...
8.7k
views
commented
Jan 8, 2021
Probability
gateit-2008
probability
normal
+
–
5
answers
11
GATE CSE 2014 Set 3 | Question: 16
Let $\Sigma$ be a finite non-empty alphabet and let $2^{\Sigma^*}$ be the power set of $\Sigma^*$. Which one of the following is TRUE? Both $2^{\Sigma^*}$ and $\Sigma^*$ are countable $2^{\Sigma^*}$ is countable and $\Sigma^*$ is uncountable $2^{\Sigma^*}$ is uncountable and $\Sigma^*$ is countable Both $2^{\Sigma^*}$ and $\Sigma^*$ are uncountable
Let $\Sigma$ be a finite non-empty alphabet and let $2^{\Sigma^*}$ be the power set of $\Sigma^*$. Which one of the following is TRUE? Both $2^{\Sigma^*}$ and $\Sigma^*$ ...
9.6k
views
commented
Dec 10, 2020
Theory of Computation
gatecse-2014-set3
theory-of-computation
normal
countable-uncountable-set
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register