CS 2350 - Discrete Structures of Computer Science
4 Credits
Introduces the theoretical concepts of computer science, number systems, coding schemes, formal logic, sets and relations, induction, recursion, recurrences, graphs, proofs of program correctness, analysis of algorithms, asymptotic complexity measure and advanced level. Credit will not be awarded for both MATH 2100 and CS 2350.
Pre-Requisites CS 1110 , CS 1119 , CS 2300 , MATH 1118 , MATH 1119 , MATH 1127
Major Content Areas
Elementary graph theory and applications (14%)
algorithm analysis (7%)
Recurrence relations (7%)
Elementary number theory and applications (14%)
Relations and functions (14%)
Mathematical induction, including both strong and weak induction (17%)
Combinatorics and probability (7%)
Logic and Proof (14%)
Elementary set theory (6%)
Learning Outcomes
Use graphs and trees to solve problems algorithmic-ally.
Solve problems involving sets, relations, functions and congruence.
Illustrate the basic terminology and properties of graphs and trees.
Perform computations using recursively defined functions and structures.
Examine the logical validity of arguments and proofs as they apply to Boolean expressions.
Use methods of combinatorics to solve counting and basic probability problems.
Describe how symbolic logic can be used to model real-life situations or applications, including those arising in computing contexts such as software analysis (e.g., program correctness), database queries and algorithms.
Apply mathematical induction and other techniques to prove mathematical results.
Minnesota Transfer Curriculum (MNTC) Goals
04 - Mathematical/Logical Reasoning
|