Discrete Structures (CS 102)
Academic Bulletin Description
Four Credits: An introduction to the foundations of computer science with an emphasis on understanding the abstract structures used to represent discrete objects. Participating in hands-on activities that often require teamwork, students learn the computational methods and logical principles that they need to create and manipulate discrete objects in a programming environment. Students also learn how to write, organize, and document a program’s source code so that it is easily accessible to intended users of varied backgrounds. During a weekly laboratory session students use state-of-the-art technology to complete projects, reporting on their results through both written documents and oral presentations. Prerequisite: Knowledge of elementary algebra. Distribution Requirements: QR, SP.
Lecture, Discussion, Presentations, and Group Work:
28 Aug. 2018 - 18 Dec. 2018: Lecture; Monday, Wednesday, Friday 11:00AM - 11:50AM, Alden Hall, Room 101
28 Aug. 2018 - 18 Dec. 2018: Lab; Wednesday 2:30PM - 4:20PM, Alden Hall, Room 101
Mondays: 1:30 pm -- 3:30 pm (10 minute time slots)
Tuesdays: 11:00 am -- 12:00pm and 2:30pm -- 4:30pm (10 minute time slots)
Thursdays: 11:00 am -- 12:00pm (10 minute time slots)
Schedule an appointment with me using the Google calendar
Tentative Chapter Schedule:
Other Useful Textbooks:
In order to acquire the proper skills in technical writing, critical reading, and the presentation and evaluation of technical material, it is essential for students to have hands-on experience in a laboratory. Therefore, it is mandatory for all students to attend the laboratory sessions. If you will not be able to attend a laboratory, then please see the one of the course instructor at least one week in advance in order to explain your situation. Students who miss more than two unexcused laboratories will have their final grade in the course reduced by one letter grade. Students who miss more than four unexcused laboratories will automatically fail the course.