IBCS2 - 1516 - November - Revision history

Admin: Undo revision 13348 by Admin (talk)

2016-11-07T00:56:42Z

Undo revision 13348 by Admin (talk)

Admin at 00:53, 7 November 2016

2016-11-07T00:53:26Z

Admin: Protected "IBCS2 - 1516 - November" ([edit=sysop] (indefinite) [move=sysop] (indefinite)) [cascading]

2016-02-22T16:18:19Z

Protected "IBCS2 - 1516 - November" ([edit=sysop] (indefinite) [move=sysop] (indefinite)) [cascading]

Admin: Created page with "== Friday - Tuesday (11/20/15 - 11/24/15) == * Demo DynamicQueue * Introduction to [http://en.wikipedia.org/wiki/Linked_list#Basic_concepts_and_nomenclature Linked Lists] (walk-t..."

2016-02-22T16:15:47Z

Created page with "== Friday - Tuesday (11/20/15 - 11/24/15) == * Demo DynamicQueue * Introduction to [http://en.wikipedia.org/wiki/Linked_list#Basic_concepts_and_nomenclature Linked Lists] (walk-t..."

New page

== Friday - Tuesday (11/20/15 - 11/24/15) ==
* 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 for enqueue()'s 2 scenarios:
*## enqueueing to an empty queue
*## enqueueing to a non-empty queue
*# Draw the before-and-after pictures for dequeue()'s 3 scenarios:
*## dequeueing an empty queue
*## dequeueing the very last node
*## dequeueing normally when the queue has more than one node
*# Write the dynamically-sized queue code
*## Use a combination of the StaticQueue and DynamicStack as templates
*##* i.e. implement all the methods from StaticQueue (except for isFull())
*## Be sure to test your DynamicQueue like the DynamicStack

== Monday (11/16/15) ==
'''Agenda:'''
* Node Quiz!
* Dynamically-sized Stacks
** [https://www.cs.usfca.edu/~galles/visualization/Algorithms.html Data Structure Visualizations]
** Stack scenarios and Before-&-After pictures
**# What are the possible behaviors of a stack?
**# What does the picture look like Before?
**# What does the picture look like After?
** Create a new class called DynamicStack
** What attribute must we keep track of when we talk about stacks?
** Create a Node reference for the most important stack attribute
** Implement '''void push(data)''' using Nodes.
*** push() should not return anything
*** push() creates a new Node with the data, and set the new Node's next reference to the top
*** Don't forget to update the top to be the new node!
** Implement '''int pop()''' using Nodes
*** pop() removes the value on top of the stack, return it
*** pop() should also update the top
*** pop() returns '''null''' if the stack is empty
** Implement '''isEmpty()''' which returns true if the stack is empty, and false otherwise
** Implement '''print()''' which should print your entire stack from top down (to null)
** TEST YOUR STACK
*** Be sure to push A LOT of data to test the dynamic size
*** Also test popping A LOT of data to make sure it works too

== Thursday (11/12/15) ==
'''Agenda:'''
* Stacks and Queues Quiz
* IDT Programming Contest meeting today for team registrations
* Dual Enrollment for NVCC CSC201
* Node review
** [[Media:Node.java]]
** [[Media:NodeFun.java]]
** [[Media:NodeFunAgain.java]]
* '''Node Quiz on Monday (11/16/15)'''
** Be able to trace code and draw memory diagram
** Be able to write code that creates a given memory diagram
* Dynamically-sized Stacks
** [https://www.cs.usfca.edu/~galles/visualization/Algorithms.html Data Structure Visualizations]
** Stack scenarios and Before-&-After pictures
**# What are the possible behaviors of a stack?
**# What does the picture look like Before?
**# What does the picture look like After?
** Create a new class called DynamicStack
** What attribute must we keep track of when we talk about stacks?
** Create a Node reference for the most important stack attribute
** Implement '''void push(data)''' using Nodes.
*** push() should not return anything
*** push() creates a new Node with the data, and set the new Node's next reference to the top
*** Don't forget to update the top to be the new node!
** Implement '''int pop()''' using Nodes
*** pop() removes the value on top of the stack, return it
*** pop() should also update the top
*** pop() returns '''null''' if the stack is empty
** Implement '''isEmpty()''' which returns true if the stack is empty, and false otherwise
** Implement '''print()''' which should print your entire stack from top down (to null)
** TEST YOUR STACK
*** Be sure to push A LOT of data to test the dynamic size
*** Also test popping A LOT of data to make sure it works too

== Monday (11/9/15) ==
'''Agenda:'''
* Circular Queue
* '''Stacks and Queues Quiz - Thursday (11/12/15)'''
* Object and References Review
** [[Media:Point.java]]
** [[Media:ReferencesReview.java]]
* Node class
** [[Media:Node.java]]
** [[Media:NodeFun.java]]
** [[Media:NodeFunAgain.java]]
* '''Node Quiz on Monday (11/16/15)'''
** Be able to trace code and draw memory diagram
** Be able to write code that creates a given memory diagram

== Monday - Thursday (11/2/15 - 11/5/15) ==
'''Warmup:'''
# List and describe the stack operations (names of methods and what they do)
# List and describe the queue operations (names of methods and what they do)

'''Agenda:'''
* Queues - [[Media:Queues.ppt]]
* Complete [[Java - Static Queue Assignment]]

@@ Line 72: / Line 72: @@
 ** Be able to trace code and draw memory diagram
 ** Be able to write code that creates a given memory diagram
-* Work on Dynamically-sized Stacks
+* Dynamically-sized Stacks
-** [https://www.cs.usfca.edu/~galles/visualization/StackLL.html Dynamic Stack Visualization]
+** [https://www.cs.usfca.edu/~galles/visualization/Algorithms.html Data Structure Visualizations]
 ** Stack scenarios and Before-&-After pictures
-**# Load the [https://www.cs.usfca.edu/~galles/visualization/StackLL.html Dynamic Stack Visualization]. Considering the following questions and use the visualization tool to help you answer them.
+**# What are the possible behaviors of a stack?
-**# What does an empty stack look like? (The top reference variable is null)
+**# What does the picture look like Before?
-**# For each of the following actions, assess what the picture looks like Before? then After?
+**# What does the picture look like After?
 ** Create a new class called DynamicStack
-** What attribute must we keep track of when we talk about stacks? (Hint: rhymes with "mop")
+** What attribute must we keep track of when we talk about stacks?
 ** Create a Node reference for the most important stack attribute
 ** Implement '''void push(data)''' using Nodes.
 *** push() should not return anything
-*** push() creates a new Node with the data parameter, and set the new Node's next reference to the top
+*** push() creates a new Node with the data, and set the new Node's next reference to the top
 *** Don't forget to update the top to be the new node!
 ** Implement '''int pop()''' using Nodes

← Older revision	Revision as of 16:18, 22 February 2016
(No difference)