Difference between revisions of "IB Computer Science 2"

From WLCS
Jump to: navigation, search
(Thursday - Friday (5/11/17 - 5/19/17))
 
(360 intermediate revisions by the same user not shown)
Line 1: Line 1:
== Thursday - Friday (5/11/17 - 5/19/17) ==
+
== Thursday - Monday (12/6/18 - 12/10/18) ==
 
'''Agenda:'''
 
'''Agenda:'''
* Exam debrief
+
* Work on Dynamic Queue Documentation assignment - due in Canvas by '''Sunday (12/9/18)'''
* Missing assignments?  Want credit?
+
* Dynamic queue implementation
** Create and send Mr. Bui your resume -- it will be graded subjectively
+
* Linked Lists
** Outline your coursework plan for next year (you can actually schedule and figure this out now).  Be sure to cover all your freshman or general education requirements
+
** Traversing through a LL
* Complete [https://docs.google.com/forms/d/1dCcfJnCaczrBzeQoagJsZMZxidRFEdI-s4E6h_DJqAM/viewform End-of-Course Survey]
+
** Adding an item to a LL
** Summary results will be shown when all students have finished
+
** Deleting an item from a LL
* Complete the [http://nova.mce.cc/ NVCC Dual Enrollment Evaluation]
+
** Modifying an item in a LL
* Backup all your work (machines will be wiped)
+
** Searching for an item in a LL
*# Go to Finder->Preferences->Sidebar and click your name
+
* Types of Linked Lists
*# Open a Finder window and look for your name on the Sidebar
+
** Singly-linked lists
*# While holding down the Command key, click each of the folders that you want to backup (e.g. Desktop, Documents, NetBeansProjects, etc.)
+
*** [https://visualgo.net/en/list VisuAlgo - LL]
*# Right-click your selection and Compress
+
** Doubly-linked lists
*# A zip file will be generated, which you can upload to your Google Drive
+
*** [https://visualgo.net/en/list VisuAlgo - DLL] (click on DLL)
*# Note: If the zip file is REALLY big, then you need to figure out what files are taking up so much space (and possibly delete them)
+
** Circular linked lists
* [https://docs.google.com/presentation/d/1L56lS56iPx8NzfERe12D_mPeQnwq9SUyngEiBkVMF34/edit?usp=sharing Advice from Mr. Bui]
+
* NetBeans GUI walk-through and review
* [https://docs.google.com/presentation/d/15qiqHJeaICoR_1uhLK5ZPVY4DEjGayKcoEbdYxLtD-M/edit?usp=sharing Personal Finance Notes]
 
* '''Read''' [http://ryanstephensmarketing.com/blog/18-things-i-wish-someone-wouldve-told-me-when-i-was-18/ 18 Things I Wish Someone Would've Told Me When I Was 18] - Ryan Stephens
 
* '''Read''' [http://www.huffingtonpost.com/keith-m-parsons/message-to-my-freshman-st_b_7275016.html Message to My Freshman Students] - Keith Parsons
 
  
== Tuesday (5/9/17) ==
+
== 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) ==
 +
'''Agenda:'''
 +
* 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) ==
 +
* 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
 +
** [[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) ==
 
'''Agenda:'''
 
'''Agenda:'''
* Complete [https://docs.google.com/forms/d/1dCcfJnCaczrBzeQoagJsZMZxidRFEdI-s4E6h_DJqAM/viewform End-of-Course Survey]
+
* Ensure that you've installed NetBeans and JGrasp
* Study for any other exams
+
* 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
  
== End of Year Surveys ==
+
== Thursday (11/15/18) ==
# [https://goo.gl/forms/fuf6Cxmy5cl5mXh32 CTE Completer Survey] (only if you have not already done so)
+
'''Agenda:'''
# [https://docs.google.com/spreadsheet/viewform?formkey=cmpucDFrRDJUekY5VEphYzE2V25ZSVE6MA..#gid=0 Graduating Senior Survey]
+
* Demo your [[Java - Static Queue Assignment]]
# [https://docs.google.com/forms/d/1dCcfJnCaczrBzeQoagJsZMZxidRFEdI-s4E6h_DJqAM/viewform End-of-Course Survey]
+
* 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!
# [http://nova.mce.cc/ NVCC Dual Enrollment Evaluation]
+
* Demo your circular queue
 +
* '''Queue quiz on Monday (11/19/18) '''
 +
 
 +
== Tuesday (11/13/18) ==
 +
'''Agenda:'''
 +
* 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 - 1617 - April]]
+
* [[IBCS2 - 1819 - October]]
* [[IBCS2 - 1617 - March]]
+
* [[IBCS2 - 1819 - September]]
* [[IBCS2 - 1617 - February]]
 
* [[IBCS2 - 1617 - January]]
 
* [[IBCS2 - 1617 - December]]
 
* [[IBCS2 - 1617 - November]]
 
* [[IBCS2 - 1617 - October]]
 
* [[IBCS2 - 1617 - September]]
 
 
* [[IBCS2 Summer Assignment]]
 
* [[IBCS2 Summer Assignment]]
* [[IBCS2 - 1516]]
+
* [[IBCS2 - 1718]]

Latest revision as of 09:41, 10 December 2018

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

Thursday - Friday (5/11/17 - 5/19/17)

Agenda:

  • Exam debrief
  • Missing assignments? Want credit?
    • Create and send Mr. Bui your resume -- it will be graded subjectively
    • Outline your coursework plan for next year (you can actually schedule and figure this out now). Be sure to cover all your freshman or general education requirements
  • Complete End-of-Course Survey
    • Summary results will be shown when all students have finished
  • Complete the NVCC Dual Enrollment Evaluation
  • Backup all your work (machines will be wiped)
    1. Go to Finder->Preferences->Sidebar and click your name
    2. Open a Finder window and look for your name on the Sidebar
    3. While holding down the Command key, click each of the folders that you want to backup (e.g. Desktop, Documents, NetBeansProjects, etc.)
    4. Right-click your selection and Compress
    5. A zip file will be generated, which you can upload to your Google Drive
    6. Note: If the zip file is REALLY big, then you need to figure out what files are taking up so much space (and possibly delete them)
  • Advice from Mr. Bui
  • Personal Finance Notes
  • Read 18 Things I Wish Someone Would've Told Me When I Was 18 - Ryan Stephens
  • Read Message to My Freshman Students - Keith Parsons

Tuesday (5/9/17)

Agenda:

End of Year Surveys

  1. CTE Completer Survey (only if you have not already done so)
  2. Graduating Senior Survey
  3. End-of-Course Survey
  4. NVCC Dual Enrollment Evaluation

Archives