Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged multiple-selects
4
votes
1
answer
91
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 39
For sets $A$ and $B$, let $f: A \rightarrow B$ and $g: B \rightarrow A$ be functions such that $f(g(x))=x$ for each $x \in B$. Which among the following statements is/are correct? The function $f$ must be one-to-one. The function $f$ must be onto. The function g must be one-to-one. The function $g$ must be onto.
For sets $A$ and $B$, let $f: A \rightarrow B$ and $g: B \rightarrow A$ be functions such that $f(g(x))=x$ for each $x \in B$. Which among the following statements is/are...
GO Classes
530
views
GO Classes
asked
Feb 5
Set Theory & Algebra
goclasses2024-mockgate-14
set-theory&algebra
functions
multiple-selects
2-marks
+
–
9
votes
1
answer
92
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 41
Consider the following lock requests in the Table below. And note that: $\mathrm{S}(\cdot)$ and $\mathrm{X}(\cdot)$ stand for 'shared lock' and 'exclusive lock', respectively. $T_1, T_2, T_3, T_4$, and $T_5$ represent five ... dead('-'). Select all that are correct. At t3: a At t6: b At t7: a At t8: -
Consider the following lock requests in the Table below. And note that:$\mathrm{S}(\cdot)$ and $\mathrm{X}(\cdot)$ stand for 'shared lock' and 'exclusive lock', respectiv...
GO Classes
746
views
GO Classes
asked
Feb 5
Databases
goclasses2024-mockgate-14
databases
transaction-and-concurrency
two-phase-locking-protocol
multiple-selects
2-marks
+
–
4
votes
1
answer
93
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 42
The provided C code is a version of the C string library function strlen(), which calculates the length of a given string. unsigned int mystrlen(char *c) { unsigned int i = 0; /* Your code here. */ } Which line of code creates a working and ... != '\0') i++; return i; while (*(c + i) != '\0') ++i; return i;
The provided C code is a version of the C string library function strlen(), which calculates the length of a given string.unsigned int mystrlen(char *c) { unsigned in...
GO Classes
433
views
GO Classes
asked
Feb 5
Programming in C
goclasses2024-mockgate-14
programming
programming-in-c
strings
multiple-selects
2-marks
+
–
7
votes
2
answers
94
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 49
Consider a $2 \times 2$ matrix M. Which of the following are NOT POSSIBLE for the system of equations $M x=p?$ no solutions for some but not all $\vec{p}$; exactly one solution for all other $\vec{p}$ exactly one solution for ... some $\vec{p}$, exactly one solution for some $\vec{p}$ and more than one solution for some $\vec{p}$
Consider a $2 \times 2$ matrix M. Which of the following are NOT POSSIBLE for the system of equations $M x=p?$no solutions for some but not all $\vec{p}$; exactly one sol...
GO Classes
567
views
GO Classes
asked
Feb 5
Linear Algebra
goclasses2024-mockgate-14
linear-algebra
system-of-equations
multiple-selects
2-marks
+
–
6
votes
1
answer
95
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 50
Consider the following database relation: $\mathrm{R}=(\mathrm{SFLNGCRW} \mathrm{H})=(\mathrm{S}$ : SID, F: First Name, L: Last Name, N: Number of Units, G: GPA, C: Course (of teaching), R ... only one applied? SID determines Rating Rating determines Wage Rating determines Course Rating and First Name determine Wage and Hours of Work
Consider the following database relation: $\mathrm{R}=(\mathrm{SFLNGCRW} \mathrm{H})=(\mathrm{S}$ : SID, F: First Name, L: Last Name, N: Number of Units, G: GPA, C: Cours...
GO Classes
367
views
GO Classes
asked
Feb 5
Databases
goclasses2024-mockgate-14
databases
database-normalization
functional-dependency
multiple-selects
2-marks
+
–
4
votes
1
answer
96
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 51
Consider the following forwarding table in a router that uses longest prefix matching to forward packets. Assume that 4-bit addressing is used. ... $X=0$ and $Y=00$ $X=01$ and $Y=00$ $X=010$ and $Y=00$ $X=00$ and $Y=0$
Consider the following forwarding table in a router that uses longest prefix matching to forward packets. Assume that 4-bit addressing is used.$$\begin{array}{c|c}\hline ...
GO Classes
397
views
GO Classes
asked
Feb 5
Computer Networks
goclasses2024-mockgate-14
computer-networks
ip-packet
multiple-selects
2-marks
+
–
12
votes
3
answers
97
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 58
Let $\mathrm{F}$ and $\mathrm{G}$ be two propositional formulae. Which of the following is/are True? If $F \vee G$ is a tautology then at least one of $F, G$ is a tautology. If $F \wedge G$ is a contradiction then at ... $G$ is a tautology. If $F \rightarrow G$ is a contradiction then $F$ is a tautology and $G$ is a contradiction.
Let $\mathrm{F}$ and $\mathrm{G}$ be two propositional formulae.Which of the following is/are True?If $F \vee G$ is a tautology then at least one of $F, G$ is a tautology...
GO Classes
855
views
GO Classes
asked
Feb 5
Mathematical Logic
goclasses2024-mockgate-14
mathematical-logic
propositional-logic
multiple-selects
2-marks
+
–
5
votes
1
answer
98
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 62
At a particular point in time, the buffer cache has dirty data that needs to be flushed to disk. Suppose that the identities of these blocks can be listed in [track:sector] form as follows: ... Shortest Seek Time First Scan (initially moving upwards) Look (initially moving upwards) C-SCAN (initially moving upwards)
At a particular point in time, the buffer cache has dirty data that needs to be flushed to disk. Suppose that the identities of these blocks can be listed in [track:secto...
GO Classes
453
views
GO Classes
asked
Feb 5
CO and Architecture
goclasses2024-mockgate-14
co-and-architecture
disk-scheduling
multiple-selects
2-marks
+
–
5
votes
1
answer
99
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 64
Which of the following languages are Turing-recognizable? A. $\{\langle M\rangle \mid M$ is a (deterministic) Turing machine and $M$ accepts 010$\}$. B. $\{\langle M\rangle \mid M$ is a nondeterministic Turing machine and $M$ accepts 010 ... $\left\{\langle M\rangle \mid M\right.$ is a Turing machine and $\left.L(M)=\Sigma^*\right\}$.
Which of the following languages are Turing-recognizable?A. $\{\langle M\rangle \mid M$ is a (deterministic) Turing machine and $M$ accepts 010$\}$.B. $\{\langle M\rangle...
GO Classes
517
views
GO Classes
asked
Feb 5
Theory of Computation
goclasses2024-mockgate-14
theory-of-computation
turing-machine
multiple-selects
2-marks
+
–
4
votes
0
answers
100
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 65
Which of the following statements are true for every language $\mathrm{L} \subseteq\{0,1\}^*?$ $L^{\star}$ is infinite. $L$ is accepted by some DFA if and only if $L$ is accepted by some NFA. If $\mathrm{L}$ is the ... $\mathrm{L}$ is undecidable. If $\mathrm{L}$ is the union of two decidable languages, then $\mathrm{L}$ is decidable.
Which of the following statements are true for every language $\mathrm{L} \subseteq\{0,1\}^*?$$L^{\star}$ is infinite.$L$ is accepted by some DFA if and only if $L$ is ac...
GO Classes
617
views
GO Classes
asked
Feb 5
Theory of Computation
goclasses2024-mockgate-14
theory-of-computation
decidability
multiple-selects
2-marks
+
–
6
votes
1
answer
101
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 23
Which of the following statements is/are false? If a context-free grammar $\mathrm{G}$ is in Chomsky's normal form, then $\mathrm{G}$ is not ambiguous. For every number $n$ ... s a $10$-state NFA that accepts $\text{L}$ then there's a $100$-state DFA that accepts $\mathrm{L}$.
Which of the following statements is/are false?If a context-free grammar $\mathrm{G}$ is in Chomsky's normal form, then $\mathrm{G}$ is not ambiguous.For every number $n$...
GO Classes
640
views
GO Classes
asked
Jan 28
Theory of Computation
goclasses2024-mockgate-13
goclasses
numerical-answers
theory-of-computation
context-free-language
multiple-selects
1-mark
+
–
3
votes
1
answer
102
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 25
A garage door opens if it ever sees the password $011$ in a transmission. More formally, this FSM takes a bitstring consisting of $\text{0's}$ and $\text{1's}$ as its input, and continually outputs $\text{0's}$ until it sees the substring $011,$ ... Arrow $1 - (0/0)$ Arrow $3 - (1/0)$ Arrow $4 - (1/0)$ Arrow $5 - (1/1)$
A garage door opens if it ever sees the password $011$ in a transmission. More formally, this FSM takes a bitstring consisting of $\text{0's}$ and $\text{1's}$ as its inp...
GO Classes
376
views
GO Classes
asked
Jan 28
Digital Logic
goclasses2024-mockgate-13
goclasses
digital-logic
sequential-circuit
finite-automata
multiple-selects
1-mark
+
–
3
votes
2
answers
103
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 27
What statement is correct for $f(A, B)$ in the following circuit? $f(A, B)=\overline{\overline{A \cdot B} \cdot(A+B)}$ when Control $=1$ $f(A, B)=A \cdot B$ when Control $=0$ $f(A, B)=\overline{A}+\overline{B}$ when Control $=1$ $f(A, B)=\overline{A} \cdot \overline{B}$ when Control $=0$
What statement is correct for $f(A, B)$ in the following circuit?$f(A, B)=\overline{\overline{A \cdot B} \cdot(A+B)}$ when Control $=1$$f(A, B)=A \cdot B$ when Control $=...
GO Classes
386
views
GO Classes
asked
Jan 28
Digital Logic
goclasses2024-mockgate-13
goclasses
digital-logic
digital-circuits
multiple-selects
1-mark
+
–
3
votes
1
answer
104
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 38
Consider the syntax-directed translation given by the following grammar and semantic rules. Here, $S$ is the only non-terminal and $\Sigma=\{0,1,2\}$ is a set of terminals. $\text{S.val}$ denotes the synthesized attribute (a ... $3$ value. The value computed by the translation scheme for the input string $201$ is $20.$
Consider the syntax-directed translation given by the following grammar and semantic rules. Here, $S$ is the only non-terminal and $\Sigma=\{0,1,2\}$ is a set of terminal...
GO Classes
539
views
GO Classes
asked
Jan 28
Compiler Design
goclasses2024-mockgate-13
goclasses
compiler-design
syntax-directed-translation
multiple-selects
2-marks
+
–
4
votes
1
answer
105
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 39
Consider the following grammar $ \begin{aligned} & A \rightarrow B B \\ & B \rightarrow b \end{aligned} $ Suppose we draw an $\operatorname{LR}(0)$ automatan for the given grammar then which of the ... transitions There is exactly one state with $2$ incoming transitions There is exactly one state with $3$ outgoing transitions
Consider the following grammar$$\begin{aligned}& A \rightarrow B B \\& B \rightarrow b\end{aligned}$$Suppose we draw an $\operatorname{LR}(0)$ automatan for the given gra...
GO Classes
384
views
GO Classes
asked
Jan 28
Compiler Design
goclasses2024-mockgate-13
goclasses
compiler-design
lr-parser
multiple-selects
2-marks
+
–
8
votes
2
answers
106
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: $...
GO Classes
866
views
GO Classes
asked
Jan 28
Computer Networks
goclasses2024-mockgate-13
goclasses
computer-networks
tcp
multiple-selects
2-marks
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
...
49
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register