Αποτελέσματα Αναζήτησης
The syllabus is divided into the following sections: Course Description; Staff and Office Hours; Assigned Work; Grading Formula; Academic Integrity Policy. Please read all sections thoroughly; they provide a variety of critical information and useful guidance for succeeding in the course.
Discrete mathematical structures frequently encountered in the study of Computer Science. Sets, propositions, Boolean algebra, induction, recursion, relations, functions, and graphs. Course Information: Credit is not given for both CS 173 and MATH 213. Prerequisite: One of CS 124, CS 125, ECE 220; one of MATH 220, MATH 221.
At the University of Illinois, this course is taught right after one term of programming and one term of calculus, so it's critical that the course be accessible to students with limited background but prepare them for subsequent theoretical CS courses.
Welcome CS 173, Fall 2021! This term, all lectures of CS 173 are sharing one web site because we will be running in sync. Please look through the links above to get familiar with the syllabus and the tools that we'll be using. This page provides a quick summary to deal with immediate issues.
Welcome to CS 173, Fall 2020! Announcements are posted on our Piazza. Assignments and readings are on the Schedule page (see tabs above). Browse the tabs above to become familiar with our course and how it will be run.
The syllabus is divided into the following sections: Course Description; Staff and Office Hours; Assigned Work; Grading Formula; Academic Integrity Policy; Please read all sections thoroughly; they provide a variety of critical information and useful guidance for succeeding in the course.
Most of you are taking this course because it's required by the CS major, the ECE major, or the CS minor. There's three main reasons for making you take it To prepare you for CS 225 (e.g. analyzing running time of algorithms) and CS 374 (which expects you to be able to do proofs).
