|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Description: Using the microcomputer as a problem solving tool; system use; general purpose language programming; spreadsheet analysis and modeling; retrieving information from the Internet; strengths and weaknesses of computer based problem solutions. 3.00credit(s) Restrictions: Must be enrolled in one of the following Levels: Undergraduate
-
3.00 Credits
Description: No background in computing necessary. Design and implementation of your own database as a group project. Cooperative learning techniques to demystify key concepts: the relational model, normalization, the Entity-Relationship model and SQL. 3.00credit(s) Restrictions: Must be enrolled in one of the following Levels: Undergraduate
-
3.00 Credits
Description: Computing systems as tools for design and publishing of graphically-rich material in many forms: Image processing techniques and systems; image style and related tools; digital image processing theory; computational complexity; multimedia. 3.00credit(s) Restrictions: Must be enrolled in one of the following Levels: Undergraduate
-
3.00 Credits
Description: Computer-assisted animation & its programming dialects; cartoon creation from story-boarding to product delivery; algorithms - efficiency, correctness, understanding via animation. 3.00credit(s) Restrictions: Must be enrolled in one of the following Levels: Undergraduate May not be enrolled in one of the following Colleges: Engineering May not be enrolled in one of the following Majors: Computer Science
-
4.00 Credits
Description: Object-oriented design: objects, classes, methods, encapsulation; Programming fundamentals: data, variables, selection, loops, arrays, input/output; basic graphics; extensive programming required. 4.00credit(s) Restrictions: Must be enrolled in one of the following Levels: Undergraduate
-
4.00 Credits
Description: Object-oriented design: inheritance, interfaces, polymorphism, problem analysis; recursion; abstract data types; dynamically linked structures; Linear data structures: stacks, queues, lists, vectors; sorting and searching; event-driven programming; graphical user interfaces; extensive programming required. 4.00credit(s) Restrictions: Must be enrolled in one of the following Levels: Undergraduate Prerequisites: Undergraduate level CSC 1051 Minimum Grade of D-
-
3.00 Credits
Description: Mathematical structures that support computer science: sets, logic and proof, mathematical induction, relations, functions, counting techniques, probability, boolean algebra, matrices, graphs and trees. 3.00credit(s) Restrictions: Must be enrolled in one of the following Levels: Undergraduate Prerequisites: (Undergraduate level CSC 1051 Minimum Grade of D- or Undergraduate level ECE 1620 Minimum Grade of D-)
-
3.00 Credits
Description: System software design and implementation; process and resource management; concurrency, scheduling, and deadlock; memory management; file systems and security. 3.00credit(s) Restrictions: Must be enrolled in one of the following Levels: Undergraduate Prerequisites: Undergraduate level CSC 2400 Minimum Grade of D- or Undergraduate level ECE 2042 Minimum Grade of D-
-
3.00 Credits
Description: Efficiency classifications and mathematical analysis of recursive and nonrecursive algorithms: sorting, searching, string processing, graphs, arithmetic. 3.00credit(s) Restrictions: Must be enrolled in one of the following Levels: Undergraduate Prerequisites: Undergraduate level CSC 2053 Minimum Grade of D-
-
3.00 Credits
Description: High level language features: data types, control structures; formal lexical and syntactical analysis; operational semantics; language translation. 3.00credit(s) Restrictions: Must be enrolled in one of the following Levels: Undergraduate Prerequisites: Undergraduate level CSC 1052 Minimum Grade of D- and (Undergraduate level CSC 1300 Minimum Grade of D- or Undergraduate level MAT 2600 Minimum Grade of D-)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|