CSC230: Discrete Mathematical Structures for Computer Science

Fall2011 (3 UNITS)

 

Instructor: Dr. Kazunori Okada

Lec. Session

TTH: 12:35 - 1:50 pm

Lec. Location

TH 331

Office Phone

(415) 338-7687

Office

TH 911

Office Fax

(415) 338-6826

Office Hours

W: 1:20 - 2:20 pm

Email Address

kazokada@sfsu.edu

Web Page

http://online.sfsu.edu/~kazokada/

Mailing Address

Computer Science Department, San Francisco State University
1600 Holloway Avenue San Francisco, CA 94132-4163

Teaching Assistant

Mr. Lorenzo Flores

ltflores@sfsu.edu

TA Office Hour

TA Office

Thr: 2:00-3:00pm

SCI 254 (CS Undergrad Lab)

 

Course Outline:

·         Set Theory                         (Ch.1): 2 weeks

·         Proof Techniques              (Ch.1): 1 week

·         Formal Logic                     (Ch.2): 2 weeks

·         Test 1:                               (tentative: Oct 11)

·         Relations                           (Ch.3): 1.5 weeks

·         Functions                          (Ch.4): 1.5 week

·         Test 2:                               (tentative: Nov 01)

·         Analysis of Algorithms     (Ch.5): 1 week

·         Graphs                               (Ch.6): 1 week

·         Trees                                  (Ch.6): 0.5 week

·         Test 3:                               (tentative: Dec 01)

·         Counting                           (Ch.7): 1 week

·         Recurrence Relations        (Ch.9): 0.5 week

·         Special Topics:                  0~1 week

·         Final Exam:                       December 13 Tuesday, 10:45am-12:00pm

Chapter numbers are according to Haggard’s text. The timelines shown above are only estimates and are subject to change.

 

Prerequisites:

A grade of C or better in CSC 210 (Programming) and Math 227 (Calculus II). Students who do not meet these prerequisites will not be permitted to take this course. Concurrent registrations to these courses are not allowed. You must submit a copy of your transcripts if you did not take these courses at SFSU.

 

Course Summary:

The goal of this course is to introduce students to ideas and techniques from discrete mathematics that are widely used in computer science. We study topics in such areas as sets, matrix algebra, combinatorics, logic, induction and recursive procedures, relations, functions, graphs, and trees.

Text Book:

Discrete Mathematics for Computer Science, Haggard G, Schlipf J, Whitesides S. Thomson Brooks/Cole, 2006

 

Other Recommended Readers:

Discrete Mathematics and Its Applications (6th Ed), Rosen KH. McGraw-Hill Higher Education, 2006

Discrete Mathematics with Graph Theory(3rd Ed), Goodaire EG and Parmenter MM. Prentice Hall, 2005

 

Course Web Page:

            http://cose-stor.sfsu.edu/~kazokada/csc230/

 

 

 

Grade Weights:

·         10%:          Homework

·         20%:          Test 1

·         20%:          Test 2

·         20%:          Test 3

·         30%:          Final Exam

 

Homework:

Biweekly homework will be given for assisting your self-study and preparing you for exams. Submit your answer in class within a week. In your submission, write your name, student ID, and homework number clearly on the front page. No late homework will be accepted.

 

Exams:

There will be three midterm tests as well as a final exam. The first test covers set theory, proof techniques, and formal logic. The second test covers relations and functions. The third test covers algorithms, graphs, and trees. The final exam will cover all the materials covered in this course. No make-up exams will be given.

 

Grading Policy:

If you like to appeal your homework or test grades, you must do so within two weeks after your work was returned in class. There will be no exception even if you miss those classes. You are responsible to find out your grades.

 

Absence:

Regular attendance is recommended. In the event of an absence, it is the student’s responsibility to learn of any material missed. Lectures and demonstrations will not be repeated during office hours. In case of extraordinary circumstance, it is the student’s responsibility to inform the instructor as soon as s/he can.

Syllabus is Subject to Change:

This syllabus and schedule are subject to change. The official syllabus will be maintained at the course website. It is your responsibility to check on the site frequently and when such a change is announced.

 

 

Academic Integrity & Plagiarism:

Academic Integrity refers to the “integral” quality of the search for knowledge that a student undertakes. Plagiarism is a form of cheating or fraud; it occurs when a student misrepresents the work of another as his or her own. I encourage discussion among students, but I expect each student to hand in original work. You are responsible for doing your own work and for insuring that your work is protected from copying. Violation to the university and departmental rules (found in below links) is a serious offence and can result in severe penalties. It is your responsibility to familiarize yourself with the following rules:

·         SFSU Policy: http://www.sfsu.edu/~bulletin/current/supp-reg.htm#ppg339

·         Computer Science Department Policy: http://cs.sfsu.edu/plagarism.html

 

Disability Accommodations:

Students with disabilities who need reasonable accommodations are encouraged to contact the instructor. The Disability Programs and Resource Center (http://www.sfsu.edu/~dprc/welcome.html) is available to facilitate the reasonable accommodations process. The DPRC, located in SSB 109, can be reached by telephone at 338-2724 (voice/TTY) or by e-mail at dprc@sfsu.edu

 

Learning Assistances:

Learning Assistance Center, located at HSS 348, offers tutoring services for various subjects. More information can be found at http://www.sfsu.edu/~lac/ and http://www.sfsu.edu/~lac/tutoring.html

 

Kazunori Okada © 2011, All rights are reserved.