About this course and the syllabus
Welcome to MTH 325, Discrete Structures for Computer Science 2. This document contains all the information you need to know about the course. Your job is to read this document carefully in the first week of class and familiarize yourself with how the course works and maintain that familiarity throughout the semester. Almost all questions about the course that you might ask can be answered by referencing the syllabus.
Course catalog description: Properties of relations, equivalence relations, partial orderings, fundamental concepts of graphs, trees, digraphs, networks, and associated algorithms; computer science applications. Offered fall and winter semesters. Prerequisite: MTH 225.