1
h00
CS8 W18
Name:
(as it would appear on official course roster)
Umail address: @umail.ucsb.edu
Optional: name you wish to be called
if different from name above.
Optional: name of "homework buddy"
(leaving this blank signifies "I worked alone"

h00: Perkovic Ch1 (Introduction to CS)

ready? assigned due points
true Tue 01/16 02:00PM Tue 01/23 02:00PM

You may collaborate on this homework with AT MOST one person, an optional "homework buddy".

MAY ONLY BE TURNED IN IN THE LECTURE/LAB LISTED ABOVE AS THE DUE DATE,
OR IF APPLICABLE, SUBMITTED ON GRADESCOPE. There is NO MAKEUP for missed assignments;
in place of that, we drop the four lowest scores (if you have zeros, those are the four lowest scores).

READING ASSIGNMENT

Please read Perkovic Ch1 (Introduction to CS). Then complete these problems and turn in your completed homework in lecture on the due date.

  1. (10 pts) Please fill in the information at the top of this homework sheet, including your name and umail address. If the other two items apply, please fill them in as well. Please do this every single time you submit homework for this class. It is important to fill in both name and umail every time, since handwriting is sometimes difficult to decipher. Having both helps us ensure you get credit for your work. Also: while we strongly prefer that you submit your homework on a single sheet of paper passed out in lecture, if you MUST submit it on multiple sheets, JUST write your name at the top of bot sheets and turn in both sheets UNCONNECTED. DO NOT staple, paper clip, fold, or do ANYTHING that would make it difficult to automatically feed your paper through a scanner.
  2. Section 1.1 describes Computer Science in general. It includes a passage that distinguishes between models, algorithms and programs. In your answer, don't just copy down an exact quote from the textbook; explain in your own words. If you don't think you understand the relationship, be honest about that, and write down what you are confused about, or your best guess at what the author is trying to say.
    1. (5 pts) What is the relationship between a model and an algorithm?
    2. (5 pts) What is the relationship between an algorithm and a program?

  3. (10 pts) Section 1.2 describes Computer Systems in general. According to the author, what are the main functions of an operating system (OS) such as MacOS, Windows, and Linux?

  4. Continuing with questions from Section 1.2:
    1. (10 pts) What is the difference between computer hardware and computer software?
    2. (10 pts) The author makes a distinction between the "core set" of features in a programming language, and those that are put into "software libraries". What are two examples of features that end up in libraries rather than in the core language?
    3. (10 pts) What is the advantage of putting those features into libraries rather than into the "core set" of features?
  5. Section 1.3 describes the Python programming language.
    1. (10 pts) What is the interactive shell used for?
    2. (10 pts) What does a Python program consist of?

  6. Section 1.4 contains a description of a sample problem that the author uses to illustrate "computational thinking". The author notes that in applying computational thinking to a problem, one of the steps we take is to decide which details of the problem are important, and which are not.

    1. (10 pts) Give two examples of details about the problem statement that, according to the author's discussion, are not relevant, and should be ignored.
    2. (10 pts) Give two examples of details that are definitely relevant, and that we need to pay attention to in coming up with a solution.