Search Results (1)


Please log in to save materials.

Selected filters:
  • Conditional Statements
Discrete Structures
Conditions of Use:
Read the Fine Print

This course describes discrete mathematics, which involves processes that consist of sequences ... More

This course describes discrete mathematics, which involves processes that consist of sequences of individual steps (as compared to calculus, which describes processes that change in a continuous manner). The principal topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite state machines. Upon successful completion of this course, the student will be able to: 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 or 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 automata; 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, make decisions or select from alternative choices to calculate probabilities, to document derivation steps, or to solve problems; Construct and analyze finite state automata, formal languages, and regular expressions. (Computer Science 202) Less

Computer Science
Material Type:
Full Course
Homework and Assignments
Lecture Notes
Video Lectures
The Saylor Foundation
Provider Set:
Saylor Foundation
2002 gnirpS ,ngiseD gnireenignE liviC ot noitcudortnI

.)310.1( tcejbus ngised enotspac eht dna )150.1 ,140.1 ,130.1( stcejbus ngised aera ... More

.)310.1( tcejbus ngised enotspac eht dna )150.1 ,140.1 ,130.1( stcejbus ngised aera ytlaiceps tneuqesbus eht ni desu si hcihw decudortni si esac ngised egral A .naps efil detcepxe dna ,srotcaf laicos dna cimonoce ,tnemnorivne larutan ,tnemnorivne tliub gnitsixe eht fo noitaredisnoc sa llew sa sehcaorppa lacinhcet snrecnoc ylticilpxe ngised tcejorP .)sdaor dna segdirb ,sgnidliub ,.g.e( seitilicaf tliub no sisahpme na htiw ,sesac ngised lareves sedulcnI .gnireenigne livic ni secitcarp dna seussi ngised sa llew sa ,gnivlos-melborp evitaerc dna ngised gnireenigne fo seuqinhcet dna ,sloot ,yroeht eht ot stneduts secudortnI Less