C Discrete Mathematics

Catalog description

Proof of prerequisites is required. Term Hours: 72 Lecture This is one of two courses in discrete mathematical concepts needed in computer science, with an emphasis on their applications. Topics covered include functions, relations, sets, basic logic, proof techniques, basics of counting, Boolean algebra, recursion, graphs, trees, and discrete probability. (UC/CSU, AA GE, CalGETC).