Computer Science - Undergraduate Courses

CMPS 002: Computer Literacy. F,S

Introduction to how computers work and how to use them. Topics covered include network information systems, text editors, formatting, file and directory system, spreadsheets and databases. Computers as symbol manipulation devices. Introduction to programming concepts and computer languages. Impact of computers on society. Designed for students with little or no experience using computers. Preference is given to students who have not taken other computer engineering or computer science courses. Students cannot receive credit for this course and Computer Engineering 3. (General Education Code(s): IN.) P. Franca

CMPS 010: Introduction to Computer Science. F,W

An overview of the theory, foundations, and practice of computer science with emphasis on what computers can and cannot do, now and in the future. Topics include algorithms and data, correctness and efficiency of algorithms, hardware, programming languages, limitations of computation, applications, and social issues. No programming skills are required as a prerequisite. Major concepts and open problems in computer science are presented without reliance on sophisticated mathematical tools. (General Education Code(s): IN.) P. Tantalo

CMPS 012A: Introduction to Programming. F,W,S

An introductory programming course for computer science and engineering majors where students learn programming and documentation skills, as well as algorithmic problem solving and programming methodologies. Introduces students to computers, compilers, and editors, and they are expected to write medium-sized programs. Topics include, but are not limited to, procedures and functions, conditionals and loop control structures, static and dynamic memory manipulations, and text processing. Prior experience with Unix helpful, and some prior programming experience strongly recommended (e.g., course 10). This course is required for computer engineering, computer science, electrical engineering, and information systems management majors. Prerequisite(s): eligibility to enroll in Mathematics 19A (Mathematics 2B or 3 or 40 or higher on mathematics placement exam) or completion of Mathematics 11A or 19A or Economics 11A or AMS 3 or 11A. Concurrent enrollment in 12L required. (General Education Code(s): IN.) The Staff, D. Bailey, P. Tantalo, C. Flanagan, C. McDowell

CMPS 012B: Introduction to Data Structures. F,W,S

Teaches students to implement common data structures and the algorithms associated with each data structure, through progressively difficult exercises. Topics include big "O" notation; pointers, recursion (induction), and dynamic allocation; linked lists and list processing; stacks, queues, binary trees and binary search trees; simple sorting techniques and simple search techniques. Students will gain a working knowledge of the elements of the Java and C programming languages. Prior experience with Unix is assumed. Prerequisite(s): course 12A. Concurrent enrollment in course 12M required. Enrollment limited to 150. (General Education Code(s): IN.) W. Mackey

CMPS 012L: Computer Programming Laboratory (2 credits).F,W,S

Laboratory sequence complementing topics taught in course 12A by providing training and exposure to several software development tools and practices not covered in course 12A. In addition, the lab provides an initial exposure to a second programming language to reinforce concepts from course 12A. Prerequisite(s): eligibility to enroll in Mathematics 19A (Mathematics 2B or 3 or 40 or higher on mathematics placement exam) or completion of Mathematics 11A or 19A or Economics 11A or AMS 3 or 11A. Previous or concurrent enrollment in 12A required. The Staff, D. Bailey, P. Tantalo, C. Flanagan, C. McDowell

CMPS 012M: Data Structures Laboratory (2 credits).F,W,S

Complements course 12B, gaining additional competence with a number of important software development tools, languages, and techniques. Included are advanced Unix features and utilities such as grep, find, diff, the shell, and pipes; C programs utilizing I/O, arrays, pointers, and structures; a scripting language to perform simple text and file manipulation; and the make utility. Prerequisite(s): courses 12A and 12L. Concurrent enrollment in course 12B required. W. Mackey

CMPS 013H: Introduction to Programming and Data Structures (Honors). *

