Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Study Guide on Introduction to Programming II | CS 662, Study notes of Computer Science

Material Type: Notes; Professor: Brooks; Class: Artificial Intelligence Prog; Subject: Computer Science; University: University of San Francisco (CA); Term: Spring 2005;

Typology: Study notes

Pre 2010

Uploaded on 07/30/2009

koofers-user-whd
koofers-user-whd 🇺🇸

1

(2)

10 documents

1 / 14

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Intro to Programming II
Introduction
Chris Brooks
Department of Computer Science
University of San Francisco
Department of Computer Science University of San Francisco p.1/??
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe

Partial preview of the text

Download Study Guide on Introduction to Programming II | CS 662 and more Study notes Computer Science in PDF only on Docsity!

Intro to Programming II

Introduction

Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science — University of San Francisco – p.1/

Syllabus

Office Hours Course Text Prerequisites Test Dates & Testing Policies Check dates now! Grading Policies Department of Computer Science — University of San Francisco – p.2/

Grading

You’ll have a series of lab assignments to do Done in-class Satisfactory/unsatisfactory grade You’ll also have four programming projects Larger; 2 weeks apiece Plus two midterms and a final In class, closed notes I believe that the best way to learn a topic likeprogramming is to do it. Department of Computer Science — University of San Francisco – p.4/

How to Succeed

Come to class. Pay attention. Ask questions. Department of Computer Science — University of San Francisco – p.5/

How to Succeed

Come to class. Pay attention. Ask questions. A question as vague as “I don’t get it” is perfectlyacceptable. If you’re confused, at least half the class is also. Don’t wait until after class to ask! Come by my office I am very available to students. You can also talk with Jason Department of Computer Science — University of San Francisco – p.7/

How to Succeed

Come to class. Pay attention. Ask questions. A question as vague as “I don’t get it” is perfectlyacceptable. If you’re confused, at least half the class is also. Don’t wait until after class to ask! Come by my office I am very available to students. You can also talk with Jason Start the homework assignments and projects early Waiting until the last minute to start projects is a badidea. Department of Computer Science — University of San Francisco – p.8/

Words of Wisdom

“90% of life is showing up.” – Woody Allen “Just keep swimming.” – Finding Nemo “Never mistake activity for achievement.” – John Wooden “Teachers open the door. You must step through on yourown.” – Chinese Proverb. Department of Computer Science — University of San Francisco – p.10/

Words of Wisdom

“90% of life is showing up.” – Woody Allen “Just keep swimming.” – Finding Nemo “Never mistake activity for achievement.” – John Wooden “Teachers open the door. You must step through on yourown.” – Chinese Proverb. “Do I contradict myself? Very well, then. I contradictmyself. I am large; I contain multitudes.” - Walt Whitman Department of Computer Science — University of San Francisco – p.11/

Lab 1: Java Practice

(L & L 2.13) - Write a Java applet that draws the OlympicLogo. The circles in the logo should be colored (L to R):blue, yellow, black, green, red. Department of Computer Science — University of San Francisco – p.13/

Lab 1: Java Practice

Write a program that creates an array of 50 integers. Usea for loop and an if statement to place a 1 in all cellswhere the index is even, and a 0 in all cells where theindex is odd. (the first index is 0.) For example, a[3]should contain a 0, and a[2] should contain a 1. Print outthe array after filling it in. Department of Computer Science — University of San Francisco – p.14/