|
|
| Line 16: |
Line 16: |
| | '''Homework:''' | | '''Homework:''' |
| | * WORK ON YOUR INTERNAL ASSESSMENT | | * WORK ON YOUR INTERNAL ASSESSMENT |
| − |
| |
| − | == Friday - Monday (12/21/17 - 1/1/18) ==
| |
| − | * Non-denominational Winter Break
| |
| − |
| |
| − | == Thursday (12/21/17) ==
| |
| − | '''Agenda:'''
| |
| − | * Binary Trees Quiz
| |
| − | * Personal finance discussion
| |
| − | ** [https://docs.google.com/presentation/d/15qiqHJeaICoR_1uhLK5ZPVY4DEjGayKcoEbdYxLtD-M/edit?usp=sharing Bui's Personal Finance presentation]
| |
| − | * Work on Internal Assessment code over Winter Break!!
| |
| − | * You may change your project, but you must clear it with Mr. Bui and redo Criterion A and B
| |
| − |
| |
| − | == Monday - Wednesday (12/18/17 - 12/20/17) ==
| |
| − | '''Warmup:'''
| |
| − | # Create a binary tree from 45, 87, 12, 3, 90, 42, 76
| |
| − | # Write out the in-order tree traversal
| |
| − | # Write out the pre-order tree traversal
| |
| − | # Write out the post-order tree traversal
| |
| − |
| |
| − | '''Agenda:'''
| |
| − | * Introduction to Binary Trees
| |
| − | ** [[Media:BinaryTrees.ppt]]
| |
| − | ** Quiz on Binary Trees on Thursday (12/21/17)
| |
| − |
| |
| − | '''Homework (due before Winter Break):'''
| |
| − | # Create a Google Doc
| |
| − | # Be able to submit a list of 5-6 advanced techniques that you will employ in your Internal Assessment
| |
| − | # The list should be numbered
| |
| − | # You should state the advanced technique
| |
| − | # Advanced technique number must have a 1-2 sentence description of how you are using the advanced technique
| |
| − |
| |
| − | == Friday (12/15/17) ==
| |
| − | '''Agenda:'''
| |
| − | * Demo Linked List
| |
| − | * Criterion C Discussion
| |
| − | ** What are "advanced programming techniques"?
| |
| − | ** You should have about 5-6 advanced techniques you can write about in your Criterion C
| |
| − |
| |
| − | == Monday - Thursday (12/11/17 - 12/14/17) ==
| |
| − | '''Agenda:'''
| |
| − | * Complete and demo Linked List
| |
| − |
| |
| − | == Thursday - Friday (12/7/17 - 12/8/17) ==
| |
| − | '''Agenda:'''
| |
| − | * Dynamic Stack and Queue Quiz
| |
| − | * Demos
| |
| − | * Introduction to Linked List
| |
| − | ** Download [[Media:LinkedList.java]]
| |
| − | ** Download [[Media:LinkedListTestMain.java]]
| |
| − | ** Complete the Linked List data structure implementation and confirm that all the tests pass correctly
| |
| − |
| |
| − | == Monday - Wednesday (12/4/17 - 12/6/17) ==
| |
| − | '''Agenda:'''
| |
| − | * Dynamic stacks & queues quiz on Thursday (12/7/17)
| |
| − | ** Know the terms LIFO and FIFO
| |
| − | ** Be able to graphically illustrate the data structures as data is added and removed
| |
| − | * Demo missing [[Java - Dynamic Stack Assignment]]
| |
| − | * Stack and queue practice drawings
| |
| − | * Demo [[Java - Dynamic Queue Assignment]]
| |
| − |
| |
| − | == Monday - Friday (11/27/17 - 12/1/17) ==
| |
| − | '''Agenda:'''
| |
| − | * APS Hour of Code Volunteer Opportunity
| |
| − | ** December 4th from 6:30-8pm at the Career Center
| |
| − | ** [https://docs.google.com/forms/d/e/1FAIpQLSe-zGiMuN0OKnGJHsxzr8CSViyx_4ohtC8iv3MbPO6E5ZkpIA/viewform Volunteer Registration Form]
| |
| − | * Node Quiz retakes
| |
| − | * Demo [[Java - Dynamic Stack Assignment]]
| |
| − | * Work on [[Java - Dynamic Queue Assignment]]
| |
| − | ** BE SURE TO DO THE BEFORE AND AFTER DRAWINGS!
| |
| − |
| |
| − | == Monday - Tuesday (11/20/17 - 11/21/17) ==
| |
| − | '''Agenda:'''
| |
| − | * TURN IN PERMISSION SLIPS! (caps are intentional to convey yelling)
| |
| − | * Return Node Quiz
| |
| − | ** Node Quiz retakes
| |
| − | * Complete and demo [[Java - Dynamic Stack Assignment]]
| |
| − | ** If you have not, then complete it over Thanksgiving Break
| |
| − |
| |
| − | == Thursday (11/16/17) ==
| |
| − | '''Agenda:'''
| |
| − | * Take the Node Quiz (~10 minutes)
| |
| − | * Work on [[Java - Dynamic Stack Assignment]]
| |
| − |
| |
| − | == Monday - Wednesday (11/13/17 - 11/15/17) ==
| |
| − | '''Agenda:'''
| |
| − | * Demo completed [[Java - Static Queue Assignment]]
| |
| − | ** Be sure that you cover the special enqueue/add and dequeue/remove scenarios!
| |
| − | * Work on the Circular Queue challenge at the end of [[Java - Static Queue Assignment]]
| |
| − | * Object and References Review
| |
| − | ** [[Media:Point.java]]
| |
| − | ** [[Media:ReferencesReview.java]]
| |
| − | * Node class
| |
| − | ** [[Media:Node.java]]
| |
| − | ** [[NodeDemo.java]]
| |
| − | ** [[AnotherNodeDemo.java]]
| |
| − | * Node Quiz on Thursday (11/16/17)
| |
| − | ** 2 questions
| |
| − | ** If given code, you can draw a memory diagram
| |
| − | ** If given a memory diagram, you can write the code to create it
| |
| − |
| |
| − | == Monday - Thursday (11/6/17 - 11/9/17) ==
| |
| − | '''Agenda:'''
| |
| − | * Group 4 field trip chaperone forms?
| |
| − | * Read Queues - [[Media:Queues.ppt]]
| |
| − | * Play with the [https://www.cs.usfca.edu/~galles/visualization/QueueArray.html Queues Array Implementation]
| |
| − | * Work on [[Java - Static Queue Assignment]]
| |
| − |
| |
| − | == Wednesday - Friday (11/1/17 - 11/3/17) ==
| |
| − | '''Agenda:'''
| |
| − | * Group 4 Project Field Trip
| |
| − | ** November 29th, 2017
| |
| − | ** Smithsonian Museum of Natural History
| |
| − | ** We need chaperones -- ask your parent and return the form
| |
| − | * Introduction to Stacks - [[Media:Stacks.ppt]]
| |
| − | ** 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
| |
| − | * [https://www.cs.usfca.edu/~galles/visualization/Algorithms.html Data Structure Visualizations]
| |
| − | * Static-sized Stack class walk-through
| |
| − | *# Read through and analyze ALL the code for [[Media:Stack.java]]
| |
| − | *# Create a new project and include [[Media:Stack.java]] and [[Media:StackMain.java]]
| |
| − | *# Test out [[Media:Stack.java]] and [[Media:StackMain.java]]
| |
| − | * Read Queues - [[Media:Queues.ppt]]
| |
| − | * Play with the [https://www.cs.usfca.edu/~galles/visualization/QueueArray.html Queues Array Implementation]
| |
| − | * Work on [[Java - Static Queue Assignment]]
| |
| | | | |
| | == Archives == | | == Archives == |
| | + | * [[IBCS2 - 1718 - December]] |
| | + | * [[IBCS2 - 1718 - November]] |
| | * [[IBCS2 - 1718 - October]] | | * [[IBCS2 - 1718 - October]] |
| | * [[IBCS2 - 1718 - September]] | | * [[IBCS2 - 1718 - September]] |
| | * [[IBCS2 Summer Assignment]] | | * [[IBCS2 Summer Assignment]] |
| | * [[IBCS2 - 1617]] | | * [[IBCS2 - 1617]] |
