CS 2050

Overview

CS 2050 is a 3 credit hour CS class taken by CS majors.

Topic List

1. Propositions and Propositional Logic
2. Methods of Proof
3. Set Theory
4. Induction and Recursion
5. Algorithms and Big-O Analysis
6. Introductory Number Theory
7. Counting, Permutations, and Combinations

How it fits in the Curriculum

CS 2050 is a required class for all CS, CompE, and CM majors. It is one of the lower-divison requirements for CS and CompE. It is also a prerequisite for Algorithms (CS 3510) and Applied Combinatorics (MATH 3012), two core requirements for CS majors.

Current Registration Information

CS 2050 is not a linked course but has an optional Recitation. You must only register for the lecture section (marked with an A, B, C, etc.). Then you have the option (although its recommended) to register for the recitation section, which is under a different course number: CS 2050R. If you decide to register for recitation, you must register for a recitation section with the same leading letter (e.g. if you register for lecture section CS 2050 A, you must register for recitation section CS 2050R A01, A02, etc.).

Prerequisites

None! CS 2050 can be taken as a first year class.

Equivalent Courses

CS 2051 is the equivalent honors section of discrete math. It gives equivalent credit.

If you love math and have an interest in learning discrete math at a higher level, consider taking CS 2051 instead. Note that neither CS 2050 nor CS 2051 expect knowledge of proofs in any form.

Majors that Require this Class

• Computer Science (pick between CS 2050 and CS 2051)
• Computer Engineering
• Computational Media