Park University Logo

Related: Park.edu Home · Calendar · Degrees · Class Watch · Syllabus
Location
School Year
Semester   
Discipline
Course Number (Optional)
Limit to show only
Show classes per page
Specify Day and Time
Monday
Tuesday
Wednesday
Thursday
Friday
Saturday
Sunday
Morning Classes
(Starts before Noon)
Afternoon
(Starts after Noon before 5:00)
Evening
(Starts 5:00 or later)
Hide Cancelled Classes Blended Classes




MA208 - Discrete Mathematics

Course Description: CS208 Discrete Mathematics: This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include combinatorial problem solving, logic, Boolean algebra, combinatorial circuits, sets, relations, functions, proofs, mathematical induction, recurrence relations, graphs, trees, and counting techniques. Prequisite: A grade of "C" or better in any math course >= than MA125, or an ACT math score >= than 23, or an SAT math score >= 510, or a COMPASS score >= 66 in the Algebra placement domain, or a COMPASS sc ore 0-45 in the College Algebra placement domain. 3:0:3
TitleSemesterCampusRoomSectionHoursFacultyReqTimesDaysStatusSyllabus
Discrete MathematicsF1RR2013Mountain Home AFBN/AMT3StaffXX+TBA

1/30/ 0
Discrete MathematicsS1T2014Online Courses (Undergraduate)N/ADL3StaffXX+TBA
TBA
0/25/ 0
Discrete MathematicsU1T2014Online Courses (Undergraduate)N/ADL3StaffXX+TBA
TBA
0/25/ 0
Discrete MathematicsF1T2013Online Courses (Undergraduate)N/ADL3StaffXX+TBA
TBA
1/25/ 0
Discrete MathematicsFA2013Parkville DaytimeSC016HO3Hsin, WenXX+8:45 - 10:00 AM
--T-R--
2/ 4/ 0


MA208 - Discrete Mathematics

Course Description: CS208 Discrete Mathematics: This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include combinatorial problem solving, logic, Boolean algebra, combinatorial circuits, sets, relations, functions, proofs, mathematical induction, recurrence relations, graphs, trees, and counting techniques. Prequisite: A grade of "C" or better in any math course >= than MA125, or an ACT math score >= than 23, or an SAT math score >= 510, or a COMPASS score >= 66 in the Algebra placement domain, or a COMPASS sc ore 0-45 in the College Algebra placement domain. 3:0:3 (From catalog 2012-2013)
TitleSemesterCampusRoomSectionHoursFacultyReqTimesDaysStatusSyllabus
Discrete MathematicsU1Z2013Malmstrom AFBN/AML3LeVeque, Douglas N.XX+5:00 - 7:30 PM
--T-R--
3/20/ 0View
Discrete MathematicsF2T2012Online Courses (Undergraduate)N/ADLA3Shrestha, BijayaXX+TBA
TBA
8/25/ 0View
Discrete MathematicsF2T2012Online Courses (Undergraduate)N/ADLB3Green, Kathleen R.XX+TBA
TBA
11/25/ 0View
Discrete MathematicsS2T2013Online Courses (Undergraduate)N/ADL3Shrestha, BijayaXX+TBA
TBA
17/25/ 0View
Discrete MathematicsF2T2012Online Courses (Undergraduate)N/ADL3Hostetler, Michael L.XX+TBA
TBA
12/15/ 0View
Discrete MathematicsSP2013Parkville DaytimeSC016HO3Wakeman, JeremyXX+8:45 - 10:00 AM
--T-R--
4/ 5/ 0View
Discrete MathematicsFA2012Parkville DaytimeSC016HO3Wakeman, JeremyXX+8:45 - 10:00 AM
--T-R--
5/ 5/ 0View


MA208 - Discrete Mathematics

