Difference between revisions of "IB Computer Science 2"

From WLCS
(29 intermediate revisions by the same user not shown)
Line 1: Line 1:
== Wednesday (12/12/18) ==
+
== Thursday (1/17/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
* Poker Hands: Part 2 has been posted to repl.it -- turn it in now
+
* Binary Quiz in Canvas
* NetBeans GUI walk-through and review
+
** Closed-book, closed-notes, closed-person, no calculator
 +
* Hexadecimal
 +
** [https://docs.google.com/presentation/d/1dQ1W-xCHulQB_nAQIzRkR2-jAhvbrSHsxNWGapA1UFQ/edit?usp=sharing Hexadecimal slides]
 +
* Data Representation
 +
** [https://docs.google.com/presentation/d/1jM_8zN66HudQiO_c2c1TCUO6MVBJ7qXBI7jS8kDN9z0/edit?usp=sharing Data representation slides]
 +
* Hexadecimal Quiz on Tuesday (1/22/19)
  
== Thursday - Monday (12/6/18 - 12/10/18) ==
+
'''Homework:'''
'''Agenda:'''
+
* Work on your IA!
* 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
 
** Singly-linked lists
 
*** [https://visualgo.net/en/list VisuAlgo - LL]
 
** Doubly-linked lists
 
*** [https://visualgo.net/en/list VisuAlgo - DLL] (click on DLL)
 
** Circular linked lists
 
 
 
== Tuesday (12/4/18) ==
 
'''Warmup:'''
 
* Complete the Stacks Warmup in Canvas
 
* [https://www.cs.usfca.edu/~galles/visualization/StackLL.html Dynamic Stack Visualization]
 
 
 
'''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
 
*# You may use this [https://www.cs.usfca.edu/~galles/visualization/QueueLL.html Dynamic Queue Visualization] to help you
 
*# Create a Google document - it will have 3 sectioned headers
 
*# Use headers (literally) for each of the following sections: '''isEmpty(), enqueue(data) / add(data), dequeue()'''
 
*# Illustrate the memory diagram using nodes for isEmpty()
 
*# Describe what is being shown in the illustration (using numbered steps if it helps)
 
*# 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
 
*# Describe what is being shown in the illustrations (using numbered steps if it helps)
 
*# 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
 
*# Describe what is being shown in the illustrations (using numbered steps if it helps)
 
*# Submit your document to Canvas by '''Friday (12/7/18)'''
 
  
== Friday (11/30/18) ==
+
== Tuesday (1/15/19) ==
'''Agenda:'''
+
* Snow Day
* Group 4 Project Debrief
 
* [https://goo.gl/forms/0ya5UJ6KdVJvDvJF3 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
 
*# What are the different illustrations/diagrams of the stack in different situations?
 
*# 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) ==
+
== Friday (1/11/19) ==
* 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:'''
 
'''Agenda:'''
* Group 4 Project Field Trip (Wednesday-Thursday 11/28-11/29)
+
* [https://docs.google.com/presentation/d/1f2HPJOP7xxWGgEyl_gXXzn5aMiAT6qwHdvS2he6E5wg/edit?usp=sharing Binary]
** If you are attending, check-in and orientation at the auditorium at 8:19am
+
** Binary Quiz on Tuesday (1/15/19)
** If you are not attending, 4th and 6th periods, go to Ms. Smith's room (#4026)
+
* Internal Assessment Work Session(s)
* 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
 
** [[Media:Point.java]]
 
** [[Media:ReferencesReview.java]]
 
* Node class
 
** [[Media:Node.java]]
 
** [[NodeDemo.java]]
 
** [[AnotherNodeDemo.java]]
 
* 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
 
* [https://www.cs.usfca.edu/~galles/visualization/StackLL.html Dynamic Stack Visualization]
 
* Work on [[Java - Dynamic Stack Assignment]]
 
  
== Monday (11/19/18) ==
+
== Wednesday (1/9/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
* Ensure that you've installed NetBeans and JGrasp
+
* Data Structures Quiz in Canvas
* NVCC Dual Enrollment forms?
+
* Internal Assessment Work Session(s)
* 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) ==
+
== Monday (1/7/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
* Demo your [[Java - Static Queue Assignment]]
+
* Submit Criterion B documents to Canvas:
* 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!
+
** Record of Tasks
* Demo your circular queue
+
** Flowcharts
* '''Queue quiz on Monday (11/19/18) '''
+
** Test Plan
 +
* Data Structures Quiz on Wednesday (1/9/19)
 +
** Post-assessment data on data structures
 +
** [https://docs.google.com/presentation/d/1MQGdYjEFwKBwT9WJcb7ITlPRcgCOC2Py-Lk31QGEzb0/edit?usp=sharing Stacks slides]
 +
** [https://docs.google.com/presentation/d/1Wckb8R3om4RGi9O8HWu0yYdkaFek5y0_GI1ak0H89yU/edit?usp=sharing Queue slides]
 +
** Linked Lists
 +
** [https://docs.google.com/presentation/d/1ROGTlCgwPvzt4kD1w-cPek8V8M4VVA9SWJ3vtvXLsK4/edit?usp=sharing Binary Trees slides]
 +
* Internal Assessment Work Session(s)
 +
** CODE CODE CODE
 +
** Bring any materials you need to program your IA to class
  
== Tuesday (11/13/18) ==
+
== Monday - Friday (12/31/18 - 1/4/19) ==
'''Agenda:'''
+
* Winter Break
* Stacks Quiz makeups
 
* NVCC Dual Enrollment application
 
* Introduction to Queues - [https://docs.google.com/presentation/d/1Wckb8R3om4RGi9O8HWu0yYdkaFek5y0_GI1ak0H89yU/edit?usp=sharing Queue slides]
 
* Play with the [https://www.cs.usfca.edu/~galles/visualization/QueueArray.html Queues Array Implementation]
 
*# What attributes of a queue should we keep track of?
 
*# What happens to the tail when data is added?
 
*# What happens to the head when data is removed?
 
* Complete [[Java - Static Queue Assignment]]
 
 
 
== 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 [https://www.cs.usfca.edu/~galles/visualization/StackArray.html stack array implementation]
 
* If you have not already done so, complete your submission to Poker Hands: Part 1
 
* Introduction to Stacks - [https://docs.google.com/presentation/d/1MQGdYjEFwKBwT9WJcb7ITlPRcgCOC2Py-Lk31QGEzb0/edit?usp=sharing 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 [https://docs.google.com/document/d/13zszogl61lWLjLoY8z_UPkiWlpvUgtUHd2eNCRf9sbI/edit?usp=sharing list of cards] and the integer values to create them
 
* Here are several [https://docs.google.com/document/d/11dQ7uXnSP1EWElcm5T57-2-ntDHSXsbo2bG61lEuj74/edit?usp=sharing 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 - [https://docs.google.com/presentation/d/1MQGdYjEFwKBwT9WJcb7ITlPRcgCOC2Py-Lk31QGEzb0/edit?usp=sharing 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
 
* [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]]
 
*# There will be some repl.it practice assignments for Stack
 
*# There will be a future stack quiz -- so read all the code
 
  
 
== Archives ==
 
== Archives ==
 +
* [[IBCS2 - 1819 - December]]
 +
* [[IBCS2 - 1819 - November]]
 
* [[IBCS2 - 1819 - October]]
 
* [[IBCS2 - 1819 - October]]
 
* [[IBCS2 - 1819 - September]]
 
* [[IBCS2 - 1819 - September]]
 
* [[IBCS2 Summer Assignment]]
 
* [[IBCS2 Summer Assignment]]
 
* [[IBCS2 - 1718]]
 
* [[IBCS2 - 1718]]

Revision as of 14:38, 17 January 2019

Thursday (1/17/19)

Agenda:

Homework:

  • Work on your IA!

Tuesday (1/15/19)

  • Snow Day

Friday (1/11/19)

Agenda:

  • Binary
    • Binary Quiz on Tuesday (1/15/19)
  • Internal Assessment Work Session(s)

Wednesday (1/9/19)

Agenda:

  • Data Structures Quiz in Canvas
  • Internal Assessment Work Session(s)

Monday (1/7/19)

Agenda:

  • Submit Criterion B documents to Canvas:
    • Record of Tasks
    • Flowcharts
    • Test Plan
  • Data Structures Quiz on Wednesday (1/9/19)
  • Internal Assessment Work Session(s)
    • CODE CODE CODE
    • Bring any materials you need to program your IA to class

Monday - Friday (12/31/18 - 1/4/19)

  • Winter Break

Archives