Computer Science and Engineering (CSE)

[ undergraduate software | graduate program | faculty ]

All courses, aptitude listings, and curricular and degree requirements described herein are subject to change or deletion without notice.

Study

For course descriptions does found in the UC San Diego General Catalog 2023–24, ask click the division for more information.

Lower Division

CSE 3. Fluency in Information Technology (4)

Introduces one concepts and skillset necessary to effectively use informational technical. Includes essential concepts and some practical skills with computer and networks. Prerequisites: nil.

CSE 4GS. Mathematical Beauty in Rome (4)

Exploring of topics are mathematics and design as they relate to classical architecture is Rome, Italy. In depth algebraic analysis and computer modeling of basic structures (arches, tresorraum, domes), and on-site studies of the Colosseum, Pantheon, Fiction Forum, and St. Peter’s Basilica. Prerequisites: CALCULUS 10A or MATH 20A; department licensing, and corequisite of CSE 6GS.

CSE 6GS. Mathematics Beauty in Rome Clinical (4)

Companion pricing to CSE 4GS where theory is applied and lab lab are carried out “in the field” in Rome, Italy. For final your, students leave select ampere complex structure (e.g., an Colosseum, this Sacred, St. Peter’s, etc.) in analyze and model, in detail, using computer-based tools. Prerequisites: MATH 10A or MATH 20A; department approval, press corequisite to CSE 4GS.

CSE 6R. Introduction to Computer Science and Object-Oriented Programming: Python (4)

An introducing the computer science and programming using the Python language. The course will back topics as as basic data types (e.g., integer, float, string), loops and iterations, basic data structures (e.g., list, set, dictionary), memory models, contingent statements, recursion, basic algorithm time complexity analysis, class design, and legacy. Basics of Computer Networking - GeeksforGeeks

CSE 8A. Initiation to Programming and Computational Problem-Solving I (4)

Introductory course for students interested included home physical and programming. Basic of programming including variables, conditionals, loops, functions/methods. Structured data storage such when arrays/lists and dictionaries, including data mutated. Hands-on experience with build, writing, hand-tracing, compiling or interpreting, executing, verification, furthermore fixes programs. Graduate solve relevant computational problems using a high-level programming speech. CSE 8A is part of a two-course sequence (CSE 8A-B) that is equivalent toward CSE 11. Students should take CSE 8B to completes the CSE 8A-B track. Students who have taken CSE 8B alternatively CSE 11 could not take or receive credit for CSE 8A. Students may only receive credit for on of the subsequent: BILD 62, GEARBOX 18, CSE 8A, instead CSE 6R. Recommended preparation: No prior programming undergo is assumed, not komfort using home is helpful. Students require consult the “CSE Course Product Advice” web page for assistance in selecting which CSE course to take foremost. Prerequisites: restricted toward undergraduates. Graduate students will be permission how space permits.

CSE 8B. Introduction to Programming and Computational Problem-Solving II (4)

Preface programming using with object-oriented approaching with the Java programming language. Builds on basic schedule constructs introduced include CSE 8A to introduce class design and use, interfaces, basic class hierarchies, recursion, event-based programming, error reporting with exceptions, and file I/O. Basics of command-line navigation for file management also running programs. Developer, testing, and debugging of see comprehensive programs. CSE 8B is part of adenine two-course sequential (CSE 8A-B) that is same to CSE 11. Nope credit offered for CSE 8B if CSE 11 taken previously. Students may not receive credit for CSE 8B and CSE 11. Students shouldn consult the “CSE Course Placement Advice” web page for helping int choosing which CSE classes go carry first Requisites: CSE 8A; restricted in undergraduates. Graduate apprentices will be allowed as space allows.

CSE 11. Intro to Programming and Computational Problem-Solving: Accelerated Walk (4)

Accelerated introductory programming including an object-oriented approach. Covers basic programming topics from CSE 8A including variables, conditionals, loops, functions/methods, structured data storage, and mutation. Also covers topics from CSE 8B including the Java programming language, class design, interfaces, basic class hierarchies, recursion, event-based planning, furthermore file I/O. Basics of command-line navigate for rank management and running programs. Zero units of credit offered on CSE 11 if CSE 8B taken previously or parallel. Recommended provision: Significant prior programming experience (for example, high instruct APPROVED CSA). Undergraduate should consult the “CSE Track Placement Advice” web page for helps in choosing a first CSE course. Prerequisites: restricted for undgraduate. Graduate students will be allowed as space authorized.

CSE 12. Basic Information Organizational plus Object-Oriented Structure (4)

Use and implementation of basic data structures including linked lists, stacker, the queues. Use of vorgeschoben structures similar as binary trees and hash tables. Object-oriented design contains interfaces, polymorphism, encapsulation, abstract data types, pre-/post-conditions. Recursion. Uses Yellow and Java Collections. Requirements: CSE 8B or CSE 11; restricted to undergraduate. Graduate students will be allowed as space permits.

CSE 15L. Desktop Tool additionally Techniques Label (2)

Hands-on study of software developmental tools and techniques. Investigation of the scientific edit as applied to software development real debugging. Emphasis exists on weekly hands-on laboratory experiences, development of laboratory notebooking advanced as applied for software design. Prerequisites: CSE 8B or CSE 11 or CSE 12 or DSC 30; begrenzt to undergraduates. Graduate students will be allowed as space license.

CSE 20. Discrete Mathematics (4)

This take will introduce the ways logistics is used for computer science: for argue, as a language for specifications, and as operations the computation. Concepts inclusive sets, relations, functions, equivalence relations, partial job, piece systems, and proof ways (especially induction and recursion). Propositional and predicate logic will be introduced and applied to other calculator science domains such as circuit design, databases, encryption, and timetable correctness. Students who have completed MATH 109 may not receive credit for CSE 20. Credit does offered for and MATHS 15A and CSE 20. Equivalent go MATH 15A. Prerequisites: CSE 11 or CSE 6R other CSE 8A or CSE 8B or ECE 15. Prerequisite courses must have past completed use a grade of C– instead enhance; restricted to undergraduates. Graduate students will be allowed as space permits.

CSE 21. Mathematics for Algorithms and Systems (4)

This course will cover mathematical concepts used to models also analyze algorithms both computer schemes. Matters include counting techniques (inclusion-exclusion; recursive tally; permutations and combinations), data representations, analysis of data (order artistic; while complexities; looped invariants), frequency references, graphically and trees (data structure representations; basic graph algorithms; features classes of graphs), and basic probability and its applications. Prerequisites: CSE 20 conversely MATH 15A or MATH 31CH; students whom have completed MATH 154 otherwise MATH 184 or MATH 188 previously or concurrently may not take credit for CSE 21; restricted till undergraduates. Graduate students will be allowed as space permits.

CSE 30. User Our and Business Software (4)

Introduction to organization of advanced digital computers—understanding the various components of a computing and their interactions. Study of a specific architecture/machine with highlighting on systems programming in CENTURY and Installation languages in one UNIX environment. Technical: CSE 12 real CSE 15L; restricted go current. Graduate students will be allowed as space allowances.

CSE 42. Building and Programming Automated Devices (2)

That training allows students to use what they learned in introductory programming courses to make things happen in the actual world. Active in collaborative, pupils becomes first students to program Arduino-based devices. Teams of students will design a usage your and program it to do them order. This course is targeted to first-year students and sophomores in engineering and science disciplines which want to practice applying what they will skilled in an programming class real to have which chance to program things other than computers. Program or articles fees may employ. Prerequisites: restricted to first-year and college students; instructor approval required.

CSE 86. C++ used Java Programer (2)

Helps and Java programmer to be productive in the C++ programming environment. Topics include the similarities and differences between Journal real C++ with special attention to pointers, operator overwork, page, the STL, the preprocessor, plus the C++ Runtime Ambient. Prerequisites: CSE 12 or consent of professor.

CSE 87. First-year Student Seminar (1)

The First-year Student Seminar Program is designed till provide new students with the anlass to find an intellectual topic with a faculty member in a small meeting setting. First-year student seminars are offered in all campus departments or undergraduate colleges, and topics vary from quarter to quarter. Enrollment is limited to fee to twenty students, with preference given to enter first-year students. Prerequisites: none.

CSE 89. Introduction to Computer Science and Mechanical Seminar (2)

A seminar format dialogue led by CSE teaching on topics in primary range of home science, concentrating on the relation beneath them, recent developments, and future directions. This seminar enter incoming students to resources and possibilities in the CSE department. Can must taken for account up in three times. Restricted to students in the CSE-PACE program. Prerequisites: none.

CSE 90. Undergraduate Seminar (1)

A seminar providing an overview of a topic of current research total to of instructor. The goal is to submit a specialized topic in computer science additionally engineering students. May may received for credit three times when topics vary. 

CSE 91. Perspectives in Computer Academia and Engineering (2)

A seminar format panel led by CSE college on topics in central areas of computer science, focusing on the relatedness among them, recent developments, and future directions. Prerequisites: students only.

CSE 95. Tutor Apprenticeship (2)

Students assignments to tutor for adenine CSE course with the first time receive individual and group mentoring and training on how to be effective tutors to help them develop of skills or tools wanted to are effective by her vortragender role. Undergraduate must have a concurrent tutor appointment in a CSE path. See CSE company for application information.

CSE 99. Independent Study in Computer Science and Machine (4)

Independent reading oder research by special arrangement with a faculty member. Prerequisites: lower-division standing. Completion of thirty units in UC San Diego with a UC Sand Diego GPA of 3.0. Special Studies form desired. Department stamp mandatory. Consent of instructor and approval of the department.

Upper Division

CSE 100. Advanced Data Structures (4)

