CS2350 — Discrete Structures of Computer Science
CS 2350 - Discrete Structures of Computer Science 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. 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
Prerequisites: CS1110, CS1119, CS2300, MATH1118, MATH1119, MATH1127