New schedule!
CS 250. Algorithms. Advanced data structures, systematic study and analysis of important algorithms for searching; sorting; string processing; mathematical, geometrical, and graph algorithms, classes of P and NP, NP-complete and intractable problems. Prerequisite: 201 and 212. FALL, SPRING. [3]
CS 252. Theory of Automata, Formal Languages, and Computation. Finite-state machines and regular expressions. Context-free grammars and languages. Pushdown automata. Turing machines. Undecideability. The Chomsky hierarchy. Computational complexity. Prerequisite: 212. SPRING. [3]
EECE 116. Digital Logic. Numbering systems. Boolean algebra and combinational logic, graphical simplification, sequential logic, registers, and state machines. Three lectures and one laboratory period. FALL, SPRING. [4]
MATH 223. Concepts of Abstract Algebra. Fundamental properties of integers and polynomials. Elementary properties of groups, rings, integral domains, fields and lattices. Prerequisite: 194 or 204. FALL, SPRING. [3] Staff.
PHYS 117b. General Physics. Introduction to general physics and its applications. Sound, electricity and magnetism, optics, and modern physics. Accompanied by one three-hour laboratory per week. Corequisite: introductory calculus. [4] Ernst, Hutson, Velkovska, Haglund, Brau.