Computer Science Course Descriptions
| 150 | 190 | 212 | 225 | 226 | 227 | 280 | 310 | 313 | 318 | 330 | 340 |
| Second Page | |||||||||||
150 Microcomputers and Software Applications I
(3) (Prerequisite: Eligibility to take Math 111 [or higher]) F, S, SU. Introduction to microcomputer hardware and software. Topics include computer fundamentals, word processing, electronic spreadsheets, data bases, and other microcomputer application areas. Solutions for several problems using microcomputers and commercial software will be required.
190 Programming Fundamentals
(3) F, S, SU. Introduction to problem-solving and algorithm development techniques based on the program development process. Study of basic computer concepts and computer systems; elementary data types and data structures; input and output processing; control structures; modular program design; elementary file processing; algorithm design and evaluation. Students will apply these ideas by analyzing specifications, designing solutions, and implementing programs based on this analysis and design.
212 Introduction to FORTRAN
(3) (Prerequisite/Corequisite: Math 201 or permission of school) (Same as Math 212) F, S, SU. A study of programming to include input and output procedures, arithmetic and logical operations, DO loops, branching procedures, arrays, declaration statements, and subroutines. Application of these ideas by writing, running, and correcting programs.
225 Modern Programming
(3) (Prerequisite: A grade of C or better in CS 190 or permission of school) F, S, SU. A continuing study of the concepts presented in CS 190. Topics include problem solving, algorithm and program development, data types and operations, objects and classes, arrays, and event-driven programming.
226 Programming and Algorithmic Design I
(3) (Prerequisite: C or better in 190 or permission of school) F, S, SU. Introduction to problem-solving with algorithm and program development. Includes: problem analysis, algorithm representation and verification, scalar and structured data types, file input and output, techniques for program design, coding, testing, and documentation and basic sorting, and searching algorithms.
227 Programming and Algorithmic Design II
(3) (Prerequisite: C or better in 226) F, S, SU. Continuing study of algorithmic design, implementation, and analysis including object oriented design and implementation, abstract data types, stacks, queues, and linked structures.
280 Digital Systems Design
(3) (Prerequisites: A grade of C or better in 212, or 227, and a grade of C or better in Math 230) F. Starting from a description of digital circuits regarding as functional blocks, the course leads to a consideration of the logical design of combinational and sequential digital systems. Topics include binary representation of information, gate types, combinational circuit design, counters, registers, arithmetic circuits, sequential circuit design, and programmed logic. Students will gain practical experience by applying lecture material in a hands-on laboratory setting.
310 Computer Architecture and Organization
(3) (Prerequisite: A grade of C or better in 280) S. A study of hardware organization, memory addressing and structure, CPU-memory I/O relationships, organization of computer processors, memories, and interconnections. Students will look at processor control, data units, memory structure, microprogramming, the role of assembly language, timing, I/O design, current architectures, and alternate hardware designs. Must have a 2.25 GPA or higher in all courses which are required in the computer science major or minor.
313 Systems Design and Development
(3) (Prerequisite: A grade of C or better in CS 226. Pre/corequisite: CS 227 ) F, S, SU. Development of computerized systems focusing on structured systems analysis and its application to information system software development. Emphasis will be on problem analysis, correctness, reliability, and maintainability. Must have a 2.25 GPA or higher in all courses which are required in the computer science major and minor.
318 Data Structures and Algorithm Analysis
(3) (Prerequisite: A grade of C or better in 313) F, S. An overview of the structure and implementation of data structures, including lists, trees, heaps, and tables, and an examination of searching, sorting and other algorithms, including implementation and analysis of their efficiency. Must have a 2.25 GPA or higher in all courses which are required in the computer science major or minor.
330 Special Topics in Computer Science
(3) (Prerequisite: Permission of school) As Needed. In-depth study of an area of interest in computer science. Different areas of study will be offered. Must have a 2.25 GPA or higher in all courses which are required in the computer science major or minor. Must have a 2.25 GPA or higher in all courses which are required in the computer science major or minor. May be taken twice for academic credit with departmental approval.
340 Software Design and Development
(3) (Prerequisite: A grade of C or better in 318 or permission of school) S. Study of design techniques used in creating large program packages, organization and management of projects, and application of techniques in team projects. Must have a 2.25 GPA or higher in all courses which are required in the computer science major or minor.