Computer Engineering Program: Introductory Course Information

Many of the courses that are pertinent to CE majors are described below. A shorter but hopefully more practical definition is given. Also the semester(s) the class is normally taught (F=Fall, S=Spring, U=Summer), the professor who normally teaches the class, the presence of a lab, and estimated workload are given.

CS 1010 Introduction to Unix (0.5,FSU)
Description: This is basically an on-line introduction to the CADE lab and Unix. It is self-paced as long as you stay ahead of the rather liberal due dates. The information is useful to those new to Unix. It may not seem useful at the time, but you will be kicking yourself later when you need it and can't remember.
Workload: Light

EE 1020 Problem Solving with Matlab & Methods (0.5,SU) Coreq: EE 1270.
Description: Introduction to Electrical Engineering through programming in Matlab.
Professor: Neil Cotter
Lab: Yes, 3 hour lab
Workload: Light

EE 1270 Introduction to Electrical and Computer Engineering (4,SU) Coreq: EE 1020, MATH 1220, PHYCS 2210.
Description: Basic introduction to analysis methods for analog circuits. Important concepts like Kirchoff's laws, node voltage, mesh currents, Thevenin analysis, superposition, and RC circuits are discussed. A brief overview of op amps is given as well. These concepts are basic and should be understood and mastered by any CE student.
Professor: Neil Cotter
Lab: Yes, 3 hour lab
Workload: Moderate

CS 2010 Introduction to Computer Science I (4,FS) Coreq: CS 1010, MATH 1210.
Description: Introductory programming class. It will be taught in scheme (a lisp variant). Emphasis will be on basic software engineering and program design skills. Basic programming constructs are also discussed.
Professor: Dave Hanscom, Art Lee, Joe Zachary
Lab: Yes, discussion sections.
Workload:Moderate

CS 2020 Introduction to Computer Science II (4,FS) Prereq: CS 2010.
Description:The second introductory programming class. Classical algorithms (including sorting, searching, and graph traversal) and data structures (including stacks, queues, linked lists, trees, hash tables, and graphs) as well as complexity and space requirements are briefly covered. Pointers and memory allocation are discussed with the pertinent subjects.
Professor: Dave Hanscom, Art Lee
Lab: Yes, discussion sections.
Workload:Moderate

CS 2100 Discrete Structures (2,FS) Prereq: CS 2010.
Introduction to propositional logic, predicate logic, formal logical arguments, finite sets, functions, relations, inductive proofs, recurrence relations, graphs, and their applications to Computer Science.
Professor: Kris Sikorski
Lab: No
Workload: Moderate

EE 2270 Fundamentals of Electric Circuits (4) Prereq: EE 1270, 1020; Coreq: MATH 2250, PHYCS 2220.
Descripton: The second basic circuits class. It covers phasor transforms, power in sinusoidal-steady systems, frequency response, filters, Fourier-series methods, Laplace-transform techniques, transformers, and two-port networks. The topics are good for the most part, but some of them are just informational.
Semester(s) taught: F
Professor: Neil Cotter
Lab: Yes, 3 hour lab
Workload: Moderate

EE 2280 Fundamentals of Engineering Electronics (4,S) Prereq: EE 2000.
Fundamentals of electronic circuits and components, network models of amplifiers, basic semiconductor device physics, diodes, bipolar and MOS transistors, basic analog and digital circuit elements, frequency response, feedback and stability. Introduction to computer circuit simulation using PSPICE.
Professor: Arn Stolp
Lab: Yes, 3 hour lab.
Workload: Moderate

CS 3500 Software Practice (4,FS) Prereq: CS 2020.
Practical exposure to the process of creating large software systems, including requirements specifications, design, implementation, testing, and maintenance. Emphasis on software process, software tools (debuggers, profilers, source code repositories, test harnesses), software engineering techniques (time management, code and documentation standards, source code management, object-oriented analysis and design), and team development practice. Much of the work will be in groups and will involve modifying preexisting software systems.
Professor: Bob Kessler
Lab: Yes, discussion sections.
Workload: Moderate\

CS 3510 Advanced Algorithms and Data Structures (3,S) Quantitatively Intensive B.S. Course. Prereq: CS 2020, CS 2100.
Study of algorithms, data structures, and complexity analysis beyond the introductory treatment from CS 2020. Balanced trees, heaps, hash tables, string matching, graph algorithms, external sorting and searching. Dynamic programming, exhaustive search. Space and time complexity, derivation and solution of recurrence relations, complexity hierarchies, reducibility, NP completeness.
Professor: Claudio Silva
Lab: No
Workload: Moderate

CS/EE 3700 Fundamentals of Digital System Design (4,S) Quantitatively Intensive B.S. Course. Prereq: CS 2010, PHYCS 2220.
Techniques for minimizing logic functions and designing common combinational circuits such as decoders, selectors, and adders. Synchronous and asynchronous sequential circuits, state diagrams, Mealy and Moore circuits, state minimization and assignment. Use of software tools for design, minimization, simulation, and schematic capture. Implementation with MSI, LSI, and field programmable gate arrays. Laboratory included.
Professor: Erik Brunvand, Priyank Kalla, Ganesh Gopalakrishnan
Lab: Yes, discussion section
Workload:Moderate/Heavy

CS/EE 3810 Computer Architecture (4,FS) Quantitatively Intensive B.S. Course. Prereq: CS 2020.
An in-depth study of computer architecture and design, from digital logic to operating systems, including topics such as pipelining, memory systems, parallel and serial communication, and interrupts. Performance measures and compilation issues. Computer architectures
Professor:Dave Hanscom
Lab: No
Workload: Moderate

Computer Engineering Program • 50 S. Central Campus Dr. Rm 3417. Salt Lake City, UT 84112 • 801-581-3455 • fax: 801-581-5843 © University of Utah Please send comments to hanscom 'at' cs.utah.edu -- Disclaimer --