|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Identical to MATH 205.
-
3.00 Credits
A continuation of CS 112, topics include advanced programming design in user-defined data types, arrays, structures, pointers, array-based lists, binary searching, recursion, and introduction to object-oriented programming techniques. Prerequisite: CS 112 or consent. Offered each spring.
-
3.00 Credits
Introduces the basic concepts of computer organization and assembly language. Specific topics include CPU and memory organization, machine language, addressing techniques, macros, program segmentation and linkage, and assembler construction. This course satisfies the oral competency requirement for computer science majors. Prerequisites: CS 202 or 212, or consent. Offered fall of odd-numbered years.
-
3.00 Credits
An introduction to commonly used computer data structuring techniques. Topics include abstract data types, classes, queues, stacks, linked lists, algorithm analysis, sorting, searching, tree and graph. Prerequisites: CS 212, or consent. Offered fall of even-numbered years.
-
3.00 Credits
Introduces the concepts, principles, and stages of computer-based information systems analysis and design. Topics include the system development environment, project management, system requirements definition, interface and structure design, and system implementation and administration. Prerequisite: CS 212 or consent. Offered on demand.
-
3.00 Credits
Introduces the fundamental concepts, technologies, and applications of computer networks. Topics include the basics of data communications, network topologies, protocols, routing and switching, naming and addressing, and network operations. Prerequisite: CS 212 or consent. Offered on demand.
-
3.00 Credits
Identical to MATH 350.
-
3.00 Credits
Beginning with a study of the historical development of programming languages, students are introduced to the decisions involved in the design and implementation of such programming language features as elementary, structured, and user-defined data types, subprograms, sequence control, data control and storage management. Selected features of several existing languages are examined in the context of these issues. Prerequisites: CS 202 and 212, or consent. Offered on demand.
-
3.00 Credits
Introduces the fundamental computer algorithms, their performance analysis and the basic technique to design algorithms. Topics include the standard algorithms and performance analysis for search and sorting, advanced data structures, graph theory, and algebraic computations. Students have the capability to design algorithms for solving various computational problems. Prerequisite: CS 311 and MATH 172 or consent. Offered on demand.
-
3.00 Credits
Emphasizes the concepts and structures necessary to design and implement database systems using a relational database management system. Various database management system architectures, illustrating hierarchical, network, and relational models are discussed. Physical data storage techniques, file security, data integrity, and data normalization are also explored. Prerequisite: CS 202 or 212 or consent. Offered on demand.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|