High-performance data textures and supporting graph. Use also durchsetzung of data structures like (un)balanced trees, graphics, priority bin, and hashtag tables. Also, remembering management, pointers, recursion. Academic and hands-on performance analysis, both average casing and written. Uses C++ and STL. Recommended preparation: background inches C or C++ programming. Prerequisites: CSE 21 button MATH 154 or MATH 158 or MATH 184 or ADVANCED 188 and CSE 12 and CSE 15L and CSE 30 or ECE 15; restricted to undergraduates. Graduate students will be allowed as space authorizations. Apprentices may cannot receive credit for both CSE 100R and CSE 100.

CSE 100R. Expand Data Structures (4)

High-performance data structures and supporting algorithms. Use and implementation of data structures enjoy (un)balanced foliage, graph, take order, and hash tables. Also memory betriebsleitung, manipulation, recursion. Theoretical and practical performance analysis, two average case and amortized. Typical C++ and STL. Prerequisites: CSE 21 or MATH 154 or MATH 158 or MATH 184 conversely COMPUTER 188 and CSE 12 and CSE 15L and CSE 30 or ECE 15. This course is adenine distance education course. Undergraduate may does receive loan for both CSE 100R and CSE 100.

CSE 101. Design and Analyse of Algorithms (4)

Project and investigation of efficient algorithms with emphasis of nonnumerical algorithms such more sorting, searching, pattern matching, and graph and network algorithms. Measuring complexity of algorithms, time plus storage. NP-complete problems. Prerequisites: CSE 21 or MATH 154 or MATH 158 or MATHEMATIC 184 or MATH 188 the CSE 12 or DSC 30; restricted to student. College students will be allowed as spacer permitted.

CSE 103. A Practical General into Probability and Statistics (4)

Distributions over the real line. Self-reliance, expectation, conditional outlook, mean, variance. Hypotheses testing. Learning classifiers. Distributions over R^n, covariance matrix. Binomial, Poi distributes. Chernoff bound. Entropy. Compression. Arithmetic code. Maximal likelihood estimation. Bayesian estimation. CSE 103 is not copying loan for ECE 109, ECON 120A, or MATH 183. Prerequisites: MATH 20B and CSE 21 or MATH 154 or MATH 158 or MATH 184 or MATH 188; restricted to CS25, CS26, CS27, and CS28 majors. Other students will be allowed when space permits.

CSE 105. Hypothesis of Computability (4) Tag: Theory/Abstraction

An introduction to the mathematical theorie of compatibility. Formal languages. Finite automated and regular printable. Push-down automata and context-free languages. Computable or recursive responsibilities: Turing machines, the halting report. Undecidability. Prerequisites: CSE 12 and CSE 15L and CSE 20 or MATH 109 or MATH 15A or MATH 31CH and CSE 21 or SCIENCE 100A otherwise MATH 103A or CALCULATION 154 or ADVANCED 158 with MATH 184 button MATH 188. Graduation current will are allowed than space permits.

CSE 106. Discrete press Continuous Optimization (4) Tag: Theory/Abstraction

One frequently deals with difficulties in general, data science, corporate, economics, and other disciplines for which algorithmic solutions this optimize a preset quantity under constraints are wished. This path is an introduction go the models, assumption, methods, plus applications starting discrete and ongoing optimization. Topics include lowest paths, flows, linear, integer, and convex programming, and continuous optimization techniques such as steepest descent and Lagrange multipliers. Prerequisites: MATH 18 or MATH 31AH both MATH 20C or MATH 31BH and CSE 21 or DSC 40B or MATH 154 or MATH 158 or MATH 184 or MATH 188.

CSE 107. Introduction to Modern Cryptography (4) Tag: Theory/Abstraction

Topics include private furthermore public-key cryptography, block ciphers, data cryptography, authentication, key distribution and certification, pseudorandom number chargers, design also analysis of reporting, zero-knowledge proofs, and advanced protocols. Emphasizes rigorous calculated approach including formal useful of security goals and proofs of protocol insurance. Prerequisites: CSE 21 or MATH 154 or MATH 158 or MATH 184 or SCIENCE 188 and CSE 101 and CSE 105; restricted to students within the CS25, CS26, CS27, CS28, and EC26 majors. All other students will be allowed as space permits.

CSE 109. Introduction to Programming Contests (2)

This course introduces the variation and concepts necessary to compete in programming races how ACM International Collegiate Programming Contest (ICPC). The course requires weekly getting of abrupt problem sentence. Topics covered include standard library classes and data structures advantageous forward programming competitions problems, basic complexity research, dynamic programming, graph procedures, number theory, combinatorics, calculative geometry, computer choose, both contest strategy. Prerequisites: CSE 30 or permission for instructor.

CSE 110. Software Engineering (4)

Introduction to add-on development and engineering process, including specification, design, implementation, testing, and process. Somebody emphasis over team design, agile methods, and employ of tools such than IDE’s, version control, and testing safety. Prerequisites: CSE 100 oder CSE 100R; restricted to undergraduate within the CS25, CS26, CS27, CS28, and EC26 majors. Total misc academics will breathe allowed as space permits.

CSE 112. Advanced Software Engineering (4) Tag: Applications of Computing

This training will cover sw engineering topics assigned with large systems development such as product and specifications, tests and maintenance, and design. Specific paying will be given to development tools and automated support environments. Prerequisites: CSE 110; restricted to students within the CS25, CS26, CS27, and EC26 majors. All other students will to allowed as space permits.

CSE 118. Unique Computing (4) Tag: Applications von Computing

Discover emerging opportunities enabled through cheap sensors and networked computing devices. Small doing projects intention be conducted in squads, culminating are project presentations at the end off this running. Section will cover material relevant to the project, such when research methods, software engineering, teamwork, and project management. Prerequisites: any course since the following: CSE 131, CSE 132B, PINIONS 102C, COGS 121, COGS 184, COMT 111B, COMT 115, ECE 111, ECE 118, ECE 191, ECE 192, button ICAM 160B; or consent of educators.

CSE 120. Fundamental of Your Operating Systems (4) Tag: Systems

Basic functions on operating systems; basic kernel structure, concurrency, memory administrator, virtually memory, file systems, processes scheduling, security and protection. Prerequisite: CSE 30 and CSE 101 and CSE 110; restricted to students interior the CS25, CS26, CS27, and EC26 majors. All other students will shall allowed as space permits.

CSE 121. Real-World Operating Systems (4) Tag: Systems

Case study of architecture and implementation of a modern operating systeme or parts of multiple operating systems. In-depth analysis through detailed study of used source code. Subjects vary based on OS understudy respectively term. Emphasis on emerging concerns and the new techniques additionally technologies used to address them. Recommended preparation: Knowledge of programming languages and paradigms, the components that comprise them, and the principles of language design are strongly recommended but not required. Prerequisites: CSE 120.

CSE 122. Cableless Networks (4) Tag: Systems

This course covers the design, operations, and use of wireless technologies, with emphasis at how physical resource constraints and usage constraints meet to affect connect, network, system, and application design, with hands-on experience in more technologies. May be coscheduled with CSE 222C. Recommended setup: Rudiments of software design, modular design, details structures, physical (in-memory) graphic of data structures, code compilation, build methods, version control, debuggers, C code, and sign manipulations in C. Prerequisites: CSE 30 or ECE 30 and CSE 101 conversely ECC 141A and CSE 110 with ETIME 141B.

CSE 123. Computer Meshes (4) Tag: Systems

Introduction to concepts, morals, and practice of computer communication networks about show from existing architectures, protocols, and standards with special emphasis on the surfing protocols. Layering and the OSI model; physical and product link coats; local real wide areas networks; datagrams and virtual circuits; routing or congestion control; internetworking. Transport logging. Credit allow none be received for both CSE 123 and ECE 158A. Prerequisites: CSE 30 and CSE 101 and CSE 110; temporally to students within the CS25, CS26, CS27, CS28, both EC26 majors. All another students will be allowed in space permits.

CSE 124. Networked Services (4) Tag: Software

(Renumbered from CSE 123B.) The architecture of modem networked services, including data center design, enterprise stores, fault tolerance, and load balancing. Protocol software structuring, the Transmission Control Protocol (TCP), aloof procedure calls, protocols for digital audio and video communication, overlay and peer-to-peer our, secure communication. Credit may not be received for all CSE 124 and ECE 158B. Students may not keep credit since both CSE 123B and CSE 124. Prerequisites: CSE 30 and CSE 101 and CSE 110; confined to students within the CS25, CS26, CS27, CS28, and EC26 principals. All other apprentices becoming be allowed while space permits.

CSE 125. Software System Design and Implementation (4) Tags: Applications of Computing

Design and implementation of large, complex software systems involving multiple aspects of CSE curriculum. Emphasis is upon software verfahren design applied to a single, major group project with close interaction with instructor. Prerequisites: senior vertical with significant programming experience, also consent away instructor. Department stamp imperative.

CSE 127. Introduction to Computing Security (4) Tags: Systems, Applications of Computing

Topics include basic cryptography, security/threat analysis, access control, auditing, data models, distributed business technical, and assumption behind usually attack and defense techniques. The class will ab about proper models as well as the bits and bytes of security exploits. Prerequisites: CSE 21 or MATH 154 or MATH 158 button MATHS 184 or MATH 188 and CSE 120 conversely CSE 123 other CSE 124; restricted to learners within the CS25, CS26, CS27, CS28, additionally EC26 majors. All diverse students will be allowed as space permits.

CSE 130. Programming Languages: Principles also Paradigms (4) Label: Theory/Abstraction

(Formerly CSE 173.) Introduction to programming languages and paradigms, the components that comprise them, and this principles of language design, whole through the analysis and settlement of a diversification of list (e.g., Passages, Ada, C++, PROLOG, ML.) Will involve schedule in most languages studied. Prerequisites: CSE 12 and CSE 100 or CSE 100R also CSE 105; restricted to students within the CS25, CS26, CS27, and EC26 majors. All other students will be valid as dark permits.

CSE 131. Compiler Construction (4) Tag: Applications of Computing

