|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Analyzes modern software engineering practice for multi-person projects; methods for requirements specification, design, implementation, verification, and maintenance of large software systems; advanced software development techniques and large project management approaches; project planning, scheduling, resource management, accounting, configuration control, and documentation.
-
3.00 Credits
Includes the organization and architecture of computer systems hardware; instruction set architectures; addressing modes; register transfer notation; processor design and computer arithmetic; memory systems; hardware implementations of virtual memory, and input/output control and devices. Cross-listed as ECE 333.
-
3.00 Credits
Analyzes modern software engineering practice for multi-person projects; methods for requirements specification, design, implementation, verification, and maintenance of large software systems; advanced software development techniques and large project management approaches; project planning, scheduling, resource management, accounting, configuration control, and documentation. (Y) Prerequisites & Notes Prerequisite: CS 216 with a grade of C- or higher. Credits: 3
-
3.00 Credits
Introduces the analysis of algorithms and the effects of data structures on them. Algorithms selected from areas such as sorting, searching, shortest paths, greedy algorithms, backtracking, divide- and-conquer, and dynamic programming. Data structures include heaps and search, splay, and spanning trees. Analysis techniques include asymtotic worst case, expected time, amortized analysis, and reductions between problems.
-
3.00 Credits
Analyzes process communication and synchronization; resource management; virtual memory management algorithms; file systems; and networking and distributed systems. (Y) Prerequisites & Notes Prerequisite: CS 216 and CS 333 with grades of C- or higher. Credits: 3
-
3.00 Credits
Presents the fundamental concepts of programming language design and implementation. Emphasizes language paradigms and implementation issues. Develops working programs in languages representing different language paradigms. Many programs oriented toward language implementation issues. (Y) Prerequisites & Notes Prerequisite: CS 216 with grade of C- or higher. Prerequisite: CS 216 with grade of C- or higher. Credits: 3
-
3.00 Credits
Introduces artificial intelligence. Covers fundamental concepts and techniques and surveys selected application areas. Core material includes state space search, logic, and resolution theorem proving. Application areas may include expert systems, natural language understanding, planning, machine learning, or machine perception. Provides exposure to AI implementation methods, emphasizing programming in Common LISP. (Y) Prerequisites & Notes Prerequisite: CS 216 with grade of C- or higher. Credits: 3
-
3.00 Credits
Focuses on techniques for software design in the development of large and complex software systems. Topics will include software architecture, modeling (including UML), object-oriented design patterns, and processes for carrying out analysis and design. More advanced or recent developments may be included at the instructor’s discretion. The course will balance an emphasis on design principles with an understanding of how to apply techniques and methods to create successful software systems.
-
3.00 Credits
Introduces the analysis of algorithms and the effects of data structures on them. Algorithms selected from areas such as sorting, searching, shortest paths, greedy algorithms, backtracking, divide- and-conquer, and dynamic programming. Data structures include heaps and search, splay, and spanning trees. Analysis techniques include asymtotic worst case, expected time, amortized analysis, and reductions between problems. (Y) Prerequisites & Notes Prerequisite: CS 202 and 216 with grades of C- or higher. Credits: 3
-
3.00 Credits
Focuses on the techniques for designing and analyzing dependable computer-based systems. Topics include fault models and effects, fault avoidance techniques, hardware redundancy, error detecting and correcting codes, time redundancy, software redundancy, combinatorial reliability modeling, Markov reliability modeling, availability modeling, maintainability, safety modeling, trade-off analysis, design for testability, and the testing of redundant digital systems. Cross-listed as ECE 434. (Y) Prerequisites & Notes Prerequisite: CS 333, APMA 213, APMA 310, with grades of C- or higher, or instructor permission. Credits: 3
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|