CS 112

From CS Wiki
Jump to: navigation, search

Introduction to Problem Solving and Programming

Total Credits: 3 cr

Course Coordinator: Terry Soule

URL: http://www2.cs.uidaho.edu/~cs112/s14/index.html

Proposed Catalog Description: May be used as core credit in J-3-c. Introduction to computational thinking and problem solving, including elementary computing concepts such as variables, loops, functions, lists, conditionals, concurrency, data types, simple object oriented concepts, I/O, events, syntax, structured programming, basic concepts of computer organization, editing and the influence of computers in modern society. No lab.

Prereq: Math 108 or sufficiently high ACT, SAT, or Math Placement Test score to qualify for Math 143.

Textbook: None. Materials will be provided as needed.

References: Additional course references will be available on the course web site.

Course Goals

This is a first course in computing and computer programming, for students who have no prior experience writing programs. Computer science and engineering majors and non-majors are equally welcome. For computer science and computer engineering majors, this course is a bridge to CS 120, Computer Science 1, which is fast-moving and demanding. Taking this course first will help them hit the ground running. For non-majors, this course provides the tools to make computers work for them, whatever their chosen profession. Students will use beginner-friendly computer languages to master the basic elements of computer programming and to become comfortable with programming computers to solve problems. Possible languages include Scratch (graphical programming language), Net Logo, Processing (Java-like), and Python.

Major Topics Covered

Under construction.

Course Outcomes

At the conclusion of this course, the student should be able to:

  1. Understand how data such as numbers and text are represented in a computer
  2. Translate a verbal problem description into an algorithm that can be programmed
  3. Write a computer program to execute the algorithm on a sample input
    1. Accept input data from source like a keyboard
    2. Process the data to solve a problem
    3. Print the results on a display devices such as a computer screen
  4. Implement conditional constructs (name varies with programming language):
    1. If, if-then, If-then-else
    2. Nested If, if-then, If-then-else
    3. For loops
    4. While loops
    5. Nested loops
  5. Use pre-built methods/functions/subroutines
  6. Write and use methods/functions/subroutines
  7. Verify the correctness of a program
  8. Methodically debug a program: observe behavior, diagnose and fix problems
  9. Save their work and access it later
  10. Keep track of old versions of their work so they can always go back to a working version