Happened: 2,4,6.

• Making objects, assignments, arrays, loops.

  At UAlbany, there will be an INSTANCE of the Jan 28-30 Global Game Jam. There will be MANY OTHER INSTANCES of the Game Jam at places all over the world.

• Program that prints its argument array backwards.
• Order of things happening with a for loop
• Assignment 1: Submitting a complete application (DUE Jan 24)

• Mad PhD Makes Objects Video

• Incremental development of complete applications, submitting CSI310 homework.
• Write code that guarantees that array elements are NEVER

  accessed with subscripts that are out of the array's bounds.

• Begin the color separation project.
• Lab Assignment
• FramedPictureMaker.java

• Setting up a folder (to be called a directory) for this course: Demonstrated on a USB drive. Configuring the CLASSPATH in Dr.Java to contain the media-source directoryh.
• Making objects, assignments, arrays, loops.
• Complete program: Java file that
  1. Has notes about TWO things to do with classes: make your own and use other peoples.
  2. Is a container for a complete program.
  3. Is an almost complete program that makes a 2nd copy of a Picture.
• Prereq Exam.
• Assignment 3: Create an array of Pictures. Make three new Pictures with the inputted images layed out in a row.(DUE Feb. 4)

• MetallicaDemostration.java
• • GE slides for Chapter 1 (.ppt)  (.pdf)
  • GE slides for Chapter 2 (.ppt)  (.pdf)
  • GE slides for Chapter 3 (.ppt)  (.pdf)

• GLOBAL GAME JAM POSTER
• Misconception addressing Blackboard "assessment" DUE in 2 Weeks.
• Assignment 3: Create an array of Pictures. Make three new Pictures with the inputted images layed out in a row.(DUE Feb. 4)
• Blender video of two Picture objects..
• Arrays and locations -- visualized w/ video; what if there are 2 sheets separate sheets of paper each with coordinate axes?
• Assignment 2: Color separations (DUE Feb. 2)        Correct result example(.jpg)
• Sketch of how to figure out what size the 2nd Pictuure object should be.
• MetallicaDemonstration.java for Lecture03
• Misconceptions:SUPPLEMENTAL:        Misconceptions with notes written upon them
  1. Printing versus computing or calculating
  2. Inputting from people versus accessing simple variable or array elements.
  3. out of time.

• ---

  Making objects, assignments, arrays, loops.

• Composing pictures
• array of Pictures
• GE Pixel array in a Picture
• array of doubles
• • Mad PhD Makes Objects Video
• Person classes
• Array of Turtles
• GE slides for Chapter 1 (.ppt)  (.pdf)
• GE slides for Chapter 2 (.ppt)  (.pdf)

GE slides for Chapter 3 (.ppt)  (.pdf)

• MONDAY and TUESDAY: Do Lab 1 (last week) if you haven't done so already.
• WED, THU, FRI; MON Jan 8 and TUE Jan 9: Lab 2: Instantiating and referring to multiple Houses from multiple House reference variables. Remember the Mad PhD Makes Objects Video

