CS 210 Fundamentals of Computer Science I • 5 Cr.
Introduces computer science and programming for CS majors. Students learn design and implementation of algorithms and programming in a structured, modular language, with emphasis on problem solving, program design, and style. Prerequisite: MATH& 141 (or higher) with a C- or better, or entry code.
After completing this class, students should be able to:
- 1. Solve problems applying the techniques of decomposition, critical reasoning, induction and deduction.
- 2. Describe the functionality of memory, CPU and programs, including compilation, linking/loading and executing a program.
- 3. Identify best practices in software programming, including maintainability, style, structure and documentation.
- 4. Define the concepts of data types, including primitive types and objects.
- 5. Explain the evaluation of arithmetic expressions in conjunction with precedence rules for operators.
- 6. Use decision controls (if-else) and repetitions (do-while) in the construction of simple programs.
- 7. Design and invoke procedural methods in simple programs.
- 8. Utilize parameter passing to methods, including the process of returning values.
- 9. Implement existing code from an Applications Programming Interface (API).
- 10. Write programs to read and write simple test files on local secondary storage.
- 11. Explain the importance of code documentation with programmer comments.
- 12. Apply testing concepts and techniques to verify and fix errors in programs.
- 13. Use an Integrated Development Environment (IDE) to create programs.