ICS 621 Fall 2019 General Course Information

During the course, the students will be developing efficient solutions to algorithmic problems and implementing them under time constraints. So they must be very comfortable with one of the programming languages below, design and analysis of basic algorithms, asymptotic notation, and the algorithms taught in an undergraduate algorithms course (most of the material from the CLRS textbook), hence, the prerequisite requirement of undergraduate algorithms.

Prerequisites

• An undergraduate course in algorithms (ICS 311 or equivalent)

The course will expect you to know the material about algorithms and data structures taught in an undergraduate algorithms course.

Lecture Time & Location

• Fridays 12:30-3pm in Holmes 211

Instructor

Nodari Sitchinava

• Office: POST 309C

• Office Telephone: (808) 956-3581

• Email: nodari@hawaii.edu (Put “ICS 621” in the subject line.)

• Office Hours: Wednesday 2-4pm

Reading Material

There is no required textbook for the course. The course material will come from various sources. Some material will come from the following textbooks:

• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, 3rd Edition. The MIT Press, 2009. ISBN: 9780262033848.

• Michael Mitzenmacher and Eli Upfal. Probability and Computing. Cambridge University Press, 2017. ISBN: 9781107154889.

• Berg, Mark de, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2000. ISBN: 3540656200.

• Joseph JáJá, Introduction to Parallel Algorithms. Addison Wesley, 1992. ISBN: 9780201548563.

Additional material will come from research papers, links to which will be posted on this website.