Introduces machine learning based trading strategies. Topics: Information processing, probabilistic analysis, portfolio construction, generation of market orders, KNN, random forests. Credit not awarded for both CS 4646 and CS 7646.

Final project for students completing a master's degree in the College of Computing. Repeatable for multi-semester projects.

Final project for students completing a master's degree in the College of Computing. Repeatable for multi-semester projects.

Design and analysis of algorithms on a graduate level, including dynamic programming, divide and conquer, FFT, graph and flow algorithms, RSA, linear programming, and NP-completedness.

Design and analysis of algorithms on a graduate level, including dynamic programming, divide and conquer, FFT, graph and flow algorithms, RSA, linear programming, and NP-completedness.

Study of fundamental concepts with regard to relational databases. Topics covered include database design, query processing, concurrency control, and recovery. Credit not given for both CS 6400 and CS 6754.

Independent research conducted under the guidance of a faculty member.

Advanced techniques for designing and analyzing efficient algorithms for combinatorial, continuous, and number theoretic problems. Credit not allowed for both CS 4540 and CS 6505 or CS 4540 and CS 6515.