INFR1113 homework 1 template
\documentclass[answers]{exam}
%% Language and font encodings
\usepackage[english]{babel}
\usepackage[utf8x]{inputenc}
\usepackage[T1]{fontenc}
%% Sets page size and margins
\usepackage[a4paper,margin=2cm]{geometry}
%% Useful packages
\usepackage{amsmath}
\usepackage{graphicx}
\usepackage{paralist}
\setlength\FrameSep{4pt}
\begin{document}
\begin{questions}
\question[10]{Experiment with stack pruning parameters. What is their affect on...}
\begin{framed}
\begin{compactenum}[a.]
\item log-probabilities:
\item speed:
\item translations:
\item maximum log-probability:
\end{compactenum}
\end{framed}
\question[15]{Define a new dynamic program for Part 2.}
\begin{framed}
Write your answer here.
\end{framed}
\question[5]{What is the complexity of your Part 2 decoder? Explain your reasoning.}
\begin{framed}
Write your answer here.
\end{framed}
\question[5]{What is the mapping from hypothesis objects to stacks for Part 2?}
\begin{framed}
Write your answer here.
\end{framed}
\addtocounter{question}{1}
\question[15] Experiment with stack pruning parameters for Part 2. What is their affect on...
\begin{framed}
\begin{compactenum}[a.]
\item log-probabilities:
\item speed:
\item translations:
\item maximum log-probability:
\end{compactenum}
\end{framed}
\question[10]{Define a new dynamic program for Part 3.}
\begin{framed}
Write your answer here.
\end{framed}
\question[5]{What is the computational complexity of your Part 3 decoder?}
\begin{framed}
Write your answer here.
\end{framed}
\question[5]{What is the mapping from hypothesis objects to stacks for Part 3?}
\begin{framed}
Write your answer here.
\end{framed}
\addtocounter{question}{1}
\question[5]{What is the maximum log-probability your Part 3 decoder can obtain? What do you conclude?}
\begin{framed}
Write your answer here.
\end{framed}
\end{questions}
\end{document}