Difference between revisions of "IB Computer Science II"

From WLCS
(Thursday - Friday (11/6/08 - 11/7/08))
(Redirected page to IB Computer Science 2)
 
(303 intermediate revisions by the same user not shown)
Line 1: Line 1:
'''Welcome to the IB Computer Science II Homepage!'''
+
#REDIRECT [[IB Computer Science 2]]
 
 
You may find the old IBCS2 website here: [http://www.paulbui.net/wl/cs2 IBCS2_0708]
 
 
 
== Thursday - Friday (11/6/08 - 11/7/08) ==
 
* Show Mr. Bui your Queue before-and-after diagrams
 
* LinkedLists cont'd
 
** Attributes: head, tail, size
 
** Constructors: default
 
** Methods:
 
*** isEmpty() - returns true if the LinkedList is empty, and false otherwise
 
*** void add(int num) - adds a new Node with num at the end of the LinkedList
 
*** int remove(int index) - removes the index-th Node and returns its data
 
**** There are SIX different scenarios when you remove a Node
 
*** void insert(int num, int index)
 
**** There are FIVE different scenarios when you add a Node
 
**** DRAW the before-and-after pictures for all FIVE secenarios
 
*** print() - traverses the LinkedList and prints out each Node's data
 
* [[Media:LinkedList.java]]
 
* LinkedListTestMain - create as a class
 
 
 
== Wednesday (11/5/08) ==
 
* Print out your DynamicQueue.java -- I will grade them by hand
 
* Introduction to LinkedLists
 
** Attributes: head, tail, size
 
** Constructors: default
 
** Methods:
 
*** isEmpty() - returns true if the LinkedList is empty, and false otherwise
 
*** void add(int num) - adds a new Node with num at the end of the LinkedList
 
*** int remove(int index) - removes the index-th Node and returns its data
 
**** There are FIVE different scenarios when you remove a Node
 
*** print() - traverses the LinkedList and prints out each Node's data
 
*'''Homework:''' Draw the before-and-after diagrams for the remove() method
 
 
 
== Monday (11/3/08) ==
 
'''Warmup:'''
 
* On a separate sheep of paper, please answer the following questions:
 
** In a dynamically-sized queue's isEmpty() method, what are the two different cases or scenarios that you check for?
 
** In a dynamically-sized queue's add() method, what are the two different cases or scenarios?
 
*** Draw the before and after picture of each of the two scenarios.
 
** In a dynamically-sized queue's remove() method, what are the two different cases or scenarios?
 
*** Draw the before and after picture of each of the two scenarios.
 
 
 
'''Agenda:'''
 
* Secret ballot - Have you installed and used Java or JCreator on your computer at home?
 
* Demo DynamicQueues
 
* Introduction to Linked Lists
 
 
 
== Archives ==
 
* [[IBCS2 - October]]
 
* [[IBCS2 - September]]
 

Latest revision as of 11:21, 24 August 2010