Discrete Mathematics

MATH 243

Introduces the theoretical tools for describing algorithmic operations; covers set theory, the number system, the nature of proofs, recursion, formal logic, proof by induction, combinatorics, recurrence relations, graph theory, search problems, finite state automata, grammars, and languages.NOTE: Course offered fall, spring, and may be offered during additional sessions Same As: CMSC 243 

  • Prerequisite(s) : MATH 165 or satisfactory score on the math placement test.
  • Credits: 4
  • Cost: See tution and fees »
{{term.Term}}
CRN Register Seats Days Times Date Location
{{class.Crn}} Full Register {{course.Seats}} {{class.Days}} {{class.Begin_Time}} - {{class.End_Time}} {{class.Start_Date}} - {{class.End_Date}} {{class.Location}}
CREDIT HOURS: {{class.Credit}} | BILLABLE HOURS: {{class.BillableHours}}
{{class.Notes}}
No class sections are currently available for this course.
     Loading...