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 VYAN_jy
9
answers
1
GATE IT 2008 | Question: 39
Consider a CPU where all the instructions require $7$ clock cycles to complete execution. There are $140$ instructions in the instruction set. It is found that $125$ control signals are needed to be generated by the control unit. While designing the horizontal ... size of the control word and control address register? $125, 7$ $125, 10$ $135, 9$ $135, 10$
Consider a CPU where all the instructions require $7$ clock cycles to complete execution. There are $140$ instructions in the instruction set. It is found that $125$ cont...
17.8k
views
commented
Feb 2, 2023
CO and Architecture
gateit-2008
co-and-architecture
microprogramming
normal
+
–
1
answer
2
GATE Overflow Test Series | Mock GATE | Test 5 | Question: 21
Which of the following is/are correct? (Mark all the appropriate choices) If $G$ is an abelian group of order $36,G$ has an element of order $3$. If $G$ is an abelian group of order $308,G$ has an element of order $11$. If $G$ is ... $5$. If $G$ is an abelian group of order $308,G$ has an element of order $6$.
Which of the following is/are correct? (Mark all the appropriate choices)If $G$ is an abelian group of order $36,G$ has an element of order $3$.If $G$ is an abelian group...
412
views
commented
Jan 26, 2023
Set Theory & Algebra
go2025-mockgate-5
set-theory&algebra
group-theory
abelian-group
multiple-selects
1-mark
+
–
7
answers
3
GATE CSE 2012 | Question: 45
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during ... Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the t...
38.4k
views
commented
Jan 23, 2023
Computer Networks
gatecse-2012
computer-networks
congestion-control
normal
+
–
1
answer
4
GATE Overflow Test Series | Mock GATE | Test 4 | Question: 16
What is the worst case time complexity in building a heap of $n$ elements? $\Theta(n\log n)$ $\Theta(n^2)$ $\Theta(n*\log n *\log n)$ $\Theta(n)$
What is the worst case time complexity in building a heap of $n$ elements?$\Theta(n\log n)$$\Theta(n^2)$$\Theta(n*\log n *\log n)$$\Theta(n)$
241
views
commented
Jan 16, 2023
DS
go2025-mockgate-4
binary-heap
data-structures
time-complexity
+
–
5
answers
5
SCHEDULING
i am getting answer as 6....to calculate waiting time i have removed CPU time used by the process (BT) from total time spend inside(TAT)....not included I/O time(i think I/O is also included in waiting time)..is it correct? Three processors P,Q,R are started at times 0 ,2 ,3 ... TC2 P 0 2 1 5 3 Q 2 3(L) 3 3 1 R 3 1(H) 2 3 1 What is the average waiting time (in milliseconds) ?
i am getting answer as 6....to calculate waiting time i have removed CPU time used by the process (BT) from total time spend inside(TAT)....not included I/O time(i think ...
5.0k
views
commented
Dec 25, 2022
4
answers
6
GATE CSE 2014 Set 3 | Question: 13
Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________.
Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checkin...
17.1k
views
comment edited
Dec 22, 2022
Algorithms
gatecse-2014-set3
algorithms
graph-algorithms
numerical-answers
normal
graph-search
+
–
1
answer
7
Question on Pipelining
In a pipeline the maximum ideal speed-up is 5. Let the percentage of unconditional branches in a set of typical program be 5% and that of conditional branches be 10%. If 70% of the conditional branches are taken, calculate % loss of speed-up due to branch instructions. It is very difficult to understand this question and solve it. Please help.
In a pipeline the maximum ideal speed-up is 5. Let the percentage of unconditional branches in a set of typical program be 5% and that of conditional branches be 10%. If ...
1.1k
views
commented
Nov 8, 2022
CO and Architecture
co-and-architecture
pipelining
speedup
branch-conditional-instructions
+
–
5
answers
8
GATE CSE 1997 | Question: 4.7
A priority queue $Q$ is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT $(Q, C, K)$ where $K$ is an appropriate integer key chosen by the implementation. POP is implemented as ... For a sequence of operations, the keys chosen are in non-increasing order non-decreasing order strictly increasing order strictly decreasing order
A priority queue $Q$ is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT $(Q, C, K)$ where $K$ is an appropriate integer key chosen by ...
24.5k
views
commented
Oct 22, 2022
DS
gate1997
data-structures
stack
normal
priority-queue
+
–
7
answers
9
GATE CSE 2017 Set 1 | Question: 20
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
18.8k
views
commented
Oct 21, 2022
DS
gatecse-2017-set1
data-structures
tree
easy
numerical-answers
+
–
4
answers
10
GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is...
16.2k
views
commented
Oct 20, 2022
DS
gatecse-2015-set2
data-structures
binary-heap
normal
+
–
3
answers
11
GATE CSE 2014 Set 2 | Question: 29
Consider the following schedule S of transactions $T1, T2, T3, T4:$ ... S is not conflict-serializable but is recoverable S is both conflict-serializable and recoverable S is neither conflict-serializable not is it recoverable
Consider the following schedule S of transactions $T1, T2, T3, T4:$$${\begin{array}{|l|l|l|l|}\hline\textbf{T1}& \textbf{T2}& \textbf{T3}& \textbf{T4} \\\hline& \...
28.4k
views
commented
Oct 18, 2022
Databases
gatecse-2014-set2
databases
transaction-and-concurrency
conflict-serializable
normal
+
–
4
answers
12
GATE CSE 2016 Set 1 | Question: 51
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This is done in the following ... freedom guarantee neither serializability nor deadlock-freedom guarantee serializability but not deadlock-freedom guarantee deadlock-freedom but not serializability.
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This...
21.5k
views
commented
Oct 18, 2022
Databases
gatecse-2016-set1
databases
transaction-and-concurrency
normal
+
–
8
answers
13
GATE IT 2006 | Question: 47
Consider the depth-first-search of an undirected graph with $3$ vertices $P$, $Q$, and $R$. Let discovery time $d(u)$ represent the time instant when the vertex $u$ is first visited, and finish time $f(u)$ represent the time instant when the ... are two connected components, and $Q$ and $R$ are connected There are two connected components, and $P$ and $Q$ are connected
Consider the depth-first-search of an undirected graph with $3$ vertices $P$, $Q$, and $R$. Let discovery time $d(u)$ represent the time instant when the vertex $u$ is fi...
11.1k
views
commented
Oct 17, 2022
Algorithms
gateit-2006
algorithms
graph-algorithms
normal
graph-search
depth-first-search
+
–
6
answers
14
GATE CSE 2007 | Question: 60
Consider the relation employee(name, sex, supervisorName) with name as the key, supervisorName gives the name of the supervisor of the employee under consideration. What does the following Tuple Relational Calculus query produce? ... immediate male subordinates. Names of employees with no immediate female subordinates. Names of employees with a female supervisor.
Consider the relation employee(name, sex, supervisorName) with name as the key, supervisorName gives the name of the supervisor of the employee under consideration. What ...
23.5k
views
commented
Oct 16, 2022
Databases
gatecse-2007
databases
relational-calculus
normal
+
–
2
answers
15
GATE IT 2004 | Question: 10
What is the minimum size of ROM required to store the complete truth table of an $8-bit \times 8-bit$ multiplier? $32 K \times 16$ bits $64 K \times 16$ bits $16 K \times 32$ bits $64 K \times 32$ bits
What is the minimum size of ROM required to store the complete truth table of an $8-bit \times 8-bit$ multiplier?$32 K \times 16$ bits$64 K \times 16$ bits$16 K \times 32...
6.5k
views
commented
Oct 16, 2022
Digital Logic
gateit-2004
digital-logic
normal
rom
+
–
2
answers
16
GATE CSE 1997 | Question: 6.10, ISRO2016-54
Let $R (a, b, c)$ and $S(d, e, f)$ be two relations in which $d$ is the foreign key of $S$ that refers to the primary key of $R$. Consider the following four operations $R$ and $S$ Insert into $R$ Insert ... Which of the following can cause violation of the referential integrity constraint above? Both I and IV Both II and III All of these None of these
Let $R (a, b, c)$ and $S(d, e, f)$ be two relations in which $d$ is the foreign key of $S$ that refers to the primary key of $R$. Consider the following four operations $...
10.0k
views
commented
Oct 15, 2022
Databases
gate1997
databases
referential-integrity
easy
isro2016
+
–
7
answers
17
GATE CSE 2006 | Question: 68
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. ... strictly fewer rows than Query$2$ There exist databases for which Query$4$ will encounter an integrity violation at runtime
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. ...
20.4k
views
commented
Oct 14, 2022
Databases
gatecse-2006
databases
sql
normal
+
–
7
answers
18
GATE CSE 2016 Set 2 | Question: 44
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$ ... not recursive $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive
Consider the following languages.$L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$,$L_{2} = \left\{\left\langl...
33.5k
views
commented
Oct 13, 2022
Theory of Computation
gatecse-2016-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
5
answers
19
GATE CSE 2005 | Question: 57
Consider the languages: $L_1 = \left\{ww^R \mid w \in \{0, 1\}^* \right\}$ $L_2 = \left\{w\text{#}w^R \mid w \in \{0, 1\}^* \right\}$, where $\text{#}$ ... of the following is TRUE? $L_1$ is a deterministic CFL $L_2$ is a deterministic CFL $L_3$ is a CFL, but not a deterministic CFL $L_3$ is a deterministic CFL
Consider the languages:$L_1 = \left\{ww^R \mid w \in \{0, 1\}^* \right\}$$L_2 = \left\{w\text{#}w^R \mid w \in \{0, 1\}^* \right\}$, where $\text{#}$ is a special symbol$...
8.5k
views
commented
Oct 10, 2022
Theory of Computation
gatecse-2005
theory-of-computation
context-free-language
easy
+
–
8
answers
20
GATE CSE 2016 Set 2 | Question: 11
Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex $t$ at a distance four from the root. If $t$ is the $n^{\text{th}}$ vertex in this BFS traversal, then the maximum possible value of $n$ is __________
Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex $t$ at a distance four from the root. If $t$ is the $n^{\text{th}...
13.1k
views
commented
Oct 5, 2022
Algorithms
gatecse-2016-set2
algorithms
graph-algorithms
normal
numerical-answers
graph-search
+
–
5
answers
21
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
commented
Oct 5, 2022
Algorithms
gatecse-2003
algorithms
graph-algorithms
normal
graph-search
+
–
8
answers
22
GATE CSE 2007 | Question: 45
What is the $\text{time complexity}$ of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); } $\Theta(n^2)$ $\Theta(n \log_2n)$ $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$
What is the $\text{time complexity}$ of the following recursive function?int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); ...
32.0k
views
commented
Oct 4, 2022
Algorithms
gatecse-2007
algorithms
time-complexity
normal
+
–
4
answers
23
GATE CSE 2003 | Question: 70
Let $G= (V,E)$ be a directed graph with $n$ vertices. A path from $v_i$ to $v_j$ in $G$ is a sequence of vertices ($v_{i},v_{i+1}, \dots , v_j$) such that $(v_k, v_{k+1}) \in E$ for all $k$ in $i$ through $j-1$. A simple path is a path in ... length from $j$ to $k$ If there exists a path from $j$ to $k$, every simple path from $j$ to $k$ contains at most $A[j,k]$ edges
Let $G= (V,E)$ be a directed graph with $n$ vertices. A path from $v_i$ to $v_j$ in $G$ is a sequence of vertices ($v_{i},v_{i+1}, \dots , v_j$) such that $(v_k, v_{k+1})...
17.6k
views
commented
Oct 3, 2022
Algorithms
gatecse-2003
algorithms
graph-algorithms
normal
+
–
3
answers
24
GATE CSE 2002 | Question: 18-b
The functionality of atomic TEST-AND-SET assembly language instruction is given by the following C function int TEST-AND-SET (int *x) { int y; A1: y=*x; A2: *x=1; A3: return y; } Complete the following C functions for implementing code ... -free? For the above solution, show by an example that mutual exclusion is not ensured if TEST-AND-SET instruction is not atomic?
The functionality of atomic TEST-AND-SET assembly language instruction is given by the following C functionint TEST-AND-SET (int *x) { int y; A1: y=*x; A2: *x=1; A3: retu...
3.4k
views
commented
May 15, 2022
Operating System
gatecse-2002
operating-system
process-synchronization
normal
descriptive
+
–
2
answers
25
GATE Overflow Test Series | Mock GATE | Test 2 | Question: 56
Station $A$ is sending data to station $B$ over a full-duplex error-free channel. A sliding window protocol is being used for flow control. The send and receive window size is being used for flow control with both the window ... link is $200\;\mu s.$ What is the max achievable throughput in this communication in Mega bytes per second?
Station $A$ is sending data to station $B$ over a full-duplex error-free channel. A sliding window protocol is being used for flow control. The send and receive window si...
520
views
commented
Jan 26, 2022
Computer Networks
go2025-mockgate-2
numerical-answers
normal
sliding-window-protocol
+
–
1
answer
26
GATE Overflow Test Series | Mock GATE | Test 2 | Question: 2
Four words are given of which only one is synonymous with the given word. Select the synonym. $\text{Verge}$ Crossed Slope Threshold Tend
Four words are given of which only one is synonymous with the given word. Select the synonym.$\text{Verge}$CrossedSlopeThresholdTend
174
views
commented
Jan 26, 2022
Verbal Aptitude
go2025-mockgate-2
meaning
normal
+
–
1
answer
27
GATE Overflow Test Series | Operating Systems | Test 1 | Question: 20
Consider the following multi-process synchronization solution. do { while (test_set(&lock)); lock = FALSE; } while (TRUE); Assume that the shared boolean variable lock is initialized to FALSE and the ... ) Race condition may be possible. Mutual exclusion is guaranteed. Progress is guaranteed. Bounded waiting is guaranteed.
Consider the following multi-process synchronization solution.do { while (test_set(&lock)); lock = FALSE; } while (TRUE);Assume that the shared boolean variable lock is i...
311
views
commented
Jan 16, 2022
Operating System
go2025-os-1
process-synchronization
multiple-selects
+
–
1
answer
28
GATE Overflow Test Series | Theory of Computation | Test 1 | Question: 17
Which of the following is/are correct? (Mark all the appropriate choices) For any CFG $G$ there's a CFG $G_0$ such that $G_0$ is not ambiguous and $L(G) = L(G_0).$ The CFLs are closed under ... $a \in \Sigma).$ Regular languages having prefix property can be accepted by a Deterministic Pushdown Automata by empty stack
Which of the following is/are correct? (Mark all the appropriate choices)For any CFG $G$ there's a CFG $G_0$ such that $G_0$ is not ambiguous and $L(G) = L(G_0).$The CFLs...
415
views
commented
Jan 16, 2022
Theory of Computation
go2025-toc-1
identify-class-language
multiple-selects
+
–
7
answers
29
GATE CSE 2015 Set 2 | Question: 45
Suppose you are provided with the following function declaration in the C programming language. int partition(int a[], int n); The function treats the first element of $a[\:]$ as a pivot and rearranges the array so that all elements less than or equal to the pivot is in the ... $(a, $ left_end$, k)$ $(a, n-$left_end$-1, k-$left_end$-1)$ and $(a, $left_end$, k)$
Suppose you are provided with the following function declaration in the C programming language.int partition(int a[], int n);The function treats the first element of $a[\...
16.6k
views
comment edited
Jan 10, 2022
Algorithms
gatecse-2015-set2
algorithms
normal
sorting
+
–
4
answers
30
GATE CSE 2014 Set 1 | Question: 6
Let the function ... $\theta \in (\frac{\pi}{6},\frac{\pi}{3})$ such that $f'(\theta)\neq 0$ I only II only Both I and II Neither I nor II
Let the function$$f(\theta) = \begin{vmatrix} \sin\theta & \cos\theta & \tan\theta \\ \sin(\frac{\pi}{6}) & \cos(\frac{\pi}{6}) & \tan(\frac{\pi}{6}) & \\ \sin(\frac{\pi...
13.7k
views
commented
Jan 8, 2022
Calculus
gatecse-2014-set1
calculus
differentiation
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register