Department of 
Computer Science

Search our Site

Line

ON THIS PAGE:

General Course Information

Undergraduate-Only Courses

Upper-Level Undergraduate Courses

Graduate Courses

Graduate Module Courses

Advanced Graduate Courses

Graduate-Only Courses

  Course Descriptions

General Course Information
Following is a list of courses offered by the Department of Computer Science. Information provided for each course is: course number, name, credit hours, official catalog description (including prerequisites, when taught, and instructor). Click on the name of the course to see its official syllabus. A link at the end of the course description goes to a recent syllabus.

Additional Information:

Undergraduate-Only Courses
Courses with numbers below 100 may not be taken for graduate credit. These courses are introductory and service courses often taken by non-computer science majors.

COMP 050 Computers Make It Possible (3).
How computers have affected society and how those uses have changed computers. Introduces the student to realistic capabilities of computers and how to distinguish popular press hyperbole from reality.

COMP 051 Technology and Entrepreneurship: Propitious Partners (3).
This course will look at the fundamental technologies important to an entrepreneurial endeavor. The course will include case studies and the design of technology in a new venture.

COMP 056 The World Wide Web: What, How & Why (3).
Explore, use, and ponder World Wide Web. Include strong skills development components: critical thinking, frequent writing and presentation of information in multiple on-line forms; and if sufficient background, Web programming.

COMP 060 Robotics with LEGO® (3).
Explore process of design, and nature of computers, by designing, building and programming LEGO robots. Previous programming experience is not required.

COMP 061 3D Animation with Computers-- Your Cinematic Debut (3). Hands-on exploration of computer-based three-dimensional modeling and animation. Each student will plan an animated story, model necessary objects and scenery, animate models, and at the end present an animated short.

COMP 065 Folding, From Paper to Proteins (3).
Explore the art of origami, the science of protein, and mathematics of robotics through lectures and discussions, and projects involving artistic folding, mathematical puzzles, scientific exploration, and research.

COMP 066 Random Thoughts (3).
Explores in depth notions of 'randomness' and its antithesis, 'structure.' We will collectively conduct several classic experiments to explore the nature of randomness. Computer programming skills helpful, but not required.

COMP 070 Computability, Unsolvability, and Consciousness (3).
Turing machines, their programming and universality. Unsolvability of the halting problem. Incompleteness of logical systems and its implication for human consciousness. Consequences of the laws of physics for consciousness.

COMP 101 Computers: Power Tools for the Mind (3)
The nature of computers, their capabilities, and limitations. How computers work; popular applications; problem-solving skills; algorithms and programming; potential use and abuse in society. Lectures, weekly readings, and laboratory assignments. Fall and summer. Walsh, staff. Recent Syllabus

COMP 110 Introduction to Programming (3)
Introduction to computer use. Approaches to problem-solving; algorithms and their design; fundamental programming skills. Students can only receive credit for one of COMP 110, COMP 116, or COMP 121. Fall, spring, and summer. Dewan, Hedlund, Prins, Weiss, staff. Recent Syllabus

COMP 116 Introduction to Scientific Programming (3)
Prerequisite, MATH 231. An introduction to programming for computationally oriented scientists. Fundamental programming skills, using MATLAB and another imperative programming language (such as C). Problem analysis and algorithm design, with examples drawn from simple numerical and discrete problems. Students can only receive credit for one of COMP 110, COMP 116, or COMP 121. Fall. Snoeyink, Prins. Recent Syllabus

COMP 121 Introduction to Functional Programming (3)
An introduction to programming in the functional programming style, e.g., using a dialect of LISP. A brief introduction to an imperative language such as Pascal. A first course for prospective majors or students with some programming background. Students can only receive credit for one of COMP 110, COMP 116, or COMP 121. On demand. Staff.

COMP 371 Language and Computers (LING 301) (3)
Prerequisite, LING 101. Uses simple linguistic problems to introduce students to the use of programming languages especially suited to analyze and process natural language on the computer. No prior programming knowledge is presupposed. Fall. Webelhuth.

COMP 380 Computers and Society (3)
Cultural, social, philosophical, technological, and economic effects of information technology on individuals, groups, and society. Risks and controversies. Ethics of technology and computer use. Spring and summer. Nicolas, staff.

COMP 381 Computers and Technology for Society (3)
Overview of the impact of computers and technology on society’s institutions, beliefs, values, tastes, activities, ideals, paradigms, and processes. Programming knowledge assumed, permitting topics beyond COMP 380.

