CS202 Course Syllabus Saylor Academy PDF

Preview

Summary

lecture notes , course work ,discrete structure and discrete mathmatics...

Description

 Back to 'Course Introduction'

Log in or Sign up to track your course progress, gain access to final exams, and get a fre

Course Syllabus Welcome to CS202: Discrete Structures Specific information about this course and its requirements can be found below. For more general information including information about Community and Academic Codes of Conduct, please read the Saylor Student Han 

Course Description Introduction to the mathematical foundations from discrete mathematics for analyzing computer algorithms, Focuses on the introduction to models of computation, including finite state machines and Turing machines. 

Course Introduction This course has been designed to provide you with a clear, accessible introduction to discrete mathematics. Di that consist of a sequence of individual steps (as compared to calculus, which describes processes that change topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite stat the units of this course, you will develop the mathematical foundations necessary for more specialized subject structures, algorithms, and compiler design. Upon completion of this course, you will have the mathematical k of the science and technology of the computer age.

Unit 1: The Logic of Compound Statements Unit 2: The Logic of Quantified Statements Unit 3: Introduction to Number Theory and Proof Methods Unit 4: Mathematical Induction and Introduction to Sequences Unit 5: Set Theory Unit 6: Introduction to Counting and Probability Unit 7: Recursion Unit 8: Graphs and Trees Unit 9: Regular Expressions and Finite-State Automata 

Course Learning Outcomes Upon successful completion of this course, you will be able to: create compound statements, expressed in mathematical symbols or in English, to determine the truth or f to use the rules of inference to prove a conclusion statement from hypothesis statements by applying the r calculus logic; prove mathematical statements involving numbers by applying various proof methods, which are based on prove the validity of sequences and series and the correctness of repeated processes by applying mathema

Evaluation and Minimum Passing Score . In order to pass this course, . Your score on the exam will be tabulated as soon as you complete it. If you do not pass the exam o again as many times as needed, following a 7-day waiting period between each attempt. Once you have succe awarded a free Saylor Certificate of Completion. There are also

in this course. These are intended to help you to . You may retake all of these as many times as needed to feel that you h

and material covered. You can locate a full list of these sorts of assessments by clicking on Quizzes in the cours 

Earning College Credit This course provides students the opportunity to earn actual college credit. It has been reviewed by towards a degree by students who are currently enrolled or plan to enroll at Brandman.You can read more ab

: There is a 14-day waiting period between attempts of the Direct Credit final exam. There is no imposed w credit certificate-bearing exam and the credit exam. Some credit exams have a maximum number of attempts exam's instructions page. 

Tips for Success CS202: Discrete Structures is a

in which you the learner determines when you will start and w

There is no instructor or predetermined schedule to follow. While learning styles can vary considerably and an less time to learn or read, we estimate that the "average" student will take to complete this course. W the course at a pace that is comfortable for you and allows you to make regular (daily, or at least weekly) progr your study time in advance and try as best as you can to stick to that schedule. Learning new material can be challenging, so below we've compiled a few suggested study strategies to help y Take notes on the various terms, practices, and theories as you read. This can help you differentiate and co you with a refresher as you study. As you progress through the materials, take time to test yourself on what you have retained and how well y process of reflection is important for creating a memory of the materials you learn; it will increase the proba information. Although you may work through this course completely independently, you may find it helpful to connect w through the discussion forums. You may access the discussion forums at https://discourse.saylor.org. 

Suggested Prerequisites In order to take this course you should: have completedCS101and/orCS102for use of functions and procedures, conditional statements, loops, re expressions; and have skills in basic algebra and calculus.

Technical Requirements

Last modified: Wednesday, October 2, 2019, 12:35 PM...