|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Derivation, analysis, and use of computational procedures for solving differential equations. Topics covered include ordinary differential equations (both initial value and boundary value problems) and partial differential equations. Runge-Kutta and multistep methods for initial value problems. Finite difference methods for partial differential equations including techniques for heat conduction, wave propagation, and potential problems. Basic convergence and stability theory. Prerequisites/Corequisites: Prerequisite: MATH 4800 or CSCI 4800. Students who have passed CSCI 1200 cannot register for this course. When Offered: Spring term annually. Cross Listed: Cross-listed as MATH 4820. Credit Hours: 4
-
1.00 - 4.00 Credits
Credit Hours: 1 to 4
-
1.00 - 4.00 Credits
Credit Hours: 1 to 4
-
3.00 Credits
This course discusses modern concepts of computability and computational complexity theories. The Church-Turing thesis; variations of Turing Machines; Algorithms; Decidability; The Halting Problem; Reducibility; The Recursion Theorem; The Concept of Information; Time and Space Complexity; Intractability; NP-completeness and Cook's theorem. Prerequisites/Corequisites: Prerequisite: CSCI 2400 or equivalent. When Offered: Fall term annually. Credit Hours: 3
-
3.00 Credits
Study of the generic programming approach to design and systematic classification of software components. Techniques for achieving correctness, efficiency, and generality of algorithms, data structures, and memory management. Methods of structuring a library of generic software components for maximum usability are practiced in a significant design and implementation project. Prerequisites/Corequisites: Prerequisite: CSCI 2300 or equivalent. When Offered: Fall term annually. Credit Hours: 3
-
3.00 Credits
Introduction to the theory, algorithms, and applications of automated learning (supervised, reinforcement, and unsupervised), how much information and computation are needed to learn a task, and how to accomplish it. Emphasis will be given to unifying approaches coming from statistics, function approximation, optimization, and pattern recognition. Topics include: Decision Trees, Neural Networks, RBF's, Bayesian Learning, PAC Learning, Support Vector Machines, Gaussian processes, Hidden Markov Models. Prerequisites/Corequisites: Prerequisites: familiarity with probability, linear algebra, and calculus. When Offered: Offered on availability of instructor. Credit Hours: 3
-
3.00 Credits
A detailed discussion of issues in distributed operating system design and in computer security. The topics discussed include distributed algorithms, distributed deadlock detection and recovery, distributed concurrency control and synchronization, cryptography, and computer security. If both CSCI 6130 and CSCI 6140 are to be taken, CSCI 6140 should be taken first. Prerequisites/Corequisites: Prerequisite: CSCI 4210 or CSCI 6140. When Offered: Offered on availability of instructor. Credit Hours: 3
-
3.00 Credits
Topics include analysis of multiprogramming systems, virtual memory, computer system performance, and queuing theory. The course also discusses tools for synchronization of parallel programs and algorithms for mutual exclusion. Prerequisites/Corequisites: Prerequisite: CSCI 4210 or permission of instructor. When Offered: Fall term annually. Credit Hours: 3
-
3.00 Credits
Theoretical and empirical analysis of algorithms; tools for on-line monitoring of the algorithm's performance. Advanced algorithms for polynomial problems; randomized heuristic and approximate algorithms. Problems include computation in discrete mathematics, number theory, linear algebra, graph theory, numerical and symbolic computing. Prerequisites/Corequisites: Prerequisite: CSCI 4020 or equivalent. When Offered: Fall term annually. Credit Hours: 3
-
3.00 Credits
Models of parallel computation; deterministic and probabilistic PRAM model; P-complete problems. Techniques for designing efficient parallel algorithms. Parallel sorting prefix and suffix computation, list ranking, DAG evaluation, solving linear systems, graph and combinatorial problems. Prerequisites/Corequisites: Prerequisite: CSCI 4020 or equivalent. When Offered: Offered on availability of instructor. Credit Hours: 3
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|