|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Study of both traditional and alternative computer architectures. Introduction to digital logic, microcode, Von Neumann architectures, data representations, fetch/execute model, RISC/CISC, instruction formats and addressing, machine and assembly language, memory architecture and algorithms, I/O architecture, and elements of distributed systems. Includes formal laboratory work. Prerequisite: Computer Science 201 or permission of the instructor. COAHRAN, WALKER.
-
4.00 Credits
Study of the principal components of typical operating systems and an introduction to parallel algorithms. Topics from operating systems: storage management, scheduling, concurrent processing, synchronization, data protection, and security. Discussion of models of parallelism and algorithms for problems in such areas as lists, trees, searching, sorting, graphs, geometry, and strings. Includes formal laboratory work. Prerequisite: Computer Science 201 or permission of the instructor. DAVIS, WALKER.
-
4.00 Credits
Study of software life cycle and its consequences. Consideration of various algorithms with an emphasis on strategies that can be applied. Emphasis on design, coding, testing, and documenting of large software packages through work on a large project. Prerequisite: Computer Science 152, or 153, or permission of instructor. STAFF.
-
4.00 Credits
An introduction to current principles, approaches, and applications of artificial intelligence, with an emphasis on problem-solving methods, knowledge representation, reasoning with uncertainty, and heuristic search. Study of a range of AI approaches, such as rule-based systems, neural networks, and systems for machine learning. Review of several applications areas such as game playing, natural language processing, robotics, theorem proving, and perception. Prerequisite: Computer Science 152, or 153, or permission of instructor. J. STONE, WALKER. *Offered in alternate years.
-
4.00 Credits
Study of structures used to organize data and of the algorithms used to manipulate these structures. Assignments to implement data structures and to use them in computer science and other applications programs. Emphasis on mathematical principles behind the data structures. Prerequisite: Computer Science 152, or 153, and Mathematics 218; or permission of instructor. STAFF.
-
4.00 Credits
Description and analysis of key issues in the design, syntax, semantics, and implementation of programming languages, with examples from several highlevel languages, illustrating important paradigms (functional, object-oriented, imperative, declarative). Additional topics may include denotational semantics, type-inference algorithms, program verification, and the lambda calculus. Prerequisite: Computer Science 301 or permission of instructor. STAFF.
-
4.00 Credits
Also listed as Mathematics 341. A formal study of computational devices, their related languages, and the possibility and difficulty of computations. Examples are pushdown automata and Turing machines, context-free languages and recursively enumerable sets, and the halting problem and NP-completeness. Prerequisite: Computer Science 152, or 153, and Mathematics 218; or permission of instructor. J. STONE, WALKER.
-
4.00 Credits
Study of traditional and modern techniques for implementation of high-level languages, through either interpretation or translation to low-level languages. Topics include formalisms for describing syntax and semantics of languages, theory of parsing, regular expressions, intermediate languages, and optimization. Students construct interpreters or compilers for high-level languages. Includes formal laboratory work. Prerequisite: Computer Science 201 or permission of instructor. REBELSKY, J. STONE.
-
4.00 Credits
This course focuses on the communications protocols used in computer networks: their functionality, specification, verification, implementation, and performance. The course also considers the use of network architectures and protocol hierarchies to provide more complex services. Existing protocols and architectures are used as the basis of discussion and study. Includes formal laboratory work. Prerequisite: Computer Science 201 or permission of instructor. STAFF.
-
4.00 Credits
A survey of the basic concepts and methods of analysis used in economics. Application to such policy problems as economic recession, inflation, regulation of industry, poverty and income distribution, financial crises, pollution, and trade restrictions. Prerequisite: none. STAFF.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|