After Computer Science 223b. Data representation, information encoding, combinatorial circuits, sequential circuits, and pipelining.
Students design and construct a large digital system.
Some understanding of electric circuits and programming is desirable but not essential. Techniques for analyzing the efficiency of algorithms and designing efficient algorithms and data structures. Algorithms for graph theoretic problems, network flows, and numerical linear algebra. Provides algorithmic background essential to further study of computer science. After Computer Science 202a and 223b.