|
|
|
Apr 25, 2024
|
|
2020-2021 Catalog and Student Handbook [ARCHIVED CATALOG]
Course Descriptions
|
|
|
The following course descriptions are intended to briefly describe the nature of each of the courses. For more complete information, departments or faculty can provide specific course syllabuses.
In addition to these hours, students are expected to complete homework assignments on their own time. These assignments may include library research, computer utilization, field trips, cultural performances, and other instructional activities.
|
| |
Computer Science |
| |
-
CS 135 - Computer Science I
Credits: 3
Description
This course is intended for students in computer science or engineering majors. It covers: a) Program development in a complex operating environment; b) Problem-solving methods and algorithm development in a high-level programming language; c) Program design, coding, debugging, and documentation using techniques of a good programming style.
Student Learning Outcomes
- Develop algorithmic solutions to problems and translate their algorithms into C++ programs that meet a set of specifications.
- Compile and execute their programs in the Linux operating environment and use appropriate testing and debugging strategies.
- Use appropriate control structures (sequence, selection, and iteration) in their programs.
- Develop modularized programs using functions and passing parameters.
- Understand and properly use strings and file streams.
- Understand and properly use one-dimensional arrays and records.
- Use good programming style and adequately document programs.
Prerequisite: MATH 127 or MATH 128
|
| |
-
CS 202 - Computer Science II
Credits: 3
Description
This course is the continuation of CS 135 . It covers: a) Data structures and algorithms for manipulating linked lists; b) String and file processing; c) Recursion. Software engineering, structured programming and testing, especially larger programs are also covered in this course.
Student Learning Outcomes
- Handle Program Specification Design, and Analysis.
- Compile and execute their programs with Abstract Data Types and C++ Classes.
- Use Pointers and Dynamic Arrays in their programs.
- Develop programs using Linked Lists.
- Understand and properly use Software Reuse with Templates.
- Understand and properly use Stacks, and Queues.
- Use Recursive Thinking.
- Understand and properly use Software Reuse with Derived Classes.
Prerequisite: CS 135
|
| |
|
|
|
Print this Page