|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
1.00 Credits
Basic concepts and principles of multiprogrammed operating systems. Processes, interprocess communication, CPU scheduling, mutual exclusion, deadlocks, memory management, I/O devices, file systems, protection mechanisms. Also taught as Electrical Engineering 153. Prerequisites: Computer Science 100 and 104. Instructor: Chase, Cox, or Maggs
-
1.00 Credits
Introduction to techniques for developing, evaluating, and analyzing computational models for problems in the sciences and social sciences. Stochastic, deterministic, discrete, and continuous models. Stability of numerical approximations, parameter estimation, perturbation theory. Case studies from biology and economics. Prerequisites: Math 31, 32, 100-level Statistics. Instructor: Tomasi
-
1.00 Credits
Networking and distributed systems. Network infrastructure support for distributed applications ranging from email to web browsing to electronic commerce. Principles underlying the design of our network infrastructure and the challenges that lie ahead. The socket API, security, naming network file systems, wireless networks, Internet routing, link layer protocols (such as Ethernet), and transport protocols (TCP). Hands-on programming assignments covering issues in distributed systems and networking. Prerequisites: Computer Science 108 and 110 or equivalent. Instructor: Maggs or X. Yang
-
1.00 Credits
Databases and relational database management systems. Data modeling, database design theory, data definition and manipulation languages, storaging and indexing techniques, query processing and optimization, concurrency control and recovery, database programming interfaces. Current research issues including XML, web data management, data integration and dissemination, data mining. Hands-on programming projects and a term project. Prerequisite: Computer Science 100, recommended: Computer Science 108. Instructor: Babu or J. Yang
-
1.00 Credits
Techniques for the analysis and design of combinational and sequential networks. Discrete mathematical systems, binary arithmetic, Boolean algebra, minimization of functions, synchronous and fundamental mode sequential circuit design, design with MSI and LSI components, and special properties of switching functions are covered. Selected laboratory work. Also taught as Electrical Engineering 151L. Instructor: Cramer or Marinos
-
1.00 Credits
Theory, practice, and creation of 3D virtual worlds. Hands-on design and development of online immersive synthetic social spaces with Croquet. Introduction to Smalltalk/Squeak programming and graphics workflow for creating virtual worlds and media assets. Critical exploration of state-of-the-art virtual world technologies; 3D graphics, text chat, voice, video, simulations, and mixed reality systems. Topics include: history and culture of virtual worlds, in-world identity and avatars; behavioral norms; self-organizing cultures; virtual world economies; architectural scalability. No prerequisites - some programming experience helpful. Consent of instructor required. Instructors: McCahill and Lombardi
-
1.00 Credits
Overview, motivation, and history; OpenGL and OpenInventor; coordinate systems and geometric transforms; drawing routines, antialiasing, supersampling; 3d object representation, spatial data structures, constructive solid geometry; hidden-surface-removal algorithms, z-buffer, A-buffer; illumination and shading models, surface details, radiosity; achromatic light, color specification, colorimetry, different color models; graphics pipeline, SGI reality engine, Pixel 5; animation, levels of detail. Prerequisites: Computer Science 108 and Mathematics 104. Instructor: Agarwal or Duvall
-
1.00 Credits
Design and analysis of efficient algorithms including sorting, searching, dynamic programming, graph algorithms, fast multiplication, and others; nondeterministic algorithms and computationally hard problems. Prerequisites: Computer Science 100 and 102. Instructor: Edelsbrunner, Mungala, or Reif
-
1.00 Credits
An introduction to theoretical computer science including studies of abstract machines, the language hierarchy from regular sets to recursively enumerable sets, noncomputability, and complexity theory. Prerequisites: Computer Science 100 and Mathematics 103. Instructor: Reif or Rodger
-
1.00 Credits
Topics in proof theory, model theory, and recursion theory; applications to computer science, formal linguistics, mathematics, and philosophy. Usually taught jointly by faculty members from the departments of computer science, mathematics, and philosophy. Prerequisite: a course in logic or consent of instructor. Instructor: Staff
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|