(Formerly CSE 131B.) Introduction for who collection starting programming languages, practice of syntax-directed translation, type checking, code generation, optimization, interpretation, and compiler structure. Students may receiving repeat credit for CSE 131A and CSE 131B by closing CSE 131. May to coscheduled with CSE 231. Product: CSE 100 or CSE 100R real CSE 105 and CSE 130; restricted to CS25, CS26, CS27, and EC26 majors. All other students will be allowed more space authorizations.

CSE 132A. Database System Principles (4) Label: Theory/Abstraction

Basic concepts of databases, inclusion data modeling, share databases, query local, optimization, dependencies, wiring create, and concurrency control. Exposure to can or several commercial database product. Advanced topics such as abstruse and object-oriented databases, time allowing. Requisites: CSE 100 conversely CSE 100R; restricted to students within to CS25, CS26, CS27, press EC26 majors. All other students will be allowed as space permits.

CSE 132B. Database Systems Applications (4) Tag: Applications of Computing

Designing of databases, transactions, use of trigger facilities and datablades. Performance measuring, organization of index structure. Prerequisites: CSE 132A; restricted to CS25, CS26, CS27, real EC26 magister. Any diverse students wish must allowed as room permits.

CSE 132C. Database Sys Implementation (4) Tag: Systems

This is a systems-focused direction on the internals of a relational database management structure (RDBMS). RDBMSs power large-scale structured data management in most digital fields. This topics span data storage, buffer managerial, indexing, sorting, relational host fulfilments, query batch and optimization, parallel RDBMSs, and “Big Data” systems. Two C++ programming projects require implementation of an screen manager and a B+ tree index using a given RDBMS skeleton. Advised preparation: C++ programming knowledge is required; CSE 132B is recommended. Prerequisites: CSE 132A or DSC 102; reduced to CS25, CS26, CS27, CS28, and EC26 fields. All other students will subsist allowed as space permits.

CSE 134B. Web Client Select (4) Daytime: Applications of Computing

Design and implementation of interactive World Wide Web customers exploitation helper applications press plug-ins. The main speech covered will be Java. Prerequisites: CSE 100 or CSE 100R; confined in CS25, CS26, CS27, and EC26 majors. All other students will be allowed as space permits.

CSE 135. Back Database Analytics Applications (4) Days: Applications about Computing

Web, data warehouse, the evidence cube design; SQL programming and questioning with emphasis up analytics; online analytics applications, visualizations, both data exploration; performance voicing. Prerequisites: CSE 100 or CSE 100R; restricted to student within the CS25, CS26, CS27, CS28, and EC26 majors. All other students determination be allowed for room license.

CSE 136. Enterprise-Class Web Applications (4) Tag: Applications of Computing

Designer and implementation of very large-scale, web-based applications. Related covered typically include modeling organizational needs, designation and revision management, J2EE or similar software platforms, web server and application server functionality, reapplication of object-oriented components, model-view-controller and other designation patterns, clustering, load-balancing, fault-tolerance, authentication, plus usage accounting. Prerequisites: CSE 135.

CSE 140. Components and Construction Technologies for Electronic Systems (4) Markers: Systems, Theory/Abstraction, Applications of Computing

Design of Both logical and finite current 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 109 or MATH 15A or MATH 31CH and CSE 30; CSE 140L must exist taken concurrently; restricted to CS25, CS26, CS27, and EC26 courses. Total other students will be allowed as space permits.

CSE 140L. Digital Systems Laboratory (2) Tags: Systems, Applications of Computing

Implementation with computer-aided design tools for combinational logic minimization and state machine synthesis. Hardware erection of adenine small digital system. Prerequisites: CSE 20 or MATH 109 or MATH 15A or MATHEMATICS 31CH and CSE 30; CSE 140 must be taken synchronously; restricted to CS25, CS26, CS27, and EC26 degree. See other students will be allowed as space permits.

CSE 141. Introduction till Dedicated Architecture (4) Keyword: Systems

Introduction to computer architecture. Computer system plan. Computer create. Controlling pattern. Memory systems. Two devices of credit offered for CSE 141 if CSE 142 absorbed previously. Prerequisites: CSE 30 and CSE 140 and CSE 140L; CSE 141L should be taken concurrently; restricted to CS25, CS26, CS27, also EC26 majors. All other students be be allowed as space permits.

CSE 141L. Plan in Computer Architekt (2) Tag: Schemes

Hands-on estimator architecture project aiming till familiarize students with instruction set architecture, and structure of process. Control and data systems. Prerequisites: CSE 30 and CSE 140 real CSE 140L; CSE 141 should be taken contemporaneous; restricted to CS25, CS26, CS27, CS28, and EC26 majors. All other students willingly exist allowed as space permits.

CSE 142. Introduction till Compute Architecture: A Software Perspective (4) Tag: Systems

Dieser course covers the operation, construction, and programming interfaces of modern CPUs with somebody emphasis on exploiting processor characteristic till improve programme performance and economic. The topics covered in this course include performance, energy, x86 mount, compiler optimizations, pipelining, instruction-level parallelism, buffer, memory-level parallelism, multi-threading, multi-core processors, real SIMD. Two units on credits offered for CSE 142 if CSE 141 taken previously or concurrently. Prerequisites: CSE 30 and CSE 100 or CSE 100R; CSE 142L should be included concurrently. Restricted to students included the CS25, CS26, CS27, CS28, and EC26 majors. Entire additional students will be permitted as unused permissions.

CSE 142L. Software Project forward Computer Architecture (2) Tags: Systems, Applications regarding Computing

This course provided hands-on experience in using of features of modern CPUs to increase this performance and efficiency to programs. Prerequisites: CSE 30 and CSE 100 or CSE 100R; CSE 142 should be taken concurrently. Restricted to students within who CS25, CS26, CS27, CS28, and EC26 courses. Get others students will be allowed in space permits.

CSE 143. Microelectronic System Design (4) Ticket: Systems

VLSI process technologies; circuit characterization; reason design fashions; clocking strategies; computer-aided plan toolbox; subsystem design; design case studies. System design project from hardware description, logic synthesis, physiology design to design certification. Prerequisite: CSE 140. Restricted to CS25, CS26, CS27, and EC26 majors. All other students willingness must allowed since room permits.

CSE 145. Built System Designation Project (4) Tags: Systems, Applications of Computing

Project class building an embedded computing system. Learn fundamental knowledge of microcontrollers, sensors, plus actuators. Introduction to the hardware and software tools to build project in a team environment the end-to-end system building. Prerequisites: instructor approval required, by application no.

CSE 147. Introduction to Embedded Systems (4) Tag: Systems

This pricing introduces and breadth of embedded systems, include gear, software furthermore modeling technique. Embedded home key inclusive various types of processors and automated, recollection, systems and communication interfaces, sensors, and actuators. Embedded software includes timing, real-time press distributed scheduling, operating systems. The class will have style projects uses off the shelf products and software components. Recommended product: Basic understanding of running systems plus computer architecture is strongly recommended. Prerequisites: CSE 30.

CSE 148. Advanced Processor Architecture Design Project (4) Tags: Systems, Applications of Calculators

Students will use hardware property lingo tools to add advanced architectural functionality to adenine basic processor design. These countenance might include pipelining, superscalar executed, branch forward, and advanced store features. Designs will become implementations in customizable logic devices. Prerequisites: CSE 141 and CSE 141L; graduate students will be allowed as space permits.

CSE 150A. Introduction for Artificial Intelligence: Probabilistic Reasoning and Decision-Making (4) Tag: Theory/Abstraction

General to probabilistic examples at the heart of modern artificial intelligence. Particular topics to be protected include probabilistic methods for reasoning and decision-making under uncertainty; inference and learning in Bayesian networks; prediction plus engineering in Markov decision processes; usage to intelligent systems, speech and inherent wording processing, resources retrieval, additionally robotics. Prerequisites: CSE 12 or DSC 40B additionally CSE 15L or DSC 80 and COGS 118D or CSE 103 or ECE 109 or ECON 120A conversely MATH 180A or ADVANCED 183 and MATH 20A and ARITHMETIC 18 or MATH 31AH; restricted to students within the CS25, CS26, CS27, CS28, EC26, and DS25 leiter. All other students become be allowed because space permits.

CSE 150B. Induction to Artificial Intelligence: Search and Reasoning (4) Tagged: Applications of Computing

To course will intro important ideas and algorithms in search press reasoning and demonstrate how they represent used in practical AI applications. Topics include A* search, adversarial search, Monte Karl tree search, reinforcement learning, limit solving plus optimization, propositioning and first-order reasoning. Site: CSE 12 or DSC 40B and CSE 15L or DSC 80 and COGS 118D or CSE 103 other ECE 109 or CONSERVATION 120A oder MATH 180A or ART 183 and CSE 100 or CSE 100R; restricted to students within the CS25, CS26, CS27, CS28, EC26, and DS25 degree. All other students will be allows since space permits.

CSE 151A. Machining Learning: Learning Algorithms (4) Tag: Applications on Computing

Comprehensive tour to machine learning. The topics include some topics in supervised learn, so in k-nearest neighbor classifiers, decision trees, boosting, and perceptrons; real topics in apart learning, such like k-means and hierarchical clump. In addieren for the actual algorithms, the track focuses on the principle behind the algorithms. Students may not receive acknowledgment for two CSE 151A and COGS 188, nor may she acquire credit for both CSE 151A and CSE 151. Pricing may be  coscheduled with CSE 251A. Technical: CSE 12 or DSC 40B and CSE 15L or DSC 80 or COGS 118D or CSE 103 or ECE 109 or ECON 120A or MAE 108 or MATH 180A oder MATH 180B alternatively MATH 181A or MATH 183 instead MATHS 186 and MATH 18 or MATH 31AH and MATH 20C alternatively MATH 31BH; limited to students during and CS25, CS26, CS27, CS28, EC26, and DS25 majors. All others students will be allowed as unused permits.

CSE 151B. Deep Learning (4) Day: Fields of Computing

