Discrete Structures

Catalog description

Introduction to analysis of finite collections and mathematical foundations of sequential machines, computer system design, data structures and algorithms. Topics include sets and logic, sequences, subscripting and arrays, number systems, counting, recursion, graph theory, trees, nets, Boolean algebra, automata, and formal grammars and languages. Formal proofs (including induction) are introduced early in the course and addressed throughout the course. Connections between the mathematical theory and corresponding computer science applications are pervasive throughout the course. Computer programming labs are written in the current language used in the core Computer Science courses. This course is not intended for a Mathematics major or minor.