Computer Science 111 - Foundations of Computing Theory

Institution:

Wheaton College - Massachusetts

Subject:

Description:

Discrete mathematics represents the core mathematical and problem-solving principles in computer science education. It is not possible to make creative and effective use of computers without involving oneself in mathematical considerations. This course introduces many of the mathematical concepts that appear later in the computer science major. Everyday scenarios are related to discrete topics including algorithms, networks and data communication, parity and error, finite state machines, regular expressions, matrices, propositional logic, Boolean algebra, sets and relations in databases, and graphs and trees. Students use these techniques to solve real-world problems, such as forming SQL queries, designing shortest-path communications between cell towers and pattern matching across entire genomes and volumes of English text. (Mark D. LeBlanc, Lisa N. Michaud)

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.wheatoncollege.edu

Phone Number:

(508) 285-7722

Regional Accreditation:

New England Association of Schools and Colleges

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.