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 Shreyash007
2
answers
1
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 51
A TCP connection has been established between hosts $\text{A}$ and $\text{B. A}$ receives a packet from $\text{B}$ with the following field values shown below: Sequence: $1001$ Acknowledgment: $5001$ Window size: $3000$ [ ... Payload Size: $1000]$ Sequence: $8001$ Acknowledgment: $1053$ Window size: $2000$ [TCP Payload Size: $1000]$
A TCP connection has been established between hosts $\text{A}$ and $\text{B. A}$ receives a packet from $\text{B}$ with the following field values shown below:Sequence: $...
866
views
commented
Feb 1
Computer Networks
goclasses2024-mockgate-13
goclasses
computer-networks
tcp
multiple-selects
2-marks
+
–
1
answer
2
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 8
Consider the following program execution involving 2 threads accessing the shared variable a which has been initialised to $0.$ Which of the following statement(s) is/are correct? Both threads will never finish execution ... threads will always finish execution Either both threads will finish, or none of them of will finish execution
Consider the following program execution involving 2 threads accessing the shared variable a which has been initialised to $0.$Which of the following statement(s) is/are ...
631
views
commented
Jan 23
Operating System
goclasses2024-mockgate-12
goclasses
operating-system
process-synchronization
threads
1-mark
+
–
1
answer
3
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 43
Let $\text{D}$ be a DFA with $n$ states $\& \;\text{N}$ be an NFA with $n$ states. Which of the following is/are true? If $\text{D}$ accepts some string of length $n$, then the language of $\text{D}$ is infinite ... $\mathrm{N}$ accepts some string of length $n-1$, then the language of $\mathrm{N}$ is infinite.
Let $\text{D}$ be a DFA with $n$ states $\& \;\text{N}$ be an NFA with $n$ states. Which of the following is/are true?If $\text{D}$ accepts some string of length $n$, the...
670
views
commented
Jan 23
Theory of Computation
goclasses2024-mockgate-12
goclasses
theory-of-computation
finite-automata
multiple-selects
2-marks
+
–
1
answer
4
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 22
What is the output for the following circuit? $w=\overline{b} c$ $w=b \oplus c$ $w=\overline{b \oplus c}$ $w=\overline{b}+\overline{c}$
What is the output for the following circuit?$w=\overline{b} c$$w=b \oplus c$$w=\overline{b \oplus c}$$w=\overline{b}+\overline{c}$
398
views
commented
Jan 22
Digital Logic
goclasses2024-mockgate-12
goclasses
digital-logic
combinational-circuit
multiplexer
1-mark
+
–
2
answers
5
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 63
A town has $2017$ houses. Of these $2017$ houses, $1820$ have a dog, $1651$ have a cat, and $1182$ have a turtle. If $x$ is the largest possible number of houses that have a dog, a cat, and a turtle, and $y$ is the smallest possible number of houses that have a dog, a cat, and a turtle, then $x-y$ is ______. $1182$ $638$ $563$ $619$
A town has $2017$ houses. Of these $2017$ houses, $1820$ have a dog, $1651$ have a cat, and $1182$ have a turtle. If $x$ is the largest possible number of houses that hav...
1.0k
views
commented
Jan 22
Quantitative Aptitude
goclasses2024-mockgate-12
goclasses
quantitative-aptitude
algebra
2-marks
+
–
1
answer
6
GO Classes 2024 | Weekly Quiz 7 | Linear Algebra | Question: 17
You have a matrix $A$ ... $3$ eigenvalues of $A?$
You have a matrix $A$ with the factorization:$$A=\underbrace{\left(\begin{array}{ccc}1 & & \\3 & 2 & \\1 & -1 & 2\end{array}\right)}_B \quad \underbrace{\left(\begin{arra...
563
views
commented
Apr 8, 2023
Linear Algebra
goclasses2024_wq7
numerical-answers
goclasses
linear-algebra
eigen-value
2-marks
+
–
2
answers
7
GO Classes CS/DA 2025 | Weekly Quiz 4 | Linear Algebra | Question: 30
There exist a $3 \times 3$ real symmetric matrix $\text{S}$ ... is true but Statement $2$ is false Statement $1$ is false but Statement $2$ is true Both Statements are true Both Statements are false
There exist a $3 \times 3$ real symmetric matrix $\text{S}$ such that -$\text{Statement 1}: \text{S}\left(\begin{array}{l} 1 \\ 2 \\ 3 \end{array}\right)=\left(\begin{arr...
1.3k
views
commented
Apr 3, 2023
Linear Algebra
goclasses2025_csda_wq4
goclasses
linear-algebra
matrix
2-marks
+
–
4
answers
8
GO Classes CS/DA 2025 | Weekly Quiz 4 | Linear Algebra | Question: 12
If $P=\left[\begin{array}{lll}1 & \alpha & 3 \\ 1 & 3 & 3 \\ 2 & 4 & 4\end{array}\right]$ is the adjoint of a $3 \times 3$ matrix $\mathrm{A},$ and $\operatorname{det(A)}=4,$ then $\alpha$ equals to?
If $P=\left[\begin{array}{lll}1 & \alpha & 3 \\ 1 & 3 & 3 \\ 2 & 4 & 4\end{array}\right]$ is the adjoint of a $3 \times 3$ matrix $\mathrm{A},$ and $\operatorname{det(A)}...
1.3k
views
commented
Mar 31, 2023
Linear Algebra
goclasses2025_csda_wq4
numerical-answers
goclasses
linear-algebra
determinant
1-mark
+
–
2
answers
9
GO Classes CS/DA 2025 | Weekly Quiz 4 | Linear Algebra | Question: 4
Consider a matrix $A_{n \times n}$ having the following characteristic equation - $ \lambda^2(\lambda-3)(\lambda+2)^3(\lambda-4)^3 $ What could be $\operatorname{rank}(\mathrm{A})?$ $6$ $7$ $8$ $9$
Consider a matrix $A_{n \times n}$ having the following characteristic equation -$$\lambda^2(\lambda-3)(\lambda+2)^3(\lambda-4)^3$$What could be $\operatorname{rank}(\mat...
881
views
commented
Mar 30, 2023
Linear Algebra
goclasses2025_csda_wq4
goclasses
linear-algebra
rank-of-matrix
multiple-selects
1-mark
+
–
2
answers
10
GATE CSE 2022 | Question: 44
Consider a system with $2 \;\text{KB}$ direct mapped data cache with a block size of $64 \; \text{bytes}.$ The system has a physical address space of $64 \; \text{KB}$ and a word length of $16 \; \text{bits.}$ During the execution of a program, four data ... only $\text{R}$ and $\text{S}$ reside in the cache. Every access to $\text{R}$ evicts $\text{Q}$ from the cache.
Consider a system with $2 \;\text{KB}$ direct mapped data cache with a block size of $64 \; \text{bytes}.$ The system has a physical address space of $64 \; \text{KB}$ an...
9.1k
views
commented
Apr 1, 2022
CO and Architecture
gatecse-2022
co-and-architecture
direct-mapping
multiple-selects
2-marks
+
–
2
answers
11
the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables
Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables: S1 = 3, S2 = 2, S3 = 1; P(S1); P(S2); P(S3); Critical Section V(S3); V(S2); V(S1); Does it satisfy mutual exclusion, progress and bounded waiting?
Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables:S1 = 3, S2 = 2, S3 = 1;P(S1);P(S...
4.9k
views
commented
Jan 16, 2022
Operating System
made-easy-test-series
semaphore
operating-system
+
–
7
answers
12
GATE CSE 2021 Set 1 | Question: 30
Consider the following recurrence relation. $T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\right.$ Which one of the following options is correct? $T(n)=\Theta (n^{5/2})$ $T(n)=\Theta (n\log n)$ $T(n)=\Theta (n)$ $T(n)=\Theta ((\log n)^{5/2})$
Consider the following recurrence relation.$$T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\r...
23.9k
views
commented
Jan 9, 2022
Algorithms
gatecse-2021-set1
algorithms
recurrence-relation
time-complexity
2-marks
+
–
1
answer
13
Gate applied test series 2022
Given 2 functions X and Y, we can say function X covers function Y iff all the minterms of function Y are covered by function X ( i.e X should be superset of Y). Let Y be a function of 3 ternary variables, Y(a,b) having 15 minterms. The number of functions covering Y are ______
Given 2 functions X and Y, we can say function X covers function Y iff all the minterms of function Y are covered by function X ( i.e X should be superset of Y). Let Y b...
316
views
commented
Dec 23, 2021
Digital Logic
digital-logic
+
–
5
answers
14
GATE CSE 2020 | Question: 31
Let $G = (V, E)$ be a weighted undirected graph and let $T$ be a Minimum Spanning Tree (MST) of $G$ maintained using adjacency lists. Suppose a new weighed edge $(u, v) \in V \times V$ is added to $G$. The worst case time complexity of determining if $T$ is still an MST ... $\Theta (\mid E \mid \mid V \mid) \\$ $\Theta(E \mid \log \mid V \mid) \\$ $\Theta( \mid V \mid)$
Let $G = (V, E)$ be a weighted undirected graph and let $T$ be a Minimum Spanning Tree (MST) of $G$ maintained using adjacency lists. Suppose a new weighed edge $(u, v) ...
19.1k
views
commented
Oct 28, 2021
Algorithms
gatecse-2020
algorithms
minimum-spanning-tree
graph-algorithms
2-marks
+
–
6
answers
15
GATE CSE 2015 Set 1 | Question: 34
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram: For any $x, y \in L$, not necessarily distinct , $x \vee y$ and $x \wedge y$ are join and meet of $x, y$ ... $p_r = 0$ $p_r = 1$ $0 < p_r ≤ \frac{1}{5}$ $\frac{1}{5} < p_r < 1$
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram:For any $x, y \in L$, not necessarily distinct , $x \vee y$ and $x \we...
17.3k
views
commented
Jul 14, 2021
Set Theory & Algebra
gatecse-2015-set1
set-theory&algebra
normal
lattice
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register