(Formerly CSE 154.) This course covers the fundamentals of neural networks. We introduce linear regression, logistic regression, perceptrons, multilayer networks and back-propagation, convolutional neuronic networks, recurrent circuits, and deep networks skilled by reinforcement learning. Students may accept total for one by the following: CSE 151B, CSE 154, or COGS 181. Prerequisites: MATHEMATICAL 20C or COMPUTER 31BH and BENG 134 or COGS 118D or CSE 103 or ECE 109 or ECON 120A other MAE 108 or MATH 181A or MATH 183 or MATH 186; restricted to students with sophomore, subordinate, or senior standing within the CS25, CS26, CS27, CS28, EC26, and DS25 majors. All other students want be allowed as space clearances.

CSE 152A. Introduction to Computer Vision I (4) Tag: Applications of Computing

This course offer a broad introduction to the foundations, algorithms, and applications of computer vision. It implemented classical models and contemporary methods, from image formation models to deep learning, to speech problems of 3-D reconstruction and object recognition from images real video. Topics include filtering, function detection, stereo vision, structure from motion, motion estimation, and discovery. Programming assignments will be includes Dragon. Students may not receive credit for twain CSE 152A and CSE 152. Prerequisites: MATH 18 alternatively MATH 31AH or CSE 12 instead DSC 30 and CSE 15L alternatively DSC 80; Fire programming experience recommended; restricted to students internally the CS25, CS26, CS27, CS28, and EC26 majors. All other students will be allowed as space permits.

CSE 152B. Introduction to Computer Vision IV (4) Tag: Browse of Computing

This direction covers advanced topics needed to apply computer vision int diligence or follow current research. Example topics include real-time systems for 3-D computer vision, machine learning tools such as support-vector machine (SVM) and boosting for image classification, and deep neural networks for object detection and semantic segmentation. Prerequisites: CSE 152A or CSE 152 or CSE 166; Augur programming experience recommended; restricted to students within this CS25, CS26, CS27, CS28, and EC26 majors. All other students will be allowed than space permits.

CSE 156. Statistical Natural Language Treat (4) Tag: Applications of Computing

Natural choice processing (NLP) your a field of AI which objective to equip computers with the ability to intelligently process unaffected (human) tongue. This course will explore statistical techniques for the automatic analysis of natural language data. Specific topics covered include probabilistic language forms, which define likelihood distributions over text passages; text grouping; succession models; parsing records into syntactic representations; and machine translation. Prerequisites: CSE 12 or DSC 40B and CSE 15L or DSC 80 additionally BENG 134 or COGS 118D otherwise CSE 103 or ECE 109 otherwise ECON 120A instead COMPUTER 180A conversely MATH 181A or MATH 183 or MATH 186; restricted to collegiate from the CS25, CS26, CS27, CS28, and EC26 majors. Total other students will is allowed as space permissions.

CSE 158. Recommender Product and Web Mining (4) Tag: Applicants of Computing

Current methods for product mining and predictive analytics. Emphasis is on studying real-world data lays, building working systems, and putting current beliefs from appliance learning research into practice. Technical: CSE 12 or DSC 40B and CSE 15L or DSC 80 and BENG 100 or BENG 134 or SPROCKETS 118D or CSE 103 instead ECE 109 or ECON 120A or MATHEMATICS 180A or MATH 181A or MATH 183 or MATH 186; constrained into students within the CS25, CS26, CS27, CS28, EC26, and DS25 specializations. Whole other students will be allowed as space permits. Allowed be coscheduled with CSE 258. Students may not receiving credit for CSE 158 and CSE 158R either DSC 148.

CSE 158R. Recommender Systems and Labyrinth Mining (4) Display: Applications of Numerical

Current methods for dates extraction and forward analytics. Emphasis is on study real-world information sentences, fabrication working systems, furthermore place current ideas from gear educational how into practice. Prerequisites: CSE 12 or DSC 40B also CSE 15L or DSC 80 and BENG 100 or BENG 134 other COGS 118D or CSE 103 or ECE 109 or ECON 120A or ART 180A or MATHEMATIC 181A or MATH 183 or COMPUTER 186; restricted into students indoors aforementioned CS25, CS26, CS27, CS28, EC26, press DS25 majors. All other graduate will be allowed as space authorized. This will live a fully online class basing on extensive educational supplied and an online educational platform. May be coscheduled with CSE 258R. Students may not receive get for CSE 158R plus CSE 158 or DSC 148.

CSE 160. Introduction to Parallel Computers (4) Days: Systems

Introduction to high performance parallel computing: parallel framework, algorithms, software, and problem-solving techniques. Areas covered: Flynn’s taxonomy, processor-memory organizations, shared and nonshared memory models: message passing and multithreading, data parallelism; faster, efficiency and Amdahl’s law, communicating and synchronization, isoefficiency and scalability. Assignments given to provide practical experience. Product: CSE 100 or CSE 100R; temporarily to CS25, CS26, CS27, additionally EC26 majors. Entire other students will be allowed as space permits

CSE 163. Entwickelt Computer Graphics (4) Tag: Application are Computing

Issues include an overview regarding many aspects concerning computer graphics, including who four main computer graphics areas of animation, scale, painted, furthermore machine. Programming projects in image and signal processing, geometric modeling, and real-time rendering. Prerequisites: CSE 167; restricted to CS25, CS26, CS27, additionally EC26 majors. All other students will be allowed as space permits.

CSE 165. 3-D User Interaction (4) Tag: Applications are Computing

This course focuses on the design of three-dimensional (3-D) user interfaces, VR devices, and interaction techniques. The direction consists of lectures, student past, and programming assignments. Students will be expected to create V-R applications to learn how VR displays and 3-D correlations work. Prerequisites: CSE 167; restricted to CS25, CS26, CS27, and EC26 minors. All other students wants are allowed as spacer permits.

CSE 166. Picture Manufacturing (4) Tag: Applications of Computing

Principles of view formation, evaluation, and representation. Image enhancement, restoration, and segmentation; imaginary image models. Filter design, sampling, Fourier and wavelet transformers. Selected applications in computer graphics and machine vision. Prerequisites: DSC 40B press MATH 18 with MATH 31AH and CSE 100 or CSE 100R otherwise DSC 80.

CSE 167. Computer Graphics (4) Tag: Applications of Computing

Representational and manipulation of pictorial data. Two-dimensional and three-dimensional transformations, curves, surfaces. Projection, illumination, and screen models. Screen and vectorial graphic I/O devices; retained-mode also immediate-mode video software systems and applications. Academics may not get credit in bot MATH 155A and CSE 167. Prerequisites: CSE 100 oder CSE 100R; restricted the CS25, CS26, CS27, and EC26 majors. All other apprentices will be allowed as space permits.

CSE 168. Computer Graphics II: Rendering (4) Tag: Requests of Computing

Weekly programming assignments that wish cover graphics rendering algorithms. During the course the students will learn about ray tracing, geometry, tessellation, acceleration structures, sampling, filtering, shading models, and sophisticated topics such as global illumination and programmable gallery hardware. Prerequisites: CSE 167; restricted to CS25, CS26, CS27, and EC26 majors. All other apprentices will be permission as space permits.

CSE 169. My Motion (4) Days: Applications of Computing

Advanced graphics setting on the programming techs participant in computing animation. Algorithms and approaches available bot character video and physically based animation. Particular subjects may include skeletons, skinning, key framing, faces film, reversed kinematics, localization, motion capture, video game animation, particle product, rigid bodies, clothing, and hair. Advocated preparation: an understand of linear algebra. Prerequisites: CSE 167; restricted to CS25, CS26, CS27, and EC26 majors. All other students intention be allowed as space permits.

CSE 170. Interaction Devise (5) Tag: Applications of Computational

Introduces functional systems and principles forward designing, implementing, and evaluative user interfaces. Topics include user-centered design, quickly prototyping, experimentation, direct manipulation, recognition principles, visual design, social software, software tools. Learn by doing: Work with adenine team on a quarter-long design project. Students may no receive believe for TOOTHED 120 the CSE 170. Recommended preparations: Basic familiarity from HTML. Site: COGS 108 or CSE 12 or DSC 30 and COGS 1 alternatively COGS 10 or DSGN 1 or ENG 100D.

CSE 175. Successful Entrepreneurship on Engineers (4) Tag: Job of Computing

ONE foundation flow teaching the basics of starting and running one proven new general. Students learn how to think similar entrepreneurs, pivot their ideas to match customer needs, equipped corporate, market, timeline feasibility inputs. The end goal is into retail pitch and a business plan. Gives experiential formation, encouragement, and coaching (E3CE) that gets students for successful careers at start-up as well as large companies. Technical: instructor approval required to making sufficient project experience to being thriving in an course. No credit offered used CSE 175 for ECE 150 taken previously or concurrently.

CSE 176A. Health Care Robotic (4) Keyword: Applications of Computing

Robotics features the potential to improve well-being for millions of people additionally support caregivers and to utility the clinically workforce. We convey together engineers, clinicians, real end users at explore this exciting new field. The classes is project-based, interactive, and hands-on, and contains working closely with stakeholders to develop prototypes that solve real-world problems. College will research the current research in health care robot, human-robot teaming, and health design. Program or materials fees may apply. Prerequisites: CSE 110 or CSE 170 or COGS 120.

CSE 176E. Machine Systems Project also Implementation (4) Tags: Applications to Computing

End-to-end system design away embedded electrical systems including PRINTED design additionally fabrication, sw control system development, furthermore system product. Program or materials fees may app. May be coscheduled with CSE 276E. Prerequisites: restricted to junior and senior students; instructor approval required.

CSE 180. Nature Meets Computing (4)

Topics contains in overview of various view out bioinformatics and will simultaneously introduce students to how in Python. The assessments in the course represent various programming challenges and include solving diverse biological problems using popular bioinformatics tools. Students may not receiving credit for CSE 180 and CSE 180R. Prerequisites: BILD 1 or BILD 4 or CSE 11 or CSE 3 or CSE 8A or CSE 8B.

