CSE 3. Fluency in Information Technology (4)
Introduces the concepts and skills necessary to effectively use information technology. Includes basic concepts and some practical skills with computer and networks. Prerequisites: none.
CSE 4GS. Mathematical Beauty in Rome (4)
Exploration of topics in mathematics and engineering as they relate to classical architecture in Rome, Italy. In depth geometrical analysis and computer modeling of basic structures (arches, vaults, domes), and on-site studies of the Colosseum, Pantheon, Roman Forum, and St. Peter’s Basilica. Prerequisites: Math 10A or Math 20A; departmental approval, and corequisite of CSE 6GS.
CSE 6GS. Mathematical Beauty in Rome Lab (4)
Companion course to CSE 4GS where theory is applied and lab experiments are carried out “in the field” in Rome, Italy. For final projects, students will select a complex structure (e.g., the Colosseum, the Pantheon, St. Peter’s, etc.) to analyze and model, in detail, using computer-based tools. Prerequisites: Math 10A or Math 20A; departmental approval, and corequisite of CSE 4GS.
CSE 5A. Introduction to Programming I (4)
(Formerly CSE 62A) Introduction to algorithms and top-down problem solving. Introduction to the C language, including functions, arrays, and standard libraries. Basic skills for using a PC graphical user interface operating system environment. File maintenance utilities are covered. (A student may not receive credit for CSE 5A after receiving credit for CSE 10 or CSE 11 or CSE 8B or CSE 9B or CSE 62B or CSE 65.) Prerequisites: A familiarity with high-school level algebra is expected, but this course assumes no prior programming knowledge.
CSE 7. Introduction to Programming with Matlab (4)
Fundamentals of computer programming and basic software design covering topics related to variables, functions, and control structures; writing, testing, and debugging programs in Matlab. Examples focus on scientific applications. Recommended preparation: high school algebra and familiarity with the computing milieu. Students with limited computing experience may take CSE 3 for preparation. Students may not take CSE 7 after completing COGS 18. Program or material fee may apply. Prerequisites: none.
CSE 8A. Introduction to Computer Science: Java I (4)
Introductory course for students interested in computer science. Fundamental concepts of applied computer science using media computation. Exercises in the theory and practice of computer science. Hands-on experience with designing, editing, compiling, and executing programming constructs and applications. CSE 8A is part of a two-course sequence (CSE 8A and CSE 8B) that is equivalent to CSE 11. Students should take CSE 8B to complete this track. Formerly offered as corequisite courses CSE 8A plus 8AL. Students who have taken CSE 8B or CSE 11 may not take CSE 8A. Recommended preparation: No prior programming experience is assumed, but comfort using computers is helpful. Students should consult the CSE Course Placement Advice web page for assistance in choosing which CSE course to take first. Prerequisites: none.
CSE 8B. Introduction to Computer Science: Java II (4)
Continuation of the Java language. Continuation of programming techniques. More on inheritance. Exception handling. CSE 8B is part of a two-course sequence (CSE 8A and CSE 8B) that is equivalent to CSE 11. Students should consult the CSE Course Placement Advice web page for assistance in choosing which CSE course to take first. Students may not receive credit for CSE 8B and CSE 11. Prerequisites: CSE 8A.
CSE 11. Introduction to Computer Science and Object-Oriented Programming: Java (4)
An accelerated introduction to computer science and programming using the Java language. Basic UNIX. Modularity and abstraction. Documentation, testing and verification techniques. Basic object-oriented programming, including inheritance and dynamic binding. Exception handling. Event-driven programming. Experience with AWT library or other similar library. Students who have completed CSE 8B may not take CSE 11. Students should consult the CSE Course Placement Advice web page for assistance in choosing which CSE course to take first. Recommended preparation: high school algebra and familiarity with computing concepts and a course in a compiled language. Prerequisites: none.
CSE 12. Basic Data Structures and Object-Oriented Design (4)
Use and implementation of basic data structures including linked lists, stacks, and queues. Use of advanced structures such as binary trees and hash tables. Object-oriented design including interfaces, polymorphism, encapsulation, abstract data types, pre-/post-conditions. Recursion. Uses Java and Java Collections. Prerequisites: CSE 8B or CSE 11, and concurrent enrollment with CSE 15L.
CSE 15L. Software Tools and Techniques Laboratory (2)
Hands-on exploration of software development tools and techniques. Investigation of the scientific process as applied to software development and debugging. Emphasis is on weekly hands-on laboratory experiences, development of laboratory notebooking techniques as applied to software design. Prerequisites: CSE 8B or CSE 11, and concurrent enrollment with CSE 12.
CSE 20. Discrete Mathematics (4)
Basic discrete mathematical structures: sets, relations, functions, sequences, equivalence relations, partial orders, number systems. Methods of reasoning and proofs: prepositional logic, predicate logic, induction, recursion, pigeonhold principle. Infinite sets and diagonalization. Basic counting techniques; permutation and combinations. Applications will be given to digital logic design, elementary number theory, design of programs, and proofs of program correctness.
Prerequisites: CSE 8B or CSE 11 with a passing grade of C- or better.
Other Restrictions: NOTE: Repeat credit process for cross-reference courses: Students may receive credit for CSE 20 or Math 15A. These courses have been cross-referenced, therefore, a petition is not required for using either course when completing major requirements. However, if you fail one of the courses listed about you should take the SAME COURSE for REPEAT CREDIT. If you use another course that is equivalent, the repeat credit is not automatic and you will need to petition for repeat credit.
Offered: Every quarter: Fall, Winter, and Spring.
CSE 21. Mathematics for Algorithms and Systems (4)
This course will provide an introduction to the discrete mathematical tools needed to analyze algorithms and systems. Enumerative combinatorics: basic counting principles, inclusion-exclusion, and generating functions. Matrix notation. Applied discrete probability. Finite automata. Credit not offered for both Math 15B and CSE 21. Equivalent to Math 15B. Prerequisites: CSE 20 or Math 15A.
CSE 30. Computer Organization and Systems Programming (4)
Introduction to organization of modern digital computers—understanding the various components of a computer and their interrelationships. Study of a specific architecture/machine with emphasis on systems programming in C and Assembly languages in a UNIX environment. Prerequisites: CSE 12, CSE 15L, or consent of instructor.
CSE 80. UNIX Lab (2)
The objective of the course is to help the programmer create a productive UNIX environment. Topics include customizing the shell, file system, shell programming, process management, and UNIX tools. Prerequisites: CSE 8B or CSE 11.
CSE 86. C++ for Java Programmers (2)
Helps the Java programmer to be productive in the C++ programming environment. Topics include the similarities and differences between Java and C++ with special attention to pointers, operator overloading, templates, the STL, the preprocessor, and the C++ Runtime Environment. Prerequisites: CSE 12 or consent of instructor.
CSE 87. Freshman Seminar (1)
The Freshman Seminar Program is designed to provide new students with the opportunity to explore an intellectual topic with a faculty member in a small seminar setting. Freshman Seminars are offered in all campus departments and undergraduate colleges, and topics vary from quarter to quarter. Enrollment is limited to fifteen to twenty students, with preference given to entering freshmen. Prerequisites: none.
CSE 90. Undergraduate Seminar (1)
A seminar providing an overview of a topic of current research interest to the instructor. The goal is to present a specialized topic in computer science and engineering students. May be taken for credit three times when topics vary.
CSE 91. Perspectives in Computer Science and Engineering (2)
Designing and Building Robots is apply what you learn in an introductory programming course make things happen in the real world. You need to have taken a first course in programming as prerequisite. The course is target at sophomores in all engineering and science disciplines. If you have significant programming experience, the course will probably not be that interesting.
Working in teams, you will first learn to program Arduino-based robots. Then, teams of students will design a custom robot and program it to do their bidding.
A seminar format discussion led by CSE faculty on topics in central areas of computer science, concentrating on the relation among them, recent developments and future directions. Instructors approval via Application.
CSE 99. Independent Study in Computer Science and Engineering (4)
Independent reading or research by special arrangement with a faculty member. Prerequisites: lower-division standing. Completion of thirty units at UC San Diego with a UC San Diego GPA of 3.0. Special Studies form required. Department stamp required. Consent of instructor and approval of the department.
CSE 100. Advanced Data Structures (4)
High-performance data structures and supporting algorithms. Use and implementation of data structures like (un)balanced trees, graphs, priority queues, and hash tables. Also memory management, pointers, recursion. Theoretical and practical performance analysis, both average case and amortized. Uses C++ and STL. Credit not offered for both Math 176 and CSE 100. Equivalent to Math 176. Recommended preparation: background in C or C++ programming. Prerequisites: CSE 12, CSE 15L, CSE 21 or Math 15B, and CSE 5A or CSE 30 or ECE 15 or MAE 9.
CSE 101. Design and Analysis of Algorithms (4)
Design and analysis of efficient algorithms with emphasis of nonnumerical algorithms such as sorting, searching, pattern matching, and graph and network algorithms. Measuring complexity of algorithms, time and storage. NP-complete problems. Credit not offered for both Math 188 and CSE 101. Equivalent to Math 188. Prerequisites: CSE 12, CSE 21 or Math 15B, or Math 100A, or Math 103A and CSE 100, or Math 176.
CSE 103. A Practical Introduction to Probability and Statistics (4)
Distributions over the real line. Independence, expectation, conditional expectation, mean, variance. Hypothesis testing. Learning classifiers. Distributions over R^n, covariance matrix. Binomial, Poisson distributions. Chernoff bound. Entropy. Compression. Arithmetic coding. Maximal likelihood estimation. Bayesian estimation. CSE 103 is not duplicate credit for ECE 109, Econ 120A, or Math 183. Prerequisites: Math 20A and Math 20B.
CSE 105. Theory of Computability (4)
An introduction to the mathematical theory of computability. Formal languages. Finite automata and regular expression. Push-down automata and context-free languages. Computable or recursive functions: Turing machines, the halting problem. Undecidability. Credit not offered for both Math 166 and CSE 105. Equivalent to Math 166. Prerequisites: CSE 12, CSE 21 or Math 15B, or Math 100A, or Math 103A.
CSE 107. Introduction to Modern Cryptography (4)
Topics include private and public-key cryptography, block ciphers, data encryption, authentication, key distribution and certification, pseudorandom number generators, design and analysis of protocols, zero-knowledge proofs, and advanced protocols. Emphasizes rigorous mathematical approach including formal definitions of security goals and proofs of protocol security. Prerequisites: CSE 21 or Math 15B, CSE 101 or Math 188, CSE 105 or Math 166.
CSE 110. Software Engineering (4)
Introduction to software development and engineering methods, including specification, design, implementation, testing, and process. An emphasis on team development, agile methods, and use of tools such as IDE’s, version control, and test harnesses. CSE 70 is renumbered to CSE 110: students may not receive credit for both CSE 70 and CSE 110. Prerequisites: CSE 12, CSE 21, or Math 15B.
CSE 112. Advanced Software Engineering (4)
This course will cover software engineering topics associated with large systems development such as requirements and specifications, testing and maintenance, and design. Specific attention will be given to development tools and automated support environments. Prerequisites: CSE 111.
CSE 118. Ubiquitous Computing (4)
Explores emerging opportunities enabled by cheap sensors and networked computing devices. Small research projects will be conducted in teams, culminating in project presentations at the end of the term. Section will cover material relevant to the project, such as research methods, software engineering, teamwork, and project management. Prerequisites: any course from the following: CSE 131, CSE 132B, Cog Sci 102C, Cog Sci 121, Cog Sci 184, COMT 111B, COMT 115, ECE 111, ECE 118, ECE 191, ECE 192, or ICAM 160B; or consent of instructor.
CSE 120. Principles of Computer Operating Systems (4)
Basic functions of operating systems; basic kernel structure, concurrency, memory management, virtual memory, file systems, process scheduling, security and protection. Prerequisites: CSE 30, and CSE 101 or Math 188, and CSE 70 or CSE 110.
CSE 121. Operating Systems: Architecture and Implementation (4)
(Formerly CSE 171B.) Case study of architecture and implementation of a selected modern operating system. In-depth analysis through a detailed study of source code. Topics include process creation, context-switching, memory allocation, synchronization mechanisms, interprocess communication, I/O buffering, device drivers, and file systems. Prerequisites: CSE 120.
CSE 123. Computer Networks (4)
(Renumbered from CSE 123A.) Introduction to concepts, principles, and practice of computer communication networks with examples from existing architectures, protocols, and standards with special emphasis on the Internet protocols. Layering and the OSI model; physical and data link layers; local and wide area networks; datagrams and virtual circuits; routing and congestion control; internetworking. Transport protocols. Credit may not be received for both CSE 123 and ECE 158A, or CSE 123A and CSE 123. Prerequisites: CSE 120 or consent of instructor. Majors only.
CSE 124. Networked Services (4)
(Renumbered from CSE 123B.) The architecture of modern networked services, including data center design, enterprise storage, fault tolerance, and load balancing. Protocol software structuring, the Transmission Control Protocol (TCP), remote procedure calls, protocols for digital audio and video communication, overlay and peer-to-peer systems, secure communication. Credit may not be received for both CSE 124 and ECE 158B. Students may not receive credit for both CSE 123B and CSE 124. Prerequisites: CSE 120 or consent of instructor.
CSE 125. Software System Design and Implementation (4)
Design and implementation of large, complex software systems involving multiple aspects of CSE curriculum. Emphasis is on software system design applied to a single, large group project with close interaction with instructor. Prerequisites: senior standing with substantial programming experience, and consent of instructor. Department stamp required.
CSE 127. Introduction to Computer Security (4)
Topics include basic cryptography, security/threat analysis, access control, auditing, security models, distributed systems security, and theory behind common attack and defense techniques. The class will go over formal models as well as the bits and bytes of security exploits. Prerequisites: CSE 21 or Math 15B, and CSE 120.
CSE 130. Programming Languages: Principles and Paradigms (4)
(Formerly CSE 173.) Introduction to programming languages and paradigms, the components that comprise them, and the principles of language design, all through the analysis and comparison of a variety of languages (e.g., Pascal, Ada, C++, PROLOG, ML.) Will involve programming in most languages studied. Prerequisites: CSE 12, and CSE 100 or Math 176, CSE 105 or Math 166.
CSE 131. Compiler Construction (4)
(Formerly CSE 131B.) Introduction to the compilation of programming languages, practice of lexical and syntactic analysis, symbol tables, syntax-directed translation, type checking, code generation, optimization, interpretation, and compiler structure. (Students may receive repeat credit for CSE 131A and CSE 131B by completing CSE 131.) Prerequisites: CSE 100 or Math 176, CSE 105 or Math 166, CSE 70 or CSE 110, and CSE 130.
CSE 132A. Database System Principles (4)
Basic concepts of databases, including data modeling, relational databases, query languages, optimization, dependencies, schema design, and concurrency control. Exposure to one or several commercial database systems. Advanced topics such as deductive and object-oriented databases, time allowing. Prerequisites: CSE 100 or Math 176.
CSE 132B. Database Systems Applications (4)
Design of databases, transactions, use of trigger facilities and datablades. Performance measuring, organization of index structures. Prerequisites: CSE 132A or equivalent.
CSE 134B. Web Client Languages (4)
Design and implementation of interactive World Wide Web clients using helper applications and plug-ins. The main language covered will be Java. Prerequisites: CSE 100 or Math 176.
CSE 135. Server-side Web Applications (4)
Design and implementation of dynamic web-based applications. Multitier architecture, scripting languages, SQL, XML, session handling, nonbrowser clients, web services, and scalability, security, and usability in the web context. Credit is not offered for both CSE 135 and CSE 134A. Prerequisites: CSE 100 or Math 176.
CSE 140. Components and Design Techniques for Digital Systems (4)
(Formerly CSE 170A) Design of Boolean logic and finite state machines; two-level, multilevel combinational logic design, combinational modules and modular networks, Mealy and Moore machines, analysis and synthesis of canonical forms, sequential modules. Prerequisites: CSE 20 or Math 15A, and corequisite of CSE 140L.
CSE 140L. Digital Systems Laboratory (2)
Implementation with computer-aided design tools for combinational logic minimization and state machine synthesis. Hardware construction of a small digital system. Prerequisites: CSE 20 or Math 15A; CSE 140 must be taken concurrently.
CSE 141. Introduction to Computer Architecture (4)
Introduction to computer architecture. Computer system design. Processor design. Control design. Memory systems. Prerequisites: CSE 140, CSE 140L, or consent of the instructor. CSE 141L should be taken concurrently.
CSE 141L. Project in Computer Architecture (2)
Hands-on computer architecture project aiming to familiarize students with instruction set architecture, and design of process. Control and memory systems. Prerequisites: CSE 110, CSE 140, CSE 140L, or consent of the instructor. CSE 141 should be taken concurrently.
CSE 143. Microelectronic System Design (4)
VSLI process technologies; circuit characterization; logic design styles; clocking strategies; computer-aided design tools; subsystem design; design case studies. System design project from hardware description, logic synthesis, physical layout to design verification. Prerequisites: CSE 140 or CSE 170A or ECE 81.
CSE 144. Computer-Aided Design of VLSI Circuits (4)
Introduction to computer-aided design. Placement, assignment and floor planning techniques. Routing. Symbolic layout and compaction. Module generation and silicon compilation. Prerequisites: CSE 140 and CSE 140L.
CSE 145. Embedded System Design Project (4)
Project class building an embedded computing system. Learn fundamental knowledge of microcontrollers, sensors, and actuators. Introduction to the hardware and software tools to build project in a team environment and end-to-end system building. Prerequisites: CSE 30.
CSE 148. Advanced Processor Architecture Design Project (4)
Students will use hardware description language tools to add advanced architectural features to a basic processor design. These features may include pipelining, superscalar execution, branch prediction, and advanced cache features. Designs will be implemented in programmable logic devices. Prerequisites: CSE 141, CSE 141L, or consent of instructor.
CSE 150. Introduction to Artificial Intelligence: Search and Reasoning (4)
Search algorithms including BFS, DFS, iterative deepening and A*, randomized search algorithms including Walksat, syntax and semantics of first-order logic (FOL), knowledge representation in FOL including reasoning, basic reasoning with probabilities, basic Bayesian learning. Prerequisites: CSE 100 or Math 176, or consent of instructors.
CSE 151. Introduction to Artificial Intelligence: Statistical Approaches (4)
Reasoning with probabilities, reasoning and learning with Bayesian networks, decision making under uncertainty, sequential decision making, statistical learning methods, and reinforcement learning. Prerequisites: CSE 100 or Math 176, or consent of instructor.
CSE 152. Introduction to Computer Vision (4)
The goal of computer vision is to compute scene and object properties from images and video. This introductory course includes feature detection, image segmentation, motion estimation, object recognition, and 3-D shape reconstruction through stereo, photometric stereo, and structure from motion. Prerequisites: Math 20F, CSE 100 or Math 176, CSE 101 or Math 188.
CSE 153. Cognitive Modeling (4)
Construction of computational models that “do the same things people do,” in terms of perception, categorization, memory, language, action, etc. and typically in a fashion that is plausibly carried out by the neural networks in our brains. The model must fit behavioral, neurophysiological, and/or neuropsychological data. Recommended preparation: background knowledge in computer science, cognitive science, psychology, or neuroscience, and a basic understanding of the most fundamental concepts of differential calculus, linear algebra, and statistics. Computer programming skills may be useful to some students as they conduct their term projects, but such skills are not required. Prerequisites: CSE 100 or Math 176 or consent of instructor.
CSE 160. Introduction to Parallel Computing (4)
Introduction to high performance parallel computing: parallel architecture, algorithms, software, and problem-solving techniques. Areas covered: Flynns’ taxonomy, processor-memory organizations, shared and nonshared memory models: message passing and multithreading, data parallelism; speedup, efficiency and Amdahl’s law, communication and synchronization, isoefficiency and scalability. Assignments given to provide practical experience. Prerequisites: CSE 100 or Math 176.
CSE 164. GPU Programming (4)
Principles and practices of programming graphics processing units (GPUs). GPU architecture and hardware concepts, including memory and threading models. Modern hardware-accelerated graphics pipeline programming. Application of GPU programming to rendering of game graphics, including physical, deferring, and global lighting models. Recommended preparation: Practical Rendering and Computation with Direct3D 11 by Jason Zink, Matt Pettineo, and Jack Hoxley. Prerequisites: CSE 167.
CSE 165. 3D User Interaction (4)
This course focuses on design and evaluation of three-dimensional (3D) user interfaces, devices, and interaction techniques. The course consists of lectures, literature reviews, and programming assignments. Students will be expected to create interaction techniques for several different 3D interaction devices. Program or material fee may apply. Prerequisites: CSE 167.
CSE 166. Image Processing (4)
Principles of image formation, analysis, and representation. Image enhancement, restoration, and segmentation; stochastic image models. Filter design, sampling, Fourier and wavelet transforms. Selected applications in computer graphics and machine vision. Prerequisites: Math 20F, CSE 100 or Math 176.
CSE 167. Computer Graphics (4)
Representation and manipulation of pictorial data. Two-dimensional and three-dimensional transformations, curves, surfaces. Projection, illumination, and shading models. Raster and vector graphic I/O devices; retained-mode and immediate-mode graphics software systems and applications. Students may not receive credit for both Math 155A and CSE 167. Prerequisites: CSE 100 or Math 176.
CSE 168. Computer Graphics II: Rendering (4)
Weekly programming assignments that will cover graphics rendering algorithms. During the course the students will learn about ray tracing, geometry, tessellation, acceleration structures, sampling, filtering, shading models, and advanced topics such as global illumination and programmable graphics hardware. Prerequisites: CSE 167.
CSE 169. Computer Animation (4)
Advanced graphics focusing on the programming techniques involved in computer animation. Algorithms and approaches for both character animation and physically based animation. Particular subjects may include skeletons, skinning, key framing, facial animation, inverse kinematics, locomotion, motion capture, video game animation, particle systems, rigid bodies, clothing, and hair. Recommended preparation: An understanding of linear algebra. Prerequisites: CSE 167 or consent of instructor.
CSE 170. Introduction to Human-Computer Interaction Design (4)
Introduces fundamental methods and principles for designing, implementing, and evaluating user interfaces. Topics: user-centered design, rapid prototyping, experimentation, direct manipulation, cognitive principles, visual design, social software, software tools. Learn by doing: Work with a team on a quarter-long design project. Cross-listed with COGS 120. Recommended preparation: Basic familiarity with HTML. Prerequisites: CSE 11 or CSE 8A or CSE 7.
CSE 181. Molecular Sequence Analysis (4)
This course covers the analysis of nucleic acid and protein sequences, with an emphasis on the application of algorithms to biological problems. Topics include sequence alignments, database searching, comparative genomics, and phylogenetic and clustering analyses. Pairwise alignment, multiple alignment, DNS sequencing, scoring functions, fast database search, comparative genomics, clustering, phylogenetic trees, gene finding/DNA statistics. Prerequisites: CSE 100 or Math 176, CSE 101 or Math 188, BIMM 100 or Chem 114C. Bioinformatics majors only. CSE 181 is cross-listed with BIMM 181 and BENG 181.
CSE 182. Biological Databases (4)
This course provides an introduction to the features of biological data, how those data are organized efficiently in databases, and how existing data resources can be utilized to solve a variety of biological problems. Object oriented databases, data modeling and description. Survey of current biological database with respect to above, implementation of a database on a biological topic. Cross-listed with BIMM 182/BENG 182/Chem 182. Prerequisites: CSE 100 or Math 176. Bioinformatics majors only.
CSE 184. Computational Molecular Biology (4)
This advanced course covers the application of machine learning and modeling techniques to biological systems. Topics include gene structure, recognition of DNA and protein sequence patterns, classification, and protein structure prediction. Pattern discovery, Hidden Markov models/support victor machines/neural network/profiles. Protein structure prediction, functional characterization or proteins, functional genomics/proteomics, metabolic pathways/gene networks. Cross-listed with BIMM 184/BENG 184/Chem 184. Prerequisites: BIMM 181 or BENG 181 or CSE 181, BENG 182 or BIMM 182 or CSE 182 or CHEM 182. Bioinformatics majors only.
CSE 190. Topics in Computer Science and Engineering (4)
Topics of special interest in Computer Science and Engineering. Topics may vary from quarter to quarter. May be repeated for credit max 3 times (assuming courses taken for a different topic).
CSE 191. Seminar in CSE (1–4)
A seminar course on topics of current interest. Students, as well as, the instructor will be actively involved in running the course/class. This course cannot be counted toward a technical elective. Prerequisites: consent of instructor. Department stamp required.
CSE 192. Senior Seminar in Computer Science and Engineering (1)
The Senior Seminar Program is designed to allow senior undergraduates to meet with faculty members in a small group setting to explore an intellectual topic in CSE (at the upper-division level). Topics will vary from quarter to quarter. Senior seminars may be taken for credit up to four times, with a change in topic, and permission of the department. Enrollment is limited to twenty students, with preference given to seniors. (P/NP grades only.) Prerequisites: upper-division standing; department stamp required and consent of instructor.
CSE 195. Teaching (4)
Teaching and tutorial assistance in a CSE course under the supervision of the instructor. (P/NP grades only.) Prerequisites: consent of the department chair. Department stamp required.
CSE 197. Field Study in Computer Science and Engineering (4, 8, 12, or 16)
Directed study and research at laboratories away from the campus. (P/NP grades only.) Prerequisites: consent of the instructor and approval of the department. Department stamp required.
CSE 198. Directed Group Study (2 or 4)
Computer science and engineering topics whose study involves reading and discussion by a small group of students under the supervision of a faculty member. (P/NP grades only.) Prerequisites: consent of the instructor. Department stamp required.
CSE 199. Independent Study for Undergraduates (2 or 4)
Independent reading or research by special arrangement with a faculty member. (P/NP grades only.) Prerequisites: consent of the instructor. Department stamp required.
CSE 199H. CSE Honors Thesis Research for Undergraduates (4)
Undergraduate research for completing an honors project under the supervision of a CSE faculty member. May be taken across multiple quarters. Students should enroll for a letter grade. May be taken for credit three times. Prerequisites: Admission to the CSE department honors program. Consent of the instructor. Department stamp required.