\documentclass[12pt,oneside]{article}

\usepackage{amsmath}
\usepackage{booktabs}
\usepackage[letterpaper, margin=1in]{geometry}
\usepackage{enumitem}
\usepackage{fancyvrb}
\usepackage{hyperref}
\usepackage{graphicx}

%% comment out if you don't have MinionPro installed!
\usepackage[onlytext]{MinionPro}

\def\compare{ {\mathrm{compare}} }
\def\swap{ {\mathrm{swap}} }
\def\sort{ {\mathrm{sort}} }
\def\true{ {\mathrm{true}} }
\def\false{ {\mathrm{false}} }
\def\split{ {\mathrm{split}} }
\def\val{ {\mathrm{val}} }



%% \setlength{\topmargin}{-0.75in}
%% \addtolength{\textheight}{2.00in}
%% \setlength{\parindent}{0in}
\pagestyle{empty}

\begin{document}

\begin{center}
{\Large Lecture 17 Ticket}\hfill\emph{COSC 311: Algorithms}, Fall 2022
\end{center}

\vspace{0.25in}

\begin{minipage}{0.75\textwidth}
  \noindent{\large Name:}\ \hrulefill
  
\vspace{0.375in}

\end{minipage}

\noindent Consider the instance of the weighted knapsack problem consisting of five requests with the following durations and values:

\begin{enumerate}
\item $d_1 = 4$, $v_1 = 3$
\item $d_2 = 2$, $v_2 = 2$
\item $d_3 = 5$, $v_3 = 5$
\item $d_4 = 3$, $v_4 = 4$
\item $d_5 = 6$, $v_5 = 5$

\end{enumerate}

Suppose your total time budget is $B = 10$. Use the dynamic programming algorithm described in Lecture 24 to find the maximal value of a feasible collection of requests \emph{by hand}. What is the collection that achieves the optimal value?

You may find the following grid helpful:

\includegraphics[width=0.8\textwidth]{knapsack-example.pdf}

\end{document}
