| |
Apr 19, 2024
|
|
|
|
|
CISH 4010 - Discrete Mathematics and Computer Theory
This course covers foundations of discrete mathematics and fundamentals of computer theory. Topics include propositional logic, truth tables, quantifiers, sets, set operations, sequences, complexity of algorithms, divisibility, matrix manipulations, proofs, induction, recursion, counting and the pigeonhole principle, permutations, combinations, repeated trials, expectation, relations (properties, representation, equivalence, Warshall’s algorithm), Boolean algebra, functions, logic gates, minimizing, Finite State Machines, Turning machines, Regular expressions, context free grammars, language recognizers, derivation trees, pushdown automata.
When Offered: H and G, fall term annually; H, spring and summer term.
Credit Hours: 3
Add to Portfolio (opens a new window)
|
|
