DISCRETE MATHEMATICAL METHODS (MATH 2305)

Term: 2018-2019 SD - August-November

Faculty

	Roxanne KempShow MyInfo popup for Roxanne Kemp
	Email address is hidden, click here to email

	Themba NgwenyaShow MyInfo popup for Themba Ngwenya
	Email address is hidden, click here to email

Schedule

Mon-Tue-Thu, 6:30 PM - 10:30 PM (9/3/2019 - 9/29/2019) Location: MAIN NORTH N102

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 SD - August-November

Faculty

	Roxanne KempShow MyInfo popup for Roxanne Kemp
	Email address is hidden, click here to email

	Themba NgwenyaShow MyInfo popup for Themba Ngwenya
	Email address is hidden, click here to email

Schedule

Mon-Tue-Thu, 6:30 PM - 10:30 PM (9/3/2019 - 9/29/2019) Location: MAIN NORTH N102

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.