CSE 215: Foundations of Computer Science

Hello, if you have any need, please feel free to consult us, this is my wechat: wx91due

CSE 215: Foundations of Computer Science Fall 2024

Classes
Section 01: MoWe 2:00PM - 3:20PM, ENGINEERING 145 WESTCAMPUS
Instructor
Prof. Pramod Ganapathi
Email: [email protected]
Office: Room 105, New Computer Science
Office hours: MoWe 03:25PM - 04:55PM
Recitations and TA's
Google sheets

Course Description
In this course, we will learn the part of mathematics that is extensively used in computer science. The topics covered include: logic (propositional logic and predicate logic), number theory, proof techniques, sequences, recursion, functions, relations, and sets.
Prerequisites
AMS 151 or MAT 125 or MAT 131.
Credits
4
Course Outcome
At the end of the course, the students should have the following knowledge and skills:
  • An ability to verify if a mathematical argument is valid (i.e., logical) and sound (i.e., truthful)
  • An ability to verify the correctness of proofs of some existing theorems and prove some new theorems
  • An ability to use mathematical concepts such as sequences, functions, relations, and sets in computing
Textbook
  • [DM] Discrete Mathematics: Introduction to Mathematical Reasoning. Susanna S. Epp. Brief Edition.
Grading
Course requirements and grading are as follows:
  • Homework: 25%
  • Midterms: 45%
  • Final: 30%
Grade cutoffs are as follows. Grade cutoffs might be adjusted at the end of the semester if curving is required.
  • A [93-100], A- [90-93), B+ [87-90), B [83-87), B- [80-83), C+ [77-80), C [73-77), C- [70-73), D+ [67-70), D [63-67), F [0-63)
The previous exam papers can be found here:
  • Midterm 1, Midterm 2, Final [2021 Spring]
  • Midterm 1, Midterm 2, Final [2020 Fall, Section 1]
  • Midterm 1, Midterm 2, Final [2020 Fall, Section 2]