COMP 392 Practicum (1-3)
Prerequisites, Computer Science Major Permission of Instructor. Work experience in non-elementary computer science. Pass or fail grade depends on a substantial written report by student and evaluation by employer. May be repeated for up to six credits. Jeffay.

COMP 393 Internship (3)
Permission of the director of undergraduate studies. Computer science majors only. Practical extension of computer science knowledge through industrial work experience.

COMP 396 Independent Study in Computer Science (1 - 3)
For advanced majors in Computer Science or Computer Science track of Math Sciences or Computer Engineering track of Applied Sciences who wish to conduct an independent study or research project with a faculty supervisor. May be taken repeatedly for up to a total of 6 credit hours. Staff.

Upper-Level Undergraduate Courses
(graduate credit may be allowed)

Note: COMP 110 (or 116, or 121), 401, 410, and 411 constitute an undergraduate core which must be completed before most other upper level COMP courses can be taken.

COMP 401 Foundation of Programming (4).
Prerequisite, a course in COMP 110-129. Advanced programming. Program specifications, preconditions, postconditions, loop invariants. Linear data structures, searching, and sorting. Algorithm paradigms and analysis. Fall and spring. Dewan, Weiss.

COMP 410 Data Structures (3).
Prerequisite, COMP 401. The analysis of data structures and their associated algorithms. Abstract data types, lists, stacks, queues, trees, and graphs. Sorting, searching, hashing. Fall and spring. Hedlund, staff.

COMP 411 Computer Organization (3).
Prerequisite, COMP 401. Digital logic, circuit components. Data representation, computer architecture and implementation, assembly language programming. Fall and spring. Bishop, Fuchs.

COMP 416 Introduction to WWW Programming (3).
Prerequisite, COMP 401 or equivalent experience. Client-side programming in Java for the WWW. Introduction to TCP/IP, HTTP, and WWW architecture. Emphasis on applet programming and component programming using threads, simple client-server applications, and XML. Fall. J. Smith, Mayer-Patel, Dewan.

COMP 426 Advanced WWW Programming (3).
Prerequisite, COMP 416. Server-side programming in Java for the WWW. Emphasis on servlet programming and distributed component programming using APIs for object serialization, remote method invocation, database connectivity, and XML generation. Spring. J. Smith, Mayer-Patel, Dewan.

COMP 431 Internet Services and Protocols (3).
Prerequisites, COMP 410, 411. Application-level protocols HTTP, SMTP, FTP, transport protocols TCP and UDP, and the network-level protocol IP. Internet architecture, naming, addressing, routing, and DNS. Sockets programming. Physical-layer technologies, Ethernet, ATM, and wireless. Spring. Jeffay, F. D. Smith.

COMP 455 Models of Languages and Computation (3).
Prerequisites, MATH 381 or other evidence of mathematical maturity, and COMP 110 or equivalent experience. Introduction to the theory of computation. Finite automata, regular languages, pushdown automata, context-free languages, and Turing machines. Undecidable problems. Spring. Anderson, Halton, Plaisted, Weiss, Snoeyink, Prins.

COMP 485 Natural Language Processing (INLS 510) (3).
Prerequisite, COMP 110, 116 or 121. See course listings for School of Information and Library Science.

COMP 486 Applications of Natural Language Processing (INLS 512) (3).
Prerequisite, COMP 110, 116, or 121, or graduate standing in Information and Library Science. See course listings for School of Information and Library Science.

COMP 487 Information Retrieval (INLS 509) (3).
Prerequisite, INLS 261, COMP 110, or COMP 121. See course listings for School of Information and Library Science.

COMP 520 Compilers (3).
Prerequisites, COMP 410, 411. Design and construction of compilers. Theory and pragmatics of lexical, syntactic, and semantic analysis. Interpretation. Code generation for a modern architecture. Runtime environments. Includes a large compiler implementation project. Fall. (Alternate years.) Prins.

COMP 521 Files and Databases (3)
Prerequisites, COMP 410, 411, MATH 381. Placement of data on secondary storage. File organization. Database history, practice, major models, system structure, and design. Fall. Stotts, Weiss.

COMP 523 Software Engineering Laboratory (3)
Prerequisites, COMP 410, 411. Organization and scheduling of software engineering projects, structured programming, and design. Each team designs, codes, and debugs program components and synthesizes them into a tested, documented program product. Spring. Stotts.