Course Description: CS208 Discrete Mathematics: This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include combinatorial problem solving, logic, Boolean algebra, combinatorial circuits, sets, relations, functions, proofs, mathematical induction, recurrence relations, graphs, trees, and counting techniques. Prequisite: A grade of "C" or better in any math course >= than MA125, or an ACT math score >= than 23, or an SAT math score >= 510, or a COMPASS score >= 66 in the Algebra placement domain, or a COMPASS sc ore 0-45 in the College Algebra placement domain. 3:0:3 (From catalog 2011-2012)
TitleSemesterCampusRoomSectionHoursFacultyReqTimesDaysStatusSyllabus
Discrete MathematicsSP2012Parkville DaytimeSC016HO3Hsin, WenXX+8:45 - 10:00 AM
--T-R--
6/ 5/ 0View
Discrete MathematicsFA2011Parkville DaytimeSC016HO3Hsin, WenXX+8:45 - 10:00 AM
--T-R--
5/ 5/ 0View


MA208 - Discrete Mathematics

Course Description: CS 208 (MA 208) Discrete Mathematics This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include combinatorial problem solving, logic, Boolean algebra, combinatorial circuits, sets, relations, functions, proofs, mathematical induction, recurrence relations, graphs, trees, and counting techniques. Prerequisite: A grade of C or better in any math course >_ MA 125, or an ACT math score >= 23, or an SAT math score >= 510, or a COMPASS score >= 66 in the Algebra placement domain, or a COMPASS score 0-45 in the College Algebra placement domain. 3:0:3 (From catalog 2010-2011)
TitleSemesterCampusRoomSectionHoursFacultyReqTimesDaysStatusSyllabus
Discrete MathematicsU1LL2011Little Rock AFBN/ALR3Hostetler, Michael L.XX+6:00 - 9:00 PM
-M-W---
5/30/ 0
Discrete MathematicsFA2010Parkville DaytimeSC016HO3Hsin, WenXX+12:00 - 1:15 PM
-M-W---
3/ 4/ 0View
Discrete MathematicsSP2011Parkville DaytimeSC016HO3Hsin, WenXX+8:00 - 8:50 AM
-M-W-F-
1/ 4/ 0View


MA208 - Discrete Mathematics

Course Description: MA 208 (CS 208) Discrete Mathematics: This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include combinatorial problem solving, logic, Boolean algebra, combinatorial circuits, sets, relations, functions, proofs, mathematical induction, recurrence relations, graphs, trees, and counting technique. 3:0:3. Prerequisite: any math course > MA131. (From catalog 2009-2010)
TitleSemesterCampusRoomSectionHoursFacultyReqTimesDaysStatusSyllabus
Discrete MathematicsU1Z2010Malmstrom AFBN/AML3LeVeque, Douglas N.XX+5:00 - 7:30 PM
-M-W---
5/30/ 0View
Discrete MathematicsFA2009Parkville DaytimeSC016HO3Hsin, WenXX+9:00 - 9:50 AM
-M-W-F-
3/ 5/ 0
Discrete MathematicsSP2010Parkville DaytimeSC016HO3Hsin, WenXX+9:00 - 9:50 AM
-M-W-F-
5/ 4/ 0


MA208 - Discrete Mathematics

Course Description: MA 208 (CS 208) Discrete Mathematics: This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include combinatorial problem solving, logic, Boolean algebra, combinatorial circuits, sets, relations, functions, proofs, mathematical induction, recurrence relations, graphs, trees, and counting technique. 3:0:3. Prerequisite: any math course > MA131. (From catalog 2008-2009)
TitleSemesterCampusRoomSectionHoursFacultyReqTimesDaysStatusSyllabus
N/ANot being offered----------


MA208 - Discrete Mathematics

Course Description: MA 208 (CS 208) Discrete Mathematics: This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include combinatorial problem solving, logic, Boolean algebra, combinatorial circuits, sets, relations, functions, proofs, mathematical induction, recurrence relations, graphs, trees, and counting technique. 3:0:3. Prerequisite: any math course > MA131. (From catalog 2007-2008)
TitleSemesterCampusRoomSectionHoursFacultyReqTimesDaysStatusSyllabus
Discrete MathematicsF2AA2007Lackland AFBN/ALC3Ottum, Joseph A.XX+7:30 - 10:10 PM
-M-W---
7/30/ 0View


MA208 - Discrete Mathematics

