INFSCI 2591 ALGORITHM DESIGN
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
Minimum Credits: 3
Maximum Credits: 3
Current Sections
Spring 2024
Class No. | Days | Times | Room | Instructor(s) | TA(s) | Type |
---|---|---|---|---|---|---|
23562 (1030) | Th | 12:00pm-2:50pm | IS 403 | Hassan Karimi | LEC |