COMP 524 Programming Language Concepts (3)
Prerequisite, COMP 410. Concepts of high-level programming and their realization in specific languages. Data types, scope, control structures, procedural abstraction, classes, concurrency. Run-time implementation. Spring. Staff.

COMP 530 Operating Systems (3)
Prerequisites, COMP 410, 411. Types of operating systems. Concurrent programming. Management of storage, processes, devices. Scheduling, protection. Case study. Students implement significant components of a small operating system. Fall. (Alternate years.) Jeffay.

COMP 541 Digital Logic and Computer Design (4)

Prerequisite, COMP 411. This course is an introduction to digital logic as well as the structure and electronic design of modern processors. Students will implement a working computer during the laboratory sessions. Spring. Lastra, Singh, McMillan, Bishop.

COMP 550 Algorithms and Analysis (3)

Prerequisites, MATH 381 and COMP 410. Formal specification and verification of programs. Techniques of algorithm analysis. Problem-solving paradigms. Survey of selected algorithms. Fall and spring. Anderson, Hedlund, Lin, Manocha, Plaisted.

COMP 575 Introduction to Computer Graphics (3)
Prerequisites, COMP 410, MATH 547. Hardware, software, and algorithms for computer graphics. Scan conversion, 2D and 3D transformations, object hierarchies. Hidden surface removal, clipping, shading, and antialiasing. Not for graduate computer science credit. Fall. Staff.

COMP 580 Enabling Technologies (3)
Prerequisites, COMP 411 (for CS majors), none (for non majors). We will investigate ways computer technology can be used to mitigate the effects of disabilities and the sometimes surprising response of those we intended to help. This course is accessible to both majors and non­majors. This is an approved APPLES service learning course.

COMP 590 Topics in Computer Science (1-3)
Prerequisite, permission of the instructor. This course has variable content and may be taken multiple times for credit. Fall and spring. Staff.

Graduate Courses

COMP 631 Computer Networks (3)
Prerequisites, COMP 431, COMP 530, knowledge of probability and statistics (alternatively, STOR 435), or permission of the instructor. Traditional topics in computer networks, including link layer protocols, switching, IP, TCP, and congestion control. Additional topics may include peer-to-peer infrastructures, network security, and multimedia applications. Fall. Kaur, Jeffay, F. D. Smith, Mayer-Patel, Papadopouli.

COMP 633 Parallel and Distributed Computing (3)
Prerequisites, COMP 530, 550. Principles and practices of parallel and distributed computing. Models of computation. Concurrent programming languages and systems. Architectures. Algorithms and applications. Practicum. Spring. Prins.

COMP 651 Computational Geometry (3)

Prerequisite, undergraduate analysis of algorithms course (e.g., COMP 550) or permission of instructor. Design and analysis of algorithms and data structures for geometric problems. Applications in graphics, CAD/CAM, robotics, GIS, and molecular biology. Fall. (Odd years.) Snoeyink, Lin.

COMP 662 Scientific Computation (MATH 662) (ENVR 662) (3)

Direct methods for linear systems. Least squares problems. Iterative methods for linear systems. Direct and iterative methods for eigenvalue problems. The singular value decomposition. Methods for (stiff) systems of ODEs. Spring. Staff.

COMP 665 Images, Graphics and Vision (3)

Prerequisites, COMP 410, MATH 383. Display devices and procedures. Scan conversion. Matrix algebra supporting viewing transformations in computer graphics. Basic differential geometry. Coordinate systems, Fourier analysis, FDFT algorithm. Human visual system, psychophysics, scale in vision. Fall. Pizer, Bishop, Brooks.

COMP 715 Visualization in the Sciences (MTSC 715) (PHYS 715) (3)

Computational visualization applied in the natural sciences. For both computer science and natural science students. Available techniques and their characteristics, based on human perception, using software visualization toolkits. Project course. Spring. Taylor.

COMP 720 Compilers (3)

Prerequisites, COMP 455, 520, 524,. Tools and techniques of compiler construction. Lexical, syntactic, and semantic analysis. Emphasis on code generation and optimization. (Alternate years.) Prins.

COMP 721 Database Management Systems (3)
Prerequisites, COMP 521, 550. Database management systems, implementation, and theory. Query languages, query optimization, security, advanced physical storage methods and their analysis. (On demand.) Staff.

