| PREVIOUS | UP | NEXT | CONTENTS |
The number and title of each course is followed by the number of semester hours it carries, the semester(s) during which it is taught (F=fall, S=spring, U=summer), its prerequisites, its corequisites, and any courses with which it is cross-listed.
Where a course has both a 5000- and 6000-level number, the 5000-level version is intended for undergraduate and the 6000-level version for graduate students. The two versions of the class will meet together, but extra work will be expected of graduate students.
Current class schedules and registration information are available on line.
1010 (Introduction to Unix0.5FSU, An introduction to the Unix workstations used in the College of Engineering CADE Lab. Topics include the X Windows system, Unix shell commands, file system issues, text editing with Emacs, accessing the World Wide Web with Netscape, and electronic mail. Self-paced course using online teaching aids.)
1020 (Introduction to Programming in C++3FU, An introduction to essential programming concepts using C++. This course is more slowly paced and has less depth than either 1000 or 2010. Laboratory practice.)
1021 (Introduction to Programming in Java3FU, An introduction to essential programming concepts using Java. Laboratory practice emphasizes object-oriented techniques and web-based application design.)
1040 (Creating Interactive Web Content3FSU, Introduction to the essentials of web page design and object-oriented programming through the use of HTML and JavaScript to create interactive web pages. It is appropriate for any student who is comfortable using a computer to write a paper and browse the Web. This is a 100% online course that can be completed on any computer equipped with a recent version of Netscape Communicator or Internet Explorer.)
1050 (Social Aspects of a Digital World2F, Social and policy aspects of computing, beginning with a review of the history and technology of the Internet. Privacy, intellectual property, ethics, electronic commerce, and computer crime. Concurrent enrollment in a companion 1000-level discussion course (such as 1051) is required.)
1051 (Introductory Discussion of Social Aspects1F, The combination of 1050/1051 is appropriate for any student who is already comfortable using a computer to write papers and explore the Web.)
1950 (Independent Study1 to 4)
1960 (Special Topics1 to 4)
2010 (Introduction to Computer Science I4FS, The first course required for students intending to major in computer science and computer engineering. Introduction to the engineering and mathematical skills required to effectively program computers, and to the range of issues confronted by computer scientists. Roles of procedural and data abstraction in decomposing programs into manageable pieces. Introduction to object-oriented programming. Extensive programming exercises that involve the application of elementary software engineering techniques.) Coreq: MATH 1210, 1010.
2020 (Introduction to Computer Science II4SU, The second course required for students intending to major in computer science and computer engineering. Introduction to the problem of engineering computational efficiency into programs. Classical algorithms (including sorting, searching, and graph traversal) and data structures (including stacks, queues, linked lists, trees, hash tables, and graphs). Analysis of program space and time requirements. Extensive programming exercises that require the application of elementary techniques from software engineering.) Prereq: 2010.
2100 (Discrete Structures2F, Introduction to propositional logic, predicate logic, formal logical arguments, finite sets, functions, relations, inductive proofs, recurrence relations, graphs, and their applications to Computer Science.) Prereq: 2010.
2950 (Independent Study1-4)
2960 (Special Topics1-4)
3050 (Social Aspects of a Digital World2F, Social and policy aspects of computing, beginning with a review of the history and technology of the Internet. Privacy, intellectual property, ethics, electronic commerce, and computer crime. Concurrent enrollment in an companion 3000-level discussion course (such as 3051) is required.) Prereq: Programming proficiency.
3051 (Intermediate Discussion of Social Aspects1F, The combination of 3050/3051 is appropriate for students who have an understanding of computing technology comparable to that of a newly-admitted computer science major.) Prereq: Programming proficiency.
3100 (Models of Computation3SQuantitative Intensive B.S.\ Course., Models of sequential computation, including finite-state automata, push-down automata, and Turing machines.) Prereq: 2020, 2100.
3200 (Scientific Computation3F, Scientific computation relevant to computer science and engineering; floating-point arithmetic, systems of linear equations (direct and iterative techniques), nonlinear equations (univariate and multivariate), interpolation and differentiation (divided differences), integration (mechanical and Gaussian quadratures, optimal quadratures), approximation by spline functions (natural splines and B-splines, optimality of splines).) Prereq: 2020, MATH 2250.
3500 5010 (Software Practice4F, Practical exposure to the process of creating large software systems, including requirements specifications, design, implementation, testing, and maintenance. Emphasis on software process, software tools (debuggers, profilers, source code repositories, test harnesses), software engineering techniques (time management, code and documentation standards, source code management, object-oriented analysis and design), and team development practice. Much of the work will be in groups and will involve modifying preexisting software systems.) Prereq: 2020.
3510 5020 (Advanced Algorithms and Data Structures3SQuantitative Intensive B.S. Course., Study of algorithms, data structures, and complexity analysis beyond the introductory treatment from 2020. Balanced trees, heaps, hash tables, string matching, graph algorithms, external sorting and searching. Dynamic programming, exhaustive search. Space and time complexity, derivation and solution of recurrence relations, complexity hierarchies, reducibility, NP completeness.) Prereq: 2020, 2100.
3520 (Programming Language Concepts3F, Ideas behind the design and implementation of programming languages. Syntactic description; scope and lifetime of variables; runtime stack organization; parsing and abstract syntax; semantic issues; type systems; programming paradigms; interpreters and compilers.) Prereq: 3500, 3510.
3700 (Fundamentals of Digital System Design4SQuantitative Intensive B.S. Course., Techniques for minimizing logic functions and designing common combinational circuits such as decoders, selectors, and adders. Synchronous and asynchronous sequential circuits, state diagrams, Mealy and Moore circuits, state minimization and assignment. Use of software tools for design, minimization, simulation, and schematic capture. Implementation with MSI, LSI, and field programmable gate arrays. Laboratory included.) Prereq: 2010, PHYCS 2220. Crosslisted with 3700.
3710 (Computer Design Laboratory3F, Student groups design, build, and test a programmable device such as a computer or calculator.) Prereq: 3700, 3810. Crosslisted with 3710.
3720 (Analog & Digital Interfacing with Microprocessors & Microcontrollers4S, Fundamentals of digital-to-analog (D-to-A) and analog-to-digital (A-to-D) circuits, relays, stepper motors, and digital switches. Interfacing digital and analog circuits to computers and micro-controllers. Laboratory included.) Prereq: 3700. Crosslisted with 3720.
3810 (Computer Architecture4FQuantitative Intensive B.S. Course., An in-depth study of computer architecture and design, from digital logic to operating systems, including Topics such as pipelining, memory systems, parallel and serial communication, and interrupts. Performance measures and compilation issues. Computer architectures including RISC, CISC, stack, and parallel.) Prereq: 2020. Crosslisted with 3810.
3950 (Independent Study1-4)
3960 (Special Topics1-4)
4500 (Software Engineering Laboratory3S, Development of significant software systems by small student groups, with emphasis on applying sound, disciplined software engineering practice.) Prereq: 3500, 3510, senior standing in Computer Science.
4550 (Simulation3F, Basic simulation modeling, modeling complex systems, basic probability and statistics for simulation, building valid simulations, random numbers, and output data analysis. Both discrete event and continuous simulation may be covered.) Prereq: 3500, 3510.
4710 (Computer Engineering Senior Project3F, Students design a microcomputer system that includes RAM, EPROM, and I/O devices. Capstone project for computer engineering majors. Formal written reports, one or more oral presentations.) Prereq: 3710, 3720, senior standing in Computer Engineering. Crosslisted with 4710.
4950 (Independent Study1-4)
4960-4964 (Special Topics1-4, The following special topics courses are currently scheduled for the 2000-2001 academic year. Contact the instructor for details.
4970 (Bachelor's Thesis3, Only students who have previously worked with a faculty member in a research group may register for Bachelor's Thesis credit, and then only with the permission of the faculty member. An undergraduate thesis is a publication-quality description of work done in previous semesters. At a minimum a thesis must be published as a technical report; ideally, it should be submitted to a conference or journal. A Bachelor's Thesis is intended as an alternative to the senior Software engineering Laboratory for students who are headed for graduate school.) Prereq: Senior standing in computer science.
4999 (Honors Thesis/Project3Upper-division Communications/Writing, Restricted to students in the Honors Program working on their Honors degree.)
5010 3500 (Software Practice4F, This course is for graduate students from other than the School of Computing. Practical exposure to the process of creating large software systems, including requirements specifications, design, implementation, testing, and maintenance. Emphasis on software process, software tools (debuggers, profilers, source code repositories, test harnesses), software engineering techniques (time management, code and documentation standards, source code management, object-oriented analysis and design), and team development practice. Much of the work will be in groups and will involve modifying preexisting software systems.) Prereq: 2020 and permission of instructor.
5020 3510 (Advanced Algorithms and Data Structures3S, This course is for graduate students from other than the School of Computing. Study of algorithms, data structures, and complexity analysis beyond the introductory treatment from 2020. Balanced trees, heaps, hash tables, string matching, graph algorithms, external sorting and searching. Dynamic programming, exhaustive search. Space and time complexity, derivation and solution of recurrence relations, complexity hierarchies, reducibility, NP completeness.) Prereq: 5010 and permission of instructor.
5050 (Social Aspects of a Digital World2F, Social and policy aspects of computing, beginning with a review of the history and technology of the Internet. Privacy, intellectual property, ethics, electronic commerce, and computer crime. Concurrent enrollment in a companion 5000-level discussion course (such as 5051) is required. (Companion discussions may also be offered by other departments.)) Prereq: Permission of instructor.
5051 (Advanced Discussion of Social Aspects1F, The combination of 5050/5051 is appropriate for students who have a graduate-level background in issues related to the social aspects of computing (e.g., intellectual property or electronic commerce).) Prereq: Permission of instructor.
5060 (Legal Protection of Digital Information2S, Ways of protecting digital information--computer software and databases--using intellectual property law. Copyrights, patents, trade secrets, and contracts as ways of protecting digital information.)
5100 6100 (Foundations of Computer Science3F, Advanced examination of fundamental ideas behind algorithms, complexity analysis, mathematical logics, elementary computability, and concurrency formalisms.) Prereq: 3100, 3500, 3510.
5210 6210 (Advanced Scientific Computing I3, An introduction to existing classical and modern numerical methods and their algorithmic development and efficient implementation. Topics include: numerical linear algebra, interpolation, approximation methods and parallel computation methods for nonlinear equations, ordinary differential equations, and partial differential equations.) Prereq: 3200, 3500, 3510, MATH 3160.
5300 6300 (Artificial Intelligence3F, Introduction to field of artificial intelligence, including heuristic programming, problem-solving, search, theorem proving, question answering, machine learning, pattern recognition, game playing, robotics, computer vision.) Prereq: 3500, 3510.
5310 6310 (Robotics3F, The mechanics of robots, comprising kinematics, dynamics, and trajectories. Planar, spherical, and spatial transformations and displacements. Representing orientation: Euler angles, angle-axis, and quaternions. Velocity and acceleration: the Jacobian and screw theory. Inverse kinematics: solvability and singularities. Trajectory planning: joint interpolation and Cartesian trajectories. Statics of serial chain mechanisms. Inertial parameters, Newton-Euler equations, D'Alembert's principle. Recursive forward and inverse dynamics.) Prereq: 1000, MATH 2250, PHYCS 2220. Crosslisted with 5220.
5320 6320 (Computer Vision3S, Basic pattern-recognition and image-analysis techniques, low-level representation, intrinsic images, ``shape from'' methods, segmentation, texture and motion analysis, and representation of 2-D and 3-D shape.) Prereq: 3500, 3510, MATH 2210, MATH 2270.
5340 6340 (Natural Language Processing3S, Computational models and methods for understanding written text. Introduction to syntactic analysis, semantic analysis, discourse analysis, knowledge structures, and memory organization. A variety of approaches are covered, including conceptual dependency theory, connectionist methods, and statistical techniques. Applications include story understanding, fact extraction, and information retrieval.) Prereq: 3500, 3510; 5300/6300 recommended.
5350 6350 (Machine Learning3F, Techniques for developing computer systems that can acquire new knowledge automatically or adapt their behavior over time. Topics include concept learning, decision trees, evaluation functions, clustering methods, explanation-based learning, language learning, cognitive learning architectures, connectionist methods, reinforcement learning, genetic algorithms, hybrid methods, and discovery.) Prereq: 3500, 3510; 5300/6300 recommended.
5460 (Operating Systems3F, Characteristics, objectives, and issues concerning computer operating systems. Hardware/software interactions, process management, memory management, protection, synchronization, resource allocation, file systems, security, and distributed systems. Extensive systems programming.) Prereq: 3500, 3510, 3810.
5470 (Compiler Principles and Techniques3S, Lexical analysis, top-down and bottom-up parsing, symbol tables, internal forms and intermediate languages, runtime environments, code generation, code optimization, semantic specifications, error detection and recovery. Use of software tools for lexical analysis and parsing.) Prereq: 3500, 3510, 3810, 3100.
5480 6480 (Data Communications and Networks3F, A comprehensive study of the principles and practices of data communication and networks. Topics include: transmission media, data encoding, local and wide area networking architectures, internetwork and transport protocols (e.g., IPv4, IPv6, TCP, UDP, RPC, SMTP), networking infrastructure (e.g., routers, name servers, gateways), network management, distributed applications, network security, and electronic commerce. Principles are put into practice via a number of programming projects.) Prereq: 3500, 3510, 3810.
5520 6520 (Programming Languages and Semantics3S, Examination of the formal and pragmatic ideas behind programming language design. Imperative, functional, logic, object-oriented, and multi-paradigm languages. Lambda calculus, fixpoints, type systems, and predicate logic. Denotational semantics and models of concurrency.) Prereq: 3520, 3100.
5530 6530 (Database Systems3F, Representing information about real world enterprises using important data models including the entity-relationship, relational and object-oriented approaches. Database design criteria, including normalization and integrity constraints. Implementation techniques using commercial database management system software. Selected advanced Topics such as distributed, temporal, active, and multi-media databases.) Prereq: 3500, 3510.
5540 6540 (Human/Computer Interaction3F, Fundamentals of input/output devices, user interfaces, and human factors in the context of designing interactive applications.) Prereq: 3500, 3510.
5600 6600 (Computer Graphics I3F, Basic display techniques, display devices, vector generation, display processors. Homogeneous coordinates, transformations, and clipping in 2-D. Graphics systems, interactive graphics. Introduction to raster graphics. Some elements of photography as related to computer graphics.) Prereq: 3500, 3510, MATH 2250.
5610 6610 (Computer Graphics II3S, Representations of 3-D objects, polygons, 3-D visualization techniques, hidden-line and hidden- surface removal, polygon clipping, continuous-tone pictures, color displays, lighting models, the aliasing problem. Some fundamentals of photographing computer-generated gray-scale images.) Prereq: 5600/6600.
5630 6630 (Scientific Visualization3, Introduction to the techniques and tools needed for the visual display of data. Students will explore many aspects of visualization, using a "from concepts to results" format. The course begins with an overview of the important issues involved in visualization, continues through an overview of graphics tools relating to visualization, and ends with instruction in the utilization and customization of a variety of scientific visualization software packages.) Prereq: 3500, 3510; 3200 or 5210 or MATH 5600.
5710 6710 (Advanced Integrated Circuit Design I3F, Introduction to basic concepts of the design of CMOS integrated circuits for students with a wide range of backgrounds. Static and dynamic properties of CMOS circuits, composite layout of CMOS circuits, and modeling of transistors for use in SPICE simulations. Commonly encountered CMOS circuits. Introduction to CMOS analog/digital circuits. Students complete design, composite layout, and digitization of a simple integrated circuit using computer-aided design tools.) Prereq: 3700. Crosslisted with 5710.
5720 6720 (Advanced Integrated Circuit Design II3S, Design of mixed signal (analog/digital) CMOS integrated circuits. Fundamental building blocks for analog circuits, including the basic principles of opamp, current mirror and comparator design. Basics of discrete-time signals and filters. Implementation of switched capacitor circuits and discussions of various implementations of D/A and A/D converters, oversampled converters and phase locked loops.) Prereq: 5710/6710, 2100. Crosslisted with 5720.
5740 6740 (Computer-Aided Design of Digital Circuits3F, Introduction to theory and algorithms used for computer-aided synthesis of digital integrated circuits. Topics include algorithms and representations for Boolean optimization, hardware modeling, combination logic optimization, sequential logic optimization and technology mapping.) Prereq: 3700, 3510. Crosslisted with 5740.
5750 6750 (Synthesis and Verification of Asynchronous VLSI Systems3S, Introduction to systematic methods for the design of asynchronous VLSI systems from high-level specifications to efficient, reliable circuit implementations. Topics include specification, controller synthesis, optimization using timing information, technology mapping, data path design, and verification.) Prereq: 3700, 3510. Crosslisted with 5750.
5810 6810 (Advanced Computer Architecture3F, Principles of modern high performance computer and micro architecture: static vs. dynamic issues, pipelining, control and data hazards, branch prediction and correlation, cache structure and policies, cost-performance and physical complexity analyses.) Prereq: 3700, 3810. Crosslisted with 5810.
5830 6830 (VLSI Architecture3S, Project-based study of a variety of Topics related to VLSI systems. Use of field programmable gate arrays to design, implement, and test a VLSI project.) Prereq: 3700, 3810. Crosslisted with 5830.
5940 (Seminar1-3, Current Topics in computer science. May be repeated for credit.)
5950 (Independent Study1-4)
5960-5969 (Special Topics1-4, The following special topics courses are currently scheduled for the 1999-2000 academic year. Contact the faculty member in charge for details.
6010 (Writing Research Proposals2S, Fundamental aspects of writing computer science research proposals, including thesis, dissertation, and grant proposals. Form, style, substance, and marketing of effective proposals will be considered. Emphasis is placed on developing and presenting clear and compelling ideas. Substantial writing and class presentations is required of all participants.) Prereq: Graduate standing in Computer Science.
6020 (Conducting, Publishing, and Presenting Early-Career Research3, This is an independent study offering designed to encourage beginning graduate students to conduct, publish, and present original research early in their graduate careers. A graduate student can earn credit for 6020 by having a first-authored paper accepted for publication in a top-tier journal or conference and by subsequently presenting the published work in a one-hour research colloquium. The research must be conducted while a graduate student at Utah; the paper must be accepted within two years of enrolling in the graduate program; the journal or conference must be approved by the student's graduate committee; the colloquium must be presented as soon as possible after the acceptance of the paper; and the student must complete these requirements and register for 6020 within three years of enrolling in the graduate program. 6020 may not be repeated for credit.) Prereq: Graduate standing in Computer Science.
6100 5100 (Foundations of Computer Science3F, Graduate students only. Extra work required.) Prereq: 3100, 3500, 3510.
6110 (Formal Methods for System Design3S, Study of methods for formally specifying and verifying computing systems. Specific techniques include explicit state enumeration, implicit state enumeration, automated decision procedures for first-order logic, and automated theorem proving. Examples selected from the areas of superscalar CPU design, parallel processor memory models, and synchronization and coordination protocols.) Prereq: 5100/6100 and 5520/6520.
6210 5210 (Advanced Scientific Computing I3, Graduate students only. Extra work required.) Prereq: 3200, 3500, 3510, MATH 3160.
6220 (Advanced Scientific Computing II3, A study of the numerical solution of two and three dimensional partial differential equations that arise in science and engineering problems. Topics include: finite difference methods, finite element methods, boundary element methods, multigrid methods, mesh generation, storage optimization methods, and adaptive methods.) Prereq: 5210/6210 or MATH 5600.
6300 5300 (Artificial Intelligence3F, Graduate students only. Extra work required.) Prereq: 3500, 3510.
6310 5310 (Robotics3F, Graduate students only. Extra work required.) Prereq: 1000, MATH 2250, PHYCS 2220. Crosslisted with 6220.
6320 5320 (Computer Vision3S, Graduate students only. Extra work required.) Prereq: 3500, 3510, MATH 2210, MATH 2270.
6340 5340 (Natural Language Processing3S, Graduate students only. Extra work required.) Prereq: 3500, 3510; 5300/6300 recommended.
6350 5350 (Machine Learning3F, Graduate students only. Extra work required.) Prereq: 3500, 3510; 5300/6300 recommended.
6360 (Virtual Reality3S, Human interfaces: visual, auditory, haptic, and locomotory displays; position tracking and mapping. Computer hardware and software for the generation of virtual environments. Networking and communications. Telerobotics: remote manipulators and vehicles, low-level control, supervisory control, and real-time architectures. Applications: manufacturing, medicine, hazardous environments, and training.) Prereq: 5310/6310.
6480 5480 (Data Communications and Networks3F, Graduate students only. Extra work required.) Prereq: 3500, 3510, 3810.
6520 5520 (Programming Languages and Semantics3S, Graduate students only. Extra work required.) Prereq: 3520, 3100.
6530 5530 (Database Systems3F, Graduate students only. Extra work required.) Prereq: 3500, 3510.
6540 5540 (Human/Computer Interaction3F, Graduate students only. Extra work required.) Prereq: 3500, 3510.
6600 5600 (Computer Graphics I3F, Graduate students only. Extra work required.) Prereq: 3500, 3510, MATH 2250.
6610 5610 (Computer Graphics II3S, Graduate students only. Extra work required.) Prereq: 5600/6600.
6620 (Image Synthesis3S, Using camera and sensor simulation along with physical simulation to generate realistic synthetic images.) Prereq: 5610/6610, 6670, MATH 5010.
6630 5630 (Scientific Visualization3, Graduate students only. Extra work required.) Prereq: 3500, 3510; 3200 or 5210/6210 or MATH 5600.
6670 (Computer-Aided Geometric Design I3F) Prereq: MATH 2210, MATH 2250, 3500, 3510; Coreq: 5600/6600.
6680 (Computer-Aided Geometric Design II3S, Introduction to current concepts and issues in CAGD systems with emphasis on free- form surface design; mathematics of free-form curve and surface representations, including Coons patches, Bezier method, B-splines, triangular interpolants, and their geometric consequences; classical surface geometry; local and global design tradeoffs and explicit and parametric tradeoffs; subdivision and refinement as techniques in modeling; current production capabilities compared to advanced research. Laboratory experiments with current CAD systems.) Prereq: 6670.
6710 5710 (Advanced Integrated Circuit Design I3F, Graduate students only. Extra work required.) Prereq: 3700. Crosslisted with 6710.
6720 5720 (Advanced Integrated Circuit Design II3S, Graduate students only. Extra work required.) Prereq: 5710/6710, 2100. Crosslisted with 6720.
6740 5740 (Computer-Aided Design of Digital Circuits3F, Graduate students only. Extra work required.) Prereq: 3700, 3510. Crosslisted with 6740.
6750 5750 (Synthesis and Verification of Asynchronous VLSI Systems3S, Graduate students only. Extra work required.) Prereq: 3700, 3510. Crosslisted with 6750.
6770 (Advanced Digital VLSI Systems Design3S, Full custom, high speed, high performance CMOS circuit design issues, methodologies, and techniques. Failure modes, modeling techniques, testing, clock skew analysis, clock distribution, power analysis, power line distribution, electrical rules checking, megacell design flow, and other important design issues.) Prereq: 5710/6710. Crosslisted with 6770.
6810 5810 (Advanced Computer Architecture3F, Graduate students only. Extra work required.) Prereq: 3700, 3810. Crosslisted with 6810.
6820 (Parallel Computer Architecture3S, Architecture, design, and analysis of parallel computer systems: vector processing, data vs. control concurrency, shared memory, message passing, communication fabrics, case studies of current high performance parallel systems.) Prereq: 5810/6810. Crosslisted with 6820.
6830 5830 (VLSI Architecture3S, Graduate students only. Extra work required.) Prereq: 3700, 3810. Crosslisted with 6830.
6930-6944 (Seminar1-3, Current Topics in Computer Science. May be repeated for credit.)
6950 (Independent Study1-4)
6960-6969 (Special Topics1-4, The following special topics courses are currently scheduled for the 2000-2001 academic year. Contact the instructor for details.
6970 (Masters Thesis Research1-12)
6980 (Faculty Consultation Masters1-12)
7120 (Information-Based Complexity3S, Analysis of optimal computational methods for continuous problems. Introduction to the general worst case theory of optimal algorithms, linear problems, and spline algorithms as well as selected nonlinear problems. Examples include optimal integration, approximation, nonlinear zero finding, and fixed points.) Prereq: 3200, MATH 2270, MATH 3210.
7240 (Sinc Methods3, Sinc methods for solving difficult computational problems, such as partial differential and integral equation problems, that arise in science and engineering research. Emphasis on parallel computation. Applications vary, depending on participants in the class. Students are given projects--whenever possible in their areas of research--that lead to publishable research articles.) Prereq: 5210/6210 or MATH 5600 or MATH 5610.
7310 (Advanced Robotics3S, Covers the kinematics, dynamics, and control of robotic manipulators. Projects controlling robots will be an integral part of the course.) Prereq: 5310/6310 5220/6220. Crosslisted with 7230.
7460 (Advanced Operating Systems3, Practical distributed operating systems concepts from basics through the state of the art. Topics include interprocess communication, client-server systems, distributed shared memory, distributed file systems, distributed databases, portable computing, software fault tolerance, and wide-area (e.g. web) applications. Work includes individual oral presentations, a group project, and a written research report.) Prereq: 6460, 5480/6480.
7940 (Seminar1-3, May be repeated for credit.)
7950 (Independent Study1-4)
7960 (Special Topics1-4, The following special topics courses are currently scheduled for the 2000-2001 academic year. Contact the instructor for details.
7970 (PhD Dissertation Research1-12)
7980 (Faculty Consultation PhD1-12)
7990 (Continuing Registration: Ph.D.0)
| PREVIOUS | UP | NEXT | CONTENTS |