CS 320 - Algorithms--Theory and Practice

  • 3 credits
View available sections

Analysis, design, implementation and applications of algorithms.

This course can be applied toward:


CS 165 (Java (CS2) Data Structures and Algorithms) with a C or better; CS 220 (Discrete Structures and their Applications) with a C or better; MATH 229 (Matrices and Linear Equations) with a C or better or MATH 369 (Linear Algebra I) with a C or better.


Anton Willem Bohm
Anton Willem Bohm

(970) 491-7595 | Anton.Bohm@colostate.edu

Dr. Bohm earned his Ph.D. in Computer Science from the University of Utrecht; M.S. in Mathematics and Computer Science from the University of Delft; and B.S. Mathematics and Computer Science from the University of Delft. His main interest being High Performance Parallel Computing, he created graduate courses, on campus and on line, in parallel algorithms, and parallel computing.

While a professor at Colorado State University, he created the first year Robot Programming and Games Programming Challenge Classes and redesigned Computer Science courses, and created a new third year course, to integrate theory and practice. He also organized the CSU ISTeC High School Robot Programming Competition in 2006 and 2007. In 2005 he received CSU’s College of Natural Science Excellence in Undergraduate Teaching Award, and in 2007 he received CSU’s (Liberal Arts and Natural Sciences) Eddy Teacher Award. In 2010 he received the Colorado State University's Board of Governors "Excellence in Undergraduate Teaching" award.