ST-Design Project

This course is part of the ECE department's DP123 initiative: Design Projects for 1st, 2nd, and 3rd Year ECE Students. It enables ECE students to design and build hardware and software systems before the senior design project (SDP). Most of the projects are team-based. The projects are guided from concept to final design by the course instructors as well as by ECE seniors acting as project mentors (enrolled in E&C-ENG 497DP). DP123 projects are built in M5, the academic makerspace for ECE undergraduates.

Data Structures & Algorithms

Data structures course using the Java programming language. Basic mathematical, logical, and programming concepts relevant to description and manipulation of information structures such as arrays, lists, trees, graphs, and files; the underlying principles of algorithm design and analysis applied to sorting and searching problems. Prerequisite: grade of C or better in E&C-ENG 122, 201 or equivalent.

Data Structures & Algorithms

Data structures course using the Java programming language. Basic mathematical, logical, and programming concepts relevant to description and manipulation of information structures such as arrays, lists, trees, graphs, and files; the underlying principles of algorithm design and analysis applied to sorting and searching problems. Prerequisite: grade of C or better in E&C-ENG 122, 201 or equivalent.

Data Structures & Algorithms

Data structures course using the Java programming language. Basic mathematical, logical, and programming concepts relevant to description and manipulation of information structures such as arrays, lists, trees, graphs, and files; the underlying principles of algorithm design and analysis applied to sorting and searching problems. Prerequisite: grade of C or better in E&C-ENG 122, 201 or equivalent.

Data Structures & Algorithms

Data structures course using the Java programming language. Basic mathematical, logical, and programming concepts relevant to description and manipulation of information structures such as arrays, lists, trees, graphs, and files; the underlying principles of algorithm design and analysis applied to sorting and searching problems. Prerequisite: grade of C or better in E&C-ENG 122, 201 or equivalent.

Circuit Analysis I

Mathematical models for analog circuit elements. Basic circuit laws and network theorems applied to dc, transient, and steady-state response of first- and second-order circuits. Modeling circuit responses using differential equations and the Laplace transform. Solving RLC networks in both the time and frequency domains. Computer projects and circuit simulations using MATLAB, Excel, and PSpice. Limited to EE and CSE majors. Prerequisites: MATH 132, PHYSIC 151. Corequisite: MATH 331.

Circuit Analysis I

Mathematical models for analog circuit elements. Basic circuit laws and network theorems applied to dc, transient, and steady-state response of first- and second-order circuits. Modeling circuit responses using differential equations and the Laplace transform. Solving RLC networks in both the time and frequency domains. Computer projects and circuit simulations using MATLAB, Excel, and PSpice. Limited to EE and CSE majors. Prerequisites: MATH 132, PHYSIC 151. Corequisite: MATH 331.

Circuit Analysis I

Mathematical models for analog circuit elements. Basic circuit laws and network theorems applied to dc, transient, and steady-state response of first- and second-order circuits. Modeling circuit responses using differential equations and the Laplace transform. Solving RLC networks in both the time and frequency domains. Computer projects and circuit simulations using MATLAB, Excel, and PSpice. Limited to EE and CSE majors. Prerequisites: MATH 132, PHYSIC 151. Corequisite: MATH 331.
Subscribe to