•   Misconceptions with notes written upon them
• Remember the Mad PhD Makes Objects Video
• Lab Assignment 2
• Extra Credit Assignment 4 : 2 by 2 four picture layout:((DUE Feb 11)

• Making objects, assignments, arrays, loops.

• UA-CCI ACM Student Chapter meeting THURSDAY 6:00PM LI-84
• Assignment 5: Linked list of Pictures(EARLY BIRD: Wed. Feb 9. REGULAR DUE DATE: Mon, Feb 14.)
• How the red color intensity is copied.      With scribbles
• Refactoring the FramedPictureMaker so it has a separate copy image copying method: Before.        After.
• • Introduction to the book and the subject, emphasis on modeling.

    The Demo programs on the right demonstrate how to implement a table information model in Java.

  • Barbara's House model: HuntSpot.java      HuntDemo.java
• STARTING ASSIGNMENT 5! See the HuntSpot.java and HuntDemo.java examples above. Chapter 1 of the textbook explains the "Treasure Hunt" in Prof. Barbara Ericson's house. My demo introduced instantiation, object and objects that each have a link to another object of the same class.

• Seseme Street Database (table)      Demonstrator class

• Lab 2 (M, T, W) Lab Assignment 2
• Lab Assignment 3 (Th Feb 10,, F Feb 11, M Feb 14, T Feb 15, Wed Feb 15.)
  • Application.java
  • Dog.java
  • Cat.java

• Instantiation, what objects are, LOCATIONs of objects.
• The Two House Tale (example for Lab 2) House.java demo (shown in Lecture).

  We put DrJava in debug mode and looked at the what the program printed one line at a time.

• Prepared notes introduce Assignment 5--will cover in detail on Thursday.
• Linked objects and lists included in the notes

  ---

• Now or future (planninq queue)
  • Method calls
  • Activations
  • Activation stack
  • Call tree
  • Free store
  • Constructors
  • Static vs instance methods

• Remember the Mad PhD Makes Objects Video

• Prepared notes introduce Assignment 5--covered in detail on Thursday; notes from Thursday's class are now added!.
• Linked objects and lists
• Building a list surprise Quiz! TreasureHuntDemo.java (Quiz version)   HuntSpot.java

• No new lab this week: M, T, Wed people do last week's lab, Thu, Fri lab meetings for missed labs or help with Assignment 5.

• Linked List idea for Assignment 5.(Old notes: New Ones will be posted after lecture)
• Surprise Quiz an a linked list variation much like Assignment 5 and introducing stacks: The Procrastinator's to-do list.. (access forbidden until after the Quiz!)
  • Quiz
  • itemNode.java
  • procrastinationProgram.java
  • procrastinatorsToDoList.java(still Forbidden)
  • Scribbles before the Quiz.
• Assignment 6: Editing your list of Pictures after importing it. (Wed, Mar 2 EARLY BIRD, regular Fri, Mar 4)

  RUNNABLE PROTOTYPE ASSIGNMENT 6 PROGRAM--EXTRA CREDIT VERSION (Download and run as an executable .jar to see what your program should do. The visible bordering of the image marked by the cursor is ONLY for extra credit.

• One.jpg
• Two.jpg
• Three.jpg
• Four.jpg

• 15 minutes to finish the team-based quiz. TOOK LONGER: HELPFUL DISCUSSIONS
• Asg 5 summary, using older notes; critique of GE's linked list design
• (not talked about in the lecture, but Please use of methods for assignments 6 and beyond like:
  • Refactoring the FramedPictureMaker so it has a separate copy image copying method: Before.        After.

• Planned but deferred:
• Future: Graphics application
• Linked list and array implementations

• Future Maybe: Regular expression matcher

• Lab04 Assignment(featuring a circularly linked list)
• Lab04 Java code framework(cardGame.java)

• The Asg 6 problems: (Scribbles with the 2 Quizzes..)
  • In a sequence of say 3 things, there are 4 positions to insert another.
  • To insert or delete at a position, the next pointer for the previous position must be modified.
  • Home is a special case.
• Intro. to linked list variations: circular (in Lab 04)
• Doubly linked lists
  • Diagram of the goal of inserting a new node into a doubly linked list.
  • Coding the solution onto the structure in Java
  • Notes from a C++ course covering doubly linked lists.
• Operations like copying an image MUST be coded in separate methods
  Refactoring the FramedPictureMaker so it has a separate copy image copying method: Before.        After.
• Homework Style and Commenting Requirements.
• Scribbles made to answer questions at the end of the lecture.
• Assignment 7: (DUE Extended to Mar. 14) Refactor your Assignment 6 program so it uses a doubly linked list and has an efficient backward cursor move operation in addition to everything it had before.

• From,Mozilla.(the engine behind Firefox)

• OPEN QUIZ: Gives important details for Assignment 6 so work it now if you haven't finished; and it will be administered for a grade during the lecture!
  • Question 1     Answer
  • Question 2     Answer
  • Discussion:
    • A Java reference/pointer/address/location CANNOT refer to any variable/field which is inside an object. Java reference/ pointer/ address/ location values can only be either the null value or the location of an entire Java object. (However, this restriction does NOT apply to C or C++, which you will learn in UAlbany's CSI333, the course that follows this course in the CS major programs.
    • If you use the Dummy-head option, the constructor of PictureList should construct the Dummy Head PositionedSceneElement, and make first, last and cursor point to it, as the first diagram on the quiz shows.

• Assignments 6 and beyond require (for full credit) the use of self-contained methods for appropriate operations like copying the image from one Picture into another Picture.
• Intro to stacks, recursion and the full story about method calling (next topic). The Procrastinators To Do list has the LAST task added being the FIRST task done. Recursion used to print a palindrome made from the list. The method to do this calls a "helper method" to print the palendrom starting from a given location. Dramatized by the professor banging on the whiteboard and running back and forth: There are only 3 steps:
  1. Print one description from the node at a given location.
  2. Print the palendrome starting at the next location.
  3. Print one description from the node at a given location. (Just repeat step 1.)
  • itemNode.java
  • procrastinationProgram.java
  • procrastinatorsToDoList.java

• Lab 05 (will continue for 2 weeks) SOCIAL NETWORK.

• SURVEY
• Blender Demo of parenting and a scene graph.
  • Download and run in Blender (on Library computers or your own)
  • Blender Notes: Java Objects == Blender Blocks
• Topics for Midterm. Sample Questions/Answers to help review(Corrected).
• REVIEW DISCUSSION
• Linked list midterm review QUIZ and Homework Assignment(Now corrected). GET THEM NOW!
• POSTED AFTER CLASS: Assg 7 due date changed to March 14.

• Blender.org website
• Prof. Chaiken's Intro to Blender for graphics students First Part.
• Prof. Chaiken's Intro to Blender for graphics students Second Part.
• Prof. Chaiken's Intro to animation in Blender for graphics students.

• MIDTERM EXAM Closed book, one 8 1/2 x 11 inch paper sheet of notes.

• Finish "Facebook" lab from last week.

• Lecture NOTES and Homework ASSIGNMENT 8: MERGESORT LINES OF TEXT THAT YOU TYPE IN
• Project support:  Java Code from class        STUB
• Readings from The Cat in the Hat Comes Back, by Dr. Suess (1958) relating to method calling/returning and recursion.
• 
  

• ---

• Complete Homework Assignment 8 Background Outline and actual assignment (DUE Mar 23)
• itemNode.java
• procrastinationProgram.java
• procrastinatorsToDoList.java
• Scribbles about Activation History Trees: Palendroming and beginning of MergeSort.
• Old MergeSort Slides--showing a full activatation tree for an example of MergeSort..

• ---

  Posted AFTER THE LECTURE: 2 Java files comprising a framework for the homework

  • SortingApplication.java (COPY AND DON"T MODIFY)
  • SortingEngine.java (COPY, TEST, then CODE YOUR MERGE and MERGESORT HERE, REMOVE USE OF THE SORT METHOD FROM THE JAVA LIBRARY!)
  • A book from Project Guttenberg for test input.
  • The book sorted to compare with your program's output

• LAB 7 Intro to Java Project done with the Unix/Linux command line.

• Towers explained
• Towers of Hano( .java file)
• PROJECT SUPPORT:
• MERGESORT, recursion, activations, trees etc.
• Java Memory Model, MergeSort and Merging

• Project support scribbles from class
• Activation History Tree for MergeSort
• HOMEWORK: READ AND TRY OUT the Guzdial/Ericson stuff of Chapter 8: GET IT TO WORK YOURSELF! The next project will be based on these ideas! (You might need to use material from Chapter 7.)

• Lab 08: "Reverse Engineering" draw a data structure diagram for the GE Chapter 8 Scene Graph. Bring your textbook, although copies of the chapter will be available. To be done in 3-4 person teams with the diagram on paper to be submitted AT THE END OF THE LAB!
• HELP for when the WolfAttackMovie doesn't work: Patches for GE's WolfAttackMovie program.

• HBranch should have "private int gap"
• VBranch should also have "private int gap"
• Pages to find the class def. code:
  • DrawableNode p.195
  • Branch p. 199
  • PictNode p. 197
  • HBranch p. 202
  • VBranch p. 203
  • MoveBranch p. 204
  • BlueScreenNode p. 198
    • Picture class

• MERGESORT, recursion, activations, trees etc.
• Tracing (Activation History AND Activation Record Stack) of palendrome method
  • procrastinationProgram.java
  • procrastinatorsToDoList.java
  • itemNode.java
• Lab 08: Introduction to the scene graph and inheritance.
  • DrawableNode
    • PictNode
      • BlueScreenNode

        Uses Picture class, blueScreen Method.

    • Branch
      • MoveBranch
      • HBranch
• Tricky ideas involved:
  1. Data structure with pointers; part is a linked list.
  2. It is a tree.
  3. Traversing the scene tree to render it is RECURSIVE.
  4. Traversing involves methods calling one another that involves separate activations of the same or similar methods.
  5. Introduces inheritance.
• Assignment 9: Scene Graph. DUE Wed, April 13
  1. Write into a document answers to GE Chapter 8 Exercises 8.2, 8.3 and and 8.5
  2. Program exercise 8.6 (Omit example if you do item 4.)
  3. Program exercise 8.10 (Omit example if you do item 4.)
  4. Program exercise 8.12 The wolves attack MUST come from the right edge and the hero must appear near the left edge. Modify the scenario creatively in a way that MUST demonstrate your work for items 2. and 3.

• Element tree traversing interface to DOM

  used in JavaScript (w3c STANDARD)

• MERGESORT, recursion,STACKS, TREES, EXPRESSIONS, EXPRESSION EVALUTION etc.
• Tree and XML notes.
• Lab 08: Introduction to the scene graph and inheritance.
  • DrawableNode
    • PictNode
      • BlueScreenNode

        Uses Picture class, blueScreen Method.

    • Branch
      • MoveBranch
      • HBranch
• Reading assignment:
  1. Trees: (also arrays and lists) 10.3
  2. Introducing stacks: 11.11
  3. Binary search and tree traversal: 10.4

• Tips sheet for Assignment 9 UPDATED

• Lab 09: Add TRACED binary and brute-force search to the TreeNode class (for binary trees) from GE, write traces of recursive methods on paper and check them against what the computer prints. Credit for PAPER turned in.
• Announcement: Paper lab work may be accepted at your next lab meeting, one week after you begin!

• drawing.svg
  • Rendered: Just click on it and see.
  • xml source: Do View Source on your browser.
  • Viewed in Firebug's interactive tree browser.
  • Tree drawn with circles and arrows.
• NIH taxonomy tree Search for homo sapiens
• Tracing of recursive Fibonacci number calculation, with (1) Fibonacci number definition. (2) Activation History Tree for a given recursive Java method (3) Stack of activation records growing and shrinking alongside the Activation History Tree.

• Must supply some notes and exercises for learning xml fundamentals.
• Firebug xml and other Web language viewer, editoand debugger.

• Announcement: Paper lab work may be accepted at your next lab meeting, one week after you begin!
• Announcement 2 re: Assignment 9:
  1. The ScaleNode class should enable you to animate a monster CHANGING IN SIZE in the same way that the MoveBranch animates some of a scene MOVING.

     The ScaleNode should extend the PictNode or the BlueScreenNode (your choice). It should have methods for getting and setting the scale factor (just like the MoveBranch has getXPos, getYPos and moveTo. The drawWidth method of ScaleNode should apply the scale method to its Picture to get another Picture to give to the turtle to drop, or to run the blueScreen method on.

  2. I think GE overlooked something when they wrote Exercise 8.10! My intention was that you create a useful DiagonalBranch class WITHOUT modifying any of the given classes. So, for this course, you should just make a DiagonalBranch object draw its children on a diagonal line that you can specify with instance variables similar to gap of the HBranch and VBranch and similar to x and y of the MoveBranch.

     (GE's class designs did not provide for methods for communicating the dimensions or locations of graphics drawn from any of the nodes, which you would need to properly get the "width and height of the previous Picture").

     If you already implemented and demonstrated a reasonable interpretation of the original Exercise 8.10, that is acceptable too!

• Annotating and tracing the recursive Towers of Hanoii play() method.
  • The class we started with.
    1. Made the print() method print the value of this: instance methods are always called ON an object; the value of this is the reference/location/address/pointer to the object that the method is called on. We saw the pointer printed by DrJava from myGame is the same as what println() prints from this.
    2. Add the depth parameter to play()
    3. Make play print a message when it is called.
    4. Make play print a message when it returns.
    5. Make the Towers class into a Java Application by adding the public static void main method.
    6. Make a method to print N spaces, and use that to indent the call and return messages the amount of depth.
    7. Put tracing statements into the main method and the Towers constructor.
    8. Disable the printing of the moves, so we can easily see the nested activation call and returns.
  • The class we ended up with.
  • The activation history tree for playing the 3 disk game.
• Java library class hierarchies
  • ArrayList, look at its ancestors too.
• Binary search tree: scribbled example

• Lab 10: Analyze recursive pattern matching code on PAPER and complete programming and testing the * (wildcard matching any number of any characters) case on Blackboard. (.java file)

• Tree kinds and applications, stuff done up to now, FINAL HOMEWORK ASSIGNMENT 10 DUE April 27..
  • 15.1 Write a short report of what you did and what you figured out about why it works that way.
  • 15.5 Submit the code and a report that answers the question.
  • 15.6 Submit the code and a report that answers the question.
  • 15.9 Submit the code, compare simulations with and without aging, and write a report on their similarities and differences.
• Modified WolfDeerSimulation.java file demonstrated.
• Guzdial's Chapter 15 slides with sdc's notes written on them.

• Original Chapter 15 Slides
• Java Tutorial about Exceptions.

• Tracing of the recursive pattern matching code of Lab 10 (scribbles) includes notes on OVERLOADED METHOD NAMES: same name, different SIGNATURE, different METHOD BODIES.
  • The Java File: Download, print, run and modify. Lab 10 work all due Friday, April 28.
• Explanation of Chapter 15 including specialization (inheriting) and aggregation (referring to) continued (Chapter 15 slides with scribbles.)
  • How a Wolf is an extension of a Turtle.

• LAB 10 due day is EXTENDED TO FRI, April 29.
• LAB 11 is left for review and discussion of the programming problems in the major assignments after the Midterm.

• Summaries of Programming Projects.

• Explanation of Chpter 15.

• • A class is a blueprint for building objects!! (hopefully last time recited).
  • WolfDeerSimulation class
  • AgentNode class
  • LLNode class
  • Wolf class
  • Some SW engineering terms: Singleton design pattern, association vs containment, UML class diagram.
  • Beware: The class diagram expresses relationships like inheritance and aggregation among classes (as blueprints) but the data structure diagram expresses how computer memory is structured. So, the WolfDeerSimulation object has 2 references to AgentNode but only one AgentNode class is drawn in the class diagram

• The Source Code
• Is the real world a metaphor for computer software objects?
• Are computer software objects metaphores for real world objects?
• Grady Booch (one of the creators of UML) said: "The Unified Modeling Language is a graphical language used to visualize, specify, reason about, document, and construct the artifacts of a software-intensive system."

• 3 algorithms for the rod-cutting problem
  • Version One
  • Final Version: With a shared base class, an interface, and a benchmarking application class.

    PDF for printing

  • Notes on the Rod Cutting Problem, one (slow) Algorithm and analyzing the recursion.
  • Notes on Final Version case study software design,

    including explanation of interface/implements

    and why the design uses extends/subclasses.

• Notes: Final info, TWO kinds of trees describing structure in OOP. (in reference to Chapter 13 about Java GUI programming)
• Some review questions
• MERGESORT, recursion,STACKS, TREES, EXPRESSIONS, EXPRESSION EVALUTION etc.
  1. Mergesort tracing
  2. Why Mergesort is fast. (Quiz: How many levels are used when merge-sorting 1,000,000 letters?.
  3. Expression tree: Evaluate with a stack; Postfix notation (see also textbook chapter 10).