|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
0.00 - 4.00 Credits
Number representation and Boolean Algebra. Combinational circuit analysis and design. K-map and tabulation methods. Multiplexers, decoders, adders/subtracters and PLD devices. Sequential circuit analysis and design. Registers, counters and recognizers.
-
0.00 - 3.00 Credits
Covers the concept and properties of an algorithm, analysis and decomposition of computational problems, use of modern programming practices. Introduction to arrays and classes. Uses the C++ language.
-
0.00 - 4.00 Credits
Introduces the basics of programming using the Java language. Covers number types, objects, methods, control structures, vectors, files, and inheritance. Utilizes the Java platform to develop GUI interfaces.
Prerequisite:
EECS 1010 FOR LEVEL UG WITH MIN. GRADE OF C-
-
1.00 Credits
Preparation for entry to the professions of Electrical Engineering and Computer Science and Engineering, including ethics and social responsibilities, employment practices, continuing education and professional registration.
-
3.00 Credits
Fundamentals of computer architecture, computer arithmetic, memory systems, interfacing and communication, device subsystems, processor design, cpu organization, assembly programming, performance, distributed models and multiprocessing.
Prerequisite:
EECS 1100 FOR LEVEL UG WITH MIN. GRADE OF D- AND (EECS 1500 FOR LEVEL UG WITH MIN. GRADE OF D- OR EECS 1510 FOR LEVEL UG WITH MIN. GRADE OF D-)
-
0.00 - 4.00 Credits
An introduction to electrical circuit components and laws, including ideal op-amps, DC circuit analysis, AC circuit analysis, transient analysis of RL and RC circuits and computer-aided circuit analysis.
Prerequisite:
PHYS 2140 FOR LEVEL UG WITH MIN. GRADE OF D- (MAY BE TAKEN CONCURRENTLY)
-
3.00 Credits
For students not majoring in EECS. An introduction to electrical circuit components and laws, resistive circuit analysis, AC circuit analysis, phasers, three-phase circuits and computer-aided circuit analysis.
Prerequisite:
PHYS 2140 FOR LEVEL UG WITH MIN. GRADE OF D-
-
0.00 - 4.00 Credits
This course looks at stacks, queues, and lists as well as the order of algorithms used to access and modify these structures. In addition recursion, hashing, sorting, and set representation are examined in depth.
Prerequisite:
EECS 1510 FOR LEVEL UG WITH MIN. GRADE OF C-
-
0.00 - 4.00 Credits
The data structures introduced in EECS 2500 are extended to include trees (binary, balanced, and n-ary), graphs, and advanced sorting techniques. In addition, the C++ language is used as the main vehicle and is introduced in the couse. Students are expected to have a strong background in Java prior to this course.
Prerequisite:
EECS 2500 FOR LEVEL UG WITH MIN. GRADE OF C- AND EECS 2520 FOR LEVEL UG WITH MIN. GRADE OF C- (MAY BE TAKEN CONCURRENTLY)
-
3.00 Credits
An introduction to the discrete structures used in computer science to develop software including proof techniques, Boolean logic, graphs, trees, recurrence relations, functions, combinatorics, and number theory.
Prerequisite:
PHIL 1010 FOR LEVEL UG WITH MIN. GRADE OF D- AND EECS 1510 FOR LEVEL UG WITH MIN. GRADE OF C-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|