\documentclass[12pt,twoside]{article}
\usepackage{latex-macros/course}

\renewcommand{\coursecopyrightnames}{Prof.~Albert~R.~Meyer}
%\renewcommand{\coursecopyrightyear}{2002}

\begin{document}
\paper{objectives}{Handout 1}{Course Objectives and Outcomes}

\pdfbookmark[1]{Objectives}{Objectives}
\section*{Objectives}

% Objectives.1

On completion of 6.042, students will be able to explain and apply the
basic methods of discrete (noncontinuous) mathematics in Computer Science.
They will be able to use these methods in subsequent courses in the design
and analysis of algorithms, computability theory, software engineering,
and computer systems.

In particular, students will be able to
\begin{enumerate}
\item
\label{Basic Discrete Mathematics Concepts}
\textbf{reason mathematically about basic data types and structures}
used in computer algorithms and systems; distinguish rigorous definitions
and conclusions from merely plausible ones; synthesize elementary proofs,
especially proofs by induction.

\item
\label{Computational Processes} 
\textbf{model and analyze computational processes}
%(algorithms and systems)
using analytic and combinatorial methods.

\item \label{Discrete Probability} \textbf{apply principles of discrete
probability} to model and solve elementary problems of reliability and
estimation.

\item 
\label{Teams Objective} 
\textbf{work in small teams} to accomplish all the objectives above.
\end{enumerate}


\pdfbookmark[1]{Learning Outcomes}{Learning Outcomes}
\section*{Learning Outcomes}

% Learning Outcomes.1

Students will be able to:
\begin{enumerate}

\item \label{basic} use \textbf{logical notation} to define and reason
about \textbf{fundamental mathematical concepts} such as sets, relations,
functions, and integers.

\item \label{soundness} \textbf{evaluate elementary mathematical
arguments} and identify fallacious \emph{reasoning} (not just fallacious
conclusions).

\item \label{proofs} \textbf{synthesize induction hypotheses and simple
induction proofs}.

\item \label{graphs} \textbf{apply graph theory models} of data structures
and state machines to solve problems of connectivity and constraint
satisfaction, \eg scheduling.

\item \label{invariants} apply the method of invariants and well-founded
ordering to \textbf{prove correctness and termination of processes} and
state machines.

\item \label{closed-forms} \textbf{derive closed-form and asymptotic
expressions} from series and recurrences for growth rates of processes.

\item \label{counting} \textbf{calculate numbers of possible outcomes} of
elementary combinatorial processes such as permutations and combinations.

\item \label{probability} \textbf{calculate probabilities} and discrete
distributions for simple combinatorial processes; calculate means and
variances.

\item \label{mean} solve problems of estimation and error tolerance
by \textbf{applying theorems on deviation from the mean}.

\item \label{teams outcome} problem-solve and \textbf{study in a small
team} with fellow students.

\end{enumerate}

\iffalse

\begin{center}
Objectives
\end{center}

\ref{defs and proofs} Proofs, \ref{optimization} Combinatorics,
\ref{data and algorithms} Data and algorithms, \ref{probability}
Probability, \ref{teams} Teams.


\begin{center}
Outcomes: reflected Objectives
\end{center}

\ref{soundness} Recognize proofs: \ref{defs and proofs}

\ref{proofs} Synthesize proofs: \ref{defs and proofs}

\ref{graph models}: \ref{defs and proofs}, \ref{optimization}, \ref{data and algorithms}

\ref{graphs}: \ref{optimization}, \ref{data and algorithms}

\ref{arithmetic}: \ref{defs and proofs}, \ref{data and algorithms}

\ref{closed-forms}: \ref{data and algorithms}, \ref{optimization}

\ref{counting}: \ref{optimization}, \ref{probability}, \ref{data and algorithms}

\ref{invariants}: \ref{defs and proofs}, \ref{data and algorithms}

\ref{Big-O}: \ref{data and algorithms}, \ref{optimization}

\ref{calculate probability}: \ref{probability}

\ref{teams}: \ref{teams}
\fi


\end{document}

