|
|
| (987 intermediate revisions by the same user not shown) |
| Line 1: |
Line 1: |
| − | == Wednesday (12/9/15) == | + | == [[IBCS2 - Archives]] == |
| − | '''Agenda:'''
| |
| − | * Binary Tree Quiz
| |
| − | * Missing Demos
| |
| − | ** Dynamic Queue
| |
| − | ** Linked List
| |
| − | * [[Media:Recursion.ppt]]
| |
| − | * Binary Tree Code walk-through
| |
| − | * Internal Assessment
| |
| − | | |
| − | == Thursday - Monday (12/3/15 - 12/7/15) ==
| |
| − | '''Agenda:'''
| |
| − | * LinkedList demos!
| |
| − | * Introduction to Binary Trees
| |
| − | ** [[Media:BinaryTrees.ppt]]
| |
| − | * '''Binary Tree Quiz on Wednesday (12/9/15)'''
| |
| − | | |
| − | == Tuesday (12/1/15) ==
| |
| − | '''Agenda:'''
| |
| − | * Dual enrollment application and testing
| |
| − | * Complete LinkedList assignment posted on Google Classroom
| |
| − | | |
| − | == Friday - Tuesday (11/20/15 - 11/24/15) ==
| |
| − | '''Agenda:'''
| |
| − | * Demo DynamicQueue
| |
| − | * Introduction to [http://en.wikipedia.org/wiki/Linked_list#Basic_concepts_and_nomenclature Linked Lists] (walk-through)
| |
| − | ** [https://www.cs.usfca.edu/~galles/visualization/Algorithms.html Data Structure Visualizations]
| |
| − | ** What does a Linked List look like?
| |
| − | ** Linked List attributes
| |
| − | *** first
| |
| − | *** last
| |
| − | *** size
| |
| − | ** Linked List methods
| |
| − | *** adding data (beginning, middle, end)
| |
| − | *** deleting data (beginning, middle, end)
| |
| − | *** getting data
| |
| − | *** modifying data
| |
| − | *** searching for data
| |
| − | *** clearing all data
| |
| − | ** Complete LinkedList assignment posted on Google Classroom
| |
| − | | |
| − | == Wednesday (11/18/15) ==
| |
| − | '''Agenda:'''
| |
| − | * Finish DynamicStack walk-through
| |
| − | * Testing DynamicStack
| |
| − | * Dynamically-sized Queues - complete by the end of today
| |
| − | *# On paper, draw the before-and-after pictures
| |