COMP 723 Software Design and Implementation (3)
Prerequisites, COMP 524, 550. Principles and practices of software engineering. Object-oriented and functional approaches. Formal specification, implementation, verification, and testing. Software design patterns. Practicum. Fall. Stotts, Dewan.

COMP 724 Programming Languages (3)

Prerequisites, COMP 455, 520, 524. Selected topics in the design and implementation of modern programming languages. Formal semantics. Type theory. Inheritance. Design of virtual machines. Garbage collection. Principles of restructuring compilers. (On demand.) Prins.

COMP 730 Operating Systems (3)
Prerequisite, COMP 530. Theory, structuring, and design of operating systems. Sequential and cooperating processes. Single processor, multiprocessor, and distributed operating systems. Spring. Dewan, Jeffay, F. D. Smith, Mayer-Patel.

COMP 734 Distributed Systems (3)
Prerequisite, COMP 431 or permission of instructor. Design and implementation of distributed computing systems and services. Inter-process communication and protocols; naming and name resolution; security and authentication; scalability; high availability; replication; transactions; group communications; distributed storage systems. Fall. Dewan, Jeffay, F. D. Smith.

COMP 735 Distributed and Concurrent Algorithms (3)
Prerequisites, COMP 633, 723. Verification of concurrent systems. Synchronization; mutual exclusion and related problems, barriers, rendezvous, nonblocking algorithms. Fault tolerance: consensus, Byzantine agreement, self-stabilization. Broadcast algorithms. Termination and deadlock detection. Clock synchronization. (Alternate years.) Anderson.

COMP 737 Real-time Systems (3)
Prerequisite, COMP 530. Taxonomy and evolution of real-time systems. Timing constraints. Design, implementation, and analysis of real-time systems. Theory of deterministic scheduling and resource allocation. Case studies and project. Spring. (Alternate years.) Jeffay, Anderson, Baruah.

COMP 740 Computer Architecture and Implementation (3)
Prerequisites, COMP 411, PHYS 352. Architecture and implementation of modern single-processor computer systems. Performance measurement. Instruction set design. Pipelining. Instruction-level parallelism. Memory hierarchy. I/O system. Floating-point arithmetic. Case studies. Practicum. Fall. Bishop.

COMP 741 Elements of Hardware Systems (3)

Prerequisite, COMP 411. Issues and practice of information processing hardware systems for computer scientists with little or no previous hardware background. System thinking, evaluating technology alternatives, basics of electronics, signals, sensors, noise and measurements. Spring. Bishop, Vicci.

COMP 744 VLSI Systems Design (3)

Prerequisites, COMP 740, knowledge of digital logic techniques. Introduction to the design, implementation and realization of very large-scale integrated systems. Each student designs a complete digital circuit that will be fabricated and returned for testing and use. Spring. Hedlund.

COMP 750 Algorithm Analysis (3)
Prerequisites, COMP 455, 550. Algorithm complexity. Lower bounds. The classes P, NP, PSPACE, and co-NP; hard and complete problems. Pseudo-polynomial time algorithms. Advanced data structures. Graph-theoretic, number-theoretic, probabilistic, and approximation algorithms. Fall. Anderson, Plaisted, Baruah, Snoeyink.

COMP 752 Mechanized Mathematical Inference (3)
Prerequisite, COMP 825. Propositional calculus. Semantic tableaux. Davis-Putnam algorithm. Natural deduction. First-order logic. Completeness. Resolution. Problem representation. Abstraction. Equational systems and term rewriting. Specialized decision procedures. Nonresolution methods. (On demand.) Plaisted.

COMP 758 Information Theory (STOR 252] (3)


COMP 759 Error Correcting Codes (STOR 253) (3)


COMP 761 Introductory Computer Graphics (1)


COMP 762 Discrete Event Simulation (STOR 762) (3)
See course listings for Department of Statistics and Operations Research.

COMP 763 Semantics and Program Correctness (3)

Prerequisite, COMP 724. Formal characterization of programs. Denotational semantics and fixed-point theories. Proof of program correctness and termination. Algebraic theories of abstract data types. Selected topics in the formalization of concurrent computation. (On demand.) Staff.

COMP 764 Monte Carlo Method (3)

Prerequisites, MATH 233, 416, 418, STOR 435, COMP 110, or consent of the instructor. Relevant probability and statistics. General history. Variance reduction for sums and integrals. Solving linear and nonlinear equations. Random, pseudorandom generators; random trees. Sequential methods. Applications. (On demand.) Halton.

