|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
An introduction to computer system architecture, evolution of computer systems, design of various functions using decoders, multiplexers and programmable logic devices (PLDs). Design and analysis of sequential circuits. Fixed and floating-point data representation. Register transfer language. Design of a basic computer and its programming. Design of hardwired and microprogrammed controllers. A case study of Intel? family of microprocessors and its programming. Prerequisite: CSCI 264. 3 semester hours
-
3.00 Credits
A continuation of CSCI 347 that includes design of I/O systems, memory hierarchy, memory connection to CPU, design of cache memory, virtual memory, memory management hardware, design of computer arithmetic algorithms and their hardware. Introduction to pipelining and RISC architecture, vector processing, and multiprocessor systems. Prerequisite: CSCI 347. 3 semester hours
-
3.00 Credits
This course introduces students to the basic issues of parallel computing including the different models of parallel algorithms and interconnection networks that support them. The concept of message passing is covered. The performance trade-offs among different ways of paralleling an application are discussed, as well as different scientific and engineering applications that can benefit from parallel computing. With the aid of a Beowulf computer cluster, students design and implement parallel programs for a few of the applications. Prerequisite: CSCI 248. 3 semester hours
-
3.00 Credits
A continuation of CSCI 349 Parallel Computing I. More advanced topics of parallel computing are discussed. This course also emphasizes more applications of parallel computing. At the end of the course, every student is required to complete a project for solving some problem pertaining to his/her academic field of study. Prerequisite: CSCI 349. 3 semester hours
-
3.00 Credits
Basic concepts of tree searching, heuristic search, game playing, first order logic knowledge representation, and automated reasoning are introduced in conjunction with a thorough study of programming in LISP. Recursion is emphasized. Logic programming is also discussed. Prerequisite: PHIL 120 and CSCI 248. 3 semester hours
-
3.00 Credits
Various areas of artificial intelligence are introduced including vision processing, natural language processing, advanced and current topics in expert systems, mathematical theorem proving, machine learning, and neural network. Prerequisite: CSCI 355. 3 semester hours
-
3.00 Credits
This is the first course in a two-course sequence in the theory of computing. It covers finite automata and regular expressions including Kleene's theorem. Proofs are stressed. Prerequisite: CSCI 248 and MATH 152. 3 semester hours
-
3.00 Credits
Completion of the study of the Chomsky hierarchy including pushdown automata, context free languages and parsing, Turing machines, and selected topics in computability and decidability. Prerequisite: CSCI 363. 3 semester hours
-
3.00 Credits
Basic concepts of raster graphics algorithms and systems, interactive graphics, geometrical transformations, and 3D viewing. Advanced topics selected from representation of curves, surfaces, and solids; geometric modeling and graphics standards; color models; image synthesis including visible surface determination, shading, illumination, and ray tracing; modeling of texture, growth and change with fractals, grammar-based models, particle systems; animation; image processing and coding methods; high-performance hardware architectures including framebuffer strategies and parallel processing. Prerequisite: CSCI 248. 3 semester hours
-
3.00 Credits
Study of methodologies for the development of large-scale software systems: requirements analysis, system design techniques, implementation, system testing, verification, and maintenance, particularly in a team-programming environment. Prerequisite: CSCI 248. 3 semester hours
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|