|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Topics in computers and computing as related to manufacturing. Topics covered will include networks and distributed systems, software for real-time systems and database management. Term project required. Course cannot apply to major, minor or master's degree in Computer Science.
-
3.00 Credits
3 to a maximum of 6] (Also offered as MA 494 and ARTS 494/594.) A continuation of 394. Students are expected to research and make presentations on advanced topics in CGI. Significant term project required. Not allowed for graduate credit for computer science majors, nor as a technical elective for undergraduate computer science majors.
-
3.00 Credits
Guided study, under the supervision of a faculty member, of selected topics not covered in regular courses. At most 3 hours may be applied toward the CS hour requirement. Note: All prerequisites for graduate level courses require a grade of B or better.
-
3.00 Credits
Covers basic topics in automata, computability and complexity theory, including: models of computation (finite automata, Turing machines and RAMs); regular sets and expressions; recursive, r.e., and non-r.e. sets and their basic closure properties; complexity classes; determinism vs. non-determinism with and without resource bounds; reductions and completeness; practice with NP- and P-completeness proofs; and the complexity of optimization and approximation problems. Prerequisite: 401.
-
3.00 Credits
Efficient problem solving techniques. Connection, search and tour problems. Branch-and-bound and backtracking. Dynamic programming. Developing heuristics. Prerequisite: 561.
-
3.00 Credits
Development of algorithms and data structures for the manipulation of discrete geometric objects in two- and threedimensional space. Typical problems include intersection and union of polyhedra, convex hulls, triangulation, point location, neighborhood structures and path computations. Prerequisite: 561.
-
3.00 Credits
(Also offered as ECE 509.) Design and analysis of parallel algorithms using the PRAM model, with emphasis on graph algorithms, searching and sorting and linear algebra applications. Embedding into hypercubic and related networks. Introduction to parallel complexity theory. Prerequisite: 561 or ECE 537.
-
3.00 Credits
Introduction to probability theory, moments and deviation, tail inequalities, probabilistic method, Markov Chains and Random Walks, dynamic graph algorithms, data stream algorithms, and parallel and distributed algorithms. Prerequisite: 500 and 530 and 561.
-
3.00 Credits
Study of algorithms which have been successful in real world. New algorithmic tools, ways to create approximation algorithms for NP-Hard problems, exploit the power of randomness, and create tractable abstract problems from messy real-world problems. Prerequisite: 530 or 561.
-
3.00 Credits
Covers image synthesis techniques from perspective of highend scanline rendering, including physically-based rendering algorithms. Topics: radiometry, stochastic ray tracing, variance reduction, photon mapping, reflection models, participating media, advanced algorithms for light transport.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|