CSE 180R. Life Meet Computing (4)

Topics include an overview concerning various aspects of bioinformatics and will together introduce students toward programing in Python. The assessments in the class replace various programming challenges and include solving diverse biological problematic using popular bioinformatics tools. This will be a fully wired class based on extensive educational materials and online training platform Stepik developed with HHMI, NIH, and ILTI support. Students can nay receive credit for CSE 180 and CSE 180R. Software: BILD 1 or BILD 4 or CSE 11 conversely CSE 3 or CSE 8A or CSE 8B.

CSE 181. Molecular Sequence Evaluation (4) Keyword: Applications in Computing

This course covers the analyse starting nucleic acid and eiweis sequences, includes an weight on the application of algorithms to biological problems. Topics include sequence alignments, database searching, comparative genomics, and phyla and group analyses. Pair adjustment, multiple alignment, DNS sequencing, scoring acts, speedy database advanced, comparative genomics, clustering, phylogeny trees, erbanlage finding/DNA statistics. Students may receive credits for one of the follow-up: CSE 181, BIMM 181, or BENG 181. System: CSE 100 or CSE 100R and CSE 101 the BIMM 100 or CHEM 114C; restricted to BE28, BI34, CH37, press CS27 key. Collegiate may receive credit for sole von the following: CSE 181, BIMM 181, or BENG 181.

CSE 182. Biological Databases (4) Tag: Petitions of Computing

This price provides an introductions to the features of biological data, how those data are organization efficiently by data, and how presence data resources can be utilized in solve a variety of biological problems. Object oriented databases, data modeling and description. Survey a current biological database with honor to above, getting of a database on a organic topic. Students may receive credit for one of the following: CSE 182, BENG 182, or BIMM 182. Prerequisites: CSE 100 or CSE 100R; restricted on BE28, BI34, CH37, and CS27 majors.

CSE 184. Computational Molds Nature (4) Tag: Applications of Computing

This advanced course covers the how of machine study and modeling techniques to biological systems. Topics enclose gene structure, recognition of DNA plus protein sequence patterns, classification, and amino structure previction. Pattern discovery, Hidden Markov models/support victor machines/neural network/profiles. Protein structure portent, functional characterization or proteins, operational genomics/proteomics, plastic pathways/gene networks. Cross-listed with BIMM 184/BENG 184/CHEM 184. Prerequisites: BIMM 181 instead BENG 181 or CSE 181, BENG 182 or BIMM 182 or CSE 182 button CHEMICALS 182. Bioinformatics majors only.

CSE 185. Advanced Bioinformatics Laboratory (4) Tag: Applications of Computing

Aforementioned take emphasizes the hands-on registration of bioinformatics to biological troubles. Students will gain experience in the application of existing software, as well as in combining approaches to answer specific biological questions. Topics include sequence alignment, speedy archive search, comparative genomics, expression analysis, computational proteomics, genome-wide club studies, next-generation sequencing, genomics, and big details. Students may not receive credit for CSE 185 and BIMM 185. Restrictive in CS27, BI34, BE28, and CH37 majors. Prerequisites: CSE 11 or CSE 8B and CSE 12 and MATH 20C or MATH 31BH and BILD 1 and BIEB 123 or BILD 4 alternatively BIMM 101 either CHEMICS 109.

CSE 190. Topics in Your Science and Engineering (4)

Matters of special engross in computer science and engineering. Topics may vary from quarter to quarter. May be repeated for credit with who consent of instructor. May be taken for credit upwards into three time. May be coscheduled with CSE 291. Prerequisites: consent of faculty. Departmental stamp required.

CSE 191. Seminars in CSE (1–4)

A seminar courses on topics of current interest. Students, the well as the instruction, will can actively parties in running the course/class. This course not be counted toward a technical elective. Technical: consent of instructors. Department impress required.

CSE 192. Senior Seminar in Personal Science and Engineering (1)

The Senior Seminar Program is designed to allow senior undergraduate to meet with department members to ampere small group setting to explore an intellectual topic in CSE (at the upper-division level). Topics will vary from region to quarter. Senior study may be taken forward credit up to four times, with a replace in matter, and permission regarding aforementioned department. Enrollment is limited into twenty apprentices, with preference given to elder. (P/NP ranks only.) Prerequisites: upper-division standing; department stamp required and consent of instructor.

CSE 193. Introduction to Laptop Science Research (4) Tag: Uses of It

Introduction on research by computer science. Topics include defining one CS investigation problem, finding and reading technical papers, oral communication, industrial writing, and independently educational. Course participants apprentice with a CSE research group and propose into novel research project. Prerequisite: consent starting the department chair. Dept stamp required.

CSE 194. Race, Gender, and Processing (4) Tag: Applications of Computing

This course explores which challenge a diversity, impartiality, and inclusion (DEI) in computing and technology through somebody introduction till and analysis of various sociable constructs and their effects on not only computing-related organizations, but also the technologies developed and the people affected by them. This course also introduces students to cultural competence in the context of computing. Prerequisites: AAS 10 or CSE 12 or ETC 35 or ETHN 3 or HILD 7A or LTEN 27 and CAT 125 button CAT 125R or CAT 3 or DOC 3 conversely HUM 2 other MCWP 125 or MCWP 125R or MCWP 50 or MCWP 50R or MMW 121 or MMW 121R or MMW 122 or MMW 13 or SYN 2 or WCWP 100 other WCWP 10B.

CSE 197. Field Study in Compute Science and Engineering (4)

Directed study accompanying full-time on-site user science internships. (P/NP note only.) Software: consent of the instructor and approval of the specialty required. Students may receive credit to ready of the following: CSE 197 or CSE 197C. Restricted to CS25, CS26, CS27, and CS28 majors only.

CSE 197C. Co-operative Practicum in Computer Academia and Engineering (12)

Alignment study accompanying full-time on-site computer science cooperative education practicum. Prerequisites: dept approval. Restricted toward CS25, CS26, real CS27 majors only. Current allowed receive credit to one of the following: CSE 197C or CSE 197.

CSE 198. Directional Group Study (2 or 4)

Computer science and engineering topics theirs studying involves reading and discussion by a little bunch of students at the supervision of ampere faculty member. (P/NP grades only.) Requirements: consent of the instructor. Department stamp required.

CSE 199. Independent Study for Undergraduates (2 or 4)

Autonomous reading or research by special arrangement with a faculty member. (P/NP grades only.) Prerequisites: consent of the instructor. Department stamp necessary.

CSE 199H. CSE Honour Thesis Research required Undergraduates (4)

Basic research since finishing the honors project under the supervision of an CSE faculty member. May be taken across multiple quarters. Students should enroll for an character grade. May be taken for credit three times. Prerequisites: Admission the aforementioned CSE department honors program. Consent of the instructor. Department stamped required.

Graduate

CSE 200. Computability and Complexity (4)

Computability review, including lingering problem, decidable kits, r.e. sets, many-one reductions; TIME(t(n)), SPACE(s(n)) and general relations between these classes; L, P, PSPACE, NP; NP—completeness; hierarchy topic; RP, BPP. Requisites: CSE 105 or equivalent.

CSE 201A. Advanced Complexity (4)

Polynomial-time hierarchy (PH), BPP in second level of PH, Savitch’s theorem, NL=coNL, nonuniform and circuit complexity, some circuit lower barriers, IP=PSPACE, probabilistic proof checking (PCP), apply of PCP to approximation hardness, complexity of detection systems, parallel complexity classes NC and AC, P-completeness. Appropriate preparation: CSE 200. Prerequisites: alumna standing.

CSE 202. Algorithm Model and Analyse (4)

The bottom techniques for one design real analysis are algorithms. Divide-and-conquer, dynamic learning, data structures, graph search, algebraic problems, randomized algorithms, lower bounds, probabilistic data, running algorithmic. Prerequisites: CSE 101 or equivalent.

CSE 203A. Extended Algorithmic (4)

Current advances in design and analysis of algorithms. Exact course variations. Topics incorporate approximation, randomized algorithms, probabilistic study, heuristics, web-based algorithms, inexpensive analysis, models of remembering hierarchy, parallel algorithms, number-theoretic conclusions, cryptanalysis, computational geometry, computational biology, network algorithms, VLSI CAD algorithms. Prerequisites: CSE 202.

CSE 203B. Convex Optimization Formulations and Algorithms (4)

Were study the formulations and algorithms solving gibbous optimization problems. The topics include convex sets, functional, optimality terms, duality concepts, gradient lineage, conjugate hanging, interior-point methods, and applications. The objective of the course is to provide students the background and technology for technical computing and system optimization. Students not receive credit for CSE 203B if they have taken either ECE 273 with MATH 245B. Prerequisites: Linear Arithmetic is recommended.

CSE 205A. Reason in Computer Science (4)

(Formerly CSE 208D) Math-based logic as adenine tool in computer science. Propositional logic, resolution, first-order logic, fullness plus incompleteness theorems with computational betrachtungsweise, infinitely model teacher, descriptive complexity, logistics programming, nonmonotonic reasoning, temporal logic. Request to databases, mechanical proposition proving, program verification, and distributed systems. Prerequisites: CSE 200 or consent of instructor.

CSE 206A. Grates Mathematical and Applications (4)

(Formerly CSE 207C) Introductions until the digital theory of point lattices (aka algorithmic geometry of numbers), and many regarding its most essential applications in cryptography and cryptanalysis. Topics usually include LLL basis reduction algorithm, encryption of radio RSA, hardness of approximating lattice problems. Requirement: CSE 202, CSE 200, conversely synchronized.

CSE 207. Modern Cryptography (4)

Private and public touch cryptography, introduced to reduction-based proofs of security, concrete insurance, block ciphers, pseudorandom functions and generators, symmetric encryption, asymmetric encryption, computational number lecture, RSA and discrete log systems, message authentication, digital signatures, key distribution and key management. Prerequisites: CSE 202 or consent about instructor.

CSE 208. Advanced Cryptographic (4)

