Course Search

The development of algorithms and their implementations in a higher-level programming language, with emphasis on proper design principles and advanced programming concepts. Introduction to the performance analysis of algorithms. Course requirements include a substantial number of programming projects. Prerequisites: grade of C or better in COS 160 or permission of instructor. Offered fall and spring Cr 4.

A first introduction to computer programming for solving practical problems, taught in Python, a modern object-oriented, dynamic computer language. The course teaches how to represent aggregates of data, process data selectively and repetitively, structure programs with functions and use predefined libraries with an eye towards acquiring, managing, visualizing and performing basic analysis of sets of data. Students will conduct hands-on programming, both at home and in the lab. Prerequisite: grade of C or better in MAT 108 or permission of instructor. Cr 4.

Introduction to the fundamental principles of data structures, including their use, specification, and implementation, as well as fundamental principles of algorithms related to to data structures. Data structures covered include lists, trees, graphs, and hash tables. Algorithm techniques include searching, sorting, dynamic memory allocation, recursion, and multithreading. Prerequisite: ELE 271. Cr. 4.

Students design, build, and test combinational and sequential logic circuits and write assembly language programs. This course must be taken concurrently with COS 250. Offered fall. Cr 1. .

Basic abstract data types and their representations, fundamental algorithms, and algorithm analysis. Consideration is given to applications. Specific topics include linked structures, trees, searching and sorting, priority queues, graphs, and hashing. Course requirements include a substantial programming component. Prerequisites: grades of C or better in COS 161, and MAT 145 or MAT 152 or their equivalents, or permission of instructor. Offered fall. Cr 4.