MAT-173 Objectives

MAT-173 Contemporary Math II

To identify a proper algorithm.
To formulate an algorithm for the solution of a state problem.
To produce a flowchart for a given algorithm.
To learn the rudiments of BASIC programming language.
To apply BASIC programming to selected problems.
To consider the impact of computers on contemporary society and their role in the classroom.

To identify and use specific functions and capabilities of a hand-held calculator. These may include such things as scientific notation, fixed or floating decimal point, arithmetic or algebraic logic, memory, constants, rounding or truncation, inverse functions, fraction representation, etc.
To perform arithmetic operations on integers, fractions, and decimals with the aid of a calculator.
To use calculators to solve problems involving very large or very small numbers.
To investigate number patterns such as repeating decimals, series, etc.
To solve non-standard problems using the calculator as a tool.
To consider the impact of hand-held calculators on contemporary society and their place in the classroom.

To form a frequency distribution or a relative frequency distribution from a set of raw data, identifying class limits, class boundaries, class marks, class width, and cumulative frequencies.
To draw a histogram from a given frequency distribution and to interpret a histogram.
To find the mean, median, and mode(s) of raw data or of grouped data.
To find percentiles (or quartiles or deciles) of raw data or of grouped data.
To calculate the variance and standard deviation of raw data or of grouped data.
To interpret the standard deviation and to apply it to a standard normal distribution to find the probability of a single observation lying within a specified interval.
To be familiar with the basic concepts of statistical design and exploratory data analysis.
To be a critical reader of descriptive statistics.

To draw a graph as a model for an applied problem.
To identify vertices and edges of a graph, and the degree of each vertex, and to define connectedness and completeness of a graph.
To define an Eulerian path between two vertices, to identify necessary and sufficient conditions for an Eulerian path to exist, and to identify the Eulerian path(s) between two vertices when possible.
To identify Eulerian graphs.
To define a Hamiltonian path between two vertices, and to identify a Hamiltonian path between two vertices if one exists.
To identify Hamiltonian graphs.
To find a least distance circuit through a graph (the Chinese Postman’s Problem).
To draw a directed graph from its matrix and to construct the matrix of a given digraph.
To use matrix multiplication to find the number of n-step paths between two vertices.
To determine the reachability matrix of a digraph.
To use a directed graph to model a scheduling problem and to determine the least time schedule using the critical path method (CPM) or Project Evaluation and Review Technique (PERT).

To balance a checkbook including monthly interest, service charges, automatic deposits and withdrawals.
To calculate monthly finance charges using the Average Daily Balance method.
To understand the use of differential rates for commission, finance charges, etc.
To calculate simple interest, principal, simple interest rates, or time.
To calculate compound interest.
To calculate the effective simple interest rate and to compare with nominal simple interest rate.
To document the growth of an ordinary annuity and to calculate the present value of an ordinary annuity.
To prepare an amortization schedule for a loan and to investigate the processing of partial payments.
To be an informed consumer.