AMS 301
3 credits · STEM+
An introduction to graph theory and combinatorial analysis. The emphasis is on solving applied problems rather than on theorems and proofs. Techniques used in problem solving include generating functions, recurrence relations, and network flows. This course develops the type of mathematical thinking that is fundamental to computer science and operations research.
| Section | Days | Time | Room | Instructor |
|---|---|---|---|---|
| LEC 01 | TuTh | 5:00PM–6:20PM | HUMANITIES 1003 WESTCAMPUS | Xiaolin Li★ 1.5 |
| LEC 03 | TuTh | 12:30PM–1:50PM | HARRIMAN HLL 137 WESTCAMPUS | Prahlad Narasimhan Kasthurirangan |
| LEC 90 · SUNY Korea | MoWe | 3:30PM–4:50PM | Korea OUTOFCNTRY | Suil O |