CS 3305 - Discrete Mathematics for Computing II

Institution:

The University of Texas at Dallas

Subject:

Description:

Topics in enumeration; principle of inclusion and exclusion. Partial orders and lattices. Algorithmic complexity; recurrence relations. Graph theory. Students cannot receive credit for both CS 3305 and CE/TE 3307. Prerequisite: CS 2305. (3-0) S

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.utdallas.edu

Phone Number:

(972) 883-2111

Regional Accreditation:

Southern 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.