HW1(Latex file)
\documentclass[11pt]{article}
\usepackage{epsfig,graphics,latexsym}
\usepackage{boxedminipage}
%\usepackage{latex8}
%\usepackage{times}
\pagestyle{empty}
%\makeatletter
\usepackage{fullpage}
\begin{document}
\date{}
\title{Written Homework 1\\CS250 - Analysis of Algorithms}
\author{Instructor: Yuting Zhang \\Computer Science Department\\ Allegheny College \\~\\ {\bf \large Assigned: 01/21/08~~~~~~~~~Due: 01/28/08}}
\date{}
\maketitle
%\newtheorem{theorem}{Theorem}
%\newtheorem{lem}[theorem]{Lemma}
%\newtheorem{cor}[theorem]{Corollary}
\noindent {\bf \large Instructions:}\\
\begin{itemize}
\item The total point of this homework is 40 points and 10 points for
extra credit.
\item All questions must be answered on an INDIVIDUAL basis. If your
answer is inspired by the discussion with other students, you need mention their names in your acknowledgment section.
\item State clearly all your assumptions if something seems ambiguous.
\item You are required to write your homework using \LaTeX\ .
\item You are required to submit your homework at the beginning of the class on the due date.
\end{itemize}
\noindent {\bf \large Problems:}:
\begin{enumerate}
\item Exercise 0.1. Choose any 7 sub-problems from (a) - (q). (21
points, 3 points each)
\item {\em Door in a Wall}~~ You are facing a wall that stretches
infinitely in both directions. There is a door in the wall, but you
know neither how far away nor in which direction. You can see the door
only when you are right next to it. Design an algorithm that enables
you to reach the door by walking at most O(n) steps where n is the
(unknown to you) number of steps between your initial position and the
door. (12 points) (Exercise 2.2 (10) in the ``Levitin'' book)
\item Exercise 0.3 a) (7 points)
\item Extra credit: Exercise 0.3 b) (10 points)
\end{enumerate}
\end{document}
Link to this Page
