Foundations of Discrete Structures and Algorithms 0,

3 Credits

Basic representations used in algorithms: propositional and predicate logic, set operations and functions, relations and their representations, matrices and their representations, graphs and their representations, trees and their representations. Basic formalizations for proving algorithm correctness: logical consequences, induction, structural induction. Basic formalizations for algorithm analysis: counting, pigeonhole principle, permutations. Credit will not be given for both CSE 140 and MATH 261 . Prerequisites: ( MATH 021 or MATH 031 or MATH 051 or MATH 076 or MATH 081 or MATH 062 ) and CSE 017 Can be taken Concurrently: CSE 017 Attribute/Distribution: Q