Math 118: Finite Mathematics - Revision history

Ls5: moved Math 118 to Math 118: Finite Mathematics

2013-04-03T22:08:04Z

moved Math 118 to Math 118: Finite Mathematics

Roundy: /* Offered */

2012-05-10T20:04:28Z

‎Offered

Roundy: /* (Credit Hours:Lecture Hours:Lab Hours) */

2011-01-29T00:39:14Z

‎(Credit Hours:Lecture Hours:Lab Hours)

Roundy: /* Desired Learning Outcomes */

2011-01-29T00:36:33Z

‎Desired Learning Outcomes

Roundy: /* Desired Learning Outcomes */

2011-01-29T00:29:47Z

‎Desired Learning Outcomes

Roundy: /* Textbooks */

2011-01-29T00:25:19Z

‎Textbooks

Roundy: /* Textbooks */

2011-01-29T00:25:05Z

‎Textbooks

Roundy: /* Additional topics */

2011-01-29T00:23:57Z

‎Additional topics

Roundy: /* Prerequisites */

2011-01-29T00:23:33Z

‎Prerequisites

Roundy: /* Description */

2011-01-29T00:22:50Z

‎Description

@@ Line 8: / Line 8: @@
 === Offered ===
-Fall, Winter
+Fall, Winter, Spring, Summer
 === Prerequisite ===

@@ Line 5: / Line 5: @@
 === (Credit Hours:Lecture Hours:Lab Hours) ===
-(3:0:3)
+(3:3:0)
 === Offered ===

@@ Line 20: / Line 20: @@
 <div style="-moz-column-count:2; column-count:2;">
-#  Probability Models (21 lectures)
+# Part 1:  Probability Models (20 lectures, approx.)
 #* Sets Theory (3 lectures)
 #** Describe sets using set-builder notation.
-#* Solve problems involving set membership, subsets, intersections, unions, and complements of sets.
+#** Solve problems involving set membership, subsets, intersections, unions, and complements of sets.
-# Regular surfaces
+#** Be able to identify the various partitions of a Venn diagram.
-#* Regular surfaces as inverse images of regular values
+#** Determine the number of elements in a partition, based on set counting rules for unions, complements, and products.
-#* Change of parameters
+#* Combinatorics & Counting (6 lectures)
-#* The tangent plane
+#** Describe the sample space of an experiment and the set of all possible outcomes using trees and the multiplicative principle, as appropriate.
-#* The first fundamental form
+#** Explain what a permutation is, and how many permutations there are for a given set.
-#*Orientation of surfaces
+#** Demonstrate how to count more sophisticated permutation problems involving products and restrictions to sets.
-# The geometry of the Gauss map
+#** Use the notion of partitions to reduce permutation problems to combinations, where the order does not matter.
-#* Definition of the Gauss map and fundamental properties
+#** Be able to solve various hybrid counting problems with and without replacement, with and without order.
-#* The Gauss map in local coordinates
+#** Be able to apply ideas from combinatorics and counting, and formulate real-world problems.
-#* Minimal surfaces
+#* Probability (8 lectures)
-#Intrinsic geometry of surfaces
+#** Be able to describe the notions of outcomes and events in probability, and the axioms of a probability space.
-#* Isometries and conformal maps
+#** Use ideas from combinatorics to determine the probabilities of various events, with equally likely outcomes.
-#* Geodesics and parallel transport
+#** Demonstrate understanding of probabilistic independence.
-#* The Gauss-Bonnet Theorem and applications
+#** Describe a stochastic process, and be able to compute probabilities of events on trees.
-#* The exponential map
+#** Explain Bayes rule and demonstrate proficiency with conditional probability.
 </div>

@@ Line 17: / Line 17: @@
 == Desired Learning Outcomes ==
-???
 === Prerequisites ===
 Math 110

← Older revision		Revision as of 00:25, 29 January 2011
Line 28:		Line 28:

	Finite Mathematics, 5th edition, Daniel P. Maki and Maynard Thompson, McGraw-Hill 2005		Finite Mathematics, 5th edition, Daniel P. Maki and Maynard Thompson, McGraw-Hill 2005
−
−	*

	=== Additional topics ===		=== Additional topics ===

← Older revision	Revision as of 22:08, 3 April 2013
(No difference)

@@ Line 27: / Line 27: @@
 Possible textbooks for this course include (but are not limited to):
+Finite Mathematics, 5th edition, Daniel P. Maki and Maynard Thompson, McGraw-Hill 2005
 === Additional topics ===

@@ Line 31: / Line 31: @@
 === Additional topics ===
 === Courses for which this course is prerequisite ===
 [[Category:Courses|118]]

@@ Line 19: / Line 19: @@
 ???
 === Prerequisites ===
 === Minimal learning outcomes ===

@@ Line 14: / Line 14: @@
 === Description ===
-???
+Description: This course studies the basic elements and applications of finite mathematics.  The first half of the class covers the language of set theory, principles of counting and combinatorics, probability theory for equally likely outcomes, elementary stochastic processes, conditional probabilities, and repeated experiments.  The concept of a random variable is developed, along with expectation and variance.  The second half of the class explores systems of linear equations and matrix algebra, linear programming, and Markov chains. This course considers a broad range of applications in business, the life sciences, and the social sciences.
 == Desired Learning Outcomes ==