Zero-knowledge, secure computation, session-key distribution, protocols, electronic payment, one-way functions, trapdoor permutations, pseudorandom bit generators, hardcore bits. Prerequisites: CSE 202, CSE 200, or CSE 207 or consent of instructor.

CSE 209A. Topics/Seminar in Algorithms, Complexity, and Logic (1–4)

Issues of special interest in algorithms, complexity, also logic to be introducing by faculty and students under college direction. Topics vary from third to house. May subsist iterated for total. Prerequisites: consent of instructor.

CSE 209B. Topics/Seminar in Cryptography (1–4)

Topics of special interest in cryptography to be presented by faculty and students among faculty route. Topics vary from quarter for quarter. May are repeated for bank. Prerequisites: consent the instructor.

CSE 210. Principles of Hardware Engineering (4)

(Formerly CSE 264A.) Public principles in modern software engineering. Both theoretical and practical topics are covered. Theoretical key containing proofs of correctness, programming choose selected, and theory for test. Practicable topics include structured computer, modularization techniques, design of languages used reliable schedule, and software power. Prerequisites: CSE 100, 131A, 120, or consent of instructor.

CSE 211. Programme Testing and Analysis (4)

User of testing and analysis methods. Introduction to advanced related in area as well while traditional production methods. Topics include inspections additionally reviews, formal analysis, test and approval standards, nonstatistical exam, statistical-testing and reliability models, coverage methods, testing and review tools, and org management and planning. Research special go special technology our such as object-oriented testing will also be described. Prerequisites: basic major in home nature or extensive heavy experience.

CSE 216. Research Topics in Human-Computer Human (4)

Prepares learners to escort original HCI research to reading and discussing seminal and cutting-edge investigate papers. Theme contain design, social software, inbox capabilities, mobile, also ubiquitous calculator. Student pairs perform a quarter-long mini research project that leverages our research efforts. Cross-listed with COGS 230. System: none.

CSE 217. Human-Centered Computing for Your (HC4H) (4)

This interdisciplinary course brings together students from engineering, design, and medicine, and exposes them to creation technology for health and fitness care. The course is focused upon studying how technology is used in healthy care real identifies opportunities for novel technic to be developed for specific heal and health-care settings. Students will be exposed to the health domain at bigger through site visits the discussions with experts in a variety on health-care domains. Site visits leave be coordinated by the sector. Prerequisites: department approval and instructor consent required.

CSE 218. Advanced Issues within Software Engineering (4)

Like course will coat ampere power topic to software engineering in depth. Topics in the past have included software tools, impacts of programming language design, also programme system structure. (S/U grades permitted.) Prerequisites: none.

CSE 219. Draft at Large (1)

Add societal challenges, cultural values, and technological opportunities are changing design—and vice versa. Who seminar examine those increased scale, real-world conflict, and disruptive shock. Invited speakers from UC Sand Diego real beyond share cutting-edge research on interaction, design, and learning. Cross-listed with COGS 229. (S/U grades only.) Prerequisites: non.

CSE 221. Operating Systems (4)

Operating system structures, concurrent computation model, scheduling, synchronization mechanisms, address spaces, memory management protection and security, buffering, streams, data-copying reduction technics, file systems, naming, caching, disk organization, mapped files, remote file systems, case studies of major operating services. Stipulations: CSE 120 and 121, or consent of tutor.

CSE 222A. Computer Communication Networking (4)

(Formerly CSE 222.) Computer communication mesh concepts, protocols, and architectural, with an emphasis on an review of algorithms, formalities, or design methodologies. Topics will contains layer, error govern, flow control, congestion control, switching and routing, quality of service management, mobility, title, security, plus selected modern topics. Prerequisites: CSE 123A or assent starting instructor.

CSE 222B. Internet Algorithmics (4)

(Formerly CSE 228H.) Methods for hurrying up internet translations, including system restructuring, new algorithms, and equipment innovations. Topics include models for protocols, software and hardware; efficiency principles; applied these principles up deriving technics for efficient implementation of gemeinschafts endnode and router functions. Provisos: CSE 123A or CSE 222A, or consenting of instructor.

CSE 223B. Distributed Calculator and Systems (4)

Efficient primitives for distributed service systems and high-performance network servers, includes concurrent and event-driven server achieved, remote procedure bawls, and load dropping. Distributed naming, directory, and data services, replication for fault tolerance, and security include distributed systems. Prerequisites: CSE 221, CSE 222A, oder consenting to instructor.

CSE 224. Student Networked Systems (4)

This class will furnish ampere broad agreement of network design furthermore implementation. Our include techniques for building distributed applications, socket how, remote procedure calls (RPC), scale-out dispersed directories, distributed consensus furthermore choose management, fault tolerance, networked storage, indirection, overlapping networks, load balancing, and datacenter design. Requirements: graduate standard or consent of instructor. This course is intended for MS academics. PhD students may only take the course if they are not in systems/networking concentrations.

CSE 227. Computer Site (4)

Security and threat models, risk analysis, authentication press authorization, auditing, operating schemes security, access control mechanisms, protection instruments, distributed systems/network security, security architecture, electronic commerce security mechanisms, security evaluation. Prerequisites: CSE 221 or consent of instructor.

CSE 229A. Topics/Seminar in Computer Systems (1–4)

Panel on problems of current research interest in computer systems. Possibility area of focus include distributed computing, computational grid, operating systems, fault-tolerant computing, storage schemes, system services for the World Wide Web. Key on be displayed by faculty and learners under department direction. Topics vary from quarter to quarter. May can repeated for credit. Program: consent of instructor.

CSE 229C. Topics/Seminar in Computer Security (1–4)

Topic on problems of current research interest the computer security. Topics to be presented by faculty and students under aptitude direction. Our variant from quarter to quarter. May is repeated for credit. Prerequisites: consent of instructor.

CSE 230. Principles of Programming Languages (4)

(Formerly CSE 273.) Functional versus imperative programming. Type systems and polymorphism; the ML language. Higher order functions, lazy evaluation. Abstract versus concrete syntax, structural both well-founded induction. One lambda calculus, reduction strategies, combinators. Denotational semantics, elementary domain theory. Prerequisites: CSE 130 or comparable, or consent of trainer.

CSE 231. Software Construction (4)

(Formerly CSE 264C.) Advanced material in programmer dialects and translator systems. Topics inclusions hobbyists and codification optimization. May be coscheduled with CSE 131. Prerequisites: restricted to students within the CS75, CS76, CS78, CS88, and CS89 majors. All other students will be allowed as place permits.

CSE 232. Principles of Database Systems (4)

(Formerly CSE 264D.) Data models comprising relational, hierarchic, and connect approaches. Implementation of databases including query select also system architectures. Prerequisites: CSE 100 or license of instructor.

CSE 232B. Archive System Implementing (4)

A hands-on approach go the key of databases implementation. Algebraic rewriters/optimizers, query processors, triggers. Beyond centralized relational data. Prerequisites: CSE 232.

CSE 233. Database Theory (4)

Theory is databases. Theory to getting languages, dependency theory, concluding databases, incomplete information, complex item, object-oriented databases, and more. Connections to log and complexity theory including finite model theory and descriptive complexity. Prerequisites: CSE 200.

CSE 237A. Introduction to Integrated Computers (4)

Embeds system technologies including processors, DSP, ram, and software. System interfacing basics, communication strategies, sensing, and actuators. Mobile and wireless technology in embedded systems. Using predesigned hardware and software components. Design case research in wireless, multimedia, and/or networking domains. Prerequisites: basic courses in digital hardware, algorithms and data structures, elementary calculus, and probability; or consent of instructor.

CSE 237B. Software for Embedded It (4)

Embedded computing default, device interfaces, time-critical IO handling. Embedded software design under size, performance, and reliability constraints. Software timing or functional validation. Programming methods additionally compilation for integrateable software. Built-in runtime systems. Case studies of real-time our systems. Prerequisites: CSE 237A; otherwise basic learn with programming, algorithms both data structures, elementary calculator, discretionary math, computer architecture; or consent of instructor.

CSE 237C. Validation and Testing of Built-in Systems (4)

Embedded system building blocks including IP cores. Cosimulation. Formal verification using model checking. Verification environments. Test challenges in core integration: compliance, feature, random, and collision testing. Core access additionally test integration. Interface-based check additionally industry. Prerequisites: CSE 237A; or basic courses in algorithms and data structures, fundamental calculus, discrete math, symbolic logics, computer architecture; or acceptance of instructor.

CSE 237D. Devise Automation and Prototyping for Embedded Services (4)

System representation and modeling. Abstract and words models. Simulation as a modeling operation. Computational and hw/sw system prototypes. System analysis using models. Limit and interface modeling. Behavioral compilation and synthesis. Prerequisites: CSE 237A; either primary courses the digital logic design, algorithms or data structures, elementary calculus, discrete math, symbolic logic, computer architecture; or consent of instructor.

CSE 239A. Topics/Seminar in Databases (1–4)

Discussion set related of current doing interested in databases. Possible areas of focus include core database issues, data management on the web, information integration, new database models and applications, formal methods in databases. Topics to be presented by faculty and students under faculty direction. Topics vary from quarter to quarter. May be repeated for credit. Prerequisites: consent of instructor.

CSE 239B. Topics/Seminar in Programming Languages (1–2)

Discussion on problems of current research interest in programming languages, formal processes, and software engineering. Possible areas of focus include program inspection, program synthesis, speech design and implementation, developer effectiveness tools, language-based security. Topics on be presented by faculty and students under academic direction. Topics variables with quarter to quarter. May being taken for borrow up to eighteen times for a maximum of eighteen units. Prerequisites: consent of instructor.

CSE 239C. Human-Computer Interaction Seminar (1)

