|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Current research and developments in database management systems. Relational, semantic, object-oriented, real-time, distributed, heterogeneous, and logic databases. Concurrency control, security, active rules, recovery, and integrity subsystems. (Lec. 3, Project 3) Pre: 436 or permission of instructor. In alternate years.
-
4.00 Credits
Algorithm design techniques such as dynamic programming, greedy method, branch and bound. Linear programming; NP-completeness; graph algorithms; number theoretic algorithms; approximation algorithms for NP-complete problems; probabilistic and parallel algorithms. (Lec. 3, Project 3) Pre: 440 or 445. In alternate years.
-
4.00 Credits
Mathematical techniques for the analysis of algorithms. Sums and products; finite difference calculus; properties of binomial coefficients; Stirling, harmonic, and Fibonacci numbers; recurrence relations; generating functions; asymptotic approximation. Case studies. (Lec. 3, Project 3) Pre: 440. In alternate years.
-
4.00 Credits
Finite automata, pushdown automata, formal grammars and Chomsky hierarchy, Turing machines, computability, basics of complexity theory. Advanced topics including some of the following: cryptography, interactive proofs, circuit complexity, completeness for various complexity classes, relations among complexity classes, new models of computation. (Lec. 3, Project 3) Pre: 440 or 445. In alternate years.
-
3.00 Credits
See Mathematics 547.
-
3.00 Credits
Enumeration: generating functions, recurrence relations, classical counting numbers, inclusion-exclusion, combinatorial designs. Graphs and their applications: Euler tours, Hamilton cycles, matchings and coverings in bipartite graphs, the four-color problem. (Lec. 3) Pre: 215 or equivalent. In alternate years.
-
3.00 Credits
See Mathematics 548.
-
3.00 Credits
Topics such as Ramsey theory, Polya theory, network flows and the max-flow-mincut variations, applications in operations research; finite fields and algebraic methods; block designs, coding theory, other topics. (Lec. 3) Pre: 547 or permission of instructor. In alternate years.
-
4.00 Credits
Symbolic mathematical computation; history, use, representation of information, algorithms and heuristics. Big number arithmetic, manipulation of polynomials and rational expressions; algebraic simplification; factoring; symbolic integration. Organization and implementation of computer algebra systems. (Lec. 3, Project 3) Pre: 350, 440. In alternate years.
-
3.00 Credits
Topics of specialized or current interest, which may change. Topics may include expert systems, natural language processing, neural network models, machine learning. AI applications in remote sensing. (Lec. 3) Pre: 481 or permission of instructor. May be repeated with permission. In alternate years.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|