INFSCI 2591 ALGORITHM DESIGN

Description

Minimum Credits: 3
Maximum Credits: 3
Fundamentals of algorithm design including greedy algorithms, divide-and-conquer algorithms, dynamic programming, heuristics and approximate algorithms, parallel and distributed algorithms, multi-dimensional data structures, time complexity of algorithms, and development of programs from algorithms.
Academic Career: Graduate
Course Component: Lecture
Grade Component: Grad LG/SNC Basis
Course Requirements: PREQ: INFSCI 2500 or INFSCI 2500 Exemption (Test Score=1); PROG: School of Information Science or Sch Computing and Information

Future Sections

Please click the headings below to view the hidden sections.

Past Sections

Please click the headings below to view the hidden sections.