|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
(3:3:0) Introduces the theory and practice for software development and covers software requirements, analysis, software architecture and detailed design.
-
3.00 Credits
(3:3:0) Introduces how to implement effective test and measurement programs as well as how to apply this knowledge to the production of low-defect software.
-
3.00 Credits
(3:3:0) Introduction to the architecture, organization, and design of computer systems. Topics include processor, control and memory design, computer arithmetic, I/O, and a brief introduction to multiprocessors.
-
3.00 Credits
(3:3:0) Networks in the context of parallel and distributed systems. Information theory applied to networks. Network topology. Problems and approaches in design, development, and management of communications networks.
-
3.00 Credits
(3:3:0) Introduction to distributed systems. Topics include communications, distributed operating systems, fault-tolerance, and performance issues. Case studies and term projects supplement this course.
-
3.00 Credits
(3:3:0) Introduction to parallel processing in theory, performance evaluation of parallel machine-algorithm ensemble, parallelization techniques of sequential codes, parallel algorithm design, and parallel API.
-
3.00 Credits
(3:3:0) Introductory course to methodologies for specifying, designing, and modeling fault-tolerant computer systems. Includes fault classification, design techniques for fault detection and recovery, and reliability modeling techniques.
-
3.00 Credits
(3:3:0) Theoretical analysis of algorithms for sorting, searching, sets, matrices, etc.; designing efficient algorithms for data structures, recursion, divide-and-conquer, dynamic programming; nondeterminism, NP-completeness and approximation algorithms.
-
3.00 Credits
(3:3:0) Structured grammars, relation between grammars and automata, deterministic, and nondeterministic finite automata, push-down store, and linear-bounded automata, and Turing machines.
-
3.00 Credits
(3:3:0) An introduction to mathematical logic. The course includes proofs of several basic theorems and discusses the application of logic to different areas of computer science.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|