Difference between revisions of "IB Computer Science 2"

From WLCS
(42 intermediate revisions by the same user not shown)
Line 1: Line 1:
−
== Friday (12/14/18) ==
+
== Thursday (2/14/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
−
* Period 4: Types of Linked Lists
+
* Work on internal assessment!
−
** Singly-linked lists
+
* Criterion C Draft due '''Friday (2/15/19)'''
−
*** [https://visualgo.net/en/list VisuAlgo - LL]
+
** Review in detail, [http://ibpublishing.ibo.org/live-exist/rest/app/tsm.xql?doc=d_4_comsc_tsm_1201_1_e&part=4&chapter=5 Criterion C rubric]
−
** Doubly-linked lists
+
** Review Criterion C requirements found in [[Media:IBCS_InternalAssessmentGuidelines.pdf]]
−
*** [https://visualgo.net/en/list VisuAlgo - DLL] (click on DLL)
+
** Review [https://ibpublishing.ibo.org/live-exist/rest/app/tsm.xql?doc=d_4_comsc_tsm_1201_2_e&part=4&chapter=7 IA examples]
−
** Circular linked lists
 
−
** What are some typical applications for each of the linked lists?
 
−
* NetBeans GUI walk-through and review
 
−
* Binary Trees
 
−
** [https://docs.google.com/presentation/d/1ROGTlCgwPvzt4kD1w-cPek8V8M4VVA9SWJ3vtvXLsK4/edit?usp=sharing Binary Trees slides]
 
−
** [https://visualgo.net/en/bst Binary Trees visualization]
 
  
−
== Wednesday (12/12/18) ==
+
== Tuesday (2/12/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
−
* Poker Hands: Part 1 has been graded -- did you forget to turn it in?
+
* Finish [https://docs.google.com/presentation/d/1vK-9s7vcgRGbj8jYEvl5TUP3hDfsHsCWM7YqDD68CNc/edit?usp=sharing Operating Systems slides]
−
* Poker Hands: Part 2 has been posted to repl.it -- turn it in now
+
* Work on Internal Assessment!!!
−
* Turn in Circular Queue to repl.it also
+
* Criterion C Draft due '''Friday (2/15/19)'''
 +
** Review in detail, [http://ibpublishing.ibo.org/live-exist/rest/app/tsm.xql?doc=d_4_comsc_tsm_1201_1_e&part=4&chapter=5 Criterion C rubric]
 +
** Review Criterion C requirements found in [[Media:IBCS_InternalAssessmentGuidelines.pdf]]
 +
** Review [https://ibpublishing.ibo.org/live-exist/rest/app/tsm.xql?doc=d_4_comsc_tsm_1201_2_e&part=4&chapter=7 IA examples]
  
−
== Thursday - Monday (12/6/18 - 12/10/18) ==
+
== Wednesday - Friday (2/6/19 - 2/8/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
−
* Work on Dynamic Queue Documentation assignment - due in Canvas by '''Sunday (12/9/18)'''
+
* [https://docs.google.com/presentation/d/12r_Egw1qYrqvhpyu2UHiVd4As82LQiFzmFQ3Minchqs/edit?usp=sharing Computer Architecture / Computer Organization slides]
−
* Dynamic queue implementation
+
* [https://docs.google.com/presentation/d/1vK-9s7vcgRGbj8jYEvl5TUP3hDfsHsCWM7YqDD68CNc/edit?usp=sharing Operating Systems slides]
−
* Linked Lists
+
* Criterion C Draft due '''Friday (2/15/19)'''
−
** Traversing through a LL
+
** Review in detail, [http://ibpublishing.ibo.org/live-exist/rest/app/tsm.xql?doc=d_4_comsc_tsm_1201_1_e&part=4&chapter=5 Criterion C rubric]
−
** Adding an item to a LL
+
** Review Criterion C requirements found in [[Media:IBCS_InternalAssessmentGuidelines.pdf]]
−
** Deleting an item from a LL
+
** Review [https://ibpublishing.ibo.org/live-exist/rest/app/tsm.xql?doc=d_4_comsc_tsm_1201_2_e&part=4&chapter=7 IA examples]
−
** 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) ==
+
== Monday (2/4/19) ==
−
'''Warmup:'''
+
'''Agenda:'''
−
* Complete the Stacks Warmup in Canvas
+
* Logic Gates Quiz
−
* [https://www.cs.usfca.edu/~galles/visualization/StackLL.html Dynamic Stack Visualization]
+
* Criterion C Draft due '''Friday (2/15/19)'''
 +
** Review in detail, [http://ibpublishing.ibo.org/live-exist/rest/app/tsm.xql?doc=d_4_comsc_tsm_1201_1_e&part=4&chapter=5 Criterion C rubric]
 +
** Review Criterion C requirements found in [[Media:IBCS_InternalAssessmentGuidelines.pdf]]
 +
** Review [https://ibpublishing.ibo.org/live-exist/rest/app/tsm.xql?doc=d_4_comsc_tsm_1201_2_e&part=4&chapter=7 IA examples]
 +
* Work on your Internal Assessment
  
 +
== Thursday (1/31/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
−
* Programming with nodes and terminology:
+
* [https://esa-foundation-feb2019.devpost.com/ Entertainment & Software Association Hackathon]
−
** node
+
** Saturday, February 2nd, 2019 from 8AM-8PM
−
** data / cargo
+
** Registration due tomorrow
−
** pointers, reference variables or references
+
* Boolean Logic quiz
−
** next reference
+
** In order to receive the access code, draw a truth table with 3 boolean variables (a, b, c) and all the F/T input permutations
−
** null
+
* Logic Gates
−
* More advanced documents w/ headers, page breaks, and table of contents
+
** [[Media:LogicGates.gif]]
−
* Dynamic Queue Documentation Assignment
+
** [[Media:LogicGatesWithTruthTables.gif]]
−
*# You may use this [https://www.cs.usfca.edu/~galles/visualization/QueueLL.html Dynamic Queue Visualization] to help you
+
** [https://docs.google.com/presentation/d/1g3MfIeA9LcDz2qJMslu43hU3XRCf5yZwMNPP3WSKv1Q/edit?usp=sharing Logic Gates slides]
−
*# Create a Google document - it will have 3 sectioned headers
+
* Logic Gates Quiz on Monday (2/4/19)
−
*# Use headers (literally) for each of the following sections: '''isEmpty(), enqueue(data) / add(data), dequeue()'''
+
** Be able to draw all the gates
−
*# Illustrate the memory diagram using nodes for isEmpty()
+
** Be able to draw a circuit based on a boolean expression
−
*# Describe what is being shown in the illustration (using numbered steps if it helps)
+
** Be able to write a boolean expression based on a circuit
−
*# Illustrate the memory diagram using nodes for enqueue(data) / add(data) - before and after images!
+
* IA Work Session (most of your code should be completed by the end of January)  
−
*#* 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/29/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
−
* Group 4 Project Debrief
+
* Boolean Logic quiz on Thursday (1/31/19) (not logic gates)
−
* [https://goo.gl/forms/0ya5UJ6KdVJvDvJF3 Group 4 Project Reflection Google Form]
+
* Logic Gates
−
** Complete this form even if you already turned in a PDF
+
** [[Media:LogicGates.gif]]
−
** You may copy the reflection that you wrote in your PDF and paste it into the form
+
** [[Media:LogicGatesWithTruthTables.gif]]
−
* Node Quiz
+
** [https://docs.google.com/presentation/d/1g3MfIeA9LcDz2qJMslu43hU3XRCf5yZwMNPP3WSKv1Q/edit?usp=sharing Logic Gates slides]
−
* Dynamic Stack notes - before & after images with Nodes
+
* IA Work Session (most of your code should be completed by the end of January)  
−
*# 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) ==
+
== Thursday (1/24/19) ==
−
* Most students will be attending the Group 4 Project field trip
+
'''Agenda:'''
−
* If you are not attending, go to Ms. Smith's room (#4026)
+
* Boolean Logic
−
* Work on any missing assignments
+
** [https://docs.google.com/presentation/d/1xhbt6M14fmCQZ0oKqRoVEHvdpy5GuCN8Cf3B9F2g77E/edit?usp=sharing Boolean logic slides]
−
* Study for '''Node Quiz on Friday (11/30/18)'''
+
* IA Work Session (most of your code should be completed by the end of January)
−
* Work on [[Java - Dynamic Stack Assignment]]
 
  
−
== Monday (11/26/18) ==
+
== Tuesday (1/22/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
−
* Group 4 Project Field Trip (Wednesday-Thursday 11/28-11/29)
+
* Hexadecimal Quiz
−
** If you are attending, check-in and orientation at the auditorium at 8:19am
+
* Data Representation
−
** If you are not attending, 4th and 6th periods, go to Ms. Smith's room (#4026)
+
** [https://docs.google.com/presentation/d/1jM_8zN66HudQiO_c2c1TCUO6MVBJ7qXBI7jS8kDN9z0/edit?usp=sharing Data representation slides]
−
* Assignments thus far.  Demo missing assignments during GP:
+
* IA Work Session
−
** Poker Hands: Part 1
+
 
−
** Poker Hands: Part 2 (repl.it submission coming soon)
+
'''Homework:'''
−
** Static Queue
+
* Work on your IA! (most of your code should be completed by the end of January)
−
** 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) ==
+
== Thursday (1/17/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
−
* Ensure that you've installed NetBeans and JGrasp
+
* Binary Quiz in Canvas
−
* NVCC Dual Enrollment forms?
+
** Closed-book, closed-notes, closed-person, no calculator
−
* Workplace Readiness Skills: Pre-assessment
+
* Hexadecimal
−
* Assignments thus far:
+
** [https://docs.google.com/presentation/d/1dQ1W-xCHulQB_nAQIzRkR2-jAhvbrSHsxNWGapA1UFQ/edit?usp=sharing Hexadecimal slides]
−
** Poker Hands: Part 1
+
* Data Representation
−
** Poker Hands: Part 2 (repl.it submission coming soon)
+
** [https://docs.google.com/presentation/d/1jM_8zN66HudQiO_c2c1TCUO6MVBJ7qXBI7jS8kDN9z0/edit?usp=sharing Data representation slides]
−
** Static Queue
+
* Hexadecimal Quiz on Tuesday (1/22/19)
−
** Circular Queue
+
 
−
* Queue questions?
+
'''Homework:'''
−
** Quiz will be after lunch (at the halfway point of class)
+
* Work on your IA!
−
* Demo assignments
+
 
 +
== Tuesday (1/15/19) ==
 +
* Snow Day
  
−
== Thursday (11/15/18) ==
+
== Friday (1/11/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
−
* Demo your [[Java - Static Queue Assignment]]
+
* [https://docs.google.com/presentation/d/1f2HPJOP7xxWGgEyl_gXXzn5aMiAT6qwHdvS2he6E5wg/edit?usp=sharing Binary]
−
* 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!
+
** Binary Quiz on Tuesday (1/15/19)
−
* Demo your circular queue
+
* Internal Assessment Work Session(s)
−
* '''Queue quiz on Monday (11/19/18) '''
 
  
−
== Tuesday (11/13/18) ==
+
== Wednesday (1/9/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
−
* Stacks Quiz makeups
+
* Data Structures Quiz in Canvas
−
* NVCC Dual Enrollment application
+
* Internal Assessment Work Session(s)
−
* 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) ==
+
== Monday (1/7/19) ==
 
'''Agenda:'''
 
'''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]
+
* Submit Criterion B documents to Canvas:
−
* If you have not already done so, complete your submission to Poker Hands: Part 1
+
** Record of Tasks
−
* Introduction to Stacks - [https://docs.google.com/presentation/d/1MQGdYjEFwKBwT9WJcb7ITlPRcgCOC2Py-Lk31QGEzb0/edit?usp=sharing Stacks slides]
+
** Flowcharts
−
** Be able to describe the characteristics of a stack
+
** Test Plan
−
** Be able to explain the operations of a stack
+
* Data Structures Quiz on Wednesday (1/9/19)
−
** Be able to describe different stack applications
+
** Post-assessment data on data structures
−
** If given a list or an array, be able to explain their use as stacks
+
** [https://docs.google.com/presentation/d/1MQGdYjEFwKBwT9WJcb7ITlPRcgCOC2Py-Lk31QGEzb0/edit?usp=sharing Stacks slides]
−
** Be able to implement the programming code for a stack that uses an array
+
** [https://docs.google.com/presentation/d/1Wckb8R3om4RGi9O8HWu0yYdkaFek5y0_GI1ak0H89yU/edit?usp=sharing Queue slides]
−
* Study the code in [[Media:Stack.java]] and [[Media:StackMain.java]]
+
** Linked Lists
−
* Halfway through class...take the Stack Quiz
+
** [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
  
−
== Thursday - Monday (11/1/18 - 11/5/18) ==
+
== Monday - Friday (12/31/18 - 1/4/19) ==
−
'''Agenda:'''
+
* Winter Break
−
* 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 11:31, 14 February 2019

Thursday (2/14/19)

Agenda:

Tuesday (2/12/19)

Agenda:

Wednesday - Friday (2/6/19 - 2/8/19)

Agenda:

Monday (2/4/19)

Agenda:

Thursday (1/31/19)

Agenda:

  • Entertainment & Software Association Hackathon
    • Saturday, February 2nd, 2019 from 8AM-8PM
    • Registration due tomorrow
  • Boolean Logic quiz
    • In order to receive the access code, draw a truth table with 3 boolean variables (a, b, c) and all the F/T input permutations
  • Logic Gates
  • Logic Gates Quiz on Monday (2/4/19)
    • Be able to draw all the gates
    • Be able to draw a circuit based on a boolean expression
    • Be able to write a boolean expression based on a circuit
  • IA Work Session (most of your code should be completed by the end of January)

Tuesday (1/29/19)

Agenda:

Thursday (1/24/19)

Agenda:

  • Boolean Logic
  • IA Work Session (most of your code should be completed by the end of January)

Tuesday (1/22/19)

Agenda:

Homework:

  • Work on your IA! (most of your code should be completed by the end of January)

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

Retrieved from "https://www.paulbui.net/wiki/index.php?title=IB_Computer_Science_2&oldid=15140"