Provides an accelerated introduction to programming and data structures. Includes a review of basic programming, including loop and conditional control structures, procedures and parameter passing, and arrays. Course goes on to cover same material as course 12B. Students cannot receive credit for this course and course 12A or 12B. Prerequisite(s): interview only; students must have completed a high school or college level programming course in Java, C, or C++. A short oral examination given to ascertain programming level. Concurrent enrollment in course 13L required. Enrollment limited to 25. (General Education Code(s): IN.) S. Brandt, D. Long

CMPS 013L: Introduction to Programming and Data Structures Laboratory (2 credits).*

Provides accelerated introduction to practical aspects of programming and data structures. Covers three areas: 1) common programming tools, including Unix commands, compilers and linkers, editors, debuggers, and Makefiles; 2) basic programming techniques, including design, testing, and debugging; and 3) C programming, focusing on the major differences between C and Java. Previous or concurrent enrollment in course 13H required. Prerequisite(s): interview only; students must have completed a high school or college level programming course in Java, C, or C++. A short oral examination given to ascertain programming level. S. Brandt, D. Long

CMPS 020: Game Design Experience. W

Surveys history, technology, narrative, ethics, and design of interactive computer games. Covers the interplay of narrative, graphics, rule systems, and artificial intelligence in the creation of interactive games. Intended as an introduction to computer game design with a game programming focus for computer game design majors. Students cannot receive credit for this course and course 80K. Prerequisite(s): course 12A, or equivalent programming experience and permission of instructor. E. Whitehead, M. Mateas

CMPS 060G: Beginning Programming: Social Sciences and Humanities. F,W

An introduction to the basic techniques of computer programming. Detailed study of one programming language. Extensive practice using a computer, particularly personal computers, to solve problems. Course 60G is intended for social sciences and humanities students. Students can only receive credit for either 60G or 60N. Students cannot receive credit for course 60G if taken concurrently with or subsequently to course 12A. (General Education Code(s): IN.) P. Franca

CMPS 060M: Scientific Computation with Matlab and Maple. S

Basic concepts from calculus visualized using Matlab and Maple; plotting data and functions, integration, differentiation, limits; solving systems of equation; linear regression; and example applications from science and engineering. Prerequisite(s): Mathematics 19B, or 20B, or by consent of instructor. Enrollment limited to 60. M. Warmuth

CMPS 060N: Beginning Programming: Natural Sciences. S

An introduction to the basic techniques of computer programming. Detailed study of one programming language. Extensive practice using a computer to solve problems. Course 60N is intended for science students. Students can only receive credit for either 60G or 60N. Students cannot receive credit for course 60N if taken concurrently with or subsequently to course 12A. (General Education Code(s): IN.) D. Bailey, W. Tan

CMPS 080B: Systems and Simulation. F

An introduction to systems analysis as an approach to understanding and solving complex problems. The use of simulation as an aid in this problem solving. Examples are taken from ecology, economics, physics, computer science, and other fields. Intended as a generally accessible undergraduate course in which students can develop and explore computer simulation models matched to their individual interests. (General Education Code(s): T2-Natural Sciences, Q.) R. Levinson

CMPS 080C: Computer Arts and Graphics. *

Covers the design and use of various computer graphics programs for painting, drawing, computer-aided design, modeling, and animation. Students create graphical images using available software and design programs. Exposure to peripherals such as mice, laser printers, and possibly video and experimental peripherals. Use of SGI graphics workstations. Includes discussion of computer art and its development over time, and includes slides and videos of computer graphics. Not intended for computer science or computer engineering majors, who are advised to take course 160. (General Education Code(s): T2-Natural Sciences.) S. Lodha

CMPS 080G: Introduction to Unix. S

Introduction to computing, the Internet, and the World Wide Web through the language of the Unix operating system. Oriented to the beginner, the course presupposes no previous acquaintance with any particular sort of computer. It covers the basic concepts of text editing and formatting, writing Web pages in basic HTML, and promotes a rigorous understanding of Unix commands and shell scripts. Views communication with a computer as a matter of learning a few simple though powerful languages. (Also offered as Linguistics 80G. Students cannot receive credit for both courses.) (General Education Code(s): T2-Natural Sciences.) A. Van Gelder

