MATH 2305 002 - DISCRETE MATHEMATICAL METHODSMAR 2017 WC

Course Information

DISCRETE MATHEMATICAL METHODS (MATH 2305)

Term: 2016 - 2017 - March-June

Faculty

Roxanne KempShow MyInfo popup for Roxanne Kemp
Email address is hidden, click here to email
 
Janell GibsonShow MyInfo popup for Janell Gibson
Email address is hidden, click here to email
 
Khaison R ReedShow MyInfo popup for Khaison R Reed
Email address is hidden, click here to email
 
Twana S ElliottShow MyInfo popup for Twana S Elliott
Email address is hidden, click here to email
 

Schedule

Mon-Thu, 12:00 AM - 12:00 PM (2/27/2017 - 3/26/2017) Location: ONLN ONLN

Description

A course designed to prepare math, computer science, and engineering majors for a background in abstraction, notation, and critical thinking for the mathematics most directly related to computer science. Topics include logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, combinatorics, discrete probability, recursion, sequence and recurrence, elementary number theory, graph theory, and mathematical proof techniques.

Prerequisite(s): MATH 1314 College Algebra or higher.

Go to Main Screen

Course Information (imported)

DISCRETE MATHEMATICAL METHODS (MATH 2305)

Term: 2016 - 2017 - March-June

Faculty

Roxanne KempShow MyInfo popup for Roxanne Kemp
Email address is hidden, click here to email
 
Janell GibsonShow MyInfo popup for Janell Gibson
Email address is hidden, click here to email
 
Khaison R ReedShow MyInfo popup for Khaison R Reed
Email address is hidden, click here to email
 
Twana S ElliottShow MyInfo popup for Twana S Elliott
Email address is hidden, click here to email
 

Schedule

Mon-Thu, 12:00 AM - 12:00 PM (2/27/2017 - 3/26/2017) Location: ONLN ONLN

Description

A course designed to prepare math, computer science, and engineering majors for a background in abstraction, notation, and critical thinking for the mathematics most directly related to computer science. Topics include logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, combinatorics, discrete probability, recursion, sequence and recurrence, elementary number theory, graph theory, and mathematical proof techniques.

Prerequisite(s): MATH 1314 College Algebra or higher.

Go to Main Screen

Course Information (imported) (imported)

DISCRETE MATHEMATICAL METHODS (MATH 2305)

Term: 2016 - 2017 - March-June

Faculty

Roxanne KempShow MyInfo popup for Roxanne Kemp
Email address is hidden, click here to email
 
Janell GibsonShow MyInfo popup for Janell Gibson
Email address is hidden, click here to email
 
Khaison R ReedShow MyInfo popup for Khaison R Reed
Email address is hidden, click here to email
 
Twana S ElliottShow MyInfo popup for Twana S Elliott
Email address is hidden, click here to email
 

Schedule

Mon-Thu, 12:00 AM - 12:00 PM (2/27/2017 - 3/26/2017) Location: ONLN ONLN

Description

A course designed to prepare math, computer science, and engineering majors for a background in abstraction, notation, and critical thinking for the mathematics most directly related to computer science. Topics include logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, combinatorics, discrete probability, recursion, sequence and recurrence, elementary number theory, graph theory, and mathematical proof techniques.

Prerequisite(s): MATH 1314 College Algebra or higher.

Go to Main Screen