CS200 Fall 2008 Class Overview - Prof. Adele E. Howe, Study notes of Computer Science

An overview of the cs200 class offered at the university of x in fall 2008. The class structure includes quizzes, tests, lab assignments, and homework assignments. The course goals aim to help students understand programs at different levels, implement object-oriented programs in java, and connect underlying theory to programming concepts. Policies emphasize professionalism and trust. Assignments include building a simulator of internet traffic and clearing cobwebs with programming exercises.

Typology: Study notes

Pre 2010

Uploaded on 03/19/2009

koofers-user-rk6
koofers-user-rk6 🇺🇸

10 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
CS200 - Class Overview 1
CS200 Fall 2008
Instructor: Adele Howe
GTA: John Stevens
UTA: Erin Nagoshi
CS200 - Class Overview 2
CS200 structure
Check the cs200 webpage
Quizzes & Class Participation:
“are you with us?”
Tests:
“what have you learned?”
Lab assignments:
“can you implement it?”
Homework assignments:
“do you understand the underlying theory?”
CS200 - Class Overview 3
Class meetings
Lectures
Concepts
Programming assignments discussion
Quizzes
Tests
Labs
Lab meetings help you with programming and
homework assignments, practice material from
lecture/book, meet with teammate (later).
Actual Lab work done by yourself (or your team) during
labs and in your own time.
CS200 - Class Overview 4
Difference from CS160/161
In CS16X you are told
What to do
How to do it (classes, methods, etc.)
In CS200 this is less so
What to do
Sometimes Class names
Larger programs, continuing assignments
Team programming
pf3

Partial preview of the text

Download CS200 Fall 2008 Class Overview - Prof. Adele E. Howe and more Study notes Computer Science in PDF only on Docsity!

CS200 - Class Overview 1

CS200 Fall 2008

Instructor: Adele Howe

GTA: John Stevens

UTA: Erin Nagoshi

CS200 - Class Overview 2

CS200 structure

 Check the cs200 webpage

 Quizzes & Class Participation: “are you with us?”  Tests: “what have you learned?”  Lab assignments: “can you implement it?”  Homework assignments: “do you understand the underlying theory?” CS200 - Class Overview 3

Class meetings

 Lectures

 Concepts  Programming assignments discussion  Quizzes  Tests

 Labs

 Lab meetings help you with programming and homework assignments, practice material from lecture/book, meet with teammate (later).  Actual Lab work done by yourself (or your team) during labs and in your own time. CS200 - Class Overview 4

Difference from CS160/

 In CS16X you are told

 What to do

 How to do it (classes, methods, etc.)

 In CS200 this is less so

 What to do

 Sometimes Class names

 Larger programs, continuing assignments

 Team programming

CS200 - Class Overview 5

Course Goals

To understand programs at different levels  Logical view  Programs = Algorithms + Data Structures  Understand their relationship and use them correctly, efficiently  Implementations  Programs = Methods + Objects  Practice design and implementation of object-oriented programs in Java  Read others’ code and work together to build larger programs  Connect underlying theory to programming concepts CS200 - Class Overview 6

Policies

“Trust men and they will be true to you; treat

them greatly and they will show themselves

great.” Ralph Waldo Emerson

Be professional.

CS200 - Class Overview 7

Programming Assignments

 Building a ‘realistic’

simulator of Internet

traffic

 Multi-part assignment

 Read and parse packets  Rout them through little tiny network

 Part individual, part

LIKE PACKAGES SENT THROUGH THE MAIL, COMMUNICATIONS SENT OVER A NETWORK ARE team assignment

BROKEN DOWN INTO SMALL PACKETS AND WRAPPED WITH SHIPPING INSTRUCTIONS [from www. superhighwaylbl.html].gov/Science-Articles/Archive/information- CS200 - Class Overview 8

Clearing Cobwebs…

 T or F: You can cast an int to double.

 Legal?: int a = 5 + (int b = 4)

 Spot the bugs:

double [] scores = {50.2, 121.0, 35.03, 14.27}; double mine; for (int in = 1; in = 4; ++in) { mine = mine + scores[in]; }

 What does this do?

public static double abc(double anArray[], int x) { if (x == 1) { return anArray[0];} else { return anArray[x-1] * abc(anArray, x-1); }}