Αποτελέσματα Αναζήτησης
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.
For each examlet, students are given an explicit skills list and TAs are given a pre-built rubric for grading open-answer questions. The examlets contain a mixture of multiple choice, drag and drop, short answer questions, shown below. For long proof questions (not shown), the interface allows students to include typeset equations in their answers.
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 overview. See also information about registration and prerequisites. The normal weekly schedule is as follows: Tuesdays: Tutorial (group problem solving).
Discrete structures and why do you care?
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.
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 125, ECE 220; one of MATH 220, MATH 221.
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.
