Grades updated 6:55 pm to include all CSIDs and all projects and project
replacements
| |||||
Comprehensive
final exam will be in our usual lecture hall (201 Education)
|
![]()
Comprehensive
final exam will be in our usual lecture hall (201 Education)
| |||||
Reminder: Boggle Iteration 1 was due last night at 8:00 pm
|
| Take the Practice final and check answers that will be posted here by 3:00 pm, Friday 8-May |
Consider your current grades
| |||
| Hand out practice final | |||
| Final Exam Review Sheet | |||
| Here are links to the other two practice tests and answers | |||
227PracticeTest1Spring09.pdf
| |||
227PracticeTest2.pdf
|
![]()
![]()
![]()
Project 11: Boggle is now linked
| |||||||
| Friday and Monday Lecture will be held in 228 Gould Simpson to work on Boggle |
| Begin Boggle, email it to yourself so you can get it in the lab on Friday |
Turnin these three printouts to your section leader
| |||||||
Complete Java's Collection
Framework begin at slide 21-19
| |||||||
| Introduce the final project: Boggle (see projects page) |
![]()
Due Dates for Project 10 OrderedMap<K,V> and the two RandomWriters
|
| Complete Project 10: OrderedMap/RandomWriters |
| Any questions on current project? | |
| Introduce Java's Collection Framework | |
| In class |
![]()
Project 10, Part I has been Webcatted
|
| Work on Project 10: OrderedMap/RandomWriters |
| Any questions on current project? | |
| HashTables: Another data structure with better runtimes than balanced BSTs |
![]()
| Project 10 Linked |
| Work on Project 10: OrderedMap and Two RandomWriters |
| Consider the remove algorithm when there is a left child | |||||||||||||||||
Consider part 2 of Project 10: RandomWriters
|
![]()
| Project 10 Linked (one lecture early again) |
| Work on Game of 20 questions |
| The Map ADT and OrderedMap, which is part of the next project | |
| OrderedMap.ppt | |
| Consider part 1 of Project 10: OrderedMap |
![]()
| None |
| Work on Game of 20 questions |
| Binary Search Trees |
![]()
| Project 10 Linked: Game of 20 Questions |
| Begin next project |
| Lecture today is all about the Game of 20 Questions and Java considerations needed to complete the project | |||||||||||||||
| Pay a game of 20 questions | |||||||||||||||
Consider the next project: Game of 20 Questions
|
![]()
Project 7 RecursionFun does not require a printed handout Wednesday
| |||
| Obstacle course bonus homework now WebCatted (code coverage on the GUI is ignored for this one--you can get 5/5 even with poor code coverage, so submitting the GUI is okay) |
| Read Project 9: Game of 20 Questions (see Projects page) | |||||
Repeating: Optional Homework
|
| Finish
ExpressionTree
with this methods. Note some of these methods are
very relevant for the next project, especially build.
private TreeNode build() public String infix() // Return the infix traversal of the data in ExpressionTree public String postfix() // Return the postfix traversal of the data in ExpressionTree public String sideways() // The tree with levels shown as indents in a "sideways" manner public int valueOf() // The value the expression tree evaluates to (integer operands) |
![]()
Project 7 RecursionFun will not require a printed handout next Wednesday
| |||
| Obstacle course bonus homework now WebCatted (code coverage on the GUI is ignored for this one--you can get 5/5 even with poor code coverage, so submitting the GUI is okay) |
| Read Chapter 19: Binary Trees | |||||
Optional Homework
|
| Introduce Binary Trees | |
| Begin Code demo: Expression Trees ExpressionTree.pdf was attached to today's handout |
![]()
| Project 7 RecursionFun does not require a printed handout this time (we'll check your WebCat submisson) |
| Complete Project 7: RecursionFun | |||
Now Optional By Wednesday 15-April, 9:50 am, complete homework ObstacleCourse.pdf
|
More Recursion: Backtracking
|
![]()
| Project 7 Linked: RecursionFun |
Before Wednesday's lecture, complete these JavaBat problems
|
Guest lecture by Will (while Rick was at ChiliPLoP
2009)
|
![]()
![]()
Test 2 Friday 3-April
|
| If possible, before section , complete page 1 of the practice test (questions 1..6) | |||
Read the Test Review sheet and
complete this Practice Test (the
handout from today for this in lecture)
|
| Complete LooplessLinkedBag<E> so no loops exist | |
| Have both classes implement the Iterable<T> interface | |
| Consider test topics from Test Review sheet |
![]()
Test 2 Friday 3-April
|
| Finish Minesweeper |
Begin test review today with with arrays and linked structures while
continuing discussion of recursion
|
![]()
| None |
| Work on Minesweeper |
| Continue Recursion 18A-SimpleRecursion.ppt 18-17 .. 18-26 | |||
In class: Write a code with printlns (see slide 26)
|
![]()
| Project 7 Linked: Minesweeper |
| Begin Minesweeper |
| Introduce Recursion 18A-SimpleRecursion.ppt 18-1 .. 18-18 | |||||
Introduce current project
|
![]()
Homework 5 is due tomorrow night @ 8:00 pm
|
By 8:00 pm Tuesday: Implement OurStack<E> and OurQueue<E> with singly linked data
structures
| |||
Before Wednesday Lecture, read pages 247..256 in Chapter 18: Recursion
|
17-StacksQueues.ppt
|
![]()
| This Friday, lecture will be held in 930 Gould-Simpson (lab with 31 workstations) for those who have not completed ArrayPriorityList<E> and LinkedPriorityList<E> | |||
|
// regarding toArray (): This code compiles but causes a ClassCastExceptionObject[] obj = new Object[10]; // toArray returns Object[]String[] str = (String[]) obj; // <- RUNTIME ERROR // Recommended: you can cast individual array elements obj[0] = new String("abc"); String aString = (String) obj[0]; // okay assertEquals("abc", aString); // passes
|
| If necessary, work on current project | |||
Optional: Read Chapter 14: Algorithm Analysis online
(search for Chapter 14 in the pdf)
|
Finish 14-AlgorithmAnalysis.ppt
Big O 23-47
| |||||
Consider the Stack ADT and one application: Evaluating postfix expressions
|
![]()
| Lecture will be held in 930 Gould-Simpson (lab with 31 workstations) this Friday for those who have not completed ArrayPriorityList<E> and LinkedPriorityList<E> | |||||||
Tuesday, 10-March is the last day to change from audit to credit or credit
to audit, or withdraw and get no credit.
|
Read Chapter 17: "Stacks and Queues"
| |||||
Work on current project
|
14-AlgorithmAnalysis.ppt
Big O (Optional: Read Chapter 14: Algorithm Analysis online
(many symbols went missing from Fast Copy formatting Rick's pdfs)
|
![]()
| Section Leader Lecture today |
| Work on current project |
Questions on project?
|
![]()
Both parts of Project 6 are now linked
|
Read Chapter 16: Linked Structures, pages 203-227
|
Testing to ensure ArrayBag.get(int index) does indeed throw an exception
when index < 0 and index == size
| |||||
| 16-LinkedIntro.ppt | |||||
Code Demo: Finish LinkedBag<E> implement Bag<E> that was begun
in the slides
| |||||
| Consider part two (LinkedPriorityList<E>) of the next project (see projects page) |
![]()
First part of Project 6 linked
|
| Read Chapter 15, pages 185-195: Implementing a List interface and Exceptions, answer all self-checks | |
| Optional reading, pages 195-201: Example code and pictures could help in Project 6A: ArrayPrioirtyList<E> implements PriorityList<E> |
Code Demo:
| |||||||
| 13B-CollectionConsiderations.ppt (part 2) | |||||||
Consider part one (ArrayPriorityList<E>) of the next project (see projects
page)
|
![]()
GameOfLifeGUI.java is available for
those who have 100% code and problem coverage
|
| Work on Project 4: Game of Life |
| 13A-CollectionConsiderations.ppt
|
![]()
2nd part of 227 book was actually edited
|
| Work on Project 4: Game of Life | |||
Read Chapter 13: Collection Considerations, pages 152..165, answer all self-checks
|
| Questions on current project: GameOfLife? | |||
| Java Interfaces (there is a 1 page handout of 11 slides) | |||
Code demo: Show a generic sorting algorithm that sorts an array of any
type that implements Comparable
|
![]()
| Project 4 WebCatted |
Begin Project 4: Game of Life
| |||
Read Chapter 12: Interfaces, pages 143..150, answer all self-checks
|
More 2D arrays
| |||||||||
| Discuss Project 5: Game of Life (see projects page) | |||||||||
| See your section leader to get your test back | |||||||||
|
![]()
Test 1, 10:00-10:50
|
![]()
| New: Added after class: Here are the Answers to the Practice test | |
| Test 1 will be Friday 20-Feb |
| Study for the test (topics and resources are listed in the Test 1 Review Sheet |
| Go over Review Sheet handout | ||||||||||||||||||||||||||||||||||
| Present more explanation and examples of things that are still not clear according to your anonymous feedback from Monday | ||||||||||||||||||||||||||||||||||
|
| Selected once: Objects, Tricky Question :-), Collections-how to make, Test material, Nested loops, Go over practice test, JavaBat logic, Calculations, Array replace |
![]()
Career fair this week (swag and get a taste of companies for summer '10
internships)
| |||||||||||||
Test 1 will be this Friday 20-Feb
| |||||||||||||
| Section leader Test review session |
| Complete this practice test before your section this week: 227PracticeTest1Spring09.pdf |
| Questions on current project? | |||||||||
Arrays with two subscripts:
double[][] table = new double[3][4];
|
![]()
Test 1 will be Friday 20-Feb
| |||
| Project 4 has been WebCatted |
| Work on Descriptive Statistics | |
| For Monday, read Chapter 11: 2D arrays and by Monday we are finished with the 4 unit C Sc127A course in 14/45ths (31%) of a semester (2D arrays will not be on the test) |
Project 4: Descriptive Statistics
| |||||||||||||||
Sorting Demo: Need 5 volunteers who are willing to follow Rick's
instructions in front of the class
|
![]()
WebCat certificate expired Saturday night and the Eclipse plugin would not
work to Submit
| |||
Rick's Office Hours were open door, They are now
|
| If necessary, work on ArrayFun | |
| Read Chapter 9: A Collection Class in Rick's book answering all self-checks, pages 113-119 |
Java classes with constructors and instance variables
String227(String) // The constructor - done int length() // a getter - done char charAt(int) // a getter - donevoid toUpperCase() // modifies the object - you did this String toString() // @Override String227@17AF9C int compareTo(String 227) // make it like String's compareTo void deleteCharAt(int) // modifies the object--the array shrinks by 1 element void append(String227) // modifies the object--the array grows by arg.length() void insertCharAt(char, int) // modifies the object--the array grows by 1 element
|
![]()
Rick's Office Hours:
|
| Read Chapter 10: Sorting and Searching Rick's book answering all self-checks, pages 121 |
Java classes with constructors and instance variables
String227(String) // The constructor - done int length() // a getter - done char charAt(int) // a getter - donevoid toUpperCase() // modifies the object - you did this String toString() // @Override String227@17AF9C int compareTo(String 227) // make it like String's compareTo void append(String227) // modifies the object--the array grows by arg.length() void deleteCharAt(int) // modifies the object--the array shrinks by 1 element void insertCharAt(char, int) // array grows by 1 while using shifting array elements | |||
Multiple constructors with String227() String227(char[] array)
| |||
| Consider scope, type and lifetime of variables in classes, see handout | |||
Introduce project 4: Descriptive Statistics
|
![]()
WebCat certificate expired Saturday night and the Eclipse plugin would not
work to Submit
| |||
Rick's Office Hours were open door, They are now
|
| If necessary, work on ArrayFun | |
| Read Chapter 9: A Collection Class in Rick's book answering all self-checks, pages 113-119 |
Java classes with constructors and instance variables
String227(String) // The constructor - done int length() // a getter - done char charAt(int) // a getter - donevoid toUpperCase() // modifies the object - you did this String toString() // @Override String227@17AF9C int compareTo(String 227) // make it like String's compareTo void deleteCharAt(int) // modifies the object--the array shrinks by 1 element void append(String227) // modifies the object--the array grows by arg.length() void insertCharAt(char, int) // modifies the object--the array grows by 1 element
|
![]()
| Project 3 was WebCatted Yesterday to allow you to submit your ArrayFun project | |||
Rick's Office Hours were open door, They are now
|
| Work on ArrayFun | |
| Read Chapter 9: A Collection Class in Rick's book |
Java Classes with constructors and instance variables
|
![]()
| Turn in your hard copy printouts of ControlFun.java and ControlFunTest.java | |
| Project 3: ArrayFun is posted (see Projects page) |
Complete any 12 JavaBat problems from Array-2 from
the top 5 rows
|
| Begin Project 3: ArrayFun | |
| Read Chapter 5 in the first part of Rick's Book: Classes = Methods+ Data, answer all self-checks (answers at end of chapter. |
Array processing with loops--for now we assume all arrays are full, they
all have array.length meaningful elements
| |||||||||||||
Practice test question
|
![]()
| Project 2: ControlFun due Tuesday 8:00 pm via WebCat | |||
Bring hard copy printouts of ControlFunTest.java and ControlFun.java to
lecture on Wednesday
|
If necessary,
|
| Any questions/concerns on current project? | |||||||||||||||
Continue with the Java array objects (one subscript only)
|
![]()
| Project 2: ControlFun is now WebCatted (I usually WebCat projects two days after assigning to avoid confusion with the previous project) |
| Work on ControlFun | |||||||
Before Monday's lecture
|
Code demos: two more while loops
| |||||
| Any questions in the current project: ControlFun? | |||||
| Begin 08-Arrays , 8-1..8-12 |
![]()
Project 2 Linked, due Tuesday 3-Feb by 8:00 pm.
|
| Read about indeterminate loops, while loops, and Scanner (String) in Chapter 7, pages 88 - 93 | |
| Work on Project 2: ControlFun |
07B The Indeterminate
loop pattern and Java's while loop
|
![]()
Tonight you should be getting an email from WebCat with your WebCat
account name and a randomly generated password
|
Complete Homework TwoMethods
with a Unit test for another class with two methods.
| |||
| If necessary, read about repetition (for loops and while loops) in Chapter 7, answer self checks from Rick's book or some other source |
| 07A The Determinate loop pattern and Java's for loop | |||||||
Writing methods with selection statements tested by a JUnit test
| |||||||
| Demonstrate submitting to WebCat (follow homework) |
![]()
| Turn in project 1 to your section leader: Four printouts stapled together | |||||
Repeating in case you missed it: Room change for Will's Section 4, Thu, 9:00-9:50
| |||||
Please help future students as they have helped you (the first 12 chapters
have not been edited, there may be--actually probably are--typos)
|
| First: read about if and if..else statements in Chapter 6, pages 69..74 from Rick's book | |||||||||||||||||||||||||||||||
Before Wednesday, 28-January's 10:00 a.m. lecture (Project 2 will be
posted Monday)
|
Demonstrate String methods in Assertions and Eclipse
| |||
| Methods 4-2 ..4-11 | |||
| Selection 6-2..6-15 | |||
| Demonstrate JavaBat http://javabat.com/ |
![]()
| Project 1 due this Friday" Four printouts stapled together | |||
Room change for Will's Section 4, Thu, 9:00-9:50
|
| Reading for Friday, 21-Jan | |
| Chapter 4: Methods | |
| If you haven't done so, get your CS account ASAP (for Windows and Unix) with this apply program |
Introduce Objects and JUnit
3-1 .. 3-20
|
![]()
| As of 1:30pm Thursday, hardcopy versions of the C Sc 227 Textbook for Spring 2008 were available in the UofA bookstore. | |
| Project 1 is posted (see projects page) |
Readings for Wednesday, 21-Jan
| |||
| Work on Project 1, at least the first three problems | |||
| If you haven't done so, get your CS accounts (for Windows and Unix) with this apply program |
| 02-JavaFundamentals | |||||||||
Consider the current project
|
![]()
| C Sc 227 Textbook for Spring 2008 was written by your instructor. A hard copy version will be available in the UofA bookstore after the first day of class (price TBA, but probably less than $23). It is also provided to you free online this semester. See Rick's Book, which is in two parts. |
Readings by Friday
| |||||||
| To get your CS account, run this apply program before Friday's class lecture from your own Internet connected machine or go to 930 Gould-Simpson between 8:00 and 5:00 pm. |
| Peruse a few relevant details in the Syllabus | |
| Program Development: Write a program to compute the grades for C Sc 277, Spring 2009. | |
| See Rick for adding or switching sections |