Difference between revisions of "IB Computer Science 2"

From WLCS
(Monday (10/7/19))
Line 10: Line 10:
 
** [[AnotherNodeDemo.java]]
 
** [[AnotherNodeDemo.java]]
 
* More Node Practice!
 
* More Node Practice!
* '''Node Quiz on Friday (11/30/18)'''
+
* '''Node Quiz on Wednesday (10/9/19)'''
 
** 2 questions
 
** 2 questions
 
** If given code, you can draw a memory diagram illustration
 
** If given code, you can draw a memory diagram illustration
 
** If given a memory diagram illustration, you can write the code to create it
 
** If given a memory diagram illustration, you can write the code to create it
 
* [https://www.cs.usfca.edu/~galles/visualization/StackLL.html Dynamic Stack Visualization]
 
* [https://www.cs.usfca.edu/~galles/visualization/StackLL.html Dynamic Stack Visualization]
 +
* Dynamic stack walk-through
  
 
== Thursday (10/3/19) ==
 
== Thursday (10/3/19) ==

Revision as of 10:15, 7 October 2019

Monday (10/7/19)

Agenda:

Thursday (10/3/19)

Agenda:

  • Complete Queue (array implementation) and submit to repl.it
  • If you have completed the Queue, then implement the circular queue data structure. Be sure you save as a new project or file and rename the class to CircularQueue. Do not overwrite your original queue code!
  • Mini queue quiz in the last 15 minutes of class

Homework:

Tuesday (10/1/19)

Agenda:

  • Stacks quiz
  • Submit your String Stack assignment to repl.it
  • Introduction to Queues - Queues slides
  • Play with the Queues Array Implementation
    1. What attributes of a queue should we keep track of?
    2. What happens to the tail when data is added?
    3. What happens to the head when data is removed?
  • Implement the Queue class and its methods:
    • Queue() constructors - use a default array size of 15
    • void enqueue(int data)
    • int dequeue()
    • void add(int data) - this method should only have one line of code!
    • int remove() - this method should only have one line of code!
    • boolean isEmpty()
    • boolean isFull()
    • int peek() - returns the head of the queue if it's not empty; Integer.MIN_VALUE otherwise
    • String toString()
  • Submit your queue (array implementation) to the repl.it assignment
  • Queue challenge: If you add() and remove() a bunch of times, eventually, your queue will fail to work because the head and tail will hit the end of the array. Prevent this from happening by making a "circular queue".

Homework:

  • Queue (array implementation) to repl.it

IBCS2 - 1920 - September

IBCS2 - Archives