CS 320 - Algorithms--Theory and Practice

  • 3 credits
View available sections

Analysis, design, implementation and applications of algorithms.

Prerequisite

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 161 (Calculus for Physical Scientists II) 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.

Instructors

Sanjay Rajopadhye
Sanjay Rajopadhye

(970) 491-7323 | sanjay.rajopadhye@colostate.edu

Sanjay Rajopadhye is Professor in the Computer Science Department. He also holds a joint appointment in the Electrical and Computer Engineering Department. He joined the faculty at CSU in 2001 and was previously a CNRS researcher at Irisa, Rennes, France, where he headed the COSI research group. Rajopadhye received the B. Tech (honors) degree in Electrical Engineering from the India Institute of Tech. , Kharagpur and a PhD in Computer Science from the University of Utah.

Rajopadhye’s interests cover parallel algorithms and architectures, embedded systems, functional programming, high performance computing on multi- and many-care architectures, automatic parallelization and optimization. He is one of the original developers of the polyhedral model, a formalism for reasoning about an important class of compute-and data-intensive programs. The model, originally developed in the context of automatic synthesis of systolic arrays from recurrence equations has found increasing application from compilation to multi- and many-core architectures.

Loading...