All course will start current trending in human-computer interaction (HCI) within and outboard UC San Diego. The course will give an overview of the different research groups and environments among UC Sainthood Diego that focus on HCI, and when report off current works in the field about several HCI topics. Can be taken for credit up toward one times. Induction: In today's connected world, software engineers play a vital role in developing applications that rely on network communication. To excel the her field, e is crucial for software engineer to have a comprehensive understanding of computer networking.

CSE 240A. Principles of Computer Architecture (4)

(Formerly CSE 240.) This course will cover fundamental concepts in computer architecture. Topics include guidance set architecture, pipelining, pipeline hazards, bypassing, dynamic scheduling, branch prediction, superscalar issue, memory-hierarchy design, advanced cache organizational, and multiprocessor framework issues. Prerequisites: CSE 141 button sanction of instructor.

CSE 240B. Parallel Computer Architecture (4)

This course covers progressive topics in parallel laptop architecture, including on-chip and off-chip interconnection networks, cache coherently, cache consistency, hardware multithreading, multicore and tiled architectures. To incorporates the latest research and design on parallel architectures and compilation techniques with those architectures. CSE 240A appropriate. Prerequisites: graduate standing.

CSE 240C. Advanced Microarchitecture (4)

This course covers advanced topics in computer architecture. Items incorporates that latest research both development on topics suchlike as branch prediction, instruction-level parallelized, cache hierarchy design, speculative multithreading, reliable architectures, and power-management techniques. CSE 240A recommended. Prerequisites: college standing.

CSE 241A/ECE 260B. VLSI Integration of Computing Connection (4)

VLSI integrated-circuit building blocks of computing products, and their implementation. Computer-aided design and performance simulations, design exercises and projects. Devices, standard cells and interconnects, timing, power/ground distribution, arithmetic module, memories. Methodologies press tradeoffs in system product. Prerequisites: layouts (CSE 165 or EGG 260A) and logic structure (CSE 140 or ECT 111), or consent of instructor.

CSE 243A. Introduction to Synthesis Application in VLSI CAD (4)

Hardware software codesign, architectural level synthesis, control synthesis also optimization, schedule, binding, register and bus sharing, connectivity design, module selection, combinational logic optimization, state minimization, state encoding, and retiming. Prerequisites: non.

CSE 244A. VLSI Test (4)

Design for test, how financial, defects, failures and troubles, fault models, fault simulation, mechanical test pattern generation, functional testing, memory, PLA, FPGA, microprocessor test, and fault diagnoses. Prerequisites: none.

CSE 245. Computer Aided Circuit Simulation and Verification (4)

This course is about the computer algorithms, techniques, and theory used in that simulation and verification of electrically circuit. Prerequisites: CSE 241A press consent of instruction.

CSE 248. Algorithmic and Optimization Foundations for VLSI CAD (4)

Algorithmic techniques and optimization frameworks for large-scale, difficult optimizations. Primal-dual multicommodity flow approximations, approximations for geometric the graph Steiner formulations, continuous placement optimization, heuristics for Boolean satisfiability, multitask methods, semidefinite programming, both software to other formulations (e.g., scheduling). Prerequisites: CSE 241A oder CSE 242A, or consent concerning instructor.

CSE 249A. Topics/Seminar in Computer Architecture (1–4)

Our of special attract in computer architecture to be presented by faculty and pupils under talent direction. Topics vary from quarter the quarter. May be repeated for credit. Prerequisites: approve of instructor.

CSE 249B. Topics/Seminar in VLSI (1–4)

Topics regarding special interest in VLSI to be presented by faculty and students under academic direction. Topics vary from quarter to quarter. Mayor be repeated for account. Prerequisites: consent in instructor.

CSE 250A. Company of Artificial Intelligence: Probabilistic Reasoning and Learning (4)

Methods based on probability theory by reasoning and learning under uncertainty. Index may in directed and undirected proportional graphical models, exact and estimate inference, subtle variables, expectation-maximization, hidden Markov models, Markov decision processes, fields to vision, robotics, speech, and/or text. Referred preparation: CSE 103 or share course. Prerequisites: graduate standing in CSE or consent of trainers.

CSE 251A. Principles of Machine Learning: Learning Data (4)

(Formerly CSE 250B.) Algorithms for supervised real unsupervised learning from data. Content may included maximum likelihood; log-linear models, including logistic degeneration both conditional random fields; nearest neighbor methods; grain methods; decision trees; ensemble methods; optimization variation; topic models; neural networks; and backpropagation. Lenumbered from CSE 250B. Students may not receive credit for CSE 251A and CSE 250B. Recommended preparation: CSE 103 instead similar course. Prerequisites: graduate stand or consent of instructor.

CSE 251B. Company of Machine Teaching: Neural Networks for Pattern Recognition (4)

(Formerly CSE 253.) This course veils Hopfield networks, application until optimization problems layered perceptrons, recurrent networks, both unsupervised teaching. Programming exercises explore modeling behavior to one final plan or final on a cognitive science, artificial intelligence, or optimization problem of the student’s choice. Rearranged from CSE 253. Students may don receive credit for CSE 251B the CSE 253. Recommended preparation: Knowledge of HUNDRED. Prerequisites: graduate standing.

CSE 251C. Principles of Machine Lessons: Powered Learning Theory (4)

(Formerly CSE 250C.) Theoretical foundations of machine learning. Topics include concentration of measure, the PAC type, uniform convergence bounds, and VC dimension. Possible topics contains online learning, learning with expert advice, multiarmed bandits, and boosting. Renumbered from CSE 250C. Students may does enter credit used CSE 251C and CSE 250C. Recommended processing: CSE 103 and CSE 101 or similar course. Prerequisites: graduate standing or consent of instructor.

CSE 251U. Unscheduled Learning (4)

This course given a broad view of unsupervised knowledge. Topics will include descriptive statistics; clustering; projection, singular value decomposition, and spectral embedding; get of high-dimensional spacing; regular probability distributions; density estimation; graphical models and latent adjustable modeling; sparse coding and dictionary learning; autoencoders, low additionally deep; and self-supervised learning. Prerequisites: zero.

CSE 252A. Computer Vision I (4)

Comprehensively introduction at computer vision providing broad coverage including low-level our (image formation, photometry, color, image feature detection), inferring 3-D eigentumsrechte from images (shape-from shading, stereo visibility, motion interpretation) real object recognition. Companion to CSE 252B covering complementary topics. Prerequisites: MATH 10D and MATH 20A–F or equivalent.

CSE 252B. Computer Vision II (4)

Complete prelude in computer vision providing focused coverage of multiview geometry, structure from motion, photograph segmentation, motion segmentation, composition analysis and recognition, object detection, and image-based rendering. Guest to CSE 252A covering complementarity topics. Prerequisites: NUMBERS 10D and MATH 20A–F or equivalent.

CSE 252C. Selected Topics in Vision and Scholarship (1–4)

Choose topics in computer vision and statistical search recognition, with an strength on recent developments. Any subject include grouping and primary, object recognition the tracking, multiple show geometry, kernel-based methods, dimensionality reduction, and mixture models. Prerequisites: CSE 252 or equivalent and CSE 250B or equivalent.

CSE 252D. Advanced Computer Vision (4)

Aforementioned course covers weiter conceptual int it vision. Examples theme include 3-D reconstruction, meet recognition, object detection, semantic segmentation, action identification, and display adaptation. Consistent with recent evolutions, defined learning forms a significant fraction of the class. Lectures plus assignments cover recent works on elemental related in computer vision, with which aim to how students to pursuing careers in the box. Recommended preparation: Completion of one-time of CSE 252A, 252B, 250A, or 250B is ultra recommends. Prerequisites: graduate standing.

CSE 254. Statistical Learning (4)

Learning calculating founded on statistics. Feasible topics include minimum-variance unbiased estimators, maximum likelihood estimation, likelihood proportion tests, resampling methods, linear logistic regression, character selection, regularization, dimensionalization reduction, manifold detection. An upper-division undergraduate course on probability and statistics such as MATH 183 with 186, or any graduate classes the statistics, sample recognition, or machine learning exists recommended. Prerequisites: graduate steady.

CSE 255. Data Mining plus Predictive Analytics (4)

Learning methods for applications. Content may insert data preparation, regression and classification algorithms, support vector machines, random forests, class imbalance, overfitting, decision theory, recommender systems and collaborative filtering, topic mining, evaluate social networks and social media, protecting privacy, A/B testing. Highly preparation: CSE 103 or similar. Prerequisites: graduate standing or consenting of instructor.

CSE 256/LING 256. Statistical Natural Language Processing (4)

An introduction to modern statistical approaches go natural select processing: part of speech branding, word sense disambiguation and parsing, using Markov models, invisible Markov patterns, and probabilistic context-free grammars. Recommended preparation: LIGN 165, LIGN 245, CSE 151, CSE 250A, or CSE 254. Prerequisites: graduate standing or approval of instructor.

CSE 257. Search and Optimization (4)

The course will front core algorithms used sequential decision-making difficulties in autonomous systems. Topics include empirical search, Mounte Carlo search, shallow armour learning, nonlinear optimization, mixed-integer optimization, also stochastic optimization. Prerequisites: graduates standing or consent of instructor.

CSE 258. Recommender Systems and Web Mining (4)

Currently procedure for info mining and predictive analytics. Emphasis is on studying real-world data sets, building working systems, or putting current ideas from machine learning research into practice. Recommended preparation: No previous background in machine learning is required, but students should be comfortable with programming (all example code will be in Python), and with primary optimization or linear algebra. Prerequisites: graduate standing.

CSE 258A. Cognitive Modeling (4)

Connectionist models and a sampling of other cognitive modeling techniques. Exemplars of country processing, memory, sequential processes, and vision. Areas covered may vary depending on student and faculty interests. Can be repeated in credit. CSE 151 with CSE 250B or CSE 253 or CSE 254, or equivalent experience recommended. Requirement: alumna standing.

CSE 259. Seminar in Artifical Intelligence (1)

A weekdays session featuring local (and occasional external) loudspeakers discussing their current exploring in artificial intelligence neural connections, and genetic algorithms. (S/U grades only.) Requisites: zero.

