Official Course description
Representation, analysis, techniques, and principles for manipulation of basic combinatoric data structures used in computer science. Rigorous reasoning is emphasized. (Counts as a Background Course for the CS concentration.)
Instructor: Prof. John Byers
Instructor: Prof. Babis Tsourakakis
Teaching Fellow (TF): Wonyl Choi
Teaching Fellow (TF): Konstantinos Sotiropoulos
The class will be co-taught by Professors Byers and Tsourakakis. On any given lecture date, one of the two instructors will deliver the lecture for both the A1 and B1 sections. The TFs will lead the discussion sessions. The objective is to reinforce the concepts covered in the lectures through problem-solving, and to provide some clarifications and guidance on the homework assignments. The purpose of the office hours of the Instructors and Teaching Fellows is to answer specific questions or clarify specific issues. Your fastest route to get an answer to most questions is via Piazza. Office hours are not to be used to fill you in on a class you skipped or to re-explain entire topics. Office hours are scheduled at times to provide the most help to students who start the homework before the last minute
Labs will be an invaluable part of the course involving interactive problem-solving sessions, tips on homework questions, and supplemental material not covered in lecture. Attendance is mandatory and will be taken.
Assignments and all other handouts can be found on our Piazza page, under the Resources tab.
Basic (high school level) calculus and algebra.
Academic standards and the code of academic conduct are taken very seriously by our university, by the College of Arts and Sciences, and by the Department of Computer Science. Course participants must adhere to the CAS Academic Conduct Code – please take the time to review this document if you are unfamiliar with its contents.
The collaboration policy for this class is as follows.
The course grade will break down as follows:
Last day to drop without a W: Oct 10. With a W: November 10. Our midterms are scheduled with these dates in mind.
Exams: There will be two in-class midterms held during the middle of the semester, tentatively Thursday, October 5 and Tuesday November 14. The cumulative final will be held during the normal two-hour final exam slot: Saturday, Dec 16, 3-5PM for students in the 2PM lecture and Tuesday, Dec 19, 3-5PM for students in the 3:30PM lecture. All exams will be in MCS B12. Please make your end-of-semester travel plans accordingly!
Homework Assignments, Submission, and Late Policy: Assignments will typically be due Fridays at 5PM. You must submit a hardcopy no later than 5PM in the drop box on the first floor of the MCS building, near the CS department office. From the CS office, walk toward the shorter end of the hallway, and turn right. Drop box is immediately on your right. Assignments must go in the box, not on the shelves above, which is where we used to return assignments. Plan on assignments being due every week, except right after a midterm, tentatively Sep 14, Sep 21, Sep 28, Oct 12, Oct 19, Oct 26, Nov 2, Nov 9, Nov 30, Dec 7.
We will collect assignments and post solutions at 5PM sharp, so homework assignments will not be accepted late. Therefore, do NOT cut it close!!
Regrading Procedure: If, after reviewing the posted solutions, you still believe a portion of your homework was graded in error, you may request a regrade. Please write, on a PostIt, the problem number and a brief description of the incorrect deduction, stick it on your homework, and give it to one of the Professors in lecture. Note that when we regrade a problem, your score may go up or down.
Attendance: It is expected that you will attend lecture and the laboratory section for this course. Attendance will be taken in labs. On occasion, some material covered in lecture and lab will not be covered by our textbook. We ask that you please arrive in class on time, since it is disruptive to have students flowing in throughout the class period. Moreover, when students are at a borderline between grades, I will factor in attendance before making a final determination.
Discrete Mathematics and Its Applications, Kenneth H. Rosen, 7th Edition.
We will be using Piazza for class discussion. The system is highly catered to getting you answers to your questions fast and efficiently from classmates, the TF, and the instructors. Please do not email questions to the teaching staff – post your questions on Piazza instead. We also encourage you to post answers to student questions there (but obviously, not answers to problems on the problem sets!). Our class page is located at: https:piazza.combuspring2015cs131home. Please go there to sign up today. We will also use Piazza to post announcements and all handouts, including homework assignments and solutions.
CAS CS 131 – Fall 2017 – Combinatoric Structures