CES 17-16 REV COURSE CS 30900
Purdue Northwest Curriculum Document
Program Name:
[one_half_first]
- Document No: CES 17-16 REV COURSE CS 30900
- Proposed Effective Date: Fall 2018
- Submitting Department: MSCS/CES
- Date Reviewed by Department: February 16, 2018
- Submission Date: March 26, 2018
- Date Reviewed College/School Curriculum Committee: 04/04/2018
- Contact Person: Catherine Murphy, Head and Roger Kraft, Associate Professor of Computer Science
[/one_half_first] [one_half]
- Approval by Faculty Senate: May 4, 2018
- Date Reviewed by Senate Curriculum Committee: April 13, 2018
- Name(s) of Library Staff Consulted: Not Applicable
- Will New Library Resources Used?: No
- Form 40 Needed?: Yes
[/one_half]
Task: Course Change or New Course Proposal: Complete Section II
- Degree Name:
Section I: This section is for changes in programs, minors and certificates
List the major changes in each program of study, minor or certificate.
Impact on Students:
Impact on University Resources:
Impact on other Academic Units:
Section II: This section is for changes in courses only
- Subject: Update prerequisite for CS 30900- Discrete Mathematical Structures
- Justification: To make prerequisite consistent with other CS courses
[one_half_first]
Current:
CS 30900-Discrete Mathematical Structures.
Prerequisite(s): MA 16400 FOR LEVEL UG WITH MIN GRADE of D.
Credit hours: 3.00. Course pattern: 3-0-3.
This course is the study of finite and discrete mathematical structures relating to the theory of computation. Topics will include directed and undirected graphs and their relation to these structures, combinatorial problems inherent in computation, Boolean algebra, and recurrence relations.
Typically offered Fall Spring Summer.
[/one_half_first] [one_half]
Proposed:
CS 30900-Discrete Mathematical Structures.
Prerequisite(s): MA 16400 FOR LEVEL UG WITH MIN GRADE C-.
Credit hours: 3.00. Course pattern: 3-0-3.
This course is the study of finite and discrete mathematical structures relating to the theory of computation. Topics will include directed and undirected graphs and their relation to these structures, combinatorial problems inherent in computation, Boolean algebra, and recurrence relations.
Typically offered Fall Spring Summer.
[/one_half]
Course Objectives / Learning Outcomes:
Impact on Students:
Not Applicable.
Impact on University Resources:
Not Applicable.
Impact on other Academic Units:
Not Applicable.