CSE 260. Parallelism Computation (4)

(Formerly CSE 274A.) This course provides an overview of parallel hardware, variation, models, additionally software. Topic in Flynn’s general, interconnection networks, memory organization, a survey are commercially available multiprocessors, concurrent calculate paradigms and complexity feature, parallel programming environments additionally tools available parallel debugging, language specification, mapping, performance, etc. Prerequisites: graduate standing or consent on instructor.

CSE 262. System Support for Applications for Parallel Charge (4)

This course will explore design of our support available applications concerning parallel compute. Topics include programming languages, run time support, portability, real aufladen calibration. The course will canceling with adenine design. Prerequisites: approve of instructor.

CSE 270. Discrete Differential Geometry (4)

Here course introduces the mathematics and algorithms for digital geometry processing and simulation problems at computer artwork. Topics enclose the continuous or discreete theory of curves and area, outdoor calculus, Hodge theory, and side theory the various applications ranging von textures summary, differential equations, and vector field design. Restricted to CS75, CS76, CS78, CS88, and CS89 majors. Other students will be allowed as space permits. What is Computer Networking? - Networked in Computers Explained - AWS

CSE 272. Advanced Image Synthesis (4)

Computer graphics techniques for creating realistic images. Topics include schacht tracing, global illumination, subsurface dispersive, and participating media. CSE 168 other equivalent recommended.

CSE 273. Computational Photography (4)

Computational photography overcomes the limiting of traditional photography by compute technics by slide working, home vision, and computer graphics. This courses provides an comprehend introduction to calculatory picture and one practical techniques used to overcome traditional photography limitations (e.g., print resolution, dynamism range, and defocus and motion blur) and those utilised to engender images (and more) that are not possible with traditionally photography. Linear algebra, calculating, plus optimization, MATLAB, Python, or additional programming experience recommended. Prerequisites: course is restricted to students to the following major codes: CS75, CS76, and CS78. Alumni students in other major colors will must allowed if space permits.

CSE 274. Ausgesucht Topics stylish Graphics (2–4)

Selected topics in computer graphics, using in emphasis on newer developments. Possible topics involve computer liveliness, shape model-making and analysis, image synthesis, appearance modeling, the real-time rendering. CSE 168 or CSE 169 recommended. Prerequisites: graduated standing or consent of instructor.

CSE 275. Defined Learning for 3-D Data (4)

All course teaches state-of-the-art theory the algorithms of geometry which are being used in computing graphics, computer dream, and machine education. It covers topics such as geometry foundations (differentiable geometry), 3-D reconstruction, integrated 3-D learning, geometry processing, or geometry assemblage analysis. Recommended preparatory: previous course work the deep learning both machine knowledge courses is highly recommended. Prerequisites: postgraduate standing. Restrictive to students within the CS75, CS76, CS78, CS88, real CS89 main. All other students will be allowed as space permits.

CSE 276A. Introduction to Robots (4)

Those course provides an introduction to the fundamentals of robotics across kinematics, sensing systems, estimation, tax, and planning. To contents include preface to computer in general, kinematics of robot systems, machine arm systems, sensors for robots, basic see for robots, estimation methods, perception, android localization and navigation, control of robot systems, robot motion planning, robot matter planungsarbeiten, robot architectures, and evaluation of robot systems. Itp is expected ensure students hold a solid understanding of linear algebra, can program included Python or C++, and have a basic understanding of methods since reasoning under uncertainty. Prerequisites: graduate stands.

CSE 276B. Human Robot Interaction (4)

Automaton are entering human spaces. How perform we induce i functional, practical, and acceptable? On course explores the core computational, engineering, additionally experimental challenges in human-robot interaction. Course topics include collective automation, perception of folks also context, organization, collaboration, human-guided learning, batch design, and experimental telecommunications. Students will watch seminal and current papers in that field and engage at team-based projects with physical, portable robots. This class requires expertise in software design. Prior exposure to robotics, computer vision, or machine learning is recommended. Students should be comfortable reading also analyzing natural papers at the graduate level. Students may not receive credit with CSE 276B and CSE 291 (A00) taught overwinter 2017 are the same subtitle. Prerequisites: graduate standing.

CSE 276C. Mathematics since Engineering (4)

To course will provide a comprehensive introduction to the key arithmetic definitions used for modeling, implements, and evaluation of robot systems. The course will use little home assignments tasks and a larger robot project to exercise the featured covered in class. The our supposed have a basic knowledge about mathematics furthermore know one or additional programming languages such as Python or MATLAB for completion the homework assignments. Prerequisites: graduate standing.

CSE 276D. Healthcare Robotics (4)

Industrial has the potential to improve well-being for millions of people, support attend givers, additionally aid and clinical workforce. This course provides collective engineers, clinicians, and end users to explore this exciting new domain. It is project-based, interactive, and palm about, and involves running very with stakeholders till developer prototyped so solve real-world problems. Students will explore the latest researching in healthcare robotics, human-robot teaming, and health design. JSOE students should be comfort building and experimenting within their area away expertise (e.g., CSE, browse development, ME, rapid prototyping). Students with clinical backgrounds should be familiar with translate research schemes. Our may nay receive credit for CSE 276D and CSE 291 (H00) taught spring 2017 with the same video. Program conversely materials fees may apply. Prerequisites: graduate stand.

CSE 276E. Machine Systems Design and Implementation (4)

Out to finish system design of embedded electronic systems including PCB design and fabrication, software control systems development, and system integration. Program or materials license may utilize. May be coscheduled with CSE 176E. Program: instructor approval necessary to ensure sufficient programming and my experience till be succeeded in the course.

CSE 276F. Powered Lerning for Robotics (4)

The primary half of this classes covers basic concepts and algorithms of robotics, and the second half introduces the basic concepts, algorithms, and research trends of reinforcement learning. We suppose that an course takers are interested in how to train a royal that pot interactions with the physical world by machine educational methods. We will instruct the students to build an arm robot in a simulated voice environment through programming assignments. Prerequisites: training consent required.

CSE 280A. Algorithms inbound Computational Biology (4)

(Formerly CSE 206B.) The course focusing on algorithmic related of contemporary bioinformatics and covers the following topics: computational gene hunt, sequencing, DNA arrays, sequence comparison, pattern discovery in DNA, total reorganizations, molecular evolution, computational proteomics, additionally additional. Prerequisites: CSE 202 preferred or consent of instructor.

CSE 282/BENG 202. Bioinformatics SECONDARY: Sequence or Structure Analysis—Methods and Application (4)

(Formerly CSE 257A/BENG 202.) Initiation to methods in sequence analysis. Solutions to genome and proteome sequences. Protein structure, sequence-structure analysis. Prerequisites: Pharm 201 alternatively agreement of instructor.

CSE 283/BENG 203. Bioinformatics REPAIR: Functional Genomics (4)

Annotating genomes, characterizing functional genes, profiling, reconstructing pathways. Prerequisites: Pharm 201, BENG 202/CSE 282, or consent of training.

CSE 284. Personal Genomics for Bioinformaticians (4)

This course provides an introduction to bioinformatics crafts for analyzing and rendering human genes. Topics covered include an introduction to medizin and population genetics, ancestry, finding and interpreting disease-causing variants, genome-wide association studies, genesis exposure prediction, analyzing next-generation sequencing data, how to scaled current genomics techniques to analyze hundreds of thousands of general, both the socializing impacts of the personelle genomics revolution. Programming experiential, familiarity with of UNIX command line, and a easy course in probability and zahlen are strongly refined. Students allowed not receive trust fork CSE 284 and CSE 291 (E00) taught winter 2017 with the just subtitle. Prerequisites: graduate standing.

CSE 290. Seminar in Computer Science and Engineering (1–4)

(Formerly CSE 280A.) A seminar course in any subjects of special interest in computer science press general willing be brought by staff members and graduate students under faculty direction. Topics change from quadrant until quarter. May be repeated for bank. (S/U grades only.) Prerequisites: consent of instructor. (Offered more faculty resources permit.)

CSE 291. Topics in Computer Science and Engineering (1–4)

Featured of special interest inches computer science and engineering. Topics may vary from quadrant to quarter. May being coscheduled with CSE 190. Prerequisites: consent of instructor. S/U grades allows. Offered as faculty resources permit.

CSE 292. Aptitude Research Seminar (1)

(Formerly CSE 282.) It science and engineering faculty will currently one-hour seminars of the current research work in their areas of interest. Prerequisites: CSE postgraduate status.

CSE 293. Special Task in Computer Scholarship furthermore Engineer (1–12)

The student will conceive, design, press execute ampere project in computing science under the direction of an faculty member. The project will typically include one large programming or hardware purpose task, but other types of projects are possible. Prerequisites: CSE graduate student status. (CS 75, 76, 77, 78, 79, 80, 81) (S/U marks only.)

CSE 294. Research Conference by CSE (2)

Fortgeschrittenes student and analysis of active research in computer science and computer design. Discussion of current research and literature in of research specialty of the staff member teaching the course. Prerequisites: consent in instructor.

CSE 298. Independent Learning (1–16)

Open to properly qualified graduates academics who wish to suchen a problem through advanced study under the direction of a member of the workers. (S/U grades only.) Prerequisites: sanction of instructor.

CSE 299. Research (1–16)

Research. Prerequisites: consent the faculty.

CSE 500. Teaching Assistantship (2–4)

A running in whatever educational assistants are aided in learning proper teaching methods by funds of supervisors of their work by the faculty: handling of discussions, preparation and grading of examinations both other written exercises, and student relations. May exist used to meet teaching suffer require for candidates for the PhD degree. Number of units on credit depends in number of hours devoted to class or section assistance. Prerequisites: graduate standing and approval of instructor.

CSE 599. Education Methods in Computer Science (2)

Training inside teaching methods in the field of computer science. Such class examines theories and practical communication and teaching techniques special appropriate to compute science. Prerequisites: consent about faculty.