CS 3510
Overview
CS 3510 is a 3 credit hour concentration requirement for many CS threads. The course has no lab component and is taken by most CS majors.
Topic List
This course provides an introduction to algorithm design from the mathematical side. Evaluations of algorithms are through written, proof-based homework and tests. 1. Divide and Conquer 2. Dynamic Programming 3. Graphs/Networks 4. Optimization 5. Hardness/Approximations
The textbook used in this course is Algorithms by Dasgupta, Papadimitriou, and Vazirani.
How it fits in the curriculum
CS 3510 is the base, introductory course in the design and analysis of algorithms. The course is more math-based meaning it doesn't require a computer language. The course is a vital stepping-point in the Theory thread as it's used as the more advanced algorithm course in the thread.
Current Registration Info
In order to register for the course, you must register under a certain section as depicted by letters (A, B, C...).
Prerequisites
- CS 2050/2051/2106 (min. grade of C)
- CS 1332 (min. grade of C) or MATH 3012/3022 (min. grade of D)
Resources
- CS 3510: Design and Analysis of Algorithms (Fall 2017): click here
- CS 3510: Design and Analysis of Algorithms (Spring 2020): click here
- Oscar Details: click here
