Oct 23, 2026  
2026-2027 Academic Catalog 
    
2026-2027 Academic Catalog
Add to Portfolio (opens a new window)

CSCI 1106 - Fundamentals of Computer Science I


Credits: 4

Catalog Description
This is the first course in a two-course sequence for students who are planning to major or minor in Computer Science. Emphasis is on algorithm design, analysis, and refinement. Topics will include functions, control structures, static data structures, file manipulation, and recursion.

Prerequisite(s) (must have a grade of C or better): MATH 1200  or appropriate score on the math placement test
Additional fee to student: No

Learner Outcomes
  1. Apply consistent documentation and program style standards that contribute to the readability and maintainability of software.
  2. Develop, design, analyze, and implement logic within a program that solves a problem with a finite number of operations.
  3. Design and develop programs that implement fundamental logic structures of sequence, selection, and repetition.
  4. Write programs that use file I/O to provide persistence across multiple executions.
  5. Develop proficiency in specification and use of appropriate primitive data types and their aggregation into simple linear data structures.
  6. Decompose problems into clearly defined sub-problems based on program requirements.
  7. Implement algorithms utilizing recursive structures.
  8. Create appropriate test cases and use debugging skills to verify correctness of output.

Major Areas of Course Content
  1. Input/output using standard input/output
  2. Input/output using secondary storage
  3. Convert mathematical formulas into equivalent programming language expressions
  4. Convert an algorithm in pseudocode or diagrams into a high-level programming language
  5. Create appropriate test cases to verify the correctness of the program
  6. Sequential structures
  7. Section structures
  8. Repetition structures
  9. Use structured programming concepts to write efficient and elegant programs
  10. Modularization, procedures, and functions with use of parameters
  11. Employ recursion
  12. Arrays
  13. Sequential and binary search
  14. Insertion, selection, and bubble sort
  15. Pointers/object references
  16. Introduction to objects

Credit for Prior Learning Options
Course-Specific Exam

Credit for Prior Learning Option Procedure(s)
This is a 2-step process: a. A comprehensive examination will be administered; b. A programming project will be assigned that is commensurate with the level of expertise of an average student who has completed the course.



Add to Portfolio (opens a new window)