CMPS 080J: Technology Targeted at Social Issues. S

Introduces the idea that engineering can be a means for addressing social issues. Case studies and guest speakers. Issues might include: economic development, privacy, activism, safe drinking water, inexpensive shelters, sustainable energy, education, and waste disposal. (General Education Code(s): T7-Natural Sciences or Social Sciences.) S. Lodha, J. Davis

CMPS 080K: Foundations of Interactive Game Design. W

Surveys history, technology, narrative, ethics, and design of interactive computer games. Work in teams to develop novel game-design storyboards. Intended as a generally accessible undergraduate course in which students can explore the interplay of narrative, graphics, rule systems, and artificial intelligence in the creation of interactive games. Programming experience not required. Students cannot receive credit for this course and course 20. Enrollment limited to 150. (General Education Code(s): T2-Natural Sciences.) E. Whitehead

CMPS 080S: From Software Innovation to Social Entrepreneurship. F

Emerging software innovations with emphasis on social software. Web 2.0 companies and services. Software that has social impact in a global context. Entrepreneurial plan including social, economic, and innovation value. Final group project on innovative software design and entrepreneurship plan. (General Education Code(s): T7-Natural Sciences or Social Sciences, E.) S. Lodha

CMPS 080V: VRML 3D Worlds on the Web. *

This hands-on course covers authoring and publishing 3D virtual worlds on the web. Focus is on tools and techniques for adding new dimensions to online publications including 3D worlds, sound, animation, and interactions. Topics are updated as technology changes. Representative topics have included VRML, HTML, XML, X3D, U3D, Acrobat, etc. Introduces students to concepts in 3D graphics, transformations, and animation through lectures, individual/group laboratory exercises, and a final project. Students must know how to use e-mail, a text editor, and a web browser. Enrollment limited to 80. (General Education Code(s): T2-Natural Sciences.) A. Pang

CMPS 094: Group Tutorial. F,W,S

Provides a means for a small group of students to study a particular topic in consultation with a faculty sponsor. Students submit petition to sponsoring agency. May be repeated for credit. The Staff

CMPS 094F: Group Tutorial (2 credits).F,W,S

Provides a means for a small group of students to study a particular topic in consultation with a faculty sponsor. Students submit petition to sponsoring agency. May be repeated for credit. The Staff

CMPS 099: Tutorial. F,W,S

Students submit petition to sponsoring agency. May be repeated for credit. The Staff

CMPS 099F: Tutorial (2 credits).F,W,S

Students submit petition to sponsoring agency. May be repeated for credit. The Staff

CMPS 101: Algorithms and Abstract Data Types. F,S

Studies basic algorithms and their relationships to common abstract data types. Covers the notions of abstract data types and the distinction between an abstract data type and an implementation of that data type. The complexity analysis of common algorithms using asymptotic (big "O") notation is emphasized. Topics include sorting and searching techniques, basic graph algorithms, and algorithm design techniques. Abstract data types covered include priority queues, dictionaries, disjoint sets, heaps, balanced trees, and hashing. Familiarity with C, Java, and Unix is assumed. Prerequisite(s): course 12B or 13H, Computer Engineering 16 or 16H, Mathematics 19B, and one course from the following: Mathematics 21, 22, 23A, 24, or Applied Mathematics and Statistics 27. Enrollment restricted to School of Engineering majors. P. Tantalo, A. Van Gelder

CMPS 102: Introduction to Analysis of Algorithms. W

Methods for the systematic construction and mathematical analysis of algorithms. Order notation, the RAM model of computation, lower bounds, and recurrence relations are covered. The algorithm design techniques include divide-and-conquer, branch and bound, and dynamic programming. Applications to combinatorial, graph, string, and geometric algorithms. Prerequisite(s): course 101. M. Warmuth, A. Van Gelder, S. Lodha, D. Helmbold, D. Achlioptas

