|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Lec 3. Prereq: CSCE 235 and 310. Turing machine model of computation: deterministic, nondeterministic, alternating, probabilistic. Complexity classes: Time and space bounded, deterministic, nondeterministic, probabilistic. Reductions and completeness. Complexity of counting problems. Non-uniformity. Lower bounds. Interactive proofs.
-
3.00 Credits
Lec 3. Prereq: CSCE 310. Review of program language structures, translation, loading, execution, and storage allocation. Compilation of simple expressions and statements. Organization of a compiler including compile-time and run-time symbol tables, lexical scan, syntax scan, object code generation, error diagnostics, object code optimization techniques, and overall design.
-
3.00 Credits
Lec 3. Prereq: CSCE 310. Introduction to the classical theory of computer science. Finite state automata and regular languages, minimization of automata. Context free languages and pushdown automata, Turing machines and other models of computation, undecidable problems, introduction to computational complexity.
-
3.00 Credits
Lec 3. Prereq: CSCE 230 and 310; parallel STAT/MATH 380 or ELEC 305. Credit in CSCE 830 will not count towards a graduate degree in computer science. Architecture of single-processor (Von Neumann or SISD) computer systems. Evolution, design, implementation, and evaluation of state-of-the-art systems. Memory Systems, including interleaving, hierarchies, virtual memory and cache implementations; Communications and I/O, including bus architectures, arbitration, I/O processors and DMA channels; and Central Processor Architectures, including RISC and Stack machines, high-speed arithmetic, fetch/execute overlap, and parallelism in a single-processor system.
-
3.00 Credits
Lec 3. Prereq: CSCE 430; MATH 314; MATH/STAT 380 or ELEC 410. CSCE 432 assumes knowledge of computer architecture, pipelining, memory hierarchy, instruction level parallelism, and compiler principles. High performance computing at the processor level. The underlying principles and micro-architectures of contemporary high-performance processors and systems. State0of0the-art architectural approaches to exploiting instruction level parallelism for performance enhancements. Case studies of actual systems highlight real-world trade-offs and theories.
-
3.00 Credits
Prereq: CSCE 335 or permission. Introduction to VLSI design using metal-oxide semiconductor (MOS) devices primarily aimed at computer science majors with little or no background in the physics or circuitry of such devices. Includes design of nMOS and CMOS logic, data-path, control unit, and highly concurrent systems as well as topics in design automation.
-
3.00 Credits
Lec 3. Prereq: CSCE 310 or equivalent programming experience. CSCE 435/835 is designed for CSCE and non-CSCE students who have an interest in building or programming clusters to enhance their computationally-intense research. Build and program clusters. Cluster construction, cluster administration, cluster programming, and grid computing.
-
3.00 Credits
Lec 3. Prereq: CSCE 351 or 451/851; CSCE 430/830. CSCE 437/837 requires the designing and implementation of a real-life file and storage system. System-level and device-level topics in the design, implementation, and use of file and storage systems. Components and organization of storage systems, disk drive hardware and firmware, multi-disk systems, RAIDs, local distributed and P2P file systems, and low-power designs.
-
3.00 Credits
(3 cr) Lec 3. Prereq: A programming language, MATH 221 and 314. Polynomial interpolation, uniform approximation, orthogonal polynomials, least-first-power approximation, polynomial and spline interpolation, approximation and interpolation by rational functions.
-
3.00 Credits
(3 cr) Lec 3. Prereq: CSCE 340, MATH 221 and 314. Numerical matrix methods and numerical solutions of ordinary differential equations.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|