CISH 4010 - Discrete Mathematics and Computer Theory

Institution:

Roberts Wesleyan University

Subject:

Description:

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

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

WWW.Roberts.edu

Phone Number:

(585) 594-6000

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.