Syllabus: Computer Science 257

COMPUTER SCIENCE 257
Discrete Structures

Dr. Theresa Beaubouef, Professor of Computer Science

OFFICE: 329C Fayard Hall

OFFICE HOURS
Tues	9:00 - 12:30
Wed	4:15 - 5:00 pm, 7:30 -7:45 as needed
Thur	1:45 - 2:30

Or by appointment.*

CONTACT INFORMATION:

          Phone: 985-549-3751, 549-2189
          Email: tbeaubouef@selu.edu
          Mailing Address: Southeastern Louisiana University
                                         Department of Computer Science & Industrial Technology
                                         SLU 10847
                                         Hammond, LA 70402

COURSE OBJECTIVES: Students will understand the basics of discrete mathematics and learn about fundamental math-related topics necessary for computer science. Material covered will include logic, recursion, probability, proof techniques, sets, functions, graphs, and other selected topics. Students will write algorithms for problems related to some of these topics.
Evaluated by tests, assignments, class activities, quizzes.

Program Learning Outcomes and Evaluation:

An ability to apply knowledge of computing and mathematics appropriate to the discipline

Evaluated by tests, assignments, class activities, quizzes.

TEXT: Mathematical Structures for Computer Science by Judith Gersting, 5th ed., Freeman Publishers, 2003.

GRADES: Final course grades will be computed as follows:

Test 1	20%
Test 2	20%
Test 3	20%
Quizzes/Programs/Homework/Class Activities	15% (No Make-ups or late assignments)
Final Exam	25%

*All assignments are due at the beginning of class on due date. Early submission is encouraged.

Late on same day (even one minute): -20%, Late next day –40%, Next day grade will be zero for the assignment.

Grades are based on ten-point scale, NO CURVING, NO EXTRA CREDIT.

TENTATIVE COURSE SCHEDULE: Chapter 1 Sections 1, 2, 3, 4, 5, 6, Test 1, Chapter 2 Sections 1, 2, 4, 5, Chapter 3 Sections 1, 2, 3, Test 2, Chapter 4 Sections 1, 3, 4, 5, Test 3, Chapters 5, 6, and (selected topics as time permits), comprehensive Final Exam.
All test dates and assignment due dates will be announced in class and/or via email at least one week ahead of time.
All dates are firm. Schedule may be modified to adapt to the needs of the class.

ATTENDANCE: Absences will have an adverse effect on your grade in the following ways: missed quiz points, missed announcements concerning assignments and due dates, non-exposure to material not directly covered in text.

ACADEMIC DISHONESTY: University policy will be followed for cases involving alleged academic dishonesty. Copying any part of another student’s assignment or exam is CHEATING. Allowing another student to copy is also CHEATING.

CLASSROOM DECORUM: The following activities are considered unacceptable in the classroom: eating, drinking, use of tobacco, use of electronic equipment, use of beepers or phones, profanity, sleeping, acting in an unsafe manner, repeatedly talking without being recognized, habitual tardiness.

NOTES:

Last day to drop: October 24

Check email often for important announcements.

Final Exam: Dec 11, 2008 at 8:00 am. (verify this with official schedule bulletin)

Holidays: Sep 1, Oct 2-3, Nov 26-28.

Students are responsible for all assigned reading material covered in text, whether covered in class or not.
Students are responsible for all material covered in class, whether covered in text or not.

If you are a qualified student with a disability seeking accommodations under the Americans with Disabilities Act, you are required to self-identify with the Office of Student life, Room 203, Student Union.

Last Updated August 2008