Lecture: TuTh 9:00 am - 10:20 am / Lab: W 5:00 p m - 7:50 pm
The course covers the following topics: passive circuit elements: resistors, capacitors, inductors. Elements of circuit topology. Kirchhoff’s and Ohm’s law. Nodal and mesh analysis. Equivalent circuits. Steady-state AC circuits. Phasors. Transient analysis. Laplace transforms. Fundamentals of AC power, coupled inductors (transformers).
Introduction to topics in computational mathematics, such as number systems, Boolean algebra, mathematical induction, combinatorics and probability, recursion and graph theory. Algorithm aspects of the topics discussed will be emphasized.
Lecture: MW 2:00 pm - 3:20 pm / Lab: Tu 4:00 p m - 6:50 pm
Introduces basic electrical and computer engineering concepts in a dual approach that includes: laboratories for hands-on wired and computer simulation experiments in analog and logic circuits, and lectures providing concepts and theory relevant to the laboratories. Emphasizes physical insight and applications rather than theory.
Pre- or corequisite: AMS 151 or MAT 125 or MAT 131
Lecture: TuTh 2:30 pm - 3:50 pm / Lab: Th 4:00 p m - 6:50 pm
The course presents fundamental and more advanced C programming concepts. Lectures discuss the C language constructs and exemplify their using in relevant programming applications. The course also introduces fundamental concepts in electrical and computer engineering, such as bitwise operations, text file scanning, stack-based computation, table-based finite state machine implementation, hash tables, and linked lists. Scheduled lab activities focus on devising, implementing, debugging, and validating C programs for the concepts discussed in class. A course project focuses on developing a more extensive C program that comprehensively utilizes the programming concepts discussed during the semester.
Prerequisite(s): Declared Major in Electrical or Computer Engineering
Lecture: TuTh 12:30 pm - 1:50 pm / Lab: Tu 4:00 p m - 6:50 pm
The course presents fundamental data structures and algorithms frequently used in engineering applications. Object oriented programming in C++ is used to teach the concepts. Discussed topics include: programming and applications of data structures; stacks, queues, lists, heaps, priority queues, and introduction to binary trees. Recursive programming is heavily utilized. Fundamental sorting algorithms are examined along with informal efficiency analysis.
Prerequisite(s): Declared Major in Electrical or Computer Engineering, ESE 124
The course covers the following topics: passive circuit elements: resistors, capacitors, inductors. Elements of circuit topology. Kirchhoff’s and Ohm’s law. Nodal and mesh analysis. Equivalent circuits. Steady-state AC circuits. Phasors. Transient analysis. Laplace transforms. Fundamentals of AC power, coupled inductors (transformers).
Prerequisite(s): MAT 127 or MAT 132 or AMS 161
Pre- or corequisite: PHY 127/134 or PHY 132/134 or PHY 142
Introduction to signals and systems. Manipulation of simple analog and digital signals. Relationship between frequencies of analog signals and their sampled sequences. Sampling theorem. Concepts of linearity, time-invariance, causality in systems. Convolution integral and summation; FIR and IIR digital filters. Differential and difference equations. Laplace transform, Z-transform, Fourier series and Fourier transform. Stability, frequency response and filtering. Provides general background for subsequent courses in control, communication, electronics, and digital signal processing.