CSCI 1900

Provides a working knowledge of set theory, mathematical induction and recursion, relations and digraphs, functions, trees and languages, finite-state machines, and languages and how these topics are applied to the practice of computer science. Students who are required to take learning support math must successfully complete it before taking this course.

None

• Understand examples and perform operations on sets, functions, relations. ( Student Outcome GSO1 )
• Apply propositional and predicate logic, and matrices using the appropriate terminology.
• Effectively use formal logic proofs and logical reasoning to solve problems.
• Model problems in computer science using graphs and trees.
• Relate and apply these concepts to practical applications.

• Sets and Subsets/Operations on Sets
• Sequences/Regular Expressions
• Properties of Integers/Matrices
• Propositions and Logical Operations
• Conditional Statements
• Methods of Proof/Mathematical Induction
• Relations/Properties of Relations
• Equivalence Relations/Functions
• Complexity of Functions
• Trees/Labeled Trees-Huffman Code
• Tree Searching/Minimal Spanning Trees
• Graphs/Finite State machines
• Regular Languages