|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
A studio course with an interactive learning style that utilizes a lab of over 139 routers, switches, and firewalls. Configuration labs include: Virtual Private Network (VPN) tunnels; Network Address Translation (NAT); Class-Based Weighted Fair Queuing over Frame Relay; Inter-VLAN routing, Multi-Layer Switching, and Quality of Service for Voice-Over-IP (VOIP). Self-paced video demonstrations are used in conjunction with hands-on lab experiences. Prerequisites/Corequisites: Prerequisite: CSCI 4650. When Offered: Fall and Spring terms annually. Credit Hours: 4
-
4.00 Credits
A studio course with an interactive learning style. Students download tools to compromise ("hack") a network. Students will then set up defense strategies in an extensive lab of advanced routers and PIX firewalls. Configuration will include: IPSec, VPN tunnels, Authentication, Authorization, and Accounting (AAA), TACACS+ and RADIUS, Intrusion Detection, Context- Based Access Control (CBAC), Nested Object groups, Attack Guards, and Shunning. Self-paced video demonstrations are used in conjunction with hands-on lab experiences.Prerequisites/Corequisites: Prerequisite: CSCI 4650. When Offered: Spring term annually. Credit Hours: 4
-
4.00 Credits
A survey of numerical methods for scientific and engineering problems. Topics include numerical solution of linear and nonlinear algebraic equations, interpolation and least squares approximations, numerical integration and differentiation, eigenvalue problems, and an introduction to the numerical solution of ordinary differential equations. Emphasis is placed on efficient computational procedures including the use of library and student written procedures using high-level software such as MATLAB. Prerequisites/Corequisites: Prerequisites: CSCI 1100 and MATH 2010 or ENGR 1100. Corequisite: MATH 2400. When Offered: Fall term annually. Cross Listed: Cross-listed as MATH 4800. Students cannot obtain credit for both this course and MATH 4800. Credit Hours: 4
-
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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|