New Course Request

New Course Request

If the course is repeatable for additional credit, what is the limit on total credit that may

be earned in the course?

SOUTH DAKOTA BOARD OF REGENTS

DSU		College of BIS
Institution		Division/Department		Institutional Approval Signature		Date

1. Review of Course

Comments from SDSM&T - We would like to request that this * not * be made common with any of our CSC courses. In short, it has sizable components of the SDSMT courses CSC 300 and CSC 372 but is

not sufficiently similar to either to labeled as one of them.

2. FTE Implication

No. Replacement of

,which is being deleted.

(prefix, number, name of course, credits)

Effective Date of Deletion:

No. Schedule Management, explain:

The course will be scheduled as part of the course rotation schedule. No additional FTE.

Yes. Specify:

3. Existing program in which course will be offered:

B.S. in Computer Science

4. Proposed CIP code:		110101
	New CIP code for this university?		Yes	X	No

5. Proposed Instructional Method by this university:		L
	Provide a brief justification.
	Lecture format.

6. Proposed delivery method by this university:

001

7. Term Change Effective:

Fall 06

8. University Department Code:

DCSC

9. Can this course be repeated for additional credit?

Yes

If the course is repeatable for additional credit, what is the limit on total credit that may
be earned in the course?

10. Will the grade for this course be limited to S/U (pass/fail)?

Yes

11. Will section enrollments be capped?		Yes		X	No
	If yes, what is the maximum enrollment per section?		Use of hardware and software determine the section size, but additional sections will be added as needed.

12. Will this course be equated (considered the same course for degree completion) with any
	other unique or common course in the course database?	Yes	X	No
	If yes, indicate the course(s) to which it will be equated.

13. Proposed Prefix		CSC
	Is this prefix already approved for your university?		X	Yes	No

A. After reviewing the common and unique course lists, this course does not currently exist and therefore will be unique. Provide the complete description as it will appear in the system unique database including prerequisites and corequisites. If the course contains a lecture and laboratory component, identify both the course and laboratory numbers (xxx and xxxL) and credit hours associated with each. Omit 1.B and 1.C. and complete the rest of the request form.

Prefix & No.

Course Title

Algorithms and Optimization

Course Description:

This course will study computer algorithms, their performance, and techniques for optimizing algorithm implementations. A variety of algorithms including search, sorting, and graph algorithms will be examined. Tools and methods for analyzing and measuring both theoretical and practical performance will be studied. Techniques for improving the performance of implementations of the algorithms will be examined. Prerequisites: CSC 300 and MATH 316.