|
Week
|
Date
|
Topic
|
Reading
|
Assignments
|
Comments
|
|
1
|
09/01
|
Introduction
_________________
- administrivia
- Looking at data
- data abstractions
- structures
- algorithms, etc.
|
K&W: - Appendix A (skim,
then read pgs. 679-681 carefully)
- Ch. 1
_________________
|
Start: Assignment 1
Grading: Assignment#1 will be graded based on the CS110 Grading Policy.
___________________
|
Sample Processing code: The_USPS_Volume_Processing_program
(without the data). <--- look
at this example to see how to read a file and turn it
into arrays of numbers for plotting. It will help for
Assignment 1! If you'd like, you can get the data from here.
Python Graphics Library: Visit this page if you need information on doing simple graphics in Python.
|
|
09/03
|
Java Basics
_________________
Java vs. Processing, program structure, basic input/output, simple dialog-based I/O, Data types and variables, constants, type conversion, reference variables
Slides from 2013: -
Welcome/Intro
-
Java Basics
|
Appendix A (Read A.1 and A.2 carefully, skim
A.3-A7, drill down when interested.)
|
Start: Lab 1
_________________
Personal computer setup: The only necessary
tools needed to work on your own computer are the java development
kit and an editor (I suggest you use Emacs, Look here for
which to download).
Here is a guide from 2013 on Java Development
|
Please remember: This is an intro
course. There is no question that is too basic. We all understand
that not everyone in the class has been breathing code all summer
long. In fact most of us have not. If you have questions
about Assignment1, please email me as soon as they arise. You can
keep trying to figure it out, but I may be able to point you in the
right direction.
To convert the copied text from the data link
above, here is a Processing
sketch with the data copied and pasted with each value on a
line by itself. You can - run the sketch and then copy the output and paste it into a
spreadsheet program;
- then format the cells of the second
column in the spreadsheet to be generic
- There is one cell that has -- that will need
to be changed to a 0 before you export the spreadsheet as a
csv;
- rename the csv file to USPSData.txt and put it in
the Data directory of your example sketch that you copied from
Sample Processing code: The_USPS_Volume_Processing_program
Java code example from class:
Part 1 Part 2
|
|
2
|
09/08
|
Diving into Java
___________________
arrays, statements, methods - class
methods, JOptionPane I/O.
|
Appendix A (Read A.8 to A.11 carefully)
|
Submit: Assignment 1
Start: Assignment 2
|
<--- please submit Assignment 1 to Moodle, even though
it's late, and even though you submitted a paper copy in
class.
Lab 1 notes: If you are unfamiliar with Unix, and
you are using a Mac or the Lab computers, you
may find this
link a good place to start.
If you are using Windows, then
when you use the CMD prompt that is DOS, so this link may be a good
place to start.
Example code:
ReviewClass.java
|
|
09/10
|
Java Cont.
file I/O in Java using the Scanner class, error detection
and correction: exceptions, try-catch blocks exceptions and
exception handling, Instance methods,
|
|
Submit: Lab 1
Start: Lab 2
|
Class Example Files:
ScannerExamples.java
Unix and Emacs Commands
|
|
3
|
09/15
|
Rosh Hashanah
|
|
|
|
|
09/17
|
Objects and Classes
File I/O and exception handling examples. Doing object-oriented
programming (OOP) in Java. Designing classes (basic UML), writing
code to implement classes. Deliberating about public and private
prefixes in class design. Examples. Inheritance in OOP.
|
|
Submit: Assignment 2
Lab 2
Start: Assignment 3
Grading: Assignment#3 will be graded based on the
CS206 Grading Policy
and coding standards.
|
Class Example Files:
PrintWriterExample.java
Place.java
School.java (inherits from Place)
Fraction.java (unfinished)
Exercise: Create a driver program that
instantiates and uses each of the example classes above (Place,
School, and Fraction).
|
|
4
|
09/22
|
More Classes
Recursive vs.
Iterative solutions (gcd vs. gcdIter in Fraction2.java) OOP in
Java. Designing classes. Composition in OOP. Example: Cup and
Contents classes
|
K&W: Chapter 1.
|
Start: Lab 3
|
Class Example Files:
RecursiveMethods.java
Fraction2.java
Cup.java (Depends on Contents)
Contents.java
Exercise: Implement a coffee date
in the main of Cup.java to ask for the drink type and
drink size of two people and then instantiate the cups
based on the order and print out the result.
|
|
09/24
|
Basic Data Structures
DynamicArray vs. LinkedList, ADTs and Interfaces in Java,
packages, generics
|
K&W: Chapter 2
|
|
|
|
5
|
09/29
|
ADT Implementation.
The Java Collections Framework (an introduction). The ArrayList class in Java. Under the hood: implementing your own list class (using fixed size arrays). Implementing our own List ADT: Version 1 (Using fixed size arrays).
|
K&W: Chapter 2
|
Submit: Assignment 3/ Lab 3 Report
Start: Assignment 4
|
<--- Note: Updated/Corrected Extra
Credit description for Assignment 3!
Grading: Assignment#3 will be graded based on the
CS206 Grading Policy
and coding
standards.
Class Example Files:
SimplifiedList.java
ArrayListFixed.java
|
|
10/01
|
Exam 1
|
|
|
|
|
6
|
10/06
|
Computational Complexity.
______________________
CPU speeds (FLOPS) and what they
mean. Big-Oh notation for worst case complexity of
algorithms. Growth rates of some common functions. Implementing our own List ADT: Version 2 (Making it generic), Version 3 (Using dynamic arrays). Comparing it to Java ArrayList.
|
K&W: Chapter 2
|
|
Class Example Files:
SimplifiedList2.java (Generic)
ArrayListFixed2.java
(Generic)
ArrayListFlexible.java (Generic)
|
|
10/08
|
Linked Lists: Design & implementation.
|
K&W: Chapter 2
|
Submit: Assignment 4
|
Class Example Files:
LinkedList.java
Node.java
Exercise: Complete the implementation of
LinkedList.java. Note: LinkedList.java should compile as
downloaded if you also have Node.java, and SimplifiedList2.java
in the same directory.
|
|
|
10/13
| Fall Break
|
|
|
|
|
10/15
| Fall Break
|
|
|
|
|
7
|
10/20
|
Implementing Linked Lists. Comparing List implementations.
|
K&W: Chapter 3&4
|
|
Class Example Files:
LinkedListCollection.java
(This extends the AbstractCollection abstract class so that we don't have to
implement the value based access, such as contains(E) and remove(E).)
LinkedListIterator.java
Exercise: Complete the implementation of
LinkedListCollection.java. Note: LinkedListCollection.java should compile as
downloaded if you also have Node.java, and SimplifiedList2.java
and LinkedListIterator.java in the same directory.
|
|
10/22
|
Stacks & Queues
Introduction to Stacks & Queues. Queues: Applications- Discrete event simulation.
|
|
Start: Assignment 5
|
Class Example Files:
Queue.java
Stack.java
|
|
8
|
10/27
|
Java Collection Framework &
Stack Applications
Review of Assignment#4, Java Collection Framework. Stack applications: pre/post fix expressions. Using Iterators.
|
|
|
Exam 2 Review Topics
|
|
10/29
|
Recursion. Writing recursive functions.
|
K&W: Chapter 5
|
|
|
|
9
|
11/03
|
Exam 2
|
|
|
|
|
11/05
|
Sorting, Part 1 (Basic sorting algorithms): Bubble Sort, Selection Sort, Insertion Sort. Complexity/Comparison.
|
K&W: Chapter 8 (Sections 8.1-8.5 only)
|
|
Extra Credit Assignment
(optional)
Merge.java
<--- Note: You can use this as a starting point for problem 3.
|
|
10
|
11/10
|
Sorting, Part 1b (Basic
sorting algorithms): Implementation Bubble Sort, Selection Sort, Insertion Sort. Complexity/Comparison.
|
K&W: Chapter 8 (Sections 8.1-8.5 only)
|
Submit: Assignment 5
|
|
|
11/12
|
Binary Trees
___________________
Hierarchical Data Structures: Trees - terminology, binary trees, expression trees, binary search trees, tree traversals: Preorder, inorder, and postorder traversals.
|
K&W: Chapter 6
|
Start: Assignment 6
|
Group A Sort (insertion and selection
sort)
Group B Sort (bubble sort)
Group C & D Sort (bubble sort)
Group E Sort (selection sort)
|
|
11
|
11/17
|
Implementing Binary Trees. Implementing Binary Search Trees. The Comparable interface in Java. Defining your own exceptions.
|
K&W: Chapter 6
|
|
|
|
11/19
|
Binary Search Trees, contd. Heaps & priority Queues.
|
K&W: Chapter 7
|
|
|
|
12
|
11/24
|
Sets and Maps in Java Collections Framework.
|
K&W: Chapter 7
|
|
|
|
11/26
|
Thanksgiving Break
|
|
|
|
|
13
|
12/01
|
Hash Tables: details. Hash tables internals: Open Addressing (w/ Linear Probing, Quadratic Probing), Chaining. Sorting: Selection Sort and Insertion Sort. Analysis for Sorting algorithms.
|
|
Submit: Assignment 6
|
|
|
12/03
|
Sorting: Quick Sort, Heap Sort, Merge Sort. How to sort using Java libraries.
|
|
|
Exam 3 Review Topics
|
|
14
|
12/08
|
Today is our last lecture. Review and wrap up.
|
|
|
|
|
12/10
|
Exam 3
|
|
|
|
|
FINALS WEEK
|
12/13
|
|
|
|
|
Ziting Shen, zshen @ bmc, Sundays 6:00pm to 10:00pm
Rachel
Xu, rxu1 @ bmc, Mondays and Wednesdays 7:30pm to 9:30pm