Sinusoidal steady-state analysis. Power in AC circuits. Linear and ideal transformers. Laplace transform methods and circuit analysis applications. Passive and active frequency-selective circuits. Fourier methods. Overview of discrete-time analysis.

The first course in software engineering, covering the software life cycle, proper selection of data structures and algorithms, and the availability and choice of programming paradigms for appropriate design and implementation of well-engineered software. An open laboratory and significant programming experiences form an integral part of this course.

Overview of computer system design. Cost and performance specification. Design of arithmetic and logic units. Fundamentals of central processor architecture and a comparative study of computer instruction set architectures. Detailed study of microprocessors, including instruction execution timing and other timing considerations. Discussions of memory and I/O devices, including the interfaces to the CPU and I/O transfer techniques. Study of common bus standards.

Presents advanced software engineering concepts in the context of object-oriented analysis and design. Topics include: concept of object-orientation, UML modeling techniques, use of CASE tools, use-case requirement analysis, modeling with classes, object-oriented design, design patterns, software quality, testing and correctness, sofware reuse and aspect-oriented software engineering.

Explores advanced topics in computer programming. Topics may include: design patterns, advanced graphical components, software component models such as Java Beans, the Java Security model, Java and databases, servlets, Java Server Pages and Enterprise Java Beans.

Examines the relationship of software testing to quality, emphasizing testing techniques and the role of testing in the validation of system requirements. Topics include: module and unit testing, integration, walkthroughs and inspections, verification and validation, preventing and detecting errors, selecting and implementing project metrics, and defining test plans and strategies traced from system requirements.

Introduction to the algorithms analysis. Topics to be covered include: the concepts of time and space complexity, advanced data structures, general issues in problem solving methodologies, greedy algorithms, dynamic programming, graph algorithms, AI-related algorithms, and an introduction to NP-completeness theory.

Course content is announced prior to each semester. Students may enroll in the course more than once because subject matter changes. COEN design elective.

Overview of computer system design. Cost and performance specification. Design of arithmetic and logic units. Fundamentals of central processor architecture and a comparative study of computer instruction set architectures. Detailed study of microprocessors, including instruction execution timing and other timing considerations. Discussions of memory and I/O devices, including the interfaces to the CPU and I/O transfer techniques. Study of common bus standards.

This course introduces students to embedded systems, the types of hardware that can support such systems, and the interfacing used in embedded systems. The course is a combined laboratory and lecture course, which directly applies the embedded systems techniques using hardware description and assembly languages to field programmable gate array technology.

Review of basic computer architecture. Evaluation of architecture performance. Design and evaluation of instruction sets. Pipeline processors and instruction scheduling. Vector processors. Memory hierarchy and design including cache, main and virtual memories. Memory protection schemes. Input/output and its relation to system performance.

Course content is announced prior to each semester. Students may enroll in the course more than once because subject matter changes. COEN design elective.

A variety of relevant topics are discussed, including communication network architecture, networking protocols, error control, media access control, routing, addressing, congestion/flow control, TCP and UDP, cryptography, authentication and VPNs.

Introduces the fundamental concepts of operating systems together with the basics of networking and communications including: memory management, scheduling, concurrent processing, device management, file systems, networking, security and system performance. Examples are drawn from legacy and modern operating systems.

Introduction to computer graphics algorithm design and implementation; includes considerable actual computer graphics experience. Topics include: point-plotting and line-drawing techniques, two-dimensional curve fitting, two-and three-dimensional graphics, clipping, windowing, hidden line removal, modeling, input-output devices, and other topics as future trends dictate.

Introduction to the important issues in computer security, including cryptography, program security, operating system security, database security, and network security. Also discusses the legal, ethical and privacy issues that arise in computer security. Programming projects enable the student to practice implementing many of the security measures discussed in class.

Provides a broad exposure to intelligent systems, including related fields such as artificial and computational intelligence. Topics include: intelligent agents, search, game playing, propositional logic and first-order predicate calculus, uncertainty, learning, communication and perception and philosophical foundations of intelligent systems.

Concepts of artificial neural network architectures and training algorithms, supervised and unsupervised learning, linear and non-linear neural networks, feedback neural networks, applications in scientific and engineering areas, fundamentals of fuzzy sets and fuzzy logic, fuzzy rules and inference systems, fuzzy pattern classification and clustering analysis and fuzzy control systems.

Covers a set of search methods based on the Darwinian principle of survival of the fittest. The methods include genetic algorithms, evolutionary strategies and evolutionary and genetic programming, which have been successfully applied to many different problem domains including optimization, learning, control, and scheduling. Provides students with the background and knowledge to implement various evolutionary computation algorithms, discusses trade-offs between different evolutionary algorithms and other search methods, and discusses issues related to the application and performance evaluation of evolutionary algorithms.

Course content is announced prior to each term. Students may enroll in the course more than once because subject matter changes. Depending upon the subject matter and the instructor, the class may be taught in traditional lecture format or as a seminar which focuses on readings from the current literature. Possible topics include advanced hardware (MPP, EPIC, VLIW), advanced software (enterprise systems, embedded software, real-time software) and advanced intelligent systems.

Course content focuses on a structured product design and development process that includes project definition, customer needs identification, product specification, concept generation and concept selection. Also focuses on issues related to teamwork, project management and effective communication. Student team design projects culminate in the development of a technically and economically viable concept and a proposal for future development of this concept (done in the second semester of this two-course sequence). 2 hr. lec., 1 hr. disc.; Co-op students, Jr. stndg. Cross-listed with BIEN 4920, ELEN 4920 and MEEN 4920.

Undergraduate independent study project of either a theoretical or experimental nature., 3.000 GPA, cons. of instr., and cons. of dept. ch.

Focus on detailed design, prototyping and testing design concepts. Includes topics directly relevant to student design projects and careers in the engineering profession. Student team design projects culminate in a final report that documents the performance and details (engineering drawings and/or documentation) of their final design. 2 hrs. lec., 1 hr. disc.