Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged 2-marks
5
votes
1
answer
91
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
452
views
GO Classes
asked
Feb 5
CO and Architecture
goclasses2024-mockgate-14
co-and-architecture
disk-scheduling
multiple-selects
2-marks
+
–
11
votes
1
answer
92
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 63
Assume an instruction mix of $15 \%$ conditional branches, $1 \%$ unconditional branches, $84 \%$ all others, and $60 \%$ of the conditional branches are taken. We have a 4-stage pipeline where branch target locations ... $1.38$ For both "predict taken", "predict not taken" branch predictions, CPI is the $1.30$
Assume an instruction mix of $15 \%$ conditional branches, $1 \%$ unconditional branches, $84 \%$ all others, and $60 \%$ of the conditional branches are taken. We have a...
GO Classes
770
views
GO Classes
asked
Feb 5
CO and Architecture
goclasses2024-mockgate-14
co-and-architecture
branch-conditional-instructions
2-marks
+
–
5
votes
1
answer
93
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
503
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
94
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
612
views
GO Classes
asked
Feb 5
Theory of Computation
goclasses2024-mockgate-14
theory-of-computation
decidability
multiple-selects
2-marks
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
...
75
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
