CSCI2014 — Discrete Structures of Computer Science
CSCI 2014 - Discrete Structures of Computer Science CSCI 2014 - Discrete Structures of Computer Science Hours/Week: Lecture 4 Lab None Course Description: This course covers discrete mathematical techniques and structures used in computer science. The content stresses problem solving techniques that involve the use of logic, various methods of proof, and sets. Topics of particular interest to computer scientists include big-O notation, recursion, and the fundamentals of trees and graphs. MnTC Goals None g., program correctness), database queries, and algorithms. examine the logical validity of arguments and proofs as they apply to Boolean expressions. apply mathematical induction and other techniques to prove mathematical results. perform computations using recursively defined functions and structures. solve problems involving sets, relations, functions, and congruences. illustrate the basic terminology and properties of graphs and trees. use graphs and trees to solve problems algorithmically. use methods of combinatorics to solve counting and basic probability problems. Minnesota Transfer Curriculum (MnTC): Goals and Competencies Competency Goals (MnTC Goals 1-6) None Theme Goals (MnTC Goals 7-10) None Courses and Registration
Prerequisites: MATH1081, MATH1061