DISCRETE MATHEMATICAL METHODS (MATH 2305)

Term: 2018-2019 FB October-January

Faculty

	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

Tue-Thu, 12:00 AM - 12:00 PM (10/29/2018 - 11/25/2018) Location: ONLN 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.

DISCRETE MATHEMATICAL METHODS (MATH 2305)

Term: 2018-2019 FB October-January

Faculty

	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

Tue-Thu, 12:00 AM - 12:00 PM (10/29/2018 - 11/25/2018) Location: ONLN 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.