CSE102: Introduction to Analysis of Algorithms

Methods for the systematic construction and mathematical analysis of algorithms. Order notation, the RAM model of computation, lower bounds, and recurrence relations are covered. The algorithm design techniques include divide-and-conquer, branch and bound, and dynamic programming. Applications to combinatorial, graph, string, and geometric algorithms.

5 credits

Year	Fall	Winter	Spring	Summer
2024-25	Section 01 Delbert D. Bailey (ddbailey)	Section 01 Sungjin Im (sim9)	Section 01 Delbert D. Bailey (ddbailey)
2023-24	Section 01 Delbert D. Bailey (ddbailey)	Section 01 Vaggos Chatziafratis (evchatzi)	Section 01 Patrick Tantalo (ptantalo)	Section 01 Vaggos Chatziafratis (evchatzi)
2022-23	Section 01 Patrick Tantalo (ptantalo)	Section 01 Vaggos Chatziafratis (evchatzi) Section 02 Allen Van Gelder (avg)	Section 01 Alexandra Kolla (akolla)	Section 01 Suresh Kumar Lodha (lodha) Session 1
2021-22	Section 01 Patrick Tantalo (ptantalo)	Section 01 Daniel Fremont (dfremont) Section 02 Alexandra Kolla (akolla)	Section 01 Suresh Kumar Lodha (lodha)
2020-21		Section 01 Daniel Fremont (dfremont) Section 02 David Lee Martin (dlmartin) Section 02 David Lee Martin (dlmartin)	Section 02 Suresh Kumar Lodha (lodha) Section 01 Allen Van Gelder (avg)

Comments

Formerly CMPS 102

While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.