CS103B is the continuation of CS103A. Both courses together constitute an in-depth course in discrete mathematics. This is the area of mathematics that deals with the study of discrete objects, where "discrete" means distinct or unconnected. Discrete math is used, for example, whenever objects are counted, when relationships between finite sets are studied, and when processes involving a finite number of steps are analyzed. This area of math has become increasingly important because information is stored and manipulated in a computer in a discrete fashion.
Discrete math provides the mathematical foundations for many computer science courses including data structures and algorithms, compilers, automata theory and formal languages, operating systems, database theory, to name a few. You will find these courses much more difficult if you attempt them without the foundations of discrete math.
The pre-requisite for this course is CS103A.
Mondays, Wednesdays, & Fridays 10:00 - 10:50 am in Gates B03.
Monday, May 5th, 6:30 - 8:30 pm. 2-hour in-class exam. Gates B01.
Friday, June 6, 8:30 - 11:30 am. 3-hour in-class exam; location TBA.
Mondays & Wednesdays 9 - 10 am or by appointment in Gates 185
Each week, our TAs will hold office hours in a classroom where you can come and work on problems from a problem set or the textbook. The TA will be available to answer questions when needed. The purpose of this is to provide students with additional options for obtaining assistance besides the individual office hours and the help line.
For the TA office hours schedule, please see the staff page.
REMINDER: Please remember to bring your Stanford ID card to open the Gates basement door (facing Gilbert Biology). The Gates building doors lock at 5:30 pm as well as on the weekends.
There will be several problem sets that will be graded. Approximately half of the problems on each problem set will be graded and your grade on the problem set will be based on your solutions to only those problems. Which problems will be graded will be determined randomly after the problem set is submitted. All problem sets are due by 5 p.m. in Gates on the dates specified in the syllabus.
Final grades will be based on the following:
To receive a passing grade, you must complete passing work on both the problem sets and the exams.
No required textbook. Everything will be provided to you in handouts. If you miss picking them up in class, you can obtain them from the handout bin in Gates (if any are left over), or from the handouts page.
The best way to obtain the skills required to succeed in this course is to solve problems - lots and lots of problems. Come to class where you will see especially important examples and applications, stay on schedule by doing a part of the current problem set each day after class. Come and see us if you need help (or write to the help line). Most importantly, if you are feeling confused, frustrated or worried about anything pertaining to the course, please let us know.