https://www.paulbui.net/wiki/index.php?action=history&feed=atom&title=IBCS2_-_1819_-_DecemberIBCS2 - 1819 - December - Revision history2026-04-14T15:41:02ZRevision history for this page on the wikiMediaWiki 1.31.8https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1819_-_December&diff=15034&oldid=prevAdmin: Protected "IBCS2 - 1819 - December" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite)) [cascading]2019-01-07T15:27:33Z<p>Protected "<a href="/wl/IBCS2_-_1819_-_December" title="IBCS2 - 1819 - December">IBCS2 - 1819 - December</a>" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite)) [cascading]</p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr class="diff-title" lang="en">
<td colspan="1" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td>
<td colspan="1" style="background-color: #fff; color: #222; text-align: center;">Revision as of 15:27, 7 January 2019</td>
</tr><tr><td colspan="2" class="diff-notice" lang="en"><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Adminhttps://www.paulbui.net/wiki/index.php?title=IBCS2_-_1819_-_December&diff=15031&oldid=prevAdmin: Created page with "== Monday - Friday (12/24/18 - 12/28/18) == * Winter Break == Thursday (12/20/18) == '''Agenda:''' * Binary Tree Traversal ** [https://docs.google.com/presentation/d/1ROGTlCg..."2019-01-07T15:26:47Z<p>Created page with "== Monday - Friday (12/24/18 - 12/28/18) == * Winter Break == Thursday (12/20/18) == '''Agenda:''' * Binary Tree Traversal ** [https://docs.google.com/presentation/d/1ROGTlCg..."</p>
<p><b>New page</b></p><div>== Monday - Friday (12/24/18 - 12/28/18) ==<br />
* Winter Break<br />
<br />
== Thursday (12/20/18) ==<br />
'''Agenda:'''<br />
* Binary Tree Traversal<br />
** [https://docs.google.com/presentation/d/1ROGTlCgwPvzt4kD1w-cPek8V8M4VVA9SWJ3vtvXLsK4/edit?usp=sharing Binary Trees slides]<br />
* Binary Trees Quiz<br />
* Criterion B: Design<br />
** Record of Tasks<br />
** Flowcharts<br />
** Test plan<br />
** Class diagrams<br />
* Winter Break HW<br />
** Complete Criterion B: Record of Tasks spreadsheet<br />
** Diagram user action flow chart(s) for your IA<br />
*** [https://docs.google.com/presentation/d/1eNybAWXVKjCJRizTvkEf8z0zNq-Tj7lory2jPYURq98/edit?usp=sharing Flowchart slides]<br />
** Develop test plan<br />
** Work on your IA code!!<br />
<br />
== Tuesday (12/18/18) ==<br />
* Binary Trees<br />
** [https://docs.google.com/presentation/d/1ROGTlCgwPvzt4kD1w-cPek8V8M4VVA9SWJ3vtvXLsK4/edit?usp=sharing Binary Trees slides]<br />
** [https://visualgo.net/en/bst Binary Trees visualization]<br />
<br />
== Friday (12/14/18) ==<br />
'''Agenda:'''<br />
* Period 4: Types of Linked Lists<br />
** Singly-linked lists<br />
*** [https://visualgo.net/en/list VisuAlgo - LL]<br />
** Doubly-linked lists<br />
*** [https://visualgo.net/en/list VisuAlgo - DLL] (click on DLL)<br />
** Circular linked lists<br />
** What are some typical applications for each of the linked lists?<br />
* NetBeans GUI walk-through and review<br />
<br />
== Wednesday (12/12/18) ==<br />
'''Agenda:'''<br />
* Poker Hands: Part 1 has been graded -- did you forget to turn it in?<br />
* Poker Hands: Part 2 has been posted to repl.it -- turn it in now<br />
* Turn in Circular Queue to repl.it also<br />
<br />
== Thursday - Monday (12/6/18 - 12/10/18) ==<br />
'''Agenda:'''<br />
* Work on Dynamic Queue Documentation assignment - due in Canvas by '''Sunday (12/9/18)'''<br />
* Dynamic queue implementation<br />
* Linked Lists<br />
** Traversing through a LL<br />
** Adding an item to a LL<br />
** Deleting an item from a LL<br />
** Modifying an item in a LL<br />
** Searching for an item in a LL<br />
* Types of Linked Lists<br />
** Singly-linked lists<br />
*** [https://visualgo.net/en/list VisuAlgo - LL]<br />
** Doubly-linked lists<br />
*** [https://visualgo.net/en/list VisuAlgo - DLL] (click on DLL)<br />
** Circular linked lists<br />
<br />
== Tuesday (12/4/18) ==<br />
'''Warmup:'''<br />
* Complete the Stacks Warmup in Canvas<br />
* [https://www.cs.usfca.edu/~galles/visualization/StackLL.html Dynamic Stack Visualization]<br />
<br />
'''Agenda:'''<br />
* Programming with nodes and terminology:<br />
** node<br />
** data / cargo<br />
** pointers, reference variables or references<br />
** next reference<br />
** null<br />
* More advanced documents w/ headers, page breaks, and table of contents <br />
* Dynamic Queue Documentation Assignment<br />
*# You may use this [https://www.cs.usfca.edu/~galles/visualization/QueueLL.html Dynamic Queue Visualization] to help you<br />
*# Create a Google document - it will have 3 sectioned headers<br />
*# Use headers (literally) for each of the following sections: '''isEmpty(), enqueue(data) / add(data), dequeue()'''<br />
*# Illustrate the memory diagram using nodes for isEmpty()<br />
*# Describe what is being shown in the illustration (using numbered steps if it helps)<br />
*# Illustrate the memory diagram using nodes for enqueue(data) / add(data) - before and after images!<br />
*#* Diagram the special case of enqueueing to an empty queue<br />
*#* Diagram the general case for enqueue<br />
*# Describe what is being shown in the illustrations (using numbered steps if it helps)<br />
*# Illustrate the memory diagram using nodes for dequeue() / remove() - before and after images!<br />
*#* Diagram the special case of dequeueing when there is only one node in the queue as well as <br />
*#* Diagram the general case for dequeue<br />
*# Describe what is being shown in the illustrations (using numbered steps if it helps)<br />
*# Submit your document to Canvas by '''Friday (12/7/18)'''</div>Admin