|
|
| (803 intermediate revisions by the same user not shown) |
| Line 1: |
Line 1: |
| − | == Friday (12/2/16) == | + | == [[IBCS2 - Archives]] == |
| − | '''Agenda:'''
| |
| − | * Dear IB CS 2 Students,
| |
| − | ** I was out Wednesday (11/30/16) because my son was sick, and unfortunately, I am out today because I am required to attend a luncheon elsewhere. My absence has undoubtedly given you social-emotional trauma, so I will attempt to make amends by giving you several details of your upcoming quiz (see below). - Mr. Bui
| |
| − | * '''Quiz on Dynamic Stacks & Dynamic Queues (using Nodes) on Tuesday (12/6/16)'''
| |
| − | *# You must know what LIFO, FIFO mean, and how they relate to stacks and queues
| |
| − | *# You must know how to graphically illustrate stacks and queues using nodes (as well as their corresponding top, head, and tail references)
| |
| − | *# You will be given incomplete, skeletal code for DynamicStack and DynamicQueue classes, and you must "fill-in-the-blank" lines of code for push(), pop(), enqueue()/add(), and dequeue()/remove()
| |
| − | * Dual Enrollment w/ NVCC - CSC200 - Introduction to Computer Science credit
| |
| − | *# On Tuesday (12/6/16), there will also be dual enrollment testing for math. We may actually be able to dual enroll with NVCC and receive CSC200 (Introduction to Computer Science) credit for taking IB CS 2. Most of you already have passed or exempted from the English portion of the NVCC placement; however, most of you will need to prove your advanced math level.
| |
| − | *# You must have your parent sign the "Intent to Pursue Dual Enrollment" form, and return it ASAP on Monday or Tuesday (12/5/16, 12/6/16)
| |
| − | * The Linked List assignment should be completely done (final demos will happen next week)
| |
| − | * Introduction to Binary Trees (if you are done with Linked List and have already studied for Dynamic Stack and Dynamic Queue)
| |
| − | ** [[Media:BinaryTrees.ppt]]
| |
| − | ** Study the PowerPoint, and search for on-line resources if you still have questions
| |
| − | | |
| − | == Wednesday (11/30/16) ==
| |
| − | '''Agenda:'''
| |
| − | * Complete and demo 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
| |
| − | * '''Quiz on Dynamic Stacks & Dynamic Queues (using Nodes) on Tuesday (12/6/16)'''
| |
| − | * Introduction to Binary Trees
| |
| − | ** [[Media:BinaryTrees.ppt]]
| |
| − | ** Study the PowerPoint, and search for on-line resources if you still have questions
| |
| − | | |
| − | == Monday (11/28/16) ==
| |
| − | '''Agenda:'''
| |
| − | * APS Codes! (volunteer opportunity)
| |
| − | ** Monday, December 5th, 2016
| |
| − | ** 7-8:30 pm @ Career Center
| |
| − | ** Pizza provided to volunteers (served at 6:30pm)
| |
| − | ** Volunteers will help inexperienced people learn basic programming
| |
| − | ** [https://docs.google.com/forms/d/113s6rPZ6Bt9I8cDbaOq6d9X0_kCVt8ZluHXgu-i9KQM/viewform?usp=drive_web&edit_requested=true Volunteer signup form here]
| |
| − | * Complete and demo 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
| |
| − | | |
| − | == Wednesday - Friday (11/23/16 - 11/25/16) ==
| |
| − | * Thanksgiving Break
| |
| − | | |
| − | == Monday (11/21/16) ==
| |
| − | '''Agenda:'''
| |
| − | * APS Codes! (volunteer opportunity)
| |
| − | ** Monday, December 5th, 2016
| |
| − | ** 7-8:30 pm @ Career Center
| |
| − | ** Pizza provided to volunteers (served at 6:30pm)
| |
| − | ** Volunteers will help inexperienced people learn basic programming
| |
| − | * Complete and demo [[Java - Dynamic Queue Assignment]]
| |
| − | * 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
| |
| − | | |
| − | == Thursday (11/17/16) ==
| |
| − | '''Agenda:'''
| |
| − | * APS Codes! (volunteer opportunity)
| |
| − | ** Monday, December 5th, 2016
| |
| − | ** 7-8:30 pm @ Career Center
| |
| − | ** Pizza provided to volunteers who help with the event
| |
| − | ** Volunteers will help inexperienced people learn basic programming. Volunteers can learn new programming languages too
| |
| − | ** [https://docs.google.com/forms/d/113s6rPZ6Bt9I8cDbaOq6d9X0_kCVt8ZluHXgu-i9KQM/viewform?usp=drive_web&edit_requested=true Volunteer signup form here]
| |
| − | * Google's Deep Mind (Artificial Intelligence company)
| |
| − | ** [https://arxiv.org/abs/1606.04474 Learning to learn by gradient descent by gradient descent (Andrychowicz et al. 2016)]
| |
| − | ** Other [https://deepmind.com/research/publications/ Deep Mind Publications]
| |
| − | * [https://quickdraw.withgoogle.com/ Google Quick, Draw!]
| |
| − | * [https://www.cs.usfca.edu/~galles/visualization/QueueLL.html Dynamic Queue Visualization]
| |
| − | ** Use a dry-erase board to illustrate the enqueue (add) and dequeue (remove) operations
| |
| − | * Work on [[Java - Dynamic Queue Assignment]]
| |
| − | | |
| − | == Tuesday (11/15/16) ==
| |
| − | '''Warmup:'''
| |
| − | * Draw the following illustrations
| |
| − | *# an empty stack
| |
| − | *# push(6)
| |
| − | *# push(1)
| |
| − | *# pop()
| |
| − | *# push(3)
| |
| − | *# push(5)
| |
| − | *# pop()
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * [http://www.oxfordmartin.ox.ac.uk/downloads/academic/future-of-employment.pdf The Future of Employment: How susceptible are jobs to computerisation? (Frey & Osborne 2013)]
| |
| − | ** tl;dr - "According to our estimates, about 47 percent of total U.S. employment is at risk. We further provide evidence that wages and educational attainment exhibit a strong negative relationship with an occupation’s probability of computerisation" (Frey & Osborne 2013)
| |
| − | * APS Codes! (volunteer opportunity)
| |
| − | ** Monday, December 5th, 2016
| |
| − | ** 7-8:30 pm @ Career Center
| |
| − | ** Pizza provided to volunteers who help with the event
| |
| − | ** Volunteers will help inexperienced people learn basic programming. Volunteers can learn new programming languages too
| |
| − | * Thanksgiving assembly speech ideas?
| |
| − | * Complete and demo [[Java - Dynamic Stack Assignment]]
| |
| − | * Work on [[Java - Dynamic Queue Assignment]]
| |
| − | | |
| − | == Thursday (11/10/16) ==
| |
| − | '''Agenda:'''
| |
| − | * Node references review
| |
| − | * Stack before-and-after visualizations
| |
| − | * [[Java - Dynamic Stack Assignment]]
| |
| − | | |
| − | == Monday (11/7/16) ==
| |
| − | '''Agenda:'''
| |
| − | * Node Quiz
| |
| − | ** Closed-note, closed-book
| |
| − | ** Use a pencil!
| |
| − | * If you wish to turn in any missing work, then you must e-mail me your code for review
| |
| − | * Work on [[Java - Dynamic Stack Assignment]]
| |
| − | | |
| − | == Thursday (11/3/16) ==
| |
| − | '''Agenda:'''
| |
| − | * Circular Queue walk-through
| |
| − | * Object and References Review
| |
| − | ** [[Media:Point.java]]
| |
| − | ** [[Media:ReferencesReview.java]]
| |
| − | * Node class
| |
| − | ** [[Media:Node.java]]
| |
| − | ** [[Media:NodeFun.java]]
| |
| − | ** [[Media:NodeFunAgain.java]]
| |
| − | * '''Node Quiz on Monday (11/7/16)'''
| |
| − | ** Be able to trace code and draw memory diagram
| |
| − | ** Be able to write code that creates a given memory diagram
| |
| − | | |
| − | == Tuesday (11/1/16) ==
| |
| − | '''Agenda:'''
| |
| − | * Complete & demo [[Java - Static Queue Assignment]]
| |
| − | | |
| − | == Archives ==
| |
| − | * [[IBCS2 - 1617 - October]]
| |
| − | * [[IBCS2 - 1617 - September]]
| |
| − | * [[IBCS2 Summer Assignment]]
| |
| − | * [[IBCS2 - 1516]]
| |
