2003-2004 College Education by UCI - University of California Irvine

More catalogs by UCI - University of California Irvine | 2003-2004 College Education | 516 pages | 2019-12-11


Page 209 of 2003-2004 College Education

electrical engineering and computer science admissions office the depth examination is conducted during each spring quarter a student must pass the ph.d preliminary examination within two complete academic year cycles after entering the ph.d program a student has only two chances to take and pass the ph.d preliminary examination a student who fails the ph.d preliminary examination twice will be asked to withdraw from the program or will be dismissed from the program and may not be readmitted into the program the ph.d degree is granted upon the recommendation of the doctoral committee and the dean of graduate studies part-time study toward the ph.d degree is not permitted students should be able to complete all requirements for the ph.d within 5-6 years from the date of admission doctoral programs must be completed within seven calendar years courses in computer science and engineering lower-division cse21 introduction to computer science i 6 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 v cse22 introduction to computer science ii 6 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 corequisite or prerequisite ics 6a or mathematics 6a prerequisite cse21/ics 21 with a grade of cor better same as ics 22 only one course from cse22/ics 22 and ics h22 may be taken for credit v cse23 fundamental data structures 4 focuses on implementation and mathematical analysis of fundamental data structures and algorithms covers storage allocation and memory management techniques prerequisites cse22/ics 22 with a grade of c or better or ece40 mathematics 6a or ics 6a same as ics 23 only one course from cse23/ics 23 and ics h23 may be taken for credit v cse25 computing tools for computer science and engineering 2 introduces computer-based mathematical and engineering tool usage and the c programming language prerequisites cse21/ics 21 and mathematics 2a cse31 introduction to digital systems 4 f summer 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 prerequisite cse21/ics 21 eceio or mae10 same as ece31 design units 2 cse31lb introduction to digital logic laboratory 3 w introduction to common digital integrated circuits gates memory circuits msi components operating characteristics specifications and applications design of simple combinational and sequential digital systems such as arithmetic processors game-playing machines construction and debugging techniques using cad tools and breadboards prerequisites cse31/ece31 ece20 or cse22/ics 22 same as ece3ilb design units 3 cse70a network analysis i 4 w summer modeling and analysis of electronic networks basic network theorems sinusoidal steady state and transient analysis of rlc networks and the impedance concept corequisite mathematics 2j or 3d prerequisites physics 7d cse21/ics 21 eceio or maeio same as ece70a design units 1 cse90 systems engineering and technical communications 2 introduces systems engineering concepts including specifications and requirements hardware and software design integration testing and documentation emphasizes organization and writing of reports and effective presentations 207 upper-division cse104 principles of operating systems 4 principles and concepts of process and resource management especially as seen in operating systems processes memory management protection scheduling file systems and 1/0 systems are covered concepts illustrated in the context of several wellknown systems same as ics 143 only one course from csei04/ics 143 and ece142 may be taken for credit cse112 electronic devices and circuits 4 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 prerequisites physics 7d cse7.0a/ece70a design units 1 cse120a discrete-time signals and systems 4 w introduction to discrete-time signals and to difference equation description and analysis of discrete-time linear time-invariant dtlti systems introduction to z-transforms and discrete-time fourier transforms and their application to input-output descriptions analysis and simulation of dtlti systems and digital filters prerequisite cse70aiece70a same as ecei20a design units 0 cse121 software tools and methods 4 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 prerequisites cse90 or ics 52 with a grade of c or better mathematics 6a or ics 6a mathematics 6b mathematics 6c or 3a satisfactory completion of the lower-division writing requirement same as ics 121 cse132 organization of digital computers 4 w building blocks and organization of digital computers the arithmetic control and memory units and input/out devices and interfaces microprogranuning and microprocessors prerequisite cse31lb/ece31lb same as ece132 only one course from csei32/ece132 and ics 152 may be taken for credit design units 4 cse135a digital signal processing 3 f nature of sampled data sampling theorem difference equations data holds z-transform w-transfortn digital filters butterworth and chebychev filters quantization effects prerequisites cse120a/ecei20a ece186 or mathematics 67 for cse majors only same as ecei35a design units 2 cse135b digital signal processing design and laboratory 3 students plan and perform 10 core laboratory exercises covering signal synthesis and analysis with various filter and frequency transform processes models of radio and radar/sonar signal processing are included prerequisite cse135n ecej35a same a ecei35b design units 3 cse141 programming languages 4 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 prerequisites cse23/ics 23 and cse31/ece31 or ics 51 with grades of cor better same as ics 141 cse142 compilers and interpreters 4 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 prerequisite cse141/ics 141 prerequisite for computer engineering majors only ece40 same as ics 142 cse151 introduction to vlsi 4 f 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 prerequisite cse 132 ece132 same as ece151 design units 4 cse161 design and analysis of algorithms 4 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 prerequisites cse23/ics 23 and cse31/ece31 or ics 51 with grades of c or better mathematics 6a or ics 6a same as ics 16 i uc irvine 2003-2004