|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Examines current topics related to realistic and representative 3D computer graphics. Topics include curve and surface geometry, solid modeling, ray tracing, radiosity and real-time computer graphics.
Prerequisite:
EECS 2510 FOR LEVEL UG WITH MIN. GRADE OF D- AND EECS 4530 FOR LEVEL UG WITH MIN. GRADE OF D-
-
3.00 Credits
Introduction to Database Systems, Data Modeling, Entity-Relationship Diagrams, The Relational Model, SQL, Relational Algebra, Relational Calculus, Normal Forms (1NF, 2NF, 3NF, BCNF, 4NF, PJNF/5NF), Candidate keys, superkeys, schema decomposition, Functional dependency, Entity and Referential Integrity.
Prerequisite:
EECS 2510 FOR LEVEL UG WITH MIN. GRADE OF D-
-
3.00 Credits
[3 hours] The design of human-computer interfaces and their importance to human-computer interaction. Human engineering, implementation techniques, prototyping, and current and future research areas. Prerequisite: EECS 3550
Prerequisite:
EECS 3350 FOR LEVEL UG WITH MIN. GRADE OF D-
-
3.00 Credits
Techniques for devising efficient computer algorithms. Topics include: divide-and-conquer techniques, dynamic programming, linear programming, graph algorithms, greedy algorithms, NP and P complexity classes, and approximation algorithms for NP complete problems.
Prerequisite:
EECS 2510 FOR LEVEL UG WITH MIN. GRADE OF D AND EECS 4100 FOR LEVEL UG WITH MIN. GRADE OF D-
-
0.00 - 4.00 Credits
Theory and operation of physical electronic devices. Electrical transport in metals, semiconductors and models of BJT's and FET's. Optoelectronic devices and integrated circuits. Laboratory includes hands-on experimentation with basic semiconductor fabrication processes.
Prerequisite:
EECS 3400 FOR LEVEL UG WITH MIN. GRADE OF D-
-
4.00 Credits
CMOS process technologies, CMOS logic families, custom and semi-custom design. Subsystem design of adders, counters and multipliers. System design methods and VLSI design tools.
Prerequisite:
EECS 3400 FOR LEVEL UG WITH MIN. GRADE OF D-
-
3.00 Credits
Examines the inner workings of several cryptographic algorithms, including the discrete math behind them. Introduces operations in a Galois Field, and covers some Prime Number Theory. Symmetric algorithms include Feistel (DES) and non-Feistel (AES) designs; Asymmetric algorithms include Merkle-Hellman and RSA. Block and stream modes are explored, as are cryptographic hash functions, and ECB and Chained modes of encryption.
Prerequisite:
EECS 2520 FOR LEVEL UG WITH MIN. GRADE OF D- AND EECS 3100 FOR LEVEL UG WITH MIN. GRADE OF D-
-
3.00 Credits
Introduces to cyber security, its interdisciplinarity, relation to nation, businesses, society, and people. Discusses cyber security terminologies, technologies, protocols, threat analysis, security principles, security mechanisms, policies, forensics, incidence response and methods/practices to secure systems. Additional real-world security problems are discussed using hands-on experiments.
Prerequisite:
EECS 2110 FOR LEVEL UG WITH MIN. GRADE OF D-
-
3.00 Credits
History and description of the open source movement, who participates, how it works, and why it works. Evolution patterns of open source development, the code itself, and the open source community as a whole. Open source licenses, legal issues, and commercial markets. Survey of real-world implementations.
Prerequisite:
EECS 3550 FOR LEVEL UG WITH MIN. GRADE OF D-
-
3.00 Credits
This course explores the topic of intelligent software agents with a emphasis on hands-on design of adaptive problem-solving agents for environments of increasing complexity ranging from single-agent computer games to complex real-world mult-agent environments.
Prerequisite:
EECS 2510 FOR LEVEL UG WITH MIN. GRADE OF D-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|