DISCRETE STRUCTURES FOR COMPUTER SCIENCE

Catalog description

(Cross-listed with CS 23022 ) Discrete structures for computer scientists with a focus on: mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, applications and modeling. Specific topics include propositional and predicate logic and logical modeling using Boolean algebra and logical gates, information representation using binary system, sets, functions, relations, logical argumentation, proof techniques, recursion and recursive modeling, sequences and summation, arithmetic and geometric progressions, algorithms, iterative vs recursive algorithms, mathematical and structural induction, recursive structures, counting, permutation and combination, binomial expansion, matrices and matrix-operations, graphs and trees and their traversal, probability and Bayes' theorem, finite state machines, their modeling and applications, Regular grammar, basics of number theory, modeling computation and Turing machines, decidability and halting problem.