Discrete Structures

3 credits · Undergraduate

This course continues CSCI 2112.03/MATH 2112.03. This course covers some basic concepts in discrete mathematics which are of particular relevance to students of computer science, engineering, and mathematics. The topics to be covered will include solution of recurrence relations, generating functions, number theory, Chinese remainder theorem, trees and graphs, finite state machines, abstract algorithms, Boolean algebra. PREREQUISITES: MATH 1315.03 or MATH 2110.03 or MATH 2112.03 CROSSLISTED: CSCI 2113.03 FORMATS: Lecture