|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Mathematics, data structures, algorithms, system architecture and programming projects for implementing two and three dimensional computer graphics software. Rastorization, matrices, linear and projective transformations; clipping, removal of hidden lines and surfaces. Devices, event driven user interaction, and an introduction to window systems and visual programming tools. Prerequisite(s): A Mat 220 (linear algebra) and I Csi 310, or permission of the instructor.
-
3.00 Credits
This course covers the broad spectrum of technical issues surrounding computer security and intrusion detection. Topics considered include: viruses, worms, host- and network-based vulnerabilities and countermeasures, database security, intrusion detection, and privacy and legal issues. Facilities for securing hosts and limiting vulnerability are also discussed. Unlike in a systems administration class, detailed operational issues are not discussed. Prerequisite(s): I Csi 402 or I Csi 400.?May not be offered during 2008-2009.
-
3.00 Credits
The making of ciphers to encode information is the subject of cryptography. This course covers the field from its origins in early historic times through its most up-to-date implementations and uses in digital computers. Various ciphers will be shown and their security assessed. This latter is known as cryptanalysis - the attempt to break a cipher in order to read the underlying message. The course will emphasize how cryptography and cryptanalysis are intimately related, and how the arms race between the two has motivated progress throughout their history. Prerequisite(s): I Csi 333 and co-registration in I Csi 403.?May not be offered during 2008-2009.
-
3.00 Credits
Topics include logical validity, logical consequence, computerized theorem proving, compactness, soundness, consistency, completeness and incompleteness in the context of propositional logic, first order logic, Frege-Hilbert deduction and computerized Semantic Tableaux deduction. This course will survey Goedel's Completeness and Incompleteness Theorems along with decidability, undecidability, and a classification of theoretically computable and uncomputable problems. Prerequisite(s) I Csi 210 plus permission of instructor. May not be offered in 2008-2009.
-
3.00 Credits
A course on data mining (finding patterns in data) algorithms and their application to interesting data types and situations. We cover algorithms that addresses the five core data mining tasks: prediction, classification, estimation, clustering, and associations. Course projects will involve advanced topics such as algorithm developments for handling large data sets, sequential, spatial, and streaming data. Prerequisite(s): I Csi 310.?May not be offered during 2008-2009.
-
3.00 Credits
An introduction to the broad spectrum of approaches and techniques of Artificial Intelligence. Emphasis on how to represent knowledge in a computer and how to process that knowledge to produce intelligent behavior. Topics include expert systems, heuristic search, natural language processing and logic-based approaches. Programming assignments using artificial intelligence languages. Prerequisite(s): I Csi 311.
-
3.00 Credits
Introduction to distributed, shared memory, and non-uniform memory advanced architectures, advanced networks, advanced parallel and distributed languages supporting scientific computing. Basic linear algebra algorithms and their relation to decomposition, memory, access patterns, and scalability. High-level prototyping languages, experimental methods, performance analysis and polyalgorithm design. Prerequisite(s): I Csi 310, I Csi 401, A Mat 220 and knowledge of numerical methods and Fortran; or permission of instructor.
-
3.00 Credits
Numerical methods for ODE's, PDE's and transforms (FFT) suitable for advanced parallel and distributed computing. Explicit versus implicit message generation and processing in distributed computing environments. Advanced experimental methods. High Performance Fortran, F90 and MPI. Prerequisite(s): I Csi 440.
-
3.00 Credits
The main ideas of Quantum Computation, Information, and Simulation are introduced. The course describes what quantum computation is and how it can be used to solve problems faster than classical computers. The challenges of building a quantum computer are addressed. Quantum simulators are explained and built illustrating the vast differences between quantum and classical gates. The course also covers quantum information, explaining how quantum states can be used to program communications. Prerequisite(s): I Csi 403 or 503, knowledge of the use of Boolean Algebra in circuit design, and programming experience.
-
3.00 Credits
The contents of this course will vary from semester to semester. Each offering will cover an advanced senior-level topic in Computer Science. May be repeated for credit when content varies. Prerequisite(s): I Csi 333 (or I Csi 205 & 310) or permission of instructor.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|