COMP 766 Visual Solid Shape (3)

Prerequisites, MATH 233, 416. 3D differential geometry; local and global shape properties; visual aspects of surface shape. Taught largely through models and figures. Applicable to graphics, computer vision, human vision, and biology. Fall. (Alternate years.) Pizer.

COMP 767 Geometric and Solid Modeling (3)

Prerequisites, COMP 575 or 770, and MATH 661. Curve and surface representations. Solid models. Constructive solid geometry and boundary representations. Robust and error-free geometric computations. Modeling with algebraic constraints. Applications to graphics, vision, and robotics. (Alternate years.) Manocha.

COMP 768 Physically Based Modeling and Simulation (3)
Prerequisites, COMP 665, or permission of the instructor. Geometric algorithms, computational methods, simulation techniques for modeling based on mechanics and its applications. (Alternate years.) Lin.

COMP 770 Computer Graphics (3)
Prerequisites, COMP 665, 761. Study of graphics hardware, software, and applications. Data structures, graphics, languages, curve surface and solid representations, mapping, ray tracing and radiosity. Spring. Bishop, Brooks, Fuchs, Lin, Manocha.

COMP 775 Medical Image Analysis (BMME 775) (3)
Prerequisites, MATH 547, STOR 435 and ability to program in Matlab. Approaches to analysis of digital images. Scale geometry, statistical pattern recognition, optimization. Segmentation, registration, shape analysis. Applications, software tools. Spring. Gerig, Pizer.

COMP 776 Computer Vision in our 3D World (3)
Prerequisites, MATH 416, 566, COMP 550, 665, 775, or permission of the instructor. Fundamental problems of computer vision. Projective geometry. Camera models, camera calibration. Shape from stereo, epipolar geometry. Photometric stereo. Optical flow, tracking, motion. Range finders, structured light. Object recognition. Fall. (Odd years.) Gerig, Welch.

COMP 785 Neural Networks (PSYC 291) (3)

COMP 787 Visual Perception (3)

Prerequisites, COMP 665 (vision segment), PSYC 730, or equivalent. Surveys form, motion, depth, scale, color, brightness, texture, and shape perception. Includes computational modeling of vision, experimental methods in visual psychophysics and neurobiology, recent research, and open questions. Fall. (Alternate years.) Pizer.

COMP 788 Expert Systems (3)
Prerequisite, COMP 750. Languages for knowledge engineering. Rules, semantic nets, and frames. Knowledge acquisition. Default logics. Uncertainties. Neural networks. (On demand.) Plaisted.

COMP 790 Topics in Computer Science (1-3)
Prerequisite, permission of the instructor. This course has variable content and may be taken multiple times for credit. Fall and spring. Staff.

COMP 822 Topics in Discrete Optimization (STOR 822) (3)
See course listings for Department of Statistics and Operations Research.

COMP 824 Functional Programming (3)
Prerequisite, COMP 524. Programming with functional or applicative languages. Lambda calculus; combinators; higher-order functions; infinite objects. Least fixed points, semantics, evaluation orders. Sequential and parallel execution models. (On demand.) Prins, Plaisted.

COMP 825 Logic Programming (3)
Prerequisite, COMP 524. Propositional calculus, Horn clauses, first-order logic, resolution. Prolog: operational semantics, relationship to resolution, denotational semantics, and non-logical features. Programming and applications. Selected advanced topics. (On demand.) Plaisted.

COMP 831 Internet Architecture and Performance (3)

Prerequisite, COMP 431 or permission of instructor. Internet structure and architecture; traffic characterization and analysis; errors and error recovery; congestion and congestion control; services and their implementations; unicast and multicast routing. Spring. (Alternate years.) Jeffay, F. D. Smith, Mayer-Patel.

COMP 832 Multimedia Networking (3)
Prerequisites, COMP 431 and 530. Audio/video coding and compression techniques and standards. Media streaming and adaptation. Multicast routing, congestion and error control. Internet protocols RSVP, RTP/RTCP. Integrated and differentiated services architecture for the Internet. Jeffay, Mayer-Patel.

COMP 841 Advanced Computer Architecture (3)
Prerequisite, COMP 740. Concepts and evolution of computer architecture, machine language syntax and semantics; data representation; naming and addressing; arithmetic; control structures; concurrency; input-output systems and devices. Milestone architectures. (Alternate years.) Brooks.

COMP 842 Advanced Computer Implementation (3)

