We're still actively developing this site. If you encounter any issues, please report them! - Report an issue

INTRODUCTION TO ALGORITHMS

COMPSCI 577
Course Description

Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.

Prerequisites

(COMPSCI/MATH 240 or COMPSCI/MATH/STAT 475 ) and (COMP SCI 367 or COMPSCI 400 ), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals

Satisfies
Credits

Not Reported

Offered

Not Reported

Grade Point Average
3.02

0.58% from Historical

Completion Rate
91.41%

-2.57% from Historical

A Rate
30.06%

11.34% from Historical

Class Size
489

106.64% from Historical

Cumulative Grade Distribution

Instructors (2026 Summr)

Sorted by ratings from Rate My Professors

Similar Courses

INTRODUCTION TO COMBINATORIAL OPTIMIZATION

COMPSCI/ISYE/MATH 425

Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.

INTRODUCTION TO THEORY OF COMPUTING

COMPSCI 520

Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.

COMPUTATIONAL COMPLEXITY

COMPSCI 710

Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems. Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.

PROGRAMMING III

COMPSCI 400

The third course in our programming fundamentals sequence. Covers balanced search trees, graphs, graph traversal algorithms, hash tables and sets, and complexity analysis and about classes of problems that require each data type. Involves design and implementation using high quality professional code, a medium sized program, that demonstrates knowledge and use of latest language features, tools, and conventions. Additional topics may include inheritance and polymorphism; anonymous inner classes, lambda functions, performance analysis to discover and optimize critical code blocks. Introduces industry standards for writing high-quality, maintainable code.

ADVANCED ALGORITHMS

COMPSCI 787

Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems. Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)