University of Oregon
Go to Main Content
 

HELP | EXIT

Summer 2022

 

Transparent Image
Mathematics (MATH)
202 Fenton, 541-346-4705
College of Arts & Sciences
Course Data
  MATH 232   Elem Discrete Math II >4 4.00 cr.
Relations, theory of graphs and trees with applications, permutations and combinations.
Grading Options: Optional; see degree guide or catalog for degree requirements
Instructor: Phillips B Office:   316 Fenton Hall
Phone:   (541) 346-8409
See CRN for CommentsPrereqs/Comments: Prereq: MATH 231.
Course Materials
 
  CRN Avail Max Time Day Location Instructor Notes
  41288 15 30 1200-1350 mtwrf
7/18-8/14
101 PETR Phillips B !
Academic Deadlines
Deadline     Last day to:
July 20:   Last day to change to or from audit
July 20:   Add this course
July 20:   Drop this course (100% refund, no W recorded)
July 23:   Withdraw from this course (75% refund, W recorded)
July 25:   Withdraw from this course (50% refund, W recorded)
July 27:   Withdraw from this course (25% refund, W recorded)
August 4:   Withdraw from this course (0% refund, W recorded)
August 4:   Change grading option for this course
Caution You can't drop your last class using the "Add/Drop" menu in DuckWeb. Go to the “Completely Withdraw from Term/University” link to begin the complete withdrawal process. If you need assistance with a complete drop or a complete withdrawal, please contact the Office of Academic Advising, 101 Oregon Hall, 541-346-3211 (8 a.m. to 5 p.m., Monday through Friday). If you are attempting to completely withdraw after business hours, and have difficulty, please contact the Office of Academic Advising the next business day.

Expanded Course Description
This course, which is the second of three in the sequence, introduces students to the subject of discrete mathematics. Initial topics in the course include elementary combinatorics and probability such as inclusion-exclusion principle and pigeonhole principle. However, most of the course is devoted to the in-depth study of graphs and trees including edge traversal and vertex traversal problems, minimum spanning trees, depth-first search algorithms, weighted trees, Huffman codes, and algorithms on directed graphs.
New Search

1

2

3

4

5

6

Hour Minute am/pm
Hour Minute am/pm
Mon Tue Wed Thu Fri Sat Sun
Transparent Image
Skip to top of page
Release: 8.11