Preview Workflow

The CIM Courses system will be down temporarily undergoing routine maintenance.

Viewing: CSCI 6212 : Design and Analysis of Algorithms

Last approved: Thu, 13 Apr 2017 15:18:41 GMT

Last edit: Wed, 22 Mar 2017 23:09:22 GMT

Catalog Pages referencing this course
School of Engineering and Applied Sciences
Computer Science (CSCI)
CSCI
6212
Design and Analysis of Algorithms
Design & Analysis of Algorithm
Fall 2017
3
Course Type
Lecture
Default Grading Method
Letter Grade

No
No

Corequisites

137

Frequency of Offering
Every Year
Term(s) Offered
Fall
Spring
Summer
Are there Course Equivalents?
No
 
No
Fee Type


No


Design and analysis of algorithms; Turing machines; NP-complete theory; algorithmic techniques: divide-and-conquer, greedy, dynamic programming, graph traversal, backtracking, and branch-and-bound; applications include sorting and searching, graph algorithms, and optimization. Students are expected to know data structures and possess general programming skills in one or more procedural/OOP language such as C/C++/Java, and to have a good mathematical background such as discrete math and some calculus, prior to registration.
1. Design and synthesize algorithms for given problems using standard algorithm design techniques and their combinations
2. Analyze algorithms and programs (in pseudocode) to compute the time complexity
3. Apply basic concepts in mathematics to evaluate algorithms and software programs and prove their correctness
Uploaded a Course Syllabus

Course Attribute
CCAS - Professional

riffat (Mon, 13 Feb 2017 15:14:47 GMT): Rollback: Per dept request to include learning outcomes.
sheller (Mon, 13 Feb 2017 19:04:30 GMT): Rollback: for LO
gharris (Sat, 25 Feb 2017 17:26:03 GMT): Rollback: Syllabus is missing credit hour/independent learning statement.
Key: 2051