Course # |
Title |
Fall |
Winter |
Spring |
| CSE 21 |
Introduction to Computer Science I |
(250)
|
(130)
|
0
|
|
First of a three-quarter introductory course. Introduces fundamental concepts related to computer software design and construction. Develops initial design and programming skills using a high-level programming language (primarily C++/Java). Introduces useful computer-based tools for analysis, expression, discovery. Same as ICS 21. Only one course from CSE21/ICS 21 and ICS H21 may be taken for credit.
|
Course # |
Title |
Fall |
Winter |
Spring |
| CSE 22 |
Introduction to Computer Science II |
(50)
|
(250)
|
(80)
|
|
Second of a three-quarter introductory sequence. Abstract behavior of classic data structures (stacks, queues, priority queues, tables, trees), alternative implementations, analysis of time and space efficiency. Recursion. Object-oriented and functional programming. Models of computation. SEE CATALOGUE FOR PREREQUISITES.
|
Course # |
Title |
Fall |
Winter |
Spring |
| CSE 23 |
Fundamental Data Structures |
(80)
|
(50)
|
(250)
|
|
Focuses on implementation and mathematical analysis of fundamental data structures and algorithms. Covers storage allocation and memory management techniques. SEE CATALOGUE FOR PREREQUISITES.
|
Course # |
Title |
Fall |
Winter |
Spring |
| CSE 31 |
Introduction to Digital Systems |
(110)
|
0
|
(50)
|
|
Digital representation of information. Specifications of combinational and sequential systems. Analysis and design of networks of gates and flip flops. Standard modules and their use. Introduction to algorithmic systems: datapath and control. SEE CATALOGUE FOR PREREQUISITES.
|
Course # |
Title |
Fall |
Winter |
Spring |
| CSE 112 |
Electronic Devices and Circuits |
(80)
|
0
|
0
|
|
Semiconductor properties, carrier transport, P-N junctions, metal-semiconductor junctions, diodes, MOS transistors, transistor equivalent circuits, amplifiers, invertors, digital circuits, CMOS circuits, and logic gates. SEE CATALOGUE FOR PREREQUISITES.
|
Course # |
Title |
Fall |
Winter |
Spring |
| CSE 121 |
Software Tools and Methods |
(80)
|
(80)
|
0
|
|
Concepts and techniques of constructing software in a systematic fashion, including detailed design techniques, specifications, programming methods, quality-inducing procedures, development tools, team techniques, testing, estimation, and performance improvement. Laboratory work involves exercises to illustrate important concepts, methods, and tools. SEE CATALOGUE FOR PREREQUISITES.
|
Course # |
Title |
Fall |
Winter |
Spring |
| CSE 135A |
Digital Signal Processing |
(49)
|
0
|
0
|
|
Nature of sampled data, sampling theorem, difference equations, data holds, z-transform, w-transform, digital filters, Butterworth and Chebychev filters, quantization effects. SEE CATALOGUE FOR PREREQUISITES.
|
Course # |
Title |
Fall |
Winter |
Spring |
| CSE 141 |
Concepts in Programming Languages I |
(130)
|
(130)
|
0
|
|
In-depth study of several contemporary programming languages stressing variety in data structures, operations, notation, and control. Examination of different programming paradigms, such as logic programming, functional programming and object-oriented programming; implementation strategies, programming environments, and programming style. SEE CATALOGUE FOR PREREQUISITES.
|
Course # |
Title |
Fall |
Winter |
Spring |
| CSE 142 |
Compilers and Interpreters |
(130)
|
0
|
(130)
|
|
Introduction to the theory of programming language processors covering lexical analysis, syntax analysis, semantic analysis, intermediate representations, code generation, optimization, interpretation, and run-time support. SEE CATALOGUE FOR PREREQUISITES.
|
Course # |
Title |
Fall |
Winter |
Spring |
| CSE 151 |
Introduction to VLSI |
(80)
|
0
|
0
|
|
A first course in the design of Very Large Scale Integrated (VLSI) systems and chips. Review of CMOS VLSI technology. Analysis and synthesis of basic and complex CMOS gates. Introduction to CAD methodology and usage of CAD Tools. SEE CATALOGUE FOR PREREQUISITES.
|
Course # |
Title |
Fall |
Winter |
Spring |
| CSE 161 |
Design and Analysis of Algorithms |
(80)
|
0
|
(130)
|
|
Time and space complexity of algorithms. Models of computation, techniques for efficient algorithm design, effect of data structure choice on efficiency of an algorithm. Fast algorithms for problems such as sorting, set manipulation, graph problems, matrix multiplication, Fourier transforms, and pattern matching. NP-complete problems. SEE CATALOGUE FOR PREREQUISITES.
|
Course # |
Title |
Fall |
Winter |
Spring |
| CSE 181A |
Senior Design Project |
(50)
|
0
|
0
|
|
Teaches problem definition, detailed design, integration and testability with teams of students specifying, designing, building, and testing complex systems. Lectures include engineering values, discussions, and ethical ramifications of engineering decisions. SEE CATALOGUE FOR PREREQUISITES.
|
