Overview
Description
Analysis and design of algorithms on sequences, sets, graphs and trees. Geometric, algebraic and numeric algorithms, FFTs, reductions. Parallel algorithms.
Requirements
Prerequisites
- with a “C” or better
CS 302CS 365EE 291
Original catalog text
Prerequisites
Prerequisite(s): CS 302 with a “C” or better; CS 365 or EE 291.
Units
Lecture3
Catalog Details
Offering
Offered: Every Fall and Spring
Terms
fall, spring
Attributes
Standard
Learning Outcomes
- identify, formulate, analyze, and solve complex computing or engineering problems by applying principles of computing, engineering, science, and mathematics.
- design, implement, and evaluate a computing or engineering solution to meet a given set of requirements, with consideration of public health, safety, and welfare, as well as global, cultural, social, environmental, and economic factors.