Recent questions tagged goclasses-cs-dpp-day-390

A computer scientist wants to determine the time required to read an entire magnetic disk.Assume:$2400$ cylinders $6$ tracks per cylinder $32$ sectors per track one compl...

Which of the following statements about magnetic disk storage is incorrect?The formatted capacity of a disk is smaller than its unformatted capacity. A sector contains in...

A disk has:rotational speed $=7200\ \mathrm{rpm}$ average seek time $=8\ \mathrm{ms}$ sectors per track $=1000$Approximately how much time is required, on average, to acc...

A magnetic disk rotates at $4200\ \mathrm{rpm}$. Its average positioning time is $5\ \mathrm{ms}$The average waiting time is defined as:$$\mathrm{Average\ positioning\ ti...

A magnetic disk has a sector size of $\mathbf{512}$ bytes. Each sector is identified by a $\mathbf{28}$-bit sector number.What is the maximum disk capacity that can be ma...

Given a Turing machine $M$, consider the problem:Does $M$ accept at least one string of length exactly $5$?Which statement is correct?It is undecidable because otherwise ...

Which problem is ruled out by Rice's Theorem?Determine whether the source code of a program contains a $\mathrm{while}$ loop. Determine whether a computable function alwa...

Consider, $L=\{\langle M\rangle\mid M\ \mathrm{is\ a\ PDA\ accepting\ infinitely\ many\ strings}\}$.Rice's Theorem can be used to prove that $L$ is undecidable.If the sta...

Consider, $L=\{\langle M\rangle\mid M\ \mathrm{accepts}\ 01\ \mathrm{and\ does\ not\ accept}\ 10\}$Rice's Theorem implies that $L$ is undecidable.If the statement is true...

Which statement is correct?The Church-Turing thesis has been formally proved. A nondeterministic Universal Turing Machine can solve the Halting Problem. A two-tape Turing...