CSC230-02&-05: Discrete Mathematical Structures for Computer Science (1971,11024)

Fall 2019 (3units)

 

Instructor: Dr. Kazunori Okada

Lec. Session 02

Lec. Session 05

TR: 12:30 - 1:45 pm

W: 4:00 – 6:45 pm

Location 02

Location 05

TH 329

TH 523

Office Phone

(415) 338-7687

Office

TH 911

Office Fax

(415) 338-6826

Office Hours

TR: 2:00 - 3:00 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

Nico Pensotes Santos

npensote@mail.sfsu.edu

TA Office Hour

TA Office

Fri: 2:00 - 3:00 pm

CS Undergraduate Lab (SCI 254)

 

Course Outline TR:12:30-1:45pm (230.02,#1971):

Subjects

Duration

Readers

Notes

Set Theory

2 weeks

Ch.1

Lec01, Lec02, Lec03, Lec04

Proof Techniques

1 week

Ch.1

Lec05, Lec06

Formal Logic

2 weeks

Ch.2

Lec07, Lec08, Lec09, Lec10

MIDTERM #1

Tentative: Oct 8 (review: Lec12)

Relations

1.5 weeks

Ch.3

Lec11, Lec13

Functions

1.5 weeks

Ch.4

Lec14, Lec15

MIDTERM #2

Tentative: Oct 29  (review: Lec17)

Algorithms

1 week

Ch.5

Lec16, Lec18

Graphs

1 week

Ch.6

Lec19, Lec20

Trees

0.5 week

Ch.6

Lec21

MIDTERM #3

Tentative: Nov 21 (review: Lec23)

Counting

1 week

Ch.7

Lec22, Lec24

Recursion

0.5 week

Ch.9

Lec25

FINAL EXAM

Dec 19 Thursday, 10:30am-12:45pm (review: Lec26)

Course Outline W:4:00-6:45pm (230.05,#11024):

Subjects

Duration

Readers

Notes

Set Theory

2 weeks

Ch.1

LecW01, LecW02

Proof Techniques

1 week

Ch.1

LecW03

Formal Logic

2 weeks

Ch.2

LecW04, LecW05

MIDTERM #1

Tentative: Oct 9 (review: LecW06)

Relations

1.5 weeks

Ch.3

LecW06, LecW07

Functions

1.5 weeks

Ch.4

LecW08

MIDTERM #2

Tentative: Oct 30  (review: LecW09)

Algorithms

1 week

Ch.5

LecW09, LecW10

Graphs

1.5 week

Ch.6

LecW11, LecW12

MIDTERM #3

Tentative: Dec 4 (review: LecW13)

Counting

1 week

Ch.7

LecW13, LecW14

Recursion

0.5 week

Ch.9

LecW15

FINAL EXAM

Dec 18 Wednesday, 4:00am-6:45pm (review: LecW15)

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

 

Prerequisites:

CSC 210 (Programming) with a grade of C or better; MATH 227 (Calculus II) with a grade of C or better or must be taken concurrently. Concurrent registration to CSC 210 is not allowed. Students who do not meet these prerequisites will not be permitted to take this course. When requested, you must submit, during the first class meeting, a hardcopy of your unofficial SFSU transcript report or similar reports from other institution showing your name, ID, and your previous institution if you did not take these courses at SFSU. Alternatively you may submit a hardcopy of CS department course transfer form showing your relevant credits. No show for the first class will results in automatic drop from the roster in order to make a room for other students in waitlist.

 

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, logic, proof techniques, induction procedures, relations, functions, graphs, trees, combinatorics, and recursive procedures.

 

Recommended Text Books:

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

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

 

Course Web Page:

          https://bidal.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. The default grade distribution is as follows: A (100% - 92.5%), A- (92.4%-90%), B+ (89.9% - 87.5%), B (87.4% - 82.5%), B- (82.4% - 80%), C+ (79.9% - 75%), C (74.9% - 65%), C- (64.9% - 60%), D+ (59.9% - 57.5%), D (57.4% - 52.5%), D- (52.4% - 50%), F (49.9% - 0%).

 

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 Code of Student Conduct: http://conduct.sfsu.edu/standards

·       Academic Dishonesty: http://conduct.sfsu.edu/academic-dishonesty

·       Plagiarism: http://conduct.sfsu.edu/plagiarism 

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

 

Learning Assistances:

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

 

Religious Holidays:

Reasonable accommodations will be made for you to observe religious holidays when such observances require you to be absent from class activities. It is your responsibility to inform the instructor during the first two weeks of class, in writing, about such holidays.

 

Disability Access:

Students with disabilities who need reasonable accommodations are encouraged to contact the instructor.  The Disability Programs and Resource Center (DPRC) is available to facilitate the reasonable accommodations process. The DPRC is located in the Student Service Building and can be reached by telephone (voice/415-338-2472, video phone/415-335-7210) or by email (dprc@sfsu.edu).

 

Student Disclosures of Sexual Violence:

SF State fosters a campus free of sexual violence including sexual harassment, domestic violence, dating violence, stalking, and/or any form of sex or gender discrimination.  If you disclose a personal experience as an SF State student, the course instructor is required to notify the Title IX Coordinator by completing the report form available at http://titleix.sfsu.edu, emailing vpsaem@sfsu.edu or calling 338-2032.

To disclose any such violence confidentially, contact:

·       The SAFE Place - (415) 338-2208; http://www.sfsu.edu/~safe_plc/

·       Counseling and Psychological Services Center - (415) 338-2208; http://psyservs.sfsu.edu/

·       For more information on your rights and available resources: http://titleix.sfsu.edu

 

Kazunori Okada © 2019, All rights are reserved.