Study Guide Discrete Mathematics Second Edition

Study Guide, Discrete Mathematics, Second Edition

Introduction to Discrete Mathematics

This text aims to unify and inter-relate mathematical topics and explain how to design, run and analyse better algorithms. Many of the less common algorithms are included i.e. planarity, graph colouring, minimization of machine states. These are actually run so that students can see the importance of working through each step of an algorithm by hand. Topics are chosen for their contribution to the students ability to reason abstractly. For example, Matrices introduces the topic from the study of arrays, Disjunctive Forms does not rely on the typical Karnaugh Maps and Quine-McClusky Algorithm to find the minimal forms of any given proposition and Planarity presents a complete planarity algorithm allowing the student to master a tough, interesting procedure. Logic and proof are explained through example and technicalities and limitations of realcomputer languages are avoided. Topics are set in some historical framework whenever possible, within the overall studies from which they are derived.

A Beginner's Guide to Finite Mathematics

This second edition of A Beginner’s Guide to Finite Mathematics takes a distinctly applied approach to finite mathematics at the freshman and sophomore level. Topics are presented sequentially: the book opens with a brief review of sets and numbers, followed by an introduction to data sets, histograms, means and medians. Counting techniques and the Binomial Theorem are covered, which provides the foundation for elementary probability theory; this, in turn, leads to basic statistics. This new edition includes chapters on game theory and financial mathematics. Requiring little mathematical background beyond high school algebra, the text will be especially useful for business and liberal arts majors.