|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Programming the computer using the BASIC language No prior programming knowledge is assumed Emphasis on problem solving, with useful programs for either mathematical or business applications Prerequisite or corequisite: MTH 111 or placement beyond Cannot be used toward Computer Science major or minor.
-
4.00 Credits
An introduction to programming using a high-level object-oriented programming language Topics will include fundamental data types, flow of control, classes and objects, methods and functions, and inheritance A structured lab component will provide experience with typical software development tools: editor, compiler/linker, and symbolic debugger Prerequisite or corequisite: CS 109 (or permission of Instructor for Mathematics majors using CS 221 as their programming elective) and MTH 111 or placement beyond.
-
4.00 Credits
A continuation of CS 221, with applications aimed at graphical and three dimensional programming Practices in object-oriented design will be further developed The structured lab component will provide substantial practice with modern graphical programming tools and increased use of program development tools Prerequisite: CS 221.
-
3.00 Credits
An in-depth study of a particular programming language such as ADA, C, COBOL, FORTH, FORTRAN, LISP, PROLOG, RPG, Smalltalk, or X-Windows Frequency of offering and language covered will vary according to demand May be taken for credit any number of times, provided that a different language is studied, but only 3 credits may be used toward a Computer Science major.
-
1.00 - 3.00 Credits
A student of sophomore status may pursue special studies in computer science based on the interest and needs of the individual Prerequisite: Permission of the Instructor, Division Chair, and Dean of the College.
-
3.00 Credits
Algorithms for the solution of numerical problems implemented on microcomputers; includes discussion of error, polynomial interpolation, solution of nonlinear equations, and numerical integration Prerequisites: MTH 222 and either CS 112 or CS 221 Crosslisted as MTH 320.
-
3.00 Credits
A survey of the internal architecture and operating principles of digital computers. Prerequisites: CS 109, CS 221, CS 222, and MTH 251
-
3.00 Credits
A study of structures used for manipulating data, and their efficient creation and processing File structures and their uses are also covered, as well as an introduction to the study of algorithms Prerequisites: Grade of "C" or better in CS 222, and MTH 251.
-
3.00 Credits
Introduction to techniques to support the design and analysis of algorithms, focusing on both the underlying mathematical theory and practical considerations of efficiency. Topics include asymptotic complexity bounds, techniques of analysis, and an introduction to automata theory and computability theory Prerequisite: Grade of "C" orbetter in CS 350.
-
3.00 Credits
Design, organization and manipulation of data bases, including the design of data items and records Data base management systems are surveyed and cases are examined in details of data insertion and retrieval Prerequisite: CS 350.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|