IB Computer Science 2

From WLCS
Jump to: navigation, search

Thursday - Monday (12/6/18 - 12/10/18)

Agenda:

  • Work on Dynamic Queue Documentation assignment - due in Canvas by Sunday (12/9/18)
  • Dynamic queue implementation
  • Linked Lists
    • Traversing through a LL
    • Adding an item to a LL
    • Deleting an item from a LL
    • Modifying an item in a LL
    • Searching for an item in a LL
  • Types of Linked Lists
  • NetBeans GUI walk-through and review

Tuesday (12/4/18)

Warmup:

Agenda:

  • Programming with nodes and terminology:
    • node
    • data / cargo
    • pointers, reference variables or references
    • next reference
    • null
  • More advanced documents w/ headers, page breaks, and table of contents
  • Dynamic Queue Documentation Assignment
    1. You may use this Dynamic Queue Visualization to help you
    2. Create a Google document - it will have 3 sectioned headers
    3. Use headers (literally) for each of the following sections: isEmpty(), enqueue(data) / add(data), dequeue()
    4. Illustrate the memory diagram using nodes for isEmpty()
    5. Describe what is being shown in the illustration (using numbered steps if it helps)
    6. Illustrate the memory diagram using nodes for enqueue(data) / add(data) - before and after images!
      • Diagram the special case of enqueueing to an empty queue
      • Diagram the general case for enqueue
    7. Describe what is being shown in the illustrations (using numbered steps if it helps)
    8. Illustrate the memory diagram using nodes for dequeue() / remove() - before and after images!
      • Diagram the special case of dequeueing when there is only one node in the queue as well as
      • Diagram the general case for dequeue
    9. Describe what is being shown in the illustrations (using numbered steps if it helps)
    10. Submit your document to Canvas by Friday (12/7/18)

Friday (11/30/18)

Agenda:

  • Group 4 Project Debrief
  • Group 4 Project Reflection Google Form
    • Complete this form even if you already turned in a PDF
    • You may copy the reflection that you wrote in your PDF and paste it into the form
  • Node Quiz
  • Circular Queue demos
  • Dynamic Stack notes - before & after images with Nodes
    1. What are the different illustrations/diagrams of the stack in different situations?
    2. What would the diagram(s) look like after a push() or pop() operation?
  • Complete Java - Dynamic Stack Assignment as a class
  • Maze generation algorithm using a stack

Wednesday (11/28/18)

  • Most students will be attending the Group 4 Project field trip
  • If you are not attending, go to Ms. Smith's room (#4026)
  • Work on any missing assignments
  • Study for Node Quiz on Friday (11/30/18)
  • Work on Java - Dynamic Stack Assignment

Monday (11/26/18)

Agenda:

  • Group 4 Project Field Trip (Wednesday-Thursday 11/28-11/29)
    • If you are attending, check-in and orientation at the auditorium at 8:19am
    • If you are not attending, 4th and 6th periods, go to Ms. Smith's room (#4026)
  • Assignments thus far. Demo missing assignments during GP:
    • Poker Hands: Part 1
    • Poker Hands: Part 2 (repl.it submission coming soon)
    • Static Queue
    • Circular Queue
  • Object and References Review - Using JGrasp
  • Node class
  • More Node Practice!
  • Node Quiz on Friday (11/30/18)
    • 2 questions
    • If given code, you can draw a memory diagram illustration
    • If given a memory diagram illustration, you can write the code to create it
  • Dynamic Stack Visualization
  • Work on Java - Dynamic Stack Assignment

Monday (11/19/18)

Agenda:

  • Ensure that you've installed NetBeans and JGrasp
  • NVCC Dual Enrollment forms?
  • Workplace Readiness Skills: Pre-assessment
  • Assignments thus far:
    • Poker Hands: Part 1
    • Poker Hands: Part 2 (repl.it submission coming soon)
    • Static Queue
    • Circular Queue
  • Queue questions?
    • Quiz will be after lunch (at the halfway point of class)
  • Demo assignments

Thursday (11/15/18)

Agenda:

  • Demo your Java - Static Queue Assignment
  • Complete the circular queue challenge extension in the Java - Static Queue Assignment. Be sure you save as a new project or file and rename the class to CircularQueue. Do not overwrite your StaticQueue code!
  • Demo your circular queue
  • Queue quiz on Monday (11/19/18)

Tuesday (11/13/18)

Agenda:

Thursday (11/8/18)

Agenda:

  • Mr. Bui is out b/c his son is sick. There will be a closed-book, closed-person quiz on stacks halfway through class. Use the first half of class to review all the stack material and to interact with the stack array implementation
  • If you have not already done so, complete your submission to Poker Hands: Part 1
  • Introduction to Stacks - Stacks slides
    • Be able to describe the characteristics of a stack
    • Be able to explain the operations of a stack
    • Be able to describe different stack applications
    • If given a list or an array, be able to explain their use as stacks
    • Be able to implement the programming code for a stack that uses an array
  • Study the code in Media:Stack.java and Media:StackMain.java
  • Halfway through class...take the Stack Quiz

Thursday - Monday (11/1/18 - 11/5/18)

Agenda:

  • Turn in Group 4 Project Permission slip
  • Turn in Dual Enrollment form
  • Complete Poker Hand Methods w/ arrays
    • NOTE: If you want to check if two strings match (e.g. String s and String s2) you must use s.equals(s2)
  • Create your own test cases...try to use multiple tests per method
  • Here is a list of cards and the integer values to create them
  • Here are several test cases and the integer values to create them. Note, I'm only give you test cases for the first few poker hands, you should be able to create your own for the rest
  • Complete Poker Hands: Part 1 today in repl.it
    • First grade of the 2nd quarter
  • Introduction to Stacks - Stacks slides
    • Be able to describe the characteristics of a stack
    • Be able to explain the operations of a stack
    • Be able to describe different stack applications
    • If given a list or an array, be able to explain their use as stacks
  • Data Structure Visualizations
  • Static-sized Stack class walk-through
    1. Read through and analyze ALL the code for Media:Stack.java
    2. Create a new project and include Media:Stack.java and Media:StackMain.java
    3. Test out Media:Stack.java and Media:StackMain.java
    4. There will be some repl.it practice assignments for Stack
    5. There will be a future stack quiz -- so read all the code

Archives