Homework Assignments Syllabus 

Textbook  Professor 

Scheduled Lectures  Homework Policy  Exam Schedule 
Grades  Honor Principle  Disabilities 



Overview 

This course integrates discrete mathematics with algorithms and data structures,
using computer science
applications to motivate the mathematics.
The course introduces counting techniques and number theory, with an emphasis
on the application to RSA public
key cryptography. It covers logic and proofs, including mathematical induction.
Relationships among recursive
algorithms, recurrence relations, and mathematical induction are discussed
with particular attention to trees as a
recursive data structure. Issues of expected running time for algorithms
and the technique of hashing data files
for quick recovery of information guides the discussion of probability through
independent trials experiments and
expected values. The course also covers matrix algebra, motivated by how
linear transformations are used in
computer graphics and (time permitting) in error correction codes.
The teaching method for the course is based on student group discussion
of problems in class for about half of each
class period. These group discussions are followed by wholeclass discussions
which explain the ideas behind the
problems and amplify on them. There is a good bit of research that shows
students retain more information when
they "construct" their own understanding of it in some way; the teaching
method is designed to foster such
constructions while covering the material in discrete mathematics that computer
science students need to know.
Although the reasons for group work are based on research in learning,
it is worth mentioning that people
responsible for hiring in business usually put very high priority on a recruit's
ability to function as part of a team. Thus
outstanding teamwork will be recognized in grading the course as described
below to allow a potential employer to
learn about it.
I hope the following quote will inspire you to participate in this course.
"Mathematics is not for spectators; in order to gain in understanding, confidence, and enthusiasm one has to participate." M.A. Armstrong
Professor 

Professor: Rosa Orellana  
Office: 305 Bradley Hall Office Hours:


Phone: 646  2430 or BlitzMail: Rosa.C.Orellana at Dartmouth dot edu (preferred) 
TA 
TA: Geeta Chaudhry 
Office: 203 Sudikoff Office Hours: By appointment 
Phone: (603)6461639 Email: geetac at cs dot dartmouth dot edu 
TA: King Y. Tan 
Office:Sudikoff 106 Office Hours: Tuesday 12pm  4pm 
Phone: 6463297 Email:kytan at cs dot dartmouth dot edu 
TA: Yurong Xu 
Office:Gerry 3 Office Hours: Thursday: 9am11:30am, 4pm6:30pm 
Phone: 646.0406 Email:Yurong.Xu at cs dot dartmouth dot edu 
Prerequisites 
CS 5 or equivalent
CS 15 or 18 (corequisite)
Textbooks 

Required
Scheduled Lectures 

Tutoring 
Tutorial sessions will be held Tuesday, Thursday, and Sunday evenings
from 7:00 PM to 9:00 PM.
TAs will aso be available for office hours. The room for the tutorials
is Gerry 103
Exams 

Exam  Date and Time  Room 
Midterm 1  Monday, January 27, 5:00 pm.  TBA 
Midterm 2  Monday, February 17, 5:00 pm  Moore B03 
Final  Thursday, March 13  8:0010:00 AM  Bradley 102 
Homework Policy and Guidelines 

Grades 

The course grade will be based upon the scores on the homework, two exams, participation (this means attending class and office hours as well as asking and responding to questions), and the final exam.
Exams (2)  20% (each) 
Homework  20% 
Participation  10% 
Final Exam  30% 
The Honor Principle 

On Exams: No help given or received from anyone. You may not use books or notes during inclass exams. For takehome exams you can use your class notes only.
On Homework: Collaboration is permitted and encouraged, but NO COPYING . In other words, you should feel free to talk to other students while you are in the process of thinking about a problem. However, when it comes time to write up your solutions, you should do this by yourself without outside assistance.
Disabilities 

Any student with a documented disability needing academic adjustments or accommodations is requested to speak with the instructor by January 20. All discussions will remain confidential, although the Academic Skills Center may be consulted to verify the documentation of the disability. Students who think they may have a disability but are not sure are encouraged to consult with the Academic Skills Center in Collis Center to register for support services.
Back to math 19 webpage