CMPS 104A: Fundamentals of Compiler Design I. F

An introduction to the basic techniques used in compiler design. Topics include compiler structure, symbol tables, regular expressions and languages, finite automata, lexical analysis, context-free languages, LL(1), recursive descent, LALR(1), and LR(1) parsing; and attribute grammars as a model of syntax-directed translation. Students use compiler building tools to construct a working compiler. Prerequisite(s): course 101 and Computer Engineering 12 and 12L. W. Mackey

CMPS 104B: Fundamentals of Compiler Design II. S

A detailed study of the structure and design of a compiler. Continues study begun in course 104A. Topics include compiler structure emphasizing the back end, type systems, run-time environments; static, stack and heap storage management, garbage collection; addressing, register allocation, code generation; basic blocks and data-flow analysis; local and global code optimization; interpretation versus compilation. Students generate machine code runnable on a real machine. Prerequisite(s): course 104A. W. Mackey

CMPS 105: Systems Programming. W

Covers fundamentals of systems programming including standard tools, shell programming, file I/O, files and directories, system data files and information, Unix processes, process control, synchronization, signals, event-driven programming, terminal I/O, daemons, interprocess communication, basic network programming, and basic user-interface programming. Prerequisite(s): course 101 and Computer Engineering 12 and 12L. Enrollment restricted to School of Engineering majors. E. Miller, W. Mackey, S. Brandt, D. Long

CMPS 109: Advanced Programming. W

An introduction to object-oriented techniques of software development including data abstraction, inheritance, polymorphism, and object-oriented design. Extensive practice using a computer to solve problems, including construction of graphical user interfaces and a multithreaded client/server applications. Prerequisite(s): course 12B/M. The Staff, D. Bailey, I. Pohl, C. McDowell

CMPS 111: Introduction to Operating Systems. F,S

Fundamental principles of operating systems: process synchronization, deadlocks, memory management, resource allocation, scheduling, storage systems, and study of several operating systems. A major programming project will be required. Prerequisite(s): course 101 and Computer Engineering 110. E. Miller, W. Mackey, S. Brandt, D. Long

CMPS 112: Comparative Programming Languages. W

Covers several programming languages and compares styles, philosophy, and design principles. Principles underlying declarative, functional, and object-oriented programming styles are studied. Students write programs emphasizing each of these techniques. Prerequisite(s): course 101 or 109. W. Mackey, M. Abadi, D. Long, C. Flanagan, A. Van Gelder, C. McDowell

CMPS 115: Software Methodology. W,S

Emphasizes the characteristics of well-engineered software systems. Topics include requirements analysis and specification, design, programming, verification and validation, maintenance, and project management. Practical and research methods are studied. Imparts an understanding of the steps used to effectively develop computer software. Prerequisite(s): course 101. Enrollment restricted to computer science, computer engineering, and information systems management majors. Enrollment limited to 25. D. Bailey, E. Whitehead, C. Flanagan, L. Werner

CMPS 116: Software Design Project. S

Students in teams specify, design, construct, test, and document a complete software system in a specialized application domain. Class time is spent in technical discussions and ongoing design reviews. A formal presentation and demonstration of each project is required. An organizational meeting will be held during the preceding quarter. Projects may be drawn from industry and campus research groups. Prerequisite(s): course 115. E. Whitehead

CMPS 122: Computer Security. *

Introduction to computer security (including selected topics in network security). Access control. Security in programming languages. Basic cryptography. Security protocols. Prerequisite(s): course 111 or permission of instructor. Enrollment restricted to School of Engineering majors. Enrollment limited to 100. E. Miller, M. Abadi

CMPS 128: Distributed Systems: File Sharing, Online Gaming, and More. S

