Introduction to Computer Programming

Course Description

This course provides the beginning programming student with the techniques necessary to write well documented, structured computer programs. The course is intended to emphasize the planning process using examples involving sequence, selection, and iteration. The course is designed to promote good programming practices for further study of other programming languages.

General Course Outcomes

Upon successful completion of this course, the student shall be able to:

  1. Describe the steps in the program development process, explain structured programming, and introduce algorithms using pseudocode, flowcharts, or other graphical representations.
  2. Demonstrate an understanding of the common words and keywords used when writing pseudocode; the Structure Theorem and the three basic control structures.
  3. Develop an understanding of the methods of analyzing a problem and developing a solution.
  4. Explain the selection control structure by introducing simple and multiple selection, nested selection, and case construct.
  5. Develop algorithms which use the repetition control structure in the form of DOWHILE, REPEATUNTIL, and counted repetition loops.
  6. Develop algorithms to several programming problems using combinations of sequence, selection, and repetition constructs.
  7. Develop an understanding of modularization as a means of dividing a problem into subtasks.
  8. Define elementary data items, data structures, the concepts of inter-module communication, local and global data, and the passing of parameters between modules.





Textbook and Course Materials

Title: Starting Out W/Python – Revel Access
Author: Tony Gaddis
Publisher: Pearson

ISBN: 978-0-13511-651-7

The text book for this course is available at the campus bookstore.