![alexandros gerbessiotis alexandros gerbessiotis](https://live.staticflickr.com/5535/9385591257_e4bcc123ed_b.jpg)
HOMEWORK SUBMISSION LINK (pdf only, 1MB limit).If you do not attend in person, you can watch prerecorded videos of the TAs working through the recitation problems on the course's Youtube playlist. Because of Institute policy, if you choose to attend in person, you will be turned away if there are already more than 30 students present. The recitations will be held in a hybrid format to facilitate mathematical communication (drawing diagrams, writing proofs, etc. TA office hours will be held through WebEx: the WebEx link for each TA is of the form Tuesday noon-1pm and Friday 1-2pm ET She will also be sending emails to ensure that you are informed about your test time accomodations near to the tests and quizzes. a shift or extension in your test time), please contact Shianne. Undergraduate mentors: Haoyu He (heh3), Qifan Jiang (jiangq3), Jacob Libsman (libsmj), Kaiwen Min (mink3), David Qian (qiand), Joshua Wu (wuj14)Ĭourse Coordinator: Shianne Hulbert (hulbes) TAs: Yitian Liu (liuy57), Owen Xie (xieo), Shuting Yang (yangs21) Lectures: Tue/Fri 10:10am-12pm ET WebEx (see Piazza for the link) Lectures will be held synchronously, then uploaded to the course's Youtube playlist. See the course syllabus for more details. Understanding this helps you to avoid tilting at windmills. Theory of Computation This branch of CS helps delineate what kinds of problems can even be hoped to be solved, and how efficiently. The aim of FOCS is to give you the tools necessary to establish certainty about your algorithms: that they do what they claim to.Īs such, this course introduces the fundamental mathematics used in computer science for the purpose of ensuring such certainty: discrete mathematics and the theory of computation.ĭiscrete mathematics This is the study of objects that can be counted-including proofs, sums and recurrences, graphs, counting, and probability-this toolbox is essential for showing algorithms do as we claim. Syllabus | Course Logistics | Course Details Foundations of Computer Science, CSCI 2200, RPI, Spring 2021Īs a computer scientist, your goal will be to choose or design, then implement, efficient algorithms that accomplish the goals for which they were designed, with certainty.