MATH 150 - Discrete Mathematics I
Credit Hours: 3
Lecture Hours: 3
Lab Hours: 0
The first course of a two-semester sequence in discrete mathematics, providing the theoretical base and support for computer science and including operations on sets; Cartesian products and tuples; combinatorial objects; Venn diagrams; event spaces and basic probability; number systems; the statement calculus; rules of inference and validity of arguments; inductive proofs; the concept of an algorithm; equivalence relations; partial ordering relations; graphs and digraphs as relations, including trees and shortest paths in digraphs; basic definitions and notations of functions; and recurrences for the analysis of algorithms.
Prerequisite: (MATH 129 and MATH 130 ) or MATH 131
Please click here for Book Information