|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Lexical analysis, syntactic analysis, intermediate code generation, object code generation, optimization, memory use, generators for scanners and parsers.
-
3.00 Credits
Data communications and computer networks. An in-depth treatment of network architectures and protocols for both WANS and LANS. Topics include: network routing and flow algorithms, internet working, and distributed systems.
-
3.00 Credits
Design and implementation of software for real-time computer systems. Survey of typical real-time systems; techniques for code-conversion, error checking, and transmission monitoring.
-
3.00 Credits
An in-depth study of hardware and software techniques used in computer graphics. Study of display and entry devices, including refresh, storage, and raster scan topics. Software techniques will include display files, windowing, clipping, two and three-dimensional transformations, and hidden-surface removal.
-
3.00 Credits
Analytic and simulation models developed using deterministic and stochastic techniques. Topics include: event-driven simulations, queuing theory, Markov processes, and dynamical systems. "Real World" project required.
-
3.00 Credits
Mathematical preliminaries, solving linear systems numerical solution of ordinary and partial differential equations.
-
3.00 Credits
Introduction to basic concepts, implementation techniques, and philosophies of artificial intelligence and intelligent systems. Introduction to expert systems, fuzzy logic systems, neural networks, and techniques for artificial intelligence programming. The fundamentals of an AI programming language (LISP or PROLOG) will be presented. The language will then be used to solve problems in typical AI applications.
-
3.00 Credits
No course description available.
-
3.00 Credits
Classification and analysis of algorithms including recursive, divide and conquer, greedy, etc. Data structures and algorithms design and performance. Run time and main storage complexity analysis. Performance evaluation measurements will be discussed and popular benchmarking techniques reviewed. P, NP, and NP complete complexities will be discussed.
-
3.00 Credits
Mathematical preliminaries, languages, context-free grammars, parsing, normal forms, finite automata, regular languages, pushdown automata, Turing machines.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|