|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
This course presents the underlying theory, concepts, and practice for real-time systems, such as avionics, process control, space travel, mobile computing and ubiquitous computing. The goals of the course include: introducing the unique problems that arise when time constraints are imposed on systems, identifying basic theory and the boundary between what is known today and what is still research, stressing a systems integration viewpoint in the sense of showing how everything fits together rather than presenting a collection of isolated solutions, and addressing multiprocessing and distributed systems. This course also presents some of the basic results from what might be called the classical technology of real-time computing and presents these results in the context of new applications of this technology in ubiquitous/pervasive computer systems.
-
1.00 - 3.00 Credits
Content varies annually, depending on students’ needs and interests. Recent topics included the foundations of computation, artificial intelligence, database design, real-time systems, Internet engineering, and electronic design automation.
-
1.00 - 3.00 Credits
Content varies annually, depending on students' needs and interests. Recent topics included the foundations of computation, artificial intelligence, database design, real-time systems, Internet engineering, and electronic design automation. (S) Prerequisites & Notes Prerequisite: Instructor permission. Credits: 1 to 3
-
3.00 Credits
This course focuses on security as an aspect of a variety of software systems. We will consider software implementations of security related policies in the context of operating systems, networks, and data bases. Topics include: operating system protection mechanisms, intrusion detection systems, formal models of security, cryptography and associated security protocols, data base security, worms, viruses, network and distributed system security, and policies of privacy and confidentiality.
-
3.00 Credits
Introduces the basic principles and mathematics of cryptology including information theory, classical ciphers, symmetric key cryptosystems and public-key cryptosystems. Develops applications of cryptology such as anonymous email, digital cash and code signing.
-
3.00 Credits
This course presents the underlying theory, concepts, and practice for real-time systems, such as avionics, process control, space travel, mobile computing and ubiquitous computing. The goals of the course include: introducing the unique problems that arise when time constraints are imposed on systems, identifying basic theory and the boundary between what is known today and what is still research, stressing a systems integration viewpoint in the sense of showing how everything fits together rather than presenting a collection of isolated solutions, and addressing multiprocessing and distributed systems. This course also presents some of the basic results from what might be called the classical technology of real-time computing and presents these results in the context of new applications of this technology in ubiquitous/pervasive computer systems. (Y) Prerequisites & Notes Prerequisite: CS 333 and 414 with grades of C- or higher. Credits: 3
-
3.00 Credits
This course focuses on security as an aspect of a variety of software systems. We will consider software implementations of security related policies in the context of operating systems, networks, and data bases. Topics include: operating system protection mechanisms, intrusion detection systems, formal models of security, cryptography and associated security protocols, data base security, worms, viruses, network and distributed system security, and policies of privacy and confidentiality. (Y) Prerequisites & Notes Prerequisite: CS 340 and either CS/ECE 457 or CS 414 with grades of C- or higher. Credits: 3
-
3.00 Credits
Introduces the basic principles and mathematics of cryptology including information theory, classical ciphers, symmetric key cryptosystems and public-key cryptosystems. Develops applications of cryptology such as anonymous email, digital cash and code signing. (Y) Prerequisites & Notes Prerequisite: CS 302 with a grade of C- or higher. Credits: 3 Criminal Justice
-
3.00 Credits
Analyzes formal languages, the Chomsky hierarchy, formal computation and machine models, finite automata, pushdown automata, Turing machines, Church’s thesis, reductions, decidability and undecidability, and NP-completeness.
-
3.00 Credits
Analyzes concepts in algorithm design, problem solving strategies, proof techniques, complexity analysis, upper and lower bounds, sorting and searching, graph algorithms, geometric algorithms, probabilistic algorithms, intractability and NP-completeness, transformations, and approximation algorithms.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|