IBCS2 - 1819 - December
From WLCS
Revision as of 11:27, 7 January 2019 by Admin (talk | contribs) (Protected "IBCS2 - 1819 - December" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite)) [cascading])
Contents
Monday - Friday (12/24/18 - 12/28/18)
- Winter Break
Thursday (12/20/18)
Agenda:
- Binary Tree Traversal
- Binary Trees Quiz
- Criterion B: Design
- Record of Tasks
- Flowcharts
- Test plan
- Class diagrams
- Winter Break HW
- Complete Criterion B: Record of Tasks spreadsheet
- Diagram user action flow chart(s) for your IA
- Develop test plan
- Work on your IA code!!
Tuesday (12/18/18)
- Binary Trees
Friday (12/14/18)
Agenda:
- Period 4: Types of Linked Lists
- Singly-linked lists
- Doubly-linked lists
- VisuAlgo - DLL (click on DLL)
- Circular linked lists
- What are some typical applications for each of the linked lists?
- NetBeans GUI walk-through and review
Wednesday (12/12/18)
Agenda:
- Poker Hands: Part 1 has been graded -- did you forget to turn it in?
- Poker Hands: Part 2 has been posted to repl.it -- turn it in now
- Turn in Circular Queue to repl.it also
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
- Singly-linked lists
- Doubly-linked lists
- VisuAlgo - DLL (click on DLL)
- Circular linked lists
Tuesday (12/4/18)
Warmup:
- Complete the Stacks Warmup in Canvas
- 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 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)