CSCI 256 Spring 2015 Algorithm Design and Analysis (Q)

This course investigates methods for designing efficient and reliable algorithms. By carefully analyzing the structure of a problem within a mathematical framework, it is often possible to dramatically decrease the computational resources needed to find a solution. In addition, analysis provides a method for verifying the correctness of an algorithm and accurately estimating its running time and space requirements. We will study several algorithm design strategies that build on data structures and programming techniques introduced in Computer Science 136. These include induction, divide-and-conquer, dynamic programming, and greedy algorithms. Additional topics of study include algorithms on graphs and strategies for handling potentially intractable problems.
Class Format: lecture
Requirements/Evaluation: evaluation will be based on problem sets and programming assignments, and midterm and final examinations
Additional Info:
Additional Info2:
Prerequisites: CSCI 136 and MATH 200
Enrollment Preference: current or expected Computer Science majors
Department Notes:
Material and Lab Fees:
Distribution Notes:
Divisional Attributes: Division III,Quantitative and Formal Reasoning
Other Attributes: BGNP Recommended Courses
Enrollment Limit: 40
Expected Enrollment: 40
Class Number: 3401
CLASSES ATTR INSTRUCTORS TIMES CLASS NUMBER ENRL CONSENT
CSCI 256 - 01 (S) LEC Algorithm Design & Analysis (Q) Division 3: Science and MathematicsQuantitative and Formal Reasoning William J. Lenhart
MWF 10:00 AM-10:50 AM 3401
Course Search
Term:
Subject:
Catalog Number:
Division:
Distribution:
Subject Attributes:
Enrollment Limit:
Course Type:
Start Time: End Time:
Day(s):
Instructor First Name:
Instructor Last Name:
Keyword Search: