|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
5.00 Credits
Prereq: C S 361. The course provides an introduction to the modern study of computer algorithms. Topics include correctness of algorithms, analysis of iterative and recursive algorithms, worst-case, best-case, and average-case behavior, design of algorithms, divide and conquer algorithms, the greedy method, graph searching, and dynamic programming techniques. Selected additional topics may include computational geometry or NP-completeness. May be retaken three times excluding withdrawals, but only last course taken counts.
-
5.00 Credits
Prereq: C S 300. The fundamentals concerning formal language theory and the theory of computation are explored. Topics include basic models of computation, the Church-Turing thesis, Turing machines, decidability and undecidability, computational complexity, NPcompleteness, and diagonalization. May be retaken three times excluding withdrawals, but only last course taken counts.
-
3.00 Credits
Prereq: . (winter) Practical and formal aspects of computing related to the lexical and syntactic analysis stages of compilation are explored. The relationships among regular expressions, deterministic finite automata, and nondeterministic finite automata are presented. The relationship between contest-free grammars and pushdown automata is also explored. Practical parsing algorithms are examined, including bottom-up, town-down, and recursive descent strategies. May be retaken three times excluding withdrawals, but only last course taken counts.
-
5.00 Credits
Prereq: C S 320 & 361. Compares and contrasts concurrency issues in different programming languages. Remote procedure call, asynchronous buffered message passing, synchronized unbuffered message passing, and shared memory will be studied. Aims to compare and contrast the programming techniques appropriate for different communication mechanisms and to assess their relative effectiveness in different problem domains. An introduction to PetriNet and its application to designing concurrent software will be given. May be retaken three times excluding withdrawals, but only last course taken counts.
-
5.00 Credits
Prereq: C S 411. Studies different parallel structures to familiarize students with the variety of approaches to parallel computing and the strengths and weaknesses of each approach. Concentrates on understanding methods for developing parallel algorithms and analyzing their performance. The advantages and disadvantages of different methods for mapping algorithms onto several different parallel architectures will be studied. Algorithms discussed will include sorting, searching, and matrix operations. May be retaken three times excluding withdrawals, but only last course taken counts.
-
4.00 Credits
Prereq: C S 361 & NOT PBIO 416. The course focuses on bioinformatics tools and biological databases. Students will learn how to utilize them by solving problems designed from current issues in biological, biotechnological, and biomedical research. May be retaken two times excluding withdrawals, but only last course taken counts.
-
4.00 Credits
Prereq: C S 361. This course introduces students to modern interactive computer graphics. It emphasizes hands-on learning through the development of several projects throughout the quarter. Topics include: graphical systems and models, grapics programming, input and interaction, geometric objects and transformaions lighting and shading, and discrete techniques. May be retaken two times excluding withdrawals, but only last course taken counts.
-
5.00 Credits
Prereq: C S 361 & E E 395A. In-depth coverage of computer operating systems and related computer architecture issues. Coverage of physical devices, interrupts, and communication between the computer and external hardware. Interfaces between user programs and the operating system, system calls, software interrupts, and protection issues. Context switching, process address spaces, and process scheduling. Process synchronization, interprocess communications, critical sections, and deadlock detection and recovery. Memory mapping, swapping, paging, and virtual memory. May be retaken three times excluding withdrawals, but only last course taken counts.
-
5.00 Credits
Prereq: C S 442. In-depth coverage of computer-tocomputer and program-to-program communication over modern computer networks focusing on the TCP/IP protocol family. Review of data communication issues, physical address binding, bridging, Ethernet, and Token Ring. Internetwork protocols, routing, domains, networks, and subnetworks. Transport protocols, reliability, flow control, retransmission, and acknowledgement. Distributed systems, server and client issues including verification, and authentication. High-level protocols and applications including electronic mail, network news, remote terminal interaction, and the World Wide Web. May be retaken three times excluding withdrawals, but only last course taken counts.
-
4.00 Credits
Prereq: C S 240C. Object-oriented design, interface design, and GUI development techniques; data structure usage and concepts; model-view-controller paradigm; input output and text parsing; exception handling; JAVA language syntax; large application development. May be retaken 2 times excluding withdrawals, but only last course taken counts.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|