Prerequisites, COMP 740, knowledge of digital logic techniques. The application of digital logic to the design of computer hardware. Storage and switching technologies. Mechanisms for addressing, arithmetic, logic, input/output, and storage. Microprogrammed and hard-wired control. (On demand.) Staff.

COMP 844 Advanced Design of VLSI Systems (3)
Prerequisite, COMP 744. Advanced topics in the design of digital MOS systems. Students design, implement, and test a large custom integrated circuit. Projects emphasize the use of advanced computer-aided design tools. (Alternate years.) Staff.

COMP 850 Advanced Analysis of Algorithms (3)
Prerequisite, COMP 750. Design and analysis of computer algorithms. Time and space complexity; absolute and asymptotic optimality. Algorithms for searching, sorting, sets, graphs, and pattern-matching. NP-complete problems and provably intractable problems. (Alternate years.) Staff.

COMP 870 Advanced Image Synthesis (3)
Prerequisite, COMP 770. Advanced topics in rendering, including global illumination, surface models, shadings, graphics hardware, image-based rendering, and antialiasing techniques. Topics from the current research literature. Fall. (Alternate years.) Lastra.

COMP 872 Exploring Virtual Worlds (3)

Prerequisite, COMP 870. Project course, lecture, and seminar on real-time interactive 3D graphics systems in which the user is “immersed” in and interacts with a simulated 3D environment. Hardware, modeling, applications, multi-user systems. (Alternate years.) Fuchs, Brooks.

COMP 875 Recent Advances in Image Analysis (3)

Prerequisite, COMP 775. Lecture and seminar on recent advances in image segmentation, registration, pattern recognition, display, restoration, and enhancement. Spring. (Even-numbered years.) Pizer, Gerig.

COMP 892 Practicum (0.5)
Prerequisite, permission of instructor. Work experience in an area of computer science relevant to the student's research interests and pre-approved by the instructor. The grade, pass or fail only, will depend on a written report by the student and on a written evaluation by the employer. Staff.

COMP 910 Computer Science Module (var)


COMP 911 Professional Writing in Computer Science (3)

Prerequisite, graduate major in computer science. Analysis of good and bad writing. Exercises in organization and composition. Each student also writes a thesis-quality short technical report on a previously approved project. Fall and spring. Halton, J. B. Smith, Snoeyink, Weiss.

COMP 915 Technical Communication in Computer Science (1)
Prerequisite, graduate major in computer science or permission of instructor. Seminar on teaching, short oral presentations, and writing in computer science. Spring. Weiss, Brooks.

COMP 916 Seminar in Professional Practice (1)

Prerequisite, satisfaction of MS Computer Science program product requirement. The role and responsibilities of the computer scientist in a corporate environment, as an entrepreneur, and as a consultant. Professional ethics. (Alternate years.) Brooks.

COMP 917 Seminar in Research (1)

Prerequisite, graduate major in computer science. The purposes, strategies, and techniques for conducting research in computer science and related disciplines. (On demand.) Staff.

COMP 918 Research Administration for Scientists (1)
Prerequisite, graduate status. Introduction to grantsmanship, research grants and contracts, intellectual property, technology transfer, conflict of interest policies. Course project: grant application in NSF FastLane. Spring. Quigg.

COMP 980 Computers and Society (1)

Prerequisite, graduate major in computer science. Seminar on social and economic effects of computers on such matters as privacy, employment, power shifts, rigidity, dehumanization, dependence, quality of life. (On demand.) Staff.

COMP 990 Research Seminar in Computer Science (0.5-3)

Prerequisite, permission of the instructor. Seminars in various topics offered by members of the faculty. Fall and spring. Staff.

COMP 991 Reading and Research (1-3)
Prerequisite, permission of the instructor. Directed reading and research in selected advanced topics. Fall and spring. Staff.

COMP 993 Master's Thesis (Var.)

Prerequisite, permission of staff. Fall and spring. Staff.

COMP 994 Doctoral Dissertation (Var.)

Prerequisite, permission of staff. Fall and spring. Staff.

Horizontal Line
Department of Computer Science
Campus Box 3175, Sitterson Hall
College of Arts & Sciences
The University of North Carolina at Chapel Hill
Chapel Hill, NC 27599-3175 USA
Phone: (919) 962-1700
Fax: (919) 962-1799
Content Manager: Associate Chairman for Academic Affairs
Server Manager: webmaster@cs.unc.edu
Last Content Review: 19 September 2008