|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
No course description available.
Prerequisite:
Separate File
-
3.00 Credits
May include functional, objectoriented, parallel, and logic programming languages; semantics for languages of these kinds; type declaration, inference, and checking (including polymorphic types); implementation issues, such as compilation, lazy evaluation, combinators, parallelism, various optimization techniques. Implementation project required.
Prerequisite:
CSE major, CSE 501 which may be taken concurrently, and CSE 505
-
3.00 Credits
Content varies, including interface issues for networks, embedded systems, education applications, safety and critical systems, graphics and virtual reality, databases, and computer-supported cooperative work.
-
3.00 Credits
Introduction to the probabilistic and statistical techniques used in modern computer systems. Graphical models, probabilistic inference, statistical learning, sequential models, decision theory.
Prerequisite:
either STAT 341 or STAT 391, and graduate standing in computer science, or permission of instructor
-
1.00 Credits
Weekly presentations on current research activities by members of the department. Only Computer Science graduate students may register, although others are encouraged to attend. Credit/no credit only.
-
1.00 Credits
Weekly public presentations on topics of current interest by visiting computer scientists. Credit/no credit only.
-
3.00 Credits
Principles of design of efficient algorithms: recursion, divide and conquer, balancing, dynamic programming, greedy method, data structure selection. Correctness and analysis of algorithms. Examples drawn from problems in sorting, searching, set manipulation, patternmatching, graphs, matrices, polynomials, and integers.
Prerequisite:
CSE major and CSE 326 or equivalent
-
3.00 Credits
Analysis of algorithms more sophisticated than those treated in 521. Content varies and may include such topics as algebraic algorithms, combinational algorithms, techniques for proving lower bounds on complexity, and algorithms for special computing devices such as networks or formulas.
Prerequisite:
CSE major and CSE 521
-
3.00 Credits
Algorithms for discrete computational geometry. Geometric computation, range searching, convex hulls, proximity, Vornoi diagrams, intersection. Application areas include VLSI design and computer graphics.
Prerequisite:
CSE major and CSE 521; recommended: CSE 457 or equivalent
-
3.00 Credits
Design and analysis of parallel algorithms: fundamental parallel algorithms for sorting, arithmetic, matrix and graph problems and additional selected topics. Emphasis on general techniques and approaches used for developing fast and efficient parallel algorithms and on limitations to their efficacy.
Prerequisite:
CSE major and CSE 521
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|