CSC 14 - Discrete Structures for Computer Science I

Institution:

Hofstra University

Subject:

COMPUTER SCIENCE

Description:

Semester Hours: 3 Fall, Spring Review of propositional and predicate logic. Methods of theorem proving; strong and weak induction. Finite and infinite sets, set operations. Introductions to computational complexity, theta and big-O notation Combinatorics, including permutations and combinations. Discrete probability and binomial distribution. (3 hours lecture, 1 hour laboratory.) Prerequisite(s)/Course Notes: Three years of high school mathematics.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Multiple

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.hofstra.edu

Phone Number:

(516) 463-6600

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.