CSCI 2014 - Discrete Structures of Computer Science

Credits: 4
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

Prerequisite(s): Course placement into MATH 1081 or completion of MATH 1061 with a grade of C or higher.
Corequisite(s): None
Recommendation: None

Major Content

Logic and proof
Mathematical induction, including both strong and weak induction
Elementary set theory
Relations and functions
Recurrence relations
Elementary number theory and applications
Elementary graph theory and applications
Combinatorics and probability
Algorithm analysis

Learning Outcomes
At the end of this course students will be able to:

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.
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.

Competency 1 (1-6)
None
Competency 2 (7-10)
None

Courses and Registration

Search form

MegaMenu_Academics_2_V2.jpg

MegaMenu_Admissions_V2.jpg

MegaMenu_Financial-Aid_V2.jpg

Menu_CECT-2.jpg

MegaMenu_Campus-Life_V2.jpg

MegaMenu_Support-Services_V2.jpg

CSCI 2014 - Discrete Structures of Computer Science