CS 330 Computer Foundations
This course is a survey of discrete mathematical structures and its applications pertaining to the study of computer science and information technology. A broad overview of topics will be covered including but not limited to: finite number systems, counting and apportionment algorithms, mathematical induction, probability and Monte Carlo simulations, game theory, graphs, trees, and recursion. Software simulations and programs will be included to enhance understanding and application.
Offered
Fall Even
Outcomes
- Use examples to explain the basic terminology of functions, relations, and sets
- Perform the operations associated with sets, functions, and relations
- Relate practical examples to the appropriate sets, functions, or relation model, and interpret the associated operations and terminology in context
- Convert logical statements from informal language to propositional and predicate logic expressions
- Describe how symbolic logic can be used to model real-life situations or applications, including those arising in computer context such as software analyze, program correctness, database queries, and algorithms
- Apply formal and/or informal logic reasoning to real problems, such as predicting the behavior of software or solving problems
- Define and identify sequences using a recursive relationship
- Apply counting arguments, including sum and product rules, inclusion-exclusion principle and arithmetic/geometric progressions
- Compute permutations and combinations of a set and interpret the meaning in the context of the particular application
- Illustrate by example the basic terminology of graph theory, as well as some of the properties and special cases of each type of graph/tree
- Demonstrate different traversal methods for trees and graphs, including pre-, post-, and in-order traversal of treesl
- Model a variety of real-world problems in computer science using appropriate forms of graphs and trees
- Calculate probabilities of events and expectations of random variables for elementary problems such as games of chance
- Differentiate between dependent and independent events