Introduction To Computation

Basic concepts of discrete mathematics useful to computer science: set theory, strings and formal languages, propositional and predicate calculus, relations and functions, basic number theory. Induction and recursion: interplay of inductive definition, inductive proof, and recursive algorithms. Graphs, trees, and search. Finite-state machines, regular languages, nondeterministic finite automata, Kleene's Theorem.

Data Structures

An introduction to the design, analysis, and implementation of data structures. This course teaches you how to build, test, debug, document, and evaluate objects that encapsulate data and their associated operations using programming constructs and data abstractions of a modern programming language. Concepts and techniques covered include linear and non-linear structures, recursive structures and algorithms, traversal algorithms, binary search trees, balanced trees, priority queues, union-find, hash tables, bloom filters, and graphs.

Advanced Programming

Data structures course using the Python programming language. Basic mathematical, logical, and programming concepts relevant to description and manipulation of information structures such as arrays, lists, trees, graphs, and files; the underlying principles of algorithm design and analysis applied to sorting and searching problems.

Visiting Artists Lec Series

Each semester, the Department of Art offers a series of lectures by nationally recognized artists, scholars, curators, critics, gallerists, and writers. In addition to the noontime public lectures, the guest speakers also engage in conversations with students and conduct studio visits. Often based on recommendations by graduate students, the research and practice of the guests are pertinent to graduate students? own interests.
Subscribe to