Course Description: (CS 208) This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include combinatorial problem solving, logic, Boolean algebra, combinatorial circuits, sets, relations, functions, proofs, mathematical induction, recurrence relations, graphs, trees, and counting techniques. PREREQUISITE: any math course > MA 131. 3:0:3 (From catalog 2006-2007)
TitleSemesterCampusRoomSectionHoursFacultyReqTimesDaysStatusSyllabus
Discrete MathematicsF2A2006AustinN/ABE3Maldonado, Aldo Rene5:10 - 7:50 PM
-M-W---
9/35/ 0View
Discrete MathematicsFA2006Parkville DaytimeSC016HO3Hsin, Wen9:00 - 9:50 AM
-M-W-F-
0/ 4/ 0View


MA208 - Discrete Mathematics

Course Description: (CS208) This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include the following: mathematical induction, sets, relations functions, matrices, graphs, trees, combinational analysis, Boolean algebra, and other structures. Prerequisite: Any math course > MA131. 3:0:3 (From catalog 2005-2006)
TitleSemesterCampusRoomSectionHoursFacultyReqTimesDaysStatusSyllabus
Discrete MathematicsF2A2005AustinN/ABE3Maldonado, Aldo Rene8:00 - 10:40 PM
-M-W---
3/35/ 0View
Discrete MathematicsU1B2006Fort BlissN/ABL3Belanger, Fred5:00 - 7:30 PM
--T-R--
17/32/ 0View


MA208 - Discrete Mathematics

Course Description: This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include the following: mathematical induction, sets, relations functions, matrices, graphs, trees, combinational analysis, Boolean algebra, and other structures. Pre-requisite: Any math course > MA131. 3:0:3 (From catalog 2004-2005)
TitleSemesterCampusRoomSectionHoursFacultyReqTimesDaysStatusSyllabus
Discrete MathematicsF2A2004AustinN/ABE3Wu, Ping5:00 - 7:30 PM
--T-R--
5/35/ 0View
Discrete MathematicsSP2005Parkville DaytimeSC016HO3Hsin, Wen8:00 - 8:50 AM
-M-W-F-
1/ 7/ 0
Discrete MathematicsFA2004Parkville DaytimeSC010HO3Hsin, Wen1:00 - 2:15 PM
--T-R--
1/10/ 0

Note:

Notes:

  • Summer 2013 and Fall 2013 Course Schedule for PDCC, Metro and Online (printable PDF) and Please use the class schedule at http://www.park.edu/course for the most recent class listing.
  • This class data was last updated on 5/19/2013 9:13:56 AM. Please check with your Campus Center for the most current updates.
  • Building abbreviations for Parkville Classrooms
    • AL = Alumni Hall
    • CERLAB = Ceramics Lab
    • CH = Chapel
    • CO = Copley
    • CQ = Copley Quad
    • HERR = Herr House
    • MA = Mabee Underground
    • MC = Mackay
    • SC = Science Hall
    • WOOD = Woodard Conference Center
  • The course listing is subject to change.
  • Status lists if the class is canceled or the number of people enrolled / maximum number of people / wait list for the class
  • If nothing appears, there is no class meeting the current qualifications (Ex. No Chemistry Classes being offered During Spring 1 at the Kansas City Accelerated Campus)
  • The following are abbreviations:
    • # - Permission of the Instructor Required
    • $ - Additional Course Fee
    • + - Pre-Requisite
    • LE - Liberal Education
  • HOS - This section is for Study Abroad Only.
  • Park University Bookstore

---------------------------------

University Resources> lists if the class is canceled or the number of people enrolled / maximum number of people / wait list for the class
  • If nothing appears, there is no class meeting the current qualifications (Ex. No Chemistry Classes being offered During Spring 1 at the Kansas City Accelerated Campus)
  • The following are abbreviations:
    • # - Permission of the Instructor Required
    • $ - Additional Course Fee
    • + - Pre-Requisite
    • LE - Liberal Education
  • HOS - This section is for Study Abroad Only.
  • Park University Bookstore
  • ---------------------------------

    University Resources