%%%Note: This file will have to also be made into a .ps
%%file and copied to /pub/ftp/pub/classes/6.042/fall97/handouts.

\documentstyle[12pt,twoside]{article}
\input{macros-course}
\begin{document}
\handout{course-information}{Course Information}{September 4, 1997}
\section{Staff}
\noindent
\begin{center}
\begin{tabular}{llrr}
Lecturer: & Prof.\ Tom Leighton & 2-377 & x3-3662\\
	  & \multicolumn{1}{r}{\tt ftl@math.mit.edu}
		& NE43-328 & x3-5876\\ 
\vspace{0.2in}	& Office Hours:  & Weds. (2-377) & 2:30pm--3:30pm\\
Tutorial Coordinator: & Dr. Santosh Vempala & 2-335 & x3-7905\\
	& \multicolumn{1}{r}{\tt vempala@theory.lcs.mit.edu}
	        & NE43-374 & x3-7553\\
\vspace{0.2in}	& Office Hours & Mon. (2-335) & 2:00pm--4:00pm\\
Teaching Assistants: & Alex Duran\\
	& \multicolumn{1}{r}{\tt amsduran@mit.edu}
	& NE43-338 & x3-7583 \\
\vspace{0.2in}
	& Office Hours: & Monday & 2:00pm--5:00pm\\
	& Gunnar Hoest\\
	& \multicolumn{1}{r}{\tt gunnar@theory.lcs.mit.edu} 
	& NE43-370 & x3-6097\\
\vspace{0.2in}	& Office Hours: & Tuesday & 11:00am--2:00pm\\
	& Eric Lehman \\
\vspace{0.2in} & \multicolumn{1}{r}{\tt e\_lehman@mit.edu} 
	& NE43-336 & x3-5971 \\
	&  David Finberg\\
	& \multicolumn{1}{r}{\tt dfinberg@math.mit.edu} 
	& 2-342 & x3-4102\\
\vspace{0.2in}	& Office Hours: & Mondays & 5:00pm--8:00pm\\
	& Dimitri Papaioannou & 35-307  & x3-6165\\
\vspace{0.2in} & \multicolumn{1}{r}{\tt \hspace*{.2in} dimitrip@mit.edu}
	     & NE43-338 & x3-7583\\
	& Russell S. Schwartz\\
	& \multicolumn{1}{r}{\tt rsschwar@mit.edu} 
	&  NE43-336 & 3-5971\\
	\vspace{0.2in}
	& Office Hours:  & Monday & 5:00pm--8:00pm\\
Secretary: 
	& Susan Welby \\ 
	& \multicolumn{1}{r}{\tt susan@theory.lcs.mit.edu} 
	& NE43-330 & x3-3037\\
\end{tabular}
\end{center}

\section{Prerequisites and ``antirequisites''}

The only official prerequisite for the course is 18.01.  Students
should be familiar with sequences and series, limits, and integration
and differentiation of univariate functions.

Most students will already be familiar with logical notation, elementary set 
theory, and elementary facts about numbers.  In order to make sure that 
everyone is sufficiently familiar with this material, each student should read 
sections 1.1--1.5 and 2.3 of {\it Discrete Mathematics and Its Applications} 
during the first week of the course.

Students who have taken 18.063, 18.310, or 6.046 should not take this course.
To learn probability, we recommend these students instead take 6.041,
18.440, 18.313, or 18.05.  Students can substitute 18.063 for 6.042 in
the EECS department M.Eng.\ and S.B. requirements.

%	It will be very useful for students to have some programming
%	experience, such as is acquired in the course 6.001.  Although no
%	programming course is a prerequisite, you should have some experience,
%	since we will at times refer to notions and terminology drawn from
%	computer programming.  For example, we will study induction and
%	recursion, and may at times refer to pointers or stacks.  If you have
%	no idea what these things are, then you will be at a disadvantage.

\section{Lectures}

Lectures will be held Tuesdays and Thursdays from 2:30 to 4:00 in Room 6-120.
Attendance in lectures is highly recommended.  Lecture notes from past years 
are available on the web, but the course is being revised this term and there
will be substantial changes in the lecture material.  Lecture notes for this 
term will be handed out in time for exams, but not in time to help with 
homework.  So to keep up, students will need to attend lecture.

\section{Tutorials}

