CSCI 256
Algorithm Design and Analysis
Spring 2017
Division III
Quantitative/Formal Reasoning
This is not the current course catalog
Class Details
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.
The Class:
Format: lecture
Limit: 40
Expected: 40
Class#: 3604
Grading: yes pass/fail option, yes fifth course option
Limit: 40
Expected: 40
Class#: 3604
Grading: yes pass/fail option, yes fifth course option
Requirements/Evaluation:
evaluation will be based on problem sets and programming assignments, and midterm and final examinations
Prerequisites:
CSCI 136 and MATH 200
Enrollment Preferences:
current or expected Computer Science majors
Distributions:
Division III
Quantitative/Formal Reasoning
Attributes:
BGNP Recommended Courses
Class Grid
-
HEADERS
Column header 1
CLASSESColumn header 2DREQColumn header 3INSTRUCTORSColumn header 4TIMESColumn header 5CLASS#
-
CSCI 256 - 01 (S) LEC Algorithm Design & Analysis
CSCI 256 - 01 (S) LEC Algorithm Design & AnalysisDivision III Quantitative/Formal ReasoningBrent A. HeeringaMWF 10:00 am - 10:50 am
Schow Library Classroom 030A3604
Megamenu Social