Removed hard problems from warmup
This commit is contained in:
parent
01d167db1c
commit
2235bdfaac
@ -80,19 +80,4 @@
|
|||||||
\end{enumerate}
|
\end{enumerate}
|
||||||
|
|
||||||
\vfill
|
\vfill
|
||||||
|
|
||||||
\problem{}
|
|
||||||
Suppose we have five hard drives. How can we arrange our data so that...
|
|
||||||
\begin{enumerate}
|
|
||||||
\item We get 3 TiB of usable storage
|
|
||||||
\item We lose no data if any two drives fail
|
|
||||||
\end{enumerate}
|
|
||||||
|
|
||||||
\vfill
|
|
||||||
|
|
||||||
\problem{}
|
|
||||||
Write a general solution to this problem, using $n$ drives and providing $s$ TiB of storage. \\
|
|
||||||
How many failures will such an array be able to tolerate?
|
|
||||||
|
|
||||||
\vfill
|
|
||||||
\end{document}
|
\end{document}
|
Loading…
x
Reference in New Issue
Block a user