All students {\bf must} attend a two-hour tutorial every Friday. 
{\bf ATTENDANCE WILL BE TAKEN.}  Each tutorial will consist of 
approximately twelve students, so there will be a good opportunity to ask 
questions and to interact with the staff. The emphasis 
of the tutorials is on techniques for solving problems, although new material 
will occasionally be presented.  During the final hour or so, the students will be divided into groups of 3--4 and each group will be assigned a problem to solve as a team.  The TA will then ask one member from one or more groups to present the solutions to the entire tutorial.  If the presentation is not satisfactory, the TA may ask the entire group to write up the solutions.


\section{Handouts and course notebook}

In order to keep your handouts organized, get a loose-leaf notebook
for the course.  All handouts will be on standard three-hole punched
paper and will be numbered consecutively.  Handouts will be available
in a file cabinet outside room NE43-309.

Handouts in postscript format can be obtained through the class web
site at {\tt http:// theory.lcs.mit.edu/classes/6.042}.  You can also
reach them by anonymous FTP at {\tt theory.lcs.mit.edu} in the
directory {\tt pub/classes/6.042/fall97}.

\section{Books}

The required textbooks for the course are {\it Discrete Mathematics and its Applications} by Kenneth H. Rosen (Third Edition, McGraw-Hill, Inc., 1995) and {\it The Nuts and Bolts of Proofs\/} by Cupillari.  The recommended textbook is {\it The Essentials of Probability\/} by Lutfiyya. 

{\it The Nuts and Bolts of Proofs\/} {\bf SHOULD BE READ COVER-TO-COVER BY EVERY STUDENT DURING THE FIRST 2 WEEKS OF THE COURSE.}  {\it Discrete Mathematics and its Applications\/} will serve as a useful reference for most of the course.  {\it The Essentials of Probability\/} will be useful near the end of the course.  It does a good job of covering the latter material (probability).

All texts will be available at The Coop under the heading 18.062.

\section{Exams}

There will be one quiz from 7pm to 9pm on the evening of Wednesday, October 15.  There will be a 3-hour final exam during the Final Exam Period at the end of the term.  

\section{Problem Sets}

Problem sets will be assigned on a weekly basis.  They will usually be
issued in lecture on Tuesday to cover that week's lectures and
tutorial, and then due in lecture on Tuesday the following week.
{\bf PROBLEM SETS WILL BE COLLECTED AT THE START OF CLASS.}  Any problem sets turned in past {\bf 2:35pm} will be considered late.  {\bf LATE PROBLEM SETS WILL BE 
PENALIZED 20\% OF THE FINAL GRADE.}

{\bf A PROBLEM SET WILL NOT BE ACCEPTED IF IT IS MORE THAN 2 DAYS LATE.}
Solutions to the problem sets will usually be distributed in the lecture or tutorial following the one in which they were due.
% We hope to follow the schedule indicated in the Course Outline handout, but
% difficulties may arise.  The problem set itself will provide official
% due dates.
Please clearly mark your problem sets with
(1) your name, 
(2) the date, 
(3) problem numbers, and 
(4) the name of your TA.
Also, {\bf ACKNOWLEDGE ANY PERSONS YOU COLLABORATED WITH ON THE PROBLEM
SETS}.  Your name should appear on every page.

Try to be as clear and precise as possible in your written solutions.
Understandability of the solution is as desirable as correctness.
Sloppy answers will be at a disadvantage and will receive fewer points
even if they are correct.  Do not use red ink to write up your
homework, because red is our color for grading.

If you are unable to complete a homework by the date assigned, 
please talk to your TA {\em in advance}. If you are unhappy with the way that
your homework has been graded, see your TA\@.  Questions, suggestions,
and complaints will be welcomed by the course staff.

When turning in a problem set, be sure to place it in the box that is labelled with the name of your tutorial instructor.

\section{Collaboration}

You are encouraged to collaborate in solving the homeworks.  Study
groups provide an excellent means to master the material of the
course.  You must write up solutions on your own, however.  If you do
collaborate on homeworks, you must cite all of your fellow
collaborators on the written problem set.  You must neither copy
solutions nor provide solutions to be copied.  {\bf YOUR WRITE-UP OF A
PROBLEM SOLUTION MUST BE YOURS.}  

{\bf NO COLLABORATION WILL BE ALLOWED ON EXAMS.}  Plagiarism, cheating, and
other anti-intellectual behavior will be dealt with severely.  If you
feel you may have violated this code of ethics, please talk with
either Professor Leighton or Dr. Vempala.  Note that it is far better if you contact us, rather than vice-versa, in cases where there is a violation of the code of ethics.

Lastly, please realize that we understand the pressure that you may experience while at MIT and that we will try to help you as best as we can.

\section{Grading}

The grade for the course will be based on your performance in tutorials, problem sets, and exams, as follows:

\subsection{Tutorials--20\%}

Each of the 13 tutorials will be worth 100 points.  You will be assigned 100 points if you show up at tutorial and actively participate.  You will get 0 points for failure to attend.  The default grade will be 100 points, although the instructor can lower your score if he/she feels that you are not putting forth a valid effort. Your overall tutorial grade will be the average of your 12 best tutorial scores (i.e., the lowest tutorial score is dropped before averaging).

\subsection{Problem Sets--30\%}

Each of the 13 problem sets will be worth 100 points.  Your overall grade for problem sets will be the average of your 12 best scores (i.e., the lowest score will be dropped before averaging).  

\subsection{Exams (Quiz 20\%, Final 30\%)}

Each exam score will be normalized to 100 points.  After normalization, 5 points will be automatically added to account for errors made in grading.  (Any errors in grading that are subsequently discovered will be credited to your score but only by the amount that exceeds the 5 points already given.)  Should the median adjusted score $S$ of an exam fall below 70 points, your score will be multiplied by $\frac{70}{S}$ to account for the possibility that the exam was too hard.  The maximum score for any exam is 100 points.  A student that misses an exam without a valid reason will receive a score of 0.

\subsection{Total Score}

The total score for the class will be computed by adding 20\% of the tutorial and quiz scores with 30\% of the problem set and final scores.  All values will be rounded to the next highest multiple of 0.1.  For example, we have illustrated the calculation of a typical total score below. 

\begin{center}
\begin{tabular}{lrcrcrr}
Tutorials    & 100.0 & $\times$  & .2 & = & 20.00\\
Problem Set  &  87.4 & $\times$  & .3 & = & 26.22\\
Quiz         &  55.0 & $\times$  & .2 & = & 11.00\\
Final Exam   &  75.3 & $\times$  & .3 & = & \underline{22.59}\\
\multicolumn{3}{c}{Total Score} &&& 79.81 &  $\Rightarrow$ 79.9 
\end{tabular}
\end{center}

In consideration of students that perform well in the class except for a single exam, we will allow a student to adjust his/her total score by replacing one-half of the contribution of either the quiz or the final (but not both) with the unadjusted total score as computed above.  For the example shown above, we would compute the adjusted total score as follows.

\begin{center}
\begin{tabular}{lrcrcrr}
Tutorials     & 100.0 & $\times$ & .2 &  = & 20.00 &\\
Problem Set   &  87.4 & $\times$ & .3 &  = & 26.22 &\\
Adjusted Quiz & $\frac{55.0 + 79.9}{2}$& $\times$ & .2 & = & 13.49 &\\
Final Exam    &  75.3 & $\times$ & .3 & = & \underline{22.59} &\\
\multicolumn{3}{c}{Adjusted Total Score} && &  82.30 & $\Rightarrow$ 82.3
\end{tabular}
\end{center}

\noindent
The exam score which is adjusted (if any) will always be selected so as to maximize the adjusted total score for the student.  An exam score of 0 cannot be adjusted.

The adjusted total score will be converted into a final grade for the course using the following scale:

\begin{center}
\begin{tabular}{rcrl}
97.0 & -- & 100.0 &    A+\\
93.0 & -- & 96.9  &    A\\
90.0 & -- &  92.9 &    A--\\
87.0 & -- &  89.9 &    A--\,-- (instead of B+)\\
83.0 & -- &  86.9 &    B\\
80.0 & -- &  82.9 &    B--\\
77.0 & -- &  79.9 &    C+\\
73.0 & -- &  76.9 &    C\\
70.0 & -- &  72.9 &    C--\\
67.0 & -- &  69.9 &    D+\\
63.0 & -- &  66.9 &    D\\
60.0 & -- &  62.9 &    D--\\
-0-  & -- &  59.9 &    F
\end{tabular}
\end{center}

If a student has an adjusted total score that is within 2 points of the next grade level (e.g., 85.3), then the student's grade may be raised to the higher level.  Such adjustment of the final grade will be made on a case-by-case basis.

\subsection{The Key to Getting a Good Grade}

The exams will be hard in 6.042/18.062.  It is imperative that students do well on the problem sets and tutorials in order to raise their average.  Not only are the problem sets and tutorials essential to learning the material, they will be a significant part of your final grade.

\end{document}