The problems given in the assignments will be majorly from the textbook.
Homework
Homework will be posted on Brightspace. Homework must be written on plain sheets of paper, scanned using a good scan app, and a single scanned PDF must be submitted on Brightspace. The PDF must have the student ID as the file name. Late submissions will not be graded for any reason (including oversleeping, forgetting, PC issues, technical issues, Brightspace issues, traveling, etc), except extenuating situations. It is strongly recommended to submit at least one version three days before the deadline. A student can submit an infinite number of versions of the answer sheets PDF to the Brightspace. We only evaluate the last/final version of the solutions PDF uploaded on Brightspace before the deadline.
Students who submit the first version of their homework at the exact deadline or after the deadline (even a nanosecond later), will receive 0. Because, we do not consider the time at which a homework was submitted by the student, we consider the time at which the homework was successfully up on Brightspace (with all pages in human-readable form) and it takes a few seconds/minutes to upload on Brightspace. If Brightspace flags the homework as late, it is late. It is the student's responsibility to verify whether the document was successfully submitted on Brightspace or not. Hence, it is strongly recommended to submit the homework multiple times starting from a few days before the deadline.
Grade/regrade requests deadline is 1 week after getting the homework/exam results on Brightspace. Any grade/regrade requests after this deadline will not be considered. Each student is assigned a TA. The grade/regrade requests must be made only to the assigned TA.
Makeup Exams
The two midterm exams and the final exam will be closed-book, closed-notes, closed-computers, and closed-calculators exams. The exams will be in person and will be proctored. Makeup exams will not be given for any reason (including oversleeping, forgetting, PC issues, technical issues, Brightspace issues, traveling, etc), except in the cases of medical emergencies (with documentation -- e.g. USA doctor's non-electronic signed note with all contact details/information stating that the student was ill and unfit to take the exam) and on the discretion of the instructor based on a case-by-case basis; student participation in university sponsored events (with documentation); and religious absences (with documentation). Students who miss an exam for an undeniably valid reason need to take a make-up exam; specific arrangements will be made on a case-by-case basis. Students who miss an exam must either give advanced notice (e.g. broke leg the previous day) with evidence or must report as soon as possible (e.g. met with an accident or medical emergency) with evidence. Students who miss exams for unimportant reasons (oversleeping, technical issues, transportation problems, family/friend functions, etc) will not be given make-up exams. Students are expected to abide by all standard examination rules and obey instructors/TA's at all times during the exams.
Attendance
Students are expected to attend every class, report for examinations and submit major graded coursework as scheduled. If a student is unable to attend lecture(s), report for any exams or complete major graded coursework as scheduled due to extenuating circumstances, the student must contact the instructor as soon as possible. Students may be requested to provide documentation to support their absence and/or may be referred to the Student Support Team for assistance. Students will be provided reasonable accommodations for missed exams, assignments or projects due to significant illness, tragedy or other personal emergencies. In the instance of missed lectures or recitations, the student is responsible for reviewing posted slides, reviewing recorded lectures, seeking notes from a classmate, etc. Please note, all students must follow Stony Brook, local, state and Centers for Disease Control and Prevention (CDC) guidelines to reduce the risk of transmission of COVID. For questions or more information click here.
Additional Resources
  • CEAS Free Tutoring Service Schedule
  • Books
    • [SWDM] A Spiral Workbook for Discrete Mathematics. Harris Kwong.
    • [MCS] Mathematics for Computer Science. Eric Lehman, F. Thomson Leighton, and Albert R. Mayer.
    • [BP] Book of Proof. Richard Hammack.
    • [DMOI] Discrete Mathematics: An Open Introduction. Oscar Levin. 3rd Edition.
    • [DFC] Delftse Foundations of Computation. Stefan Hugtenburg and Neil Yorke-Smith.
    • [ENT] Elementary Number Theory. W. Edwin Clark.
    • [ADS] Applied Discrete Structures. Alan Doerr and Kenneth Levasseur.
    • [FOCS] Foundations of Computer Science. Alfred V. Aho and Jeffrey D. Ullman.
  • Mathematical Puzzles
    • Wu Riddles
    • TED-ED Puzzles
    • 3Blue1Brown
    • Kurzgesagt
    • Numberphile
    • Mind Your Decisions
    • Brainzilla
  • Video Courses
    • MIT Course 2010. F. Thomson Leighton and Marten van Dijk.
    • MIT Course 2015. Albert R. Meyer and Adam Chlipala.
  • LaTeX
    • [OL] Learn LaTeX in 30 Minutes. Overleaf.
    • [WBL] Wikibook on LaTeX. Wikipeople.
    • [NSIL] The Not So Short Introduction to LaTeX. Tobias Oetiker.
    • [LCN] LaTeX for Complete Novices. Nicola L. C. Talbot (More Books).
    • [MML] More Math into LaTeX. George Gratzer. 4th Edition.
    • [LT] LATEX Tutorials. Indian Users Group.
    • [SIL] A Simplified Introduction to LaTeX. Harvey J. Greenberg.
    • More Books
  • Mathematical Writing
    • [SMW] Mathematical Writing. Donald E. Knuth, Tracy Larrabee, and Paul M. Roberts.
    • [HWMS] Handbook of Writing for the Mathematical Sciences. 2nd Edition. Nicholas J. Higham. (Paid)
Academic calendar
Recorded video lectures can be accessed through Google Drive Link using @stonybrook.edu email account.
Date
Class Schedule
Slides
Study
Notes
Aug 26 Introduction (Course Info) [PDF][PDF] [DM, Ch. 1] Map of Math, Map of CS
Aug 28 [HW 1]
Sep 04
Sep 09
Sep 11
Logic → Propositional Logic [PDF] [DM, Ch. 2] Take-home lesson: Logical thinking
Sep 16 [HW 2, HW 1 due]
Sep 18
Logic → Predicate Logic [PDF] [DM, Ch. 3]
Sep 23 [HW 3, HW 2 due]
Sep 25
Sep 30
Proof Techniques [PDF] [DM, Ch. 4] Take-home lesson: Proof-style thinking
Oct 02 [HW 3 due] Midterm I Review
Oct 07 Midterm I Time: Class time, Venue: Class, Syllabus: [DM, Ch. 1-4] + Logic circuits
Oct 09 [HW 4]
Oct 16
Oct 21
Oct 23
Sequences (Induction and Recursion) [PDF] [DM, Ch. 5] Take-home lesson: Recursive thinking
Oct 28 [HW 5, HW 4 due]
Oct 30
Sets [PDF] [DM, Ch. 6]
Nov 04 [HW 6, HW 5 due]
Nov 06
Nov 11
Nov 13
Functions [PDF] [DM, Ch. 7] Take-home lesson: Input-output thinking
Nov 18 [HW 6 due] Midterm II Review
Nov 20 Midterm II Time: Class time, Venue: Class, Syllabus: [DM, Ch. 5-7]
Nov 25 [HW 7]
Dec 02
Relations [PDF] [DM, Ch. 8]
Dec 04 [HW 7 due] Final Review
Dec 09 Career & Personality Development
Dec 18 (We) Final Time: 2:15-5:00 PM, Venue: Class, Schedule
Syllabus: [DM, Ch. 1-8, except Sec. 8.5]

发表评论

电子邮件地址不会被公开。 必填项已用*标注