UD Math Home Page Academics & Research People News and Events UD Home Page

 

NOTE: The following information was taken from the Spring 2000 Math 113 course syllabus. It is intended to serve as a reference only. This material may change from semester to semester.
Text:
For All Practical Purposes: Mathematical Literacy in Today's World
Consortium for Mathematics and its Applications, Fifth Edition
NOTE: Calculators are required for this course.
Course Content:
This course is designed as an alternative to the traditional Math 114 course for liberal arts majors. The course consists of three modules: Management Science, Statistics, and Social Choice and Decision Making. The general goals of the course are multi-dimensional:
1) to apply the scientific method to investigate real-world phenomena;
2) to construct, read, and interpret graphs and other displays of data;
3) to read, interpret, and communicate information using appropriate mathematical language;
4) to appropriately use technology to solve mathematical problems.
Grades:
Grades will be based on 600 points
300 points for the exams (3 exams each for 100 points
150 points for the final exam
  60 points for projects (2 projects each for 30 points)
  90 points for other activities
Sample Exams:
Sample exams require the free Acrobat Reader software installed
  Exam 1 Solutions Exam 1
  Exam 2 Solutions Exam 2
  Exam 3 Solutions Exam 3
  Final Exam Solutions Final Exam

Sections and Topics Covered:
Statistics
Chapter
Section
5
Random Sampling
 
Statistical Estimation
 
Experiments
 
Statistical Evidence
6
Displaying Distributions
 
Describing Distributions
 
Displaying Relations
 
Regression Lines
 
Correlation and Least Squares Regression
7
What is Probability?
 
Probability Models and Rules
 
Equally Likely Outcomes
 
Mean of a Probability Model
 
Normal Distributions
 
Central Limit Theorem
8
Estimating a Population Proportion
 
Confidence Intervals
 
Estimating a Population Mean
 
Statistical Process Control
 
Perils of Data Analysis
Management Science
Chapter
Section
1
Basic Concepts
 
Modeling
 
Euler Circuits
 
Eulerization and Squeezing
 
Minimum Duplication Circuits
2
Hamiltonian Circuits
 
Counting Problems
 
Traveling Salesman Problems
 
Trees and Spanning Trees
 
Scheduling
3
Scheduling
 
Using the List-Processing Algorithm
 
Independent Tasks and Other Issues
 
Bin Packing
 
Color Problems
Social Science and Decision Making
Chapter
Section
11
Elections with Only Two Alternatives
 
Elections with Three or More Alternatives
 
Insurmountable Difficulties
12
How Weighted Voting Works
 
Banzhaf Power Index
 
Equivalent Voting Systems
 
Shapley-Shubic Power Index

 

 

©2004, Department of Mathematical Sciences
Last Modified: October 13, 2004
Comments? E-Mail Webmaster (www@math.udel.edu)