Mathematics for Computing MATH 1320

Upon successful completion of this course, the student will be able to:

• Build a corresponding truth table for a Boolean expression. .
• Explain how text and graphics are represented inside the computer. .
• Perform arithmetic operations with numbers represented in different number systems (binary, octal, and hexadecimal).
• Convert from base 10 to and from other bases for number systems including Binary, Hexadecimal, and Octal.
• Construct and describe finite-state machines using state-transition diagrams.
• Analyze Big-O notation and how it applies to algorithms.
• Describe and use graphs and trees.
• Use algorithms to find a minimum-spanning tree for a graph.
• Use depth-first search and breadth-first search algorithms.
• Use basic set theory and counting (inclusion/exclusion principle, pigeonhole principle).
• Explain basic encryption and decryption techniques, and encrypt and decrypt sample data.
• Explain the purpose of hashing, and use hashing algorithms to create hashes of sample data.
• Explain popular statistical study methods learn the positives and negatives of each.
• Create and interpret histograms, bar charts, and frequency plots.
• Explain central tendency.
• Compute and interpret the three measures of center for distributions: mean, median, and mode.
• Quantify the spread of data using the range and standard deviation.
• Identify outliers in data sets using the concept of the interquartile range.
• Convert distributions into the standard normal distribution using the Z-score.
• Compute proportions using standardized distributions.
• Use normalized distributions to compute probabilities.
• Use Z-table or software to look up the proportions of observations above, below, or in between values.
• Apply the concepts of probability and normalization to sample data sets.

Effective as of Fall 2019