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
Answers by Harshq
3
votes
1
GATE CSE 2021 Set 1 | Question: 31
Consider the following context-free grammar where the set of terminals is $\{a,b,c,d,f\}$ ...
Consider the following context-free grammar where the set of terminals is $\{a,b,c,d,f\}$. $$\begin{array}{lll} \text{S} & \rightarrow & d \: a \: \text{T} \mid \text{R} ...
6.4k
views
answered
Feb 27, 2021
Compiler Design
gatecse-2021-set1
compiler-design
grammar
2-marks
+
–
2
votes
2
GATE CSE 2021 Set 1 | Question: 28
Consider a $3$-bit counter, designed using $T$ flip-flops, as shown below: Assuming the initial state of the counter given by $\text{PQR}$ as $000$, what are the next three states? $011,101,000$ $001,010,111$ $011,101,111$ $001,010,000$
Consider a $3$-bit counter, designed using $T$ flip-flops, as shown below:Assuming the initial state of the counter given by $\text{PQR}$ as $000$, what are the next thre...
7.3k
views
answered
Feb 27, 2021
Digital Logic
gatecse-2021-set1
digital-logic
sequential-circuit
digital-counter
2-marks
+
–
0
votes
3
GATE CSE 2021 Set 1 | Question: 25
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$ bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is _____________ milliseconds.
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$...
9.2k
views
answered
Feb 27, 2021
Operating System
gatecse-2021-set1
operating-system
process-scheduling
numerical-answers
1-mark
+
–
4
votes
4
GATE CSE 2021 Set 1 | Question: 24
Consider the following representation of a number in $\text{IEEE 754}$ single-precision floating point format with a bias of $127$.$S: 1\quad\quad E:\; 10000001\quad\quad F:\;11110000000000000000000$ Here $S, \;E$ and ... the floating point representation. The decimal value corresponding to the above representation (rounded to $2$ decimal places) is ____________.
Consider the following representation of a number in $\text{IEEE 754}$ single-precision floating point format with a bias of $127$.$$S: 1\quad\quad E:\; 10000001\quad\qu...
8.0k
views
answered
Feb 27, 2021
Digital Logic
gatecse-2021-set1
digital-logic
number-representation
ieee-representation
numerical-answers
1-mark
+
–
4
votes
5
GATE CSE 2021 Set 1 | Question: 22
Consider a computer system with a byte-addressable primary memory of size $2^{32}$ bytes. Assume the computer system has a direct-mapped cache of size $\text{32 KB}$ ($\text{1 KB}$ = $2^{10}$ bytes), and each cache block is of size $64$ bytes. The size of the tag field is __________ bits.
Consider a computer system with a byte-addressable primary memory of size $2^{32}$ bytes. Assume the computer system has a direct-mapped cache of size $\text{32 KB}$ ($\t...
5.4k
views
answered
Feb 27, 2021
CO and Architecture
gatecse-2021-set1
co-and-architecture
cache-memory
numerical-answers
1-mark
+
–
0
votes
6
GATE CSE 2021 Set 1 | Question: 21
Consider the following sequence of operations on an empty stack.$\textsf{push}(54);\textsf{push}(52);\textsf{pop}();\textsf{push}(55);\textsf{push}(62);\textsf{s}=\textsf{pop}();$ ... $\textsf{s+q}$ is ___________.
Consider the following sequence of operations on an empty stack.$$\textsf{push}(54);\textsf{push}(52);\textsf{pop}();\textsf{push}(55);\textsf{push}(62);\textsf{s}=\texts...
8.4k
views
answered
Feb 27, 2021
DS
gatecse-2021-set1
data-structures
stack
easy
numerical-answers
1-mark
+
–
0
votes
7
GATE CSE 2021 Set 1 | Question: 20
Consider the following expression.$\displaystyle \lim_{x\rightarrow-3}\frac{\sqrt{2x+22}-4}{x+3}$The value of the above expression (rounded to 2 decimal places) is ___________.
Consider the following expression.$$\displaystyle \lim_{x\rightarrow-3}\frac{\sqrt{2x+22}-4}{x+3}$$The value of the above expression (rounded to 2 decimal places) is ____...
6.4k
views
answered
Feb 27, 2021
Calculus
gatecse-2021-set1
calculus
limits
numerical-answers
1-mark
+
–
4
votes
8
GATE CSE 2021 Set 1 | Question: 17
Consider the following undirected graph with edge weights as shown: The number of minimum-weight spanning trees of the graph is ___________.
Consider the following undirected graph with edge weights as shown:The number of minimum-weight spanning trees of the graph is ___________.
10.9k
views
answered
Feb 27, 2021
Algorithms
gatecse-2021-set1
algorithms
graph-algorithms
minimum-spanning-tree
numerical-answers
1-mark
+
–
10
votes
9
GATE CSE 2021 Set 1 | Question: 10
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$? $\Theta(n\log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta (1)$
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$?$\Theta(...
11.8k
views
answered
Feb 27, 2021
DS
gatecse-2021-set1
data-structures
binary-search-tree
time-complexity
1-mark
+
–
2
votes
10
GATE CSE 2021 Set 1 | Question: 8
Consider the following two statements. $S_1$: Destination $\text{MAC}$ address of an $\text{ARP}$ reply is a broadcast address. $S_2$: Destination $\text{MAC}$ address of an $\text{ARP}$ request is a broadcast address. Which one of the following choices is ... true $S_1$ is true and $S_2$ is false $S_1$ is false and $S_2$ is true Both $S_1$ and $S_2$ are false
Consider the following two statements.$S_1$: Destination $\text{MAC}$ address of an $\text{ARP}$ reply is a broadcast address.$S_2$: Destination $\text{MAC}$ address of a...
5.4k
views
answered
Feb 27, 2021
Computer Networks
gatecse-2021-set1
computer-networks
network-protocols
1-mark
+
–
6
votes
11
GATE CSE 2021 Set 1 | Question: 7
Let $p$ and $q$ be two propositions. Consider the following two formulae in propositional logic. $S_1: (\neg p\wedge(p\vee q))\rightarrow q$ $S_2: q\rightarrow(\neg p\wedge(p\vee q))$ Which one of the following choices is correct? Both $S_1$ and ... but $S_2$ is not a tautology $S_1$ is not a tautology but $S_2$ is a tautology Neither $S_1$ nor $S_2$ is a tautology
Let $p$ and $q$ be two propositions. Consider the following two formulae in propositional logic.$S_1: (\neg p\wedge(p\vee q))\rightarrow q$$S_2: q\rightarrow(\neg p\wedge...
8.3k
views
answered
Feb 27, 2021
Mathematical Logic
gatecse-2021-set1
mathematical-logic
propositional-logic
1-mark
+
–
10
votes
12
GATE CSE 2021 Set 1 | Question: 12
Let $\langle M \rangle$ denote an encoding of an automaton $M$. Suppose that $\Sigma = \{0,1\}$. Which of the following languages is/are $\text{NOT}$ recursive? $L= \{ \langle M \rangle \mid M$ is a $\text{DFA}$ such that $L(M)=\emptyset \}$ ... that $L(M)=\emptyset \}$ $L= \{ \langle M \rangle \mid M$ is a $\text{PDA}$ such that $L(M)=\Sigma ^* \}$
Let $\langle M \rangle$ denote an encoding of an automaton $M$. Suppose that $\Sigma = \{0,1\}$. Which of the following languages is/are $\text{NOT}$ recursive?$L= \{ \la...
7.3k
views
answered
Feb 27, 2021
Theory of Computation
gatecse-2021-set1
multiple-selects
theory-of-computation
recursive-and-recursively-enumerable-languages
1-mark
+
–
2
votes
13
GATE CSE 2021 Set 1 | Question: 6
Let the representation of a number in base $3$ be $210$. What is the hexadecimal representation of the number? $15$ $21$ $\text{D}2$ $528$
Let the representation of a number in base $3$ be $210$. What is the hexadecimal representation of the number?$15$$21$$\text{D}2$$528$
8.9k
views
answered
Feb 27, 2021
Digital Logic
gatecse-2021-set1
digital-logic
number-representation
normal
1-mark
+
–
1
votes
14
GATE CSE 2021 Set 1 | Question: 5
Consider the following statements. $S_1:$ Every $\text{SLR(1)}$ grammar is unambiguous but there are certain unambiguous grammars that are not $\text{SLR(1)}$. $S_2:$ For any context-free grammar, there is a parser that takes at most $O(n^3)$ time to parse a ... 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
Consider the following statements.$S_1:$ Every $\text{SLR(1)}$ grammar is unambiguous but there are certain unambiguous grammars that are not $\text{SLR(1)}$.$S_2:$ For a...
7.9k
views
answered
Feb 27, 2021
Compiler Design
gatecse-2021-set1
compiler-design
lr-parser
1-mark
+
–
5
votes
15
GATE CSE 2021 Set 1 | Question: 3
Consider the following three functions. $f_1=10^n\quad f_2=n^{\log n}\quad f_3=n^{\sqrt {n}}$ Which one of the following options arranges the functions in the increasing order of asymptotic growth rate? $f_3, f_2, f_1$ $f_2, f_1, f_3$ $f_1, f_2,f_3$ $f_2, f_3, f_1$
Consider the following three functions.$$f_1=10^n\quad f_2=n^{\log n}\quad f_3=n^{\sqrt {n}}$$Which one of the following options arranges the functions in the increasing ...
10.2k
views
answered
Feb 27, 2021
Algorithms
gatecse-2021-set1
algorithms
asymptotic-notation
1-mark
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
