|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Three Credits Alternate Years: Spring 2010, 2012 The basics of computer organization, architecture and assembly language. Instructions sets, address modes, and the run/time stack are explored by programming on a RISC machine. CPU and ALU design, performance analysis, pipelining, cache, virtual memory are examined. Trade-offs between RISC, CISC and advanced architectures is discussed. Assumes basic knowledge of digital logic. Prerequisite: CS 221.
-
3.00 Credits
Three Credits Alternate Years: Fall 2008, 2010 Basic algorithm techniques: recursion, dynamic programming, greedy method branch and bound. Analysis of algorithms: recurrence equations, NP-completeness, asymptotic complexity. Applications include graph and combinatorial algorithms. Prerequisites: CS 201 and CS 211.
-
3.00 Credits
Three Credits Alternate Years: Fall 2009, 2011 Finite automata and lexical analysis, context free grammars, top down and bottom up parsing, syntax directed translation, symbol table techniques, runtime storage administration, code generation, optimization. Prerequisite: CS 211.
-
3.00 Credits
Three Credits Alternate Years: Spring 2009, 2011 Process management, concurrency, virtual storage organization, processor management, auxiliary storage management, operating system performance. Prerequisite: CS 211.
-
3.00 Credits
Three Credits Alternate Years: Fall 2009, 2011 Formal language concepts including syntax and basic characteristics of grammars. Control structures, data flow, run-time considerations. Scripting, Functional, and Logic languages. Prerequisite: CS 211.
-
3.00 Credits
Three Credits Alternate Years: Spring 2009, 2011 Data Modeling using the Entity-Relationship approach. The Relational Model and Relational Algebra. SQL. Functional dependencies and normalization. Database design Process. Record storage and primary file organization. Index structures for files. Concurrency control techniques. Prerequisite: CS 211 or consent of the Instructor.
-
3.00 Credits
Three Credits Not Offered 2008-2009 Introduction to artificial intelligence. Knowledge representation. Natural language processing. Deduction and inference. Expert systems. Computer vision. Robotics. Programming in LISP, PROLOG, or another AI language. Prerequisite: CS 211.
-
3.00 Credits
Three Credits Alternate Years: Spring 2009, 2011 Introduction to the general theory of computation. Formal grammars: regular, context-free, and context-sensitive languages. Formal automata: finite-state and pushdown models. Decidability. Turing Machines. The Chomsky hierarchy. NP-Completeness and Complexity Theory. Also listed as MA 384. Prerequisite: CS 201.
-
3.00 Credits
Three Credits Alternate Years: Spring 2010, 2012 Data Networking: Data communication system components, network architecture, layered protocols, traffic analysis, and capacity planning. Prerequisite: MA 211.
-
3.00 Credits
Three Credits For description and semester schedule, see MA 393.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|