Covers topics in distributed computing including communication, naming, synchronization, consistency and replication, fault tolerance, and security. Examples drawn from peer-to-peer systems, online gaming, the World Wide Web; other systems also used to illustrate approaches to these topics. Students implement simple distributed systems over the course of the quarter. Prerequisite(s): course 101 or Computer Engineering 150. Course 111 or 105 recommended. E. Miller, S. Brandt, D. Long

CMPS 129: Data Storage Systems. *

Covers all aspects of storage systems technology from magnetic media up through system software, including principles of magnetic recording, hard drive technology and evolution, performance measurement, file systems, storage networking, disk arrays, network-attached storage, and alternative storage technologies. Prerequisite(s): course 101, 111, and Physics 5A or 6A. E. Miller, S. Brandt, D. Long

CMPS 130: Computational Models. W,S

Various representations for regular languages, context-free grammars, normal forms, parsing, pushdown automata, pumping lemmas, Turing machines, the Church-Turing thesis. Prerequisite(s): course 101. D. Bailey, M. Warmuth, R. Levinson, P. Kolaitis

CMPS 132: Computability and Computational Complexity. W

Turing machines, general phase-structure grammars, the Chomsky hierarchy, recursive functions, diagonalization, the Halting problem, computability and unsolvability, computational complexity, time and space bounds, NP-completeness with emphasis on reductions between problems from various areas. Prerequisite(s): course 130. M. Warmuth, A. Van Gelder, P. Kolaitis, D. Helmbold

CMPS 140: Artificial Intelligence. W

Introduction to the contemporary concepts and techniques of artificial intelligence, including any or all of: machine perception and inference, machine learning, optimization problems, computational methods and models of search, game playing and theorem proving. Emphasis may be on any formal method of perceiving, learning, reasoning, and problem solving which proves to be effective. This includes both symbolic and neural network approaches to artificial intelligence. Issues discussed include symbolic versus nonsymbolic methods, local versus global methods, hierarchical organization and control, and brain modeling versus engineering approaches. Lisp or Prolog may be introduced. Involves one major project or regular programming assignments. Prerequisite(s): course 101 and one of the following: course 130, Computer Engineering 177, or Mathematics 115. I. Pohl, R. Levinson

CMPS 142: Machine Learning and Data Mining. *

Introduction to machine learning algorithms and their applications. Topics include classification learning, density estimation and Bayesian learning regression, and online learning. Provides introduction to standard learning methods such as neural networks, decision trees, boosting, and nearest neighbor techniques. Prerequisite(s): course 101 and one of Applied Mathematics and Statistics 5, 7, 113, 131, or Computer Engineering 107. Enrollment limited to 50. M. Warmuth, D. Helmbold

CMPS 146: Game AI. *

Course provides a comprehensive introduction to the use of artificial intelligence (AI) in computer games. Building on fundamental principles of AI, course explains how to create non-player characters (NPCs) with progressively more sophisticated capabilities. Prerequisite(s): course 140; familiarity with C++. Enrollment restricted to juniors, seniors, and graduate students. Enrollment limited to 20. The Staff

CMPS 148: Interactive Narrative. S

Covers wide range of practices including hypertext, interactive fiction, embedded narratives in games, interactive drama, and artificial intelligence-based story generation. Through a mixture of readings, assignments, and project work, explores the theoretical positions, debates, and technical and design issues arising from these different approaches. Students may not receive credit for this course and course 248. Prerequisite(s): course 101 Enrollment limited to 40. M. Mateas

CMPS 160: Introduction to Computer Graphics. F

Introduces different techniques of modeling, transformation, and rendering to obtain computer generated imagery. Topics include 2D and 3D graphical primitives, line drawings, curves and surface modeling, projections, matrix composition, hidden surface removal, and shading algorithms. Several intensive programming assignments on bit-mapped raster scan displays and a major programming project are required. Prerequisite(s): course 101 and Mathematics 21 or Applied Mathematics and Statistics 27. Concurrent enrollment in course 160L required. Enrollment limited to 35. A. Pang, S. Lodha, J. Davis

CMPS 160L: Introduction to Computer Graphics Laboratory (2 credits).F

Complements course 160, gaining additional competence with a number of important software development tools, graphics libraries, and graphical user interfaces. Included are OpenGL program, utilizing rubberbanding, picking, trackballing, display lists, double buffering, lighting, shading, materials and textures; and FLTK program, utilizing sliders, buttons, and dialog boxes. Prerequisite(s): course 101 and Mathematics 21 or Applied Math 27. Concurrent enrollment in course 160 required. Enrollment restricted to all engineering majors. Enrollment limited to 35. A. Pang, S. Lodha, J. Davis

CMPS 161: Visualization and Computer Animation. W

Introduction to standard techniques of computer animation and data visualization. Topics include mathematical foundations; creature and behavioral animation; scalar, vector and tensor visualization methods. Involves programming exercises, instruction in available software, and a project. Prerequisite(s): course 160 and 160L or equivalent. Enrollment restricted to students majoring in computer sciences, computer engineering, or electrical engineering. Concurrent enrollment in course 161L required. Enrollment limited to 35. A. Pang, S. Lodha

CMPS 161L: Visualization and Computer Animation Laboratory (2 credits).W

Complements course 161, gaining additional competence with a number of important software development tools and techniques. Included are Visualization Toolkit (vtk) and Insight Toolkit (ITK); C, OpenGL, and FLTK programs utilizing visualization techniques of isosurfacing, transfer function, volumetric rendering, streamlines visualization; video capture for facial animation and pose estimation, group and behavioral animations. Prerequisite(s): courses 160 and 160L; concurrent enrollment in course 161 required. Enrollment restricted to all engineering majors. Enrollment limited to 35. A. Pang, S. Lodha

CMPS 164: Game Engines. F

Covers the graphic elements in computer games. Topics include modifying, optimizing, adding components, and building a game engine. Course evaluation based on exams and several programming projects, including a game built using the student's game engine. Prerequisite(s): courses 160 and 160L. Concurrent enrollment in course 164L required. A. Pang

CMPS 164L: Game Engines Lab (2 credits).F

Provides hands-on experience in using, designing, and building game engines. Students also explore different special effects, such as particle systems, spring systems, and game physics. Prerequisite(s): courses 160 and 160L. Concurrent enrollment in course 164 required. A. Pang

CMPS 170: Game Design Studio I. F

First of a three-course capstone sequence for the computer game design program. Students work in teams to develop a comprehensive game design for a substantial computer game, including detailed storyline, level design, artistic approach, implementation technologies, and art-asset pipeline. Emphasis placed on creating novel, artistic game design concepts. Includes design reviews and formal presentations. Companion lectures cover advanced topics in game design, game programming, and software project management. Enrollment restricted to senior computer game design majors. Enrollment limited to 50. E. Whitehead, M. Mateas

CMPS 171: Games Design Studio II. W

Second of a three-course capstone sequence for the computer game design program. Students work in teams on the software design, implementation, and testing of the computer game designed in course 170. Includes design reviews, progress reviews, and formal presentations. Companion lectures cover topics in software engineering, including design, testing, and project management. Game design and game programming also covered. Enrollment restricted to senior computer game design majors. Enrollment limited to 50. E. Whitehead, M. Mateas

CMPS 172: Game Design Studio III. S

Third of a three-course capstone sequence for the computer game design program. Students work in teams on the software design, implementation and testing of the computer game designed in courses 170 and 171. Includes progress reviews and formal presentations. Companion lectures cover topics in software engineering, including user and software testing, release engineering and project management; also covered are game design and game programming. Prerequisite(s): course 171. Enrollment restricted to senior computer game design majors. Enrollment limited to 50. E. Whitehead, M. Mateas

CMPS 180: Database Systems I. W

Introduction to the concepts, approaches, tools, and methodology of database design. Covers the entity-relationship model, the relational model, relational algebra, relational calculus, commercial languages (such as SQL and QBE), functional dependencies, normal forms, and design theory. Other topics may include knowledge-bases, constraint databases, and alternative database models. Prerequisite(s): course 101. W. Tan, N. Polyzotis, P. Kolaitis

CMPS 181: Database Systems II. S

Introduction to the architecture and implementation of database systems. Topics covered include data storage, tree and hash indexes, storage management, query evaluation and optimization, transaction management, concurrency control, recovery, and XML data management. Prerequisite(s): course 180. Enrollment limited to 50. W. Tan, N. Polyzotis

CMPS 183: Hypermedia and the Web. *

An introduction to the construction of hypermedia systems and large-scale web applications. Topics covered include pre-web hypertext systems, hypermedia data models, namespaces, system architecture of the web, design of large linked information spaces, design and development of database-backed web applications, web site load testing, and web collaboration technologies. Students work in teams over the term to develop a significant web application. Prerequisite(s): course 180. Enrollment limited to 40. E. Whitehead

CMPS 190X: Methods of Cryptography. F

Theory and practice of encryption and decryption. Classic ciphers. Shannon's information-theoretic approach. Block and stream ciphers. The DES standard. Public key systems: Diffie-Hellman key exchange, RSA, digital signatures. Elliptic curve cryptography. Authentication protocols. Prerequisite(s): Mathematics 19B, 21, and Computer Engineering 16, or equivalent courses. Applied Mathematics and Statistics 27 or equivalent may be substituted for Mathematics 19B and 21. Consult with instructor regarding a course equivalent. J. Yellin

CMPS 191: Computer Science and Technology Seminar (2 credits).W

Weekly talks by industry experts, university researchers, field practitioners, and video presentations provide an in-depth exposure to a specific or a broad area of computer science and technology. Topics include emerging ideas, opportunities, challenges, and future of the industry. May be repeated for credit. S. Lodha

CMPS 193: Field Study. F,W,S

Provides for individual programs of study with specific academic objectives carried out under the direction of a member of the Computer Science Department and using resources not normally available on campus. Credit is based on the presentation of evidence of achieving the objectives, usually a term paper or project. Cannot normally be repeated for credit. Students submit petition to sponsoring agency. The Staff

CMPS 193F: Field Study (2 credits).F,W,S

Provides for individual programs of study with specific academic objectives carried out under the direction of a faculty member of the Computer Science Department and a willing sponsor at the field site. Uses resources not normally available on campus. Credit is based on the presentation of evidence of achieving the objectives by submitting a written and oral presentation. Cannot normally be repeated for credit. Intended for students majoring in computer science. Students submit petition to sponsoring agency. The Staff

CMPS 194: Group Tutorial. F,W,S

A program of independent study arranged between a group of students and a faculty member. Students submit petition to sponsoring agency. May be repeated for credit. The Staff

CMPS 194F: Group Tutorial (2 credits).F,W,S

A program of independent study arranged between a group of students and a faculty member. Intended for students majoring in computer science. Students submit petition to sponsoring agency. May be repeated for credit. The Staff

CMPS 195: Senior Thesis Research. F,W,S

Students submit petition to sponsoring agency. The Staff

CMPS 195F: Senior Thesis Research (2 credits).F,W,S

Intended for majors. Students submit petition to sponsoring agency. The Staff

CMPS 198: Individual Study or Research. F,W,S

Students submit petition to sponsoring agency. May be repeated for credit. The Staff

CMPS 198F: Individual Study or Research (2 credits).F,W,S

Intended for majors. Students submit petition to sponsoring agency. May be repeated for credit. The Staff

CMPS 199: Tutorial. F,W,S

For fourth-year students majoring in computer science. Students submit petition to sponsoring agency. May be repeated for credit. The Staff

* - Not currently offered.