Course Criteria

Add courses to your favorites to save, share, and find your best transfer school.
  • 3.00 Credits

    Advanced systems programming including privileged instructions and system services, authentication technologies, host-based and network-based security issues. Applications to asynchronous I/O, process control and communication, device drivers and file management. Prerequisites: CS F301. Offered Alternate Fall Odd-numbered Years Prerequisite:    CS F301 UF C-
  • 3.00 Credits

    This course explores the social, legal and ethical issues aggravated, transformed or created by computer technology. Additional focus is on technical communication skills needed in the computer industry. Prerequisites: WRTG F211X, WRTG F212X, WRTG F213X or WRTG F214X; COJO F131X or COJO F141X; CS F202. Offered Fall Prerequisite:    (ENGL F211X UF C- OR ENGL F212 UF C- OR WRTG F211X UF C- OR WRTG F212X UF C- OR WRTG F213X UF C- OR ENGL F213X UF C- OR WRTG F214X UF C- OR WRTG F2X UF C- OR ENGL F2X UF C- ) (AND COMM F131X UF C- OR COJO F121X UF C- OR COJO F141X UF C- OR COJO F131X UF C- OR COMM F141X UF C- OR COMM F121X UF C- OR COMM F1OX UF C- ) (OR CORE F1 UF T T OR CORE F1AA UF T T OR CORE F1AS UF T T ) AND CS F202 UF C-
  • 3.00 Credits

    Methods for programming and construction of complete computer applications, including refractoring, performance measurement, process documentation, unit testing, version control, integrated development environments, debugging and debuggers, interpreting requirements, and design patterns. Prerequisites: CS F311. Offered Spring Prerequisite:    CS F311 UF C-
  • 3.00 Credits

    Creation of computer-generated images on programmable 3-D graphics hardware. Color, lighting, textures, hidden surfaces, 3-D geometric transformations, curve and surface representations, 2-D and 3-D user interfaces, and the visual modeling of physical phenomena. Prerequisites: CS F202; MATH F253X or MATH F314. Offered Fall Prerequisite:    CS F202 UF C- (AND MATH F202X UF C- OR MATH F253X UF C- OR MATH F314 UF C- )
  • 1.00 - 6.00 Credits

    No course description available.
  • 1.00 - 6.00 Credits

    No course description available.
  • 3.00 Credits

    Examine diverse branches of Al placing Al in larger context of computer science and software engineering. Knowledge representation formalism and search technology. Programming methodologies; procedural systems such as expert systems and blackboard systems and non-procedural systems such as neural networks. Software engineering aspects of problem selection, knowledge acquisition, verification and validation. Individual projects. Prerequisites: CS F311. Offered Spring Even-numbered Years Prerequisite:    CS F311 UF C-
  • 3.00 Credits

    Analysis of classic algorithms, their implementation and efficiency. Topics from combinatorics (sets, graphs), algebra (integer arithmetic, primes, polynomial arithmetic, GCD, Diophantine equations, encryption), systems (parsing searching, sorting) and theory (recursion, Turing machines). The complexity classes P, NP and NP complete. Prerequisites: MATH F307, CS F311. Offered Fall Prerequisite:    MATH F307 UF C- AND CS F311 UF C-
  • 3.00 Credits

    Detailed level study of distributed operating system algorithms, functions and associated implementation. Distributed operating system tuning methods and security. Role of distributed operating systems in net-centric computing. Programming, documentation and evaluation of distributed operating system segments as projects. Prerequisites: CS F321; WRTG F111X; WRTG F211X, WRTG F212X, WRTG F213X or WRTG F214X. Offered Fall Prerequisite:    CS F321 UF C- (AND CORE F1 UF T T OR CORE F1AA UF T T OR CORE F1AS UF T T (OR (ENGL F111X UF C- OR WRTG F111X UF C- OR WRTG F1X UF C- OR ENGL F1X UF C- OR EACE 60 OR S11 710 OR SATE 1340 ) (AND ENGL F211X UF C- OR WRTG F211X UF C- OR ENGL F212 UF C- OR WRTG F212X UF C- OR WRTG F213X UF C- OR ENGL F213X UF C- OR WRTG F214X UF C- OR WRTG F2X UF C- OR ENGL F2X UF C- ) ) )
  • 3.00 Credits

    Data independence, modeling, relationships and organization. Hierarchical, network and relational data models; canonical schema. Data description languages, SQL, query facilities, functional dependencies, normalization, data integrity and reliability. Review of current database software packages. Prerequisites: CS F311; CS F321. Offered Spring Odd-numbered Years Prerequisite:    CS F311 UF C- AND CS F321 UF C-
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
(Type the name of a College, University, Exam, or Corporation)
(For example: Accounting, Psychology)
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
(For example: Introduction To Accounting)
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
of
(For example: Find all institutions within 5 miles of the selected Zip Code)
Privacy Statement   |   Terms of Use   |   Institutional Membership Information   |   About AcademyOne   
Copyright 2006 - 2024 AcademyOne, Inc.