Course Syllabus
Welcome to CS202: Discrete Structures. General information about this course and its requirements can be found below.
Getting Started
Earning College Credit
This course provides students the opportunity to earn actual college credit. It has been reviewed by Brandman University and can applied as credit towards a degree by students who are currently enrolled or plan to enroll at Brandman. You can read more about this special program here.
Evaluation and Minimum Passing Scores
In order to pass this course, you will need to earn a 70% or higher on the final exam. Your score on the exam will be tabulated as soon as you complete it. If you do not pass the exam on your first attempt, you may take it again as many times as needed, following a 7-day waiting period between each attempt.
You will only receive an official grade on your final exam. However, in order to adequately prepare for this exam, we recommend that you work through the materials in each unit. Throughout the course you may find practice quizzes or other assignments that will help you master material and gauge your learning. Scores on these assignments are informational only and do not contribute to your overall course grade.
If you are seeking to earn college credit at Brandman, you must take and pass the version of the exam titled "Proctored Final Exam." That exam will be password protected.
Technical Requirements
This course is delivered fully online. You will be required to have access to a computer or web-capable mobile device and have consistent access to the internet to either view or download the necessary course resources and to attempt any auto-graded course assessments and the final exam.
To access the full course including assessments and the final exam, you will need to be logged into your Saylor Academy account and enrolled in the course. If you do not already have an account, you may create one, free of charge, here. Although you can access some course resources without being logged into your account, it’s advised that you log in to maximize your course experience. For example, some of the accessibility and progress tracking features are only available when you are logged in.
For additional technical guidance check out Saylor’s tech-FAQ and the Moodle LMS tutorial.
Fees
There is no cost to access and enroll in this course. All required course resources linked throughout the course, including textbooks, videos, webpages, activities, etc are accessible for no charge. This course also contains a free final exam and course completion certificate.
This courses does contain an optional final exam that will provide students an opportunity to earn college credit. Access to the exam itself is free, though it does require the use of a proctoring service for identity verification purposes. The cost for proctoring is $25 per session.
Time Commitment
Tips/Suggestions
- create compound statements, expressed in mathematical symbols or in English, to determine the truth or falseness of compound statements and to use the rules of inference to prove a conclusion statement from hypothesis statements by applying the rules of propositional and predicate calculus logic;
- prove mathematical statements involving numbers by applying various proof methods, which are based on the rules of inference from logic;
- prove the validity of sequences and series and the correctness of repeated processes by applying mathematical induction;
- define and identify the terms, rules, and properties of set theory and use these as tools to support problem solving and reasoning in applications of logic, functions, number theory, sequences, counting, probability, trees and graphs, and finite state machines;
- calculate probabilities and apply counting rules;
- solve recursive problems by applying knowledge of recursive sequences;
- create graphs and trees to represent and help prove or disprove statements, to make decisions or select from alternative choices, to calculate probabilities, to document derivation steps, or to solve problems; and
- construct and analyze finite state automata (another name for machines), formal languages, and regular expressions.
Suggested Prerequisites
- have read the Saylor Student Handbook;
- have completed CS101 and/or CS102 for use of functions and procedures, conditional statements, loops, recursion, data types, and evaluation of expressions; and
- have skills in basic algebra and calculus.