|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
A continuation of program design and development. Introduction to data structures: stacks, queues, linear lists, trees, and sets. Includes pointers recursion, and implementation and analysis of sorting and searching algorithms. Extensive programming is required. Includes introduction to parallel models and algorithms, problem state space, relational database, and numerical approximation methods. Three hours of lecture and three hours of laboratory. Enrollment Requirement: CS 111.
-
1.00 Credits
Includes introduction to parallel models and algorithms, problem state space, relational database and numerical approximation methods. Credit may not be counted in conjunction with CS 211. Students who took CS 211 at another insitution should check their articulation agreement to see if they are required to take CS 212. Enrollment Requirement: Completion of an intermediatelevel programming course.
-
4.00 Credits
The structure of computers, number and character representation, word and instruction formats, and flowcharting. Machine and assembly language programming, address modification, indexing, indirect addressing, subroutines, and mnemonic interpreting systems. Includes digital logic, analysis and synthesis of circuits, and circuits of commonly used computer components. Three hours lecture and three hours laboratory. Enrollment Requirement: CS 111.
-
1.00 Credits
Includes digital logic, analysis and synthesis of circuits, and circuits of commonly used computer components. Credit may not be counted in conjunction with CS 231. Students who took CS 231 at another insitution should check their articulation agreement to see if they are required to take CS 232. Enrollment Requirement: Completion of an assembly programming course.
-
3.00 Credits
An introduction to the applications of computers, such as word processing, spreadsheet, database management, networking communications, operating systems, editors, societal issues and historical perspectives of computer usage; algorithmic and critical thinking and computer programming in: A. ASP ( recommended to future teachers) C. C++ J. Java P. Pascal CS 301(A) May not be taken for credit by students who have received credit for EDUC 422A and EDUC 422C. A grade of C+ or above in CS 301(A) can be used to fulfill EDUC 422A and EDUC 422C May not be repeated. Credit may not be counted toward the Computer Science Major. Enrollment restricted to students who have completed the Entry-Level Mathematics (ELM) requirement.
-
3.00 Credits
An introduction to algorithmic and critical thinking through problem solving and Java programming. Various problems are solved through many case studies and computer solutions are produced to solve these problems through the platform of web programming on the Internet. Enrollment restricted to students who have completed the Entry-Level Mathematics (ELM) requirement.
-
3.00 Credits
Introduction to the design and implementation of computer animation. The technical and creative aspects of both linear and interactive animation are investigated. Special attention is paid to the design of and production of 2-D and 3-D animations for the Internet. May not be taken for credit by students who have received credit for CS 497E. Enrollment restricted to students who have completed the Computer Competency Requirement (CCR) and the Entry-Level Mathematics (ELM) requirement.
-
3.00 Credits
An introduction to computer techniques that can be used by humans to solve real world problems. Covers algorithms for problems such as searching, sorting, shortest path, minimal network cost, articulation points, 01- knapsack. Application to airlines, railroads, police, military, and other professions will be demonstrated. No programming is required. Enrollment restricted to students who have completed the Computer Competency Requirement (CCR) and the Entry-Level Mathematics (ELM) requirement.
-
3.00 Credits
A thorough understanding of several advanced methods for implementing the abstract data types and the time used by each method. Includes abstract data types such as dictionary, priority queues, matrices, and relations, foundation of recursive algorithms, complexity analysis, complexity classes, sorting and searching, computability and undecidability, problem-solving strategies, heuristic search, modeling and components of database systems, and graphics software systems. Enrollment Requirement: CS 211. Co/Prerequisite: MATH 270 or 370.
-
3.00 Credits
A study of the functional organization and sequential operation of digital computers. The major components of a computer will be discussed. Introduction to machine instruction architecture and design. The study of the internal operations during program execution. Several computer architectures will be studied. Prerequisite: PHYS 301.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|