|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
0.00 Credits
A continuation of the study begun in Computer Science 215 of the complexity of algorithms used in computing. The notions of P, NP, and NP-complete problems and of noncomputability will be covered. The algorithms studied will include examples involving sorting, graphs, geometry, and combinatorics. Theoretical aspects of algorithms will be studied as well as practical aspects useful in writing programs. Prerequisite: C- or better in Computer Science 215L and either Computer Science 203 or Mathematics 205 (or concurrent enrollment in 203 or 205). 1.00 units, Lecture
-
0.00 Credits
An introduction to the principles and practices of local area and wide area networking. Topics include the study of the layers of computer networking, network configurations, protocols, security, and reliability. Issues related to implementing networking configurations will be studied. Prerequisite: C- or better in Computer Science 215L and either Computer Science 203 or Mathematics 205 (or concurrent enrollment in 203 or 205). 1.00 units, Lecture
-
0.00 Credits
The study of issues involved in developing large-scale software systems. Topics covered include software life cycle, system design and specification, advanced programming concepts, and techniques for software testing, debugging, and maintenance. The issues studied will be applied to team projects. Prerequisite: C- or better in Computer Science 215L and either Computer Science 203 or Mathematics 205 (or concurrent enrollment in 203 or 205). 1.00 units, Lecture
-
0.00 Credits
A study of basic principles and research methods in artificial intelligence. The course exposes students to selected topics in the field including pattern recognition, problem solving, theorem proving, knowledge representation, and natural language understanding by computers. The course will draw on recent advances made by cognitive scientists in each of these applications. Students are expected to study the theoretical background of an application. They will also complete several programming and simulation assignments during the semester. Prerequisite: C- or better in Computer Science 215L and either Computer Science 203 or Mathematics 205 (or concurrent enrollment in 203 or 205). 1.00 units, Lecture
-
0.00 Credits
The study of the fundamental concepts involved in designing computations capable of executing in an environment composed of multiple, distinct computers. Topics covered include: virtual time and global states, synchronization, data consistency, distributed computing models and paradigms, deadlock and fault tolerance. Prerequisite: Computer Science 230. 1.00 units, Lecture
-
0.00 Credits
A study of the use of language theory and automata theory in the design and construction of compilers. Topics to be discussed include lexical analysis, parsing, symbol tables, syntax trees, storage allocation, error recovery, translation systems, code generation, and optimization. Students will practice programming by writing a portion of a compiler for a subset of ALGOL, Pascal or some other language. Prerequisite: C- or better in Computer Science 230 (Machine Organization) or 316 (Programming Languages). 1.00 units, Lecture
-
0.00 Credits
Principles of database systems, including such topics as data independence, storage structures, relational data models, network data models, security, and integrity. A programming project may be required. Prerequisite: C- or better in Computer Science 215L and either Computer Science 203 or Mathematics 205 (or concurrent enrollment in 203 or 205). 1.00 units, Lecture
-
0.00 Credits
This course will introduce various programming models and techniques for multiprocessors. Students will design, implement, and evaluate parallel algorithms for solving complex problems that demand high computational speed. Topics covered include parallel machine architecture, analysis of parallel algorithms, load balancing, and various parallel algorithms including sorting, searching, linear systems, and image processing. Prerequisite: C- or better in CPSC 215 and one semester of calculus ( MATH 131) 1.00 units, Lecture
-
4.00 Credits
No Course Description Available. 4.00 units, Independent Study
-
1.00 Credits
No Course Description Available. 1.00 units, Lecture
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|