Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged multiple-selects
3
votes
1
answer
151
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 14
Which kind of data dependence can cause data hazards in a single-core, pipelined, in-order processor? (Mark all that apply.) read-after-write dependence write-after-read dependence write-after-write dependence read-after-read dependence
Which kind of data dependence can cause data hazards in a single-core, pipelined, in-order processor? (Mark all that apply.)read-after-write dependencewrite-after-read de...
GO Classes
589
views
GO Classes
asked
Jan 13
CO and Architecture
goclasses2024-mockgate-11
goclasses
co-and-architecture
pipelining
multiple-selects
1-mark
+
–
3
votes
1
answer
152
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 16
Which one of the following options is CORRECT for the given logic circuit? $P=1, Q=1 ; X=0$ $P=1, Q=0 ; X=1$ $P=0, Q=1 ; X=0$ $P=0, Q=0 ; X=1$
Which one of the following options is CORRECT for the given logic circuit?$P=1, Q=1 ; X=0$$P=1, Q=0 ; X=1$$P=0, Q=1 ; X=0$$P=0, Q=0 ; X=1$
GO Classes
398
views
GO Classes
asked
Jan 13
Digital Logic
goclasses2024-mockgate-11
goclasses
digital-logic
combinational-circuit
digital-circuits
multiple-selects
1-mark
+
–
4
votes
2
answers
153
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 19
Consider three concurrently executing threads in the same process using two semaphores $\text{s}1$ and $\text{s2}.$ Assume $\text{s1}$ has been initialized to $1$, while $\text{s2}$ has been initialized to $0.$ ... ); /* thread C */ P(s1); x = x+3; V(s2); V(s1); $6$ $12$ $18$ $36$
Consider three concurrently executing threads in the same process using two semaphores $\text{s}1$ and $\text{s2}.$ Assume $\text{s1}$ has been initialized to $1$, while ...
GO Classes
587
views
GO Classes
asked
Jan 13
Operating System
goclasses2024-mockgate-11
goclasses
operating-system
semaphore
threads
multiple-selects
1-mark
+
–
2
votes
1
answer
154
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 25
A linear-probing hash table of length $10$ uses the hash function $h(x)=x \bmod 10$ ... that apply. $34,42,23,52,33,46$ $46,34,42,23,52,33$ $42,46,33,23,34,52$ $42,23,34,52,46,33$
A linear-probing hash table of length $10$ uses the hash function $h(x)=x \bmod 10$. After inserting six integer keys into an initially empty hash table, the array of key...
GO Classes
410
views
GO Classes
asked
Jan 13
Algorithms
goclasses2024-mockgate-11
goclasses
algorithms
hashing
linear-probing
multiple-selects
1-mark
+
–
3
votes
1
answer
155
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 26
A lexical analyzer uses the following patterns to recognize four tokens $\textsf{T1, T2, T3},$ and $\textsf{T4}$ over the alphabet $ \{a,b,c\}.$ Rule1: aa*b*c* { print ( T1 ); } Rule2: c { print ( T2 ); ... never be used? Note that the analyzer outputs the token that matches the longest possible prefix. Rule$1$ Rule$2$ Rule$3$ Rule$4$
A lexical analyzer uses the following patterns to recognize four tokens $\textsf{T1, T2, T3},$ and $\textsf{T4}$ over the alphabet $ \{a,b,c\}.$Rule1: aa*b*c* { print...
GO Classes
630
views
GO Classes
asked
Jan 13
Compiler Design
goclasses2024-mockgate-11
goclasses
compiler-design
lexical-analysis
compiler-tokenization
multiple-selects
1-mark
+
–
3
votes
1
answer
156
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 27
Suppose there is a handle on the top of the stack at some point in time while performing $\text{LR(k)}$ parsing. In this context, a cetrain $\text{LR(k)}$ parsers may exhibit uncertainty in ... The parser may perform reduction without generating any conflict. The parser may execute a shift operation without generating any conflict.
Suppose there is a handle on the top of the stack at some point in time while performing $\text{LR(k)}$ parsing. In this context, a cetrain $\text{LR(k)}$ parsers may exh...
GO Classes
536
views
GO Classes
asked
Jan 13
Compiler Design
goclasses2024-mockgate-11
goclasses
compiler-design
parsing
lr-parser
multiple-selects
1-mark
+
–
5
votes
2
answers
157
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 35
Which one of the following context-free grammars is unambiguous? (Note that $a, b, c,(,),+$ are terminals, $S, X, Y$ are nonterminals, and the start symbol in each case is $S.)$ ... $S \rightarrow \epsilon|()|(S)$ $S \rightarrow \epsilon|(S)| S S$ $S \rightarrow \epsilon|(S)| S$
Which one of the following context-free grammars is unambiguous? (Note that $a, b, c,(,),+$ are terminals, $S, X, Y$ are nonterminals, and the start symbol in each case i...
GO Classes
647
views
GO Classes
asked
Jan 13
Theory of Computation
goclasses2024-mockgate-11
goclasses
theory-of-computation
context-free-grammar
multiple-selects
1-mark
+
–
5
votes
1
answer
158
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 36
Consider the system $A \mathbf{x}=\mathbf{b}$, with coefficient matrix $A$ and augmented matrix $[A \mid b]$. The sizes of $\mathbf{b}, A$, and $[A \mid \mathbf{b}]$ are $m \times 1, m \times n$ ... $\operatorname{rank}[A]>$ $\operatorname{rank}[A \mid b]$.
Consider the system $A \mathbf{x}=\mathbf{b}$, with coefficient matrix $A$ and augmented matrix $[A \mid b]$. The sizes of $\mathbf{b}, A$, and $[A \mid \mathbf{b}]$ are ...
GO Classes
521
views
GO Classes
asked
Jan 13
Linear Algebra
goclasses2024-mockgate-11
goclasses
linear-algebra
system-of-equations
multiple-selects
2-marks
+
–
9
votes
1
answer
159
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 38
A binary relation $\mathrm{R}$ over a set $\mathrm{A}$ is called a "GO Relation" if for all $\mathrm{x}, \mathrm{y}, \mathrm{z}$ $\in A$, if $x R y$ and $x R z$, then $y R z$. Which of the following ... is transitive. If $R$ is a GO relation then $R$ is reflexive. If $R$ is an equivalence relation then $R$ is a GO relation.
A binary relation $\mathrm{R}$ over a set $\mathrm{A}$ is called a "GO Relation" if for all $\mathrm{x}, \mathrm{y}, \mathrm{z}$ $\in A$, if $x R y$ and $x R z$, then $y ...
GO Classes
575
views
GO Classes
asked
Jan 13
Set Theory & Algebra
goclasses2024-mockgate-11
goclasses
set-theory&algebra
relations
multiple-selects
2-marks
+
–
8
votes
1
answer
160
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 41
A self-dual logic function is a function that is identical to its dual. An anti-self-dual logic function is a function whose dual is the same as the complement of the function. A boolean function $f$ on $n$ variables is called neutral if $f$ has ... on $\mathrm{n}$ variables is $\mathrm{C}\left(2^{n-1}\right., \left.2^ {n-2}\right)$.
A self-dual logic function is a function that is identical to its dual. An anti-self-dual logic function is a function whose dual is the same as the complement of the fun...
GO Classes
760
views
GO Classes
asked
Jan 13
Digital Logic
goclasses2024-mockgate-11
goclasses
digital-logic
boolean-algebra
multiple-selects
2-marks
+
–
4
votes
0
answers
161
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 45
Consider the scenario where $\text{L}$ is a shared variable which is a pointer to the head of a linked list originally containing three nodes with keys $3, 4,$ and $5.$ Consider the function List_Insert() which is being used by two concurrent threads $\text{T}1$ ... are separated by commas. $6,3,4,5$ $6,2,3,4,5$ $2,6,3,4,5$ $2,3,4,5$
Consider the scenario where $\text{L}$ is a shared variable which is a pointer to the head of a linked list originally containing three nodes with keys $3, 4,$ and $5.$ C...
GO Classes
368
views
GO Classes
asked
Jan 13
Operating System
goclasses2024-mockgate-11
goclasses
operating-system
process-synchronization
threads
multiple-selects
2-marks
+
–
6
votes
0
answers
162
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 52
Consider the following binary heap – Suppose the last operation you performed in the binary heap above was inserting the key $x$. What are the possible values of $x?$ $20$ $8$ $13$ $11$
Consider the following binary heap –Suppose the last operation you performed in the binary heap above was inserting the key $x$.What are the possible values of $x?$$20$...
GO Classes
540
views
GO Classes
asked
Jan 13
DS
goclasses2024-mockgate-11
goclasses
data-structures
binary-heap
multiple-selects
2-marks
+
–
4
votes
0
answers
163
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 59
Which of the following statements is/are false? In a cascade-less schedule if a transaction $T_j$ read a data item written by transaction $T_i$ then the commit of $T_i$ has to be before this read operation of $T_j$ A ... $2 \mathrm{PL}$ (could have been produced using the $2 \mathrm{PL}$ locking protocol) is conflict-serializable.
Which of the following statements is/are false?In a cascade-less schedule if a transaction $T_j$ read a data item written by transaction $T_i$ then the commit of $T_i$ ha...
GO Classes
456
views
GO Classes
asked
Jan 13
Databases
goclasses2024-mockgate-11
goclasses
databases
transaction-and-concurrency
conflict-serializable
multiple-selects
2-marks
+
–
8
votes
4
answers
164
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 60
In a relational database relation, we say a non-empty set of attributes $\mathrm{X}$ is closed (with respect to a given set of functional dependencies FD) if $X^{+}=X$ (where $X^{+}$is the closure of $X).$ ... $2.$ $R$ is in $2 N F$. $R$ is in $3 N F$.
In a relational database relation, we say a non-empty set of attributes $\mathrm{X}$ is closed (with respect to a given set of functional dependencies FD) if $X^{+}=X$ (w...
GO Classes
1.0k
views
GO Classes
asked
Jan 13
Databases
goclasses2024-mockgate-11
goclasses
databases
database-normalization
functional-dependency
multiple-selects
2-marks
+
–
3
votes
1
answer
165
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 61
Which of the following is/are undecidable? $L=\left\{\langle M\rangle \mid M\right.$ is a TM, $\mathrm{L}(M) \neq \emptyset$, and $\left.\mathrm{L}(M) \neq \Sigma^*\right\}$. $\{\langle M\rangle \mid M$ ... $\}$ $L=\{\langle M\rangle \mid M$ is a DFA and $L(M)$ is uncountable $\}$
Which of the following is/are undecidable?$L=\left\{\langle M\rangle \mid M\right.$ is a TM, $\mathrm{L}(M) \neq \emptyset$, and $\left.\mathrm{L}(M) \neq \Sigma^*\right\...
GO Classes
573
views
GO Classes
asked
Jan 13
Theory of Computation
goclasses2024-mockgate-11
goclasses
theory-of-computation
decidability
multiple-selects
2-marks
+
–
4
votes
1
answer
166
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 64
Which of the following statements about Turing machines is false? For every context-sensitive language $L$, there is a Turing machine that accepts precisely the strings of $L$. For any grammar $G$ ... Turing machine $A$ which can simulate the behaviour of any given Turing machine $B$ on any given finite input.
Which of the following statements about Turing machines is false?For every context-sensitive language $L$, there is a Turing machine that accepts precisely the strings of...
GO Classes
547
views
GO Classes
asked
Jan 13
Theory of Computation
goclasses2024-mockgate-11
goclasses
theory-of-computation
turing-machine
multiple-selects
2-marks
+
–
0
votes
1
answer
167
Made Easy Test Series Mock Test
How to calculate the third option?
How to calculate the third option?
Rohit Chakraborty
236
views
Rohit Chakraborty
asked
Jan 7
GATE
made-easy-test-series
digital-logic
adder
multiple-selects
+
–
1
votes
1
answer
168
made-easy
Rohit Chakraborty
158
views
Rohit Chakraborty
asked
Jan 7
GATE
made-easy-test-series
time-complexity
functions
multiple-selects
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
49
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register