IB Computer Science 2

Thursday - Friday (10/16/14)

• Complete the Dual Enrollment Test Score Survey

Agenda:

• Node Review
• Node Quiz
• Dynamically-sized Stacks - due Monday (10/20/13)
  • Stack scenarios and Before-&-After pictures
    1. What are the possible behaviors of a stack?
    2. What does the picture look like Before?
    3. 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 push(num) using Nodes.
    • push() should not return anything
    • push() creates a new Node with the num, and set the new Node's next reference to the top
    • Don't forget to update the top to be the new node!
  • Implement pop() using Nodes
    • pop() removes the value on top of the stack, return it
    • pop() should also update the top
    • pop() returns None 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
  • 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

Tuesday - Wednesday (10/14/14 - 10/15/14)

Agenda:

• Stacks and Queues Quiz
• Object and References Review
  • Media:Point.java
  • Media:ReferencesReview.java
• Node class
  • Media:Node.java
  • Media:NodeFun.java
  • Media:NodeFunAgain.java
• Node Quiz on Thursday, Friday (10/16/14, 10/17/14)
  • Be able to trace code and draw memory diagram
  • Be able to write code that creates a given memory diagram

Thursday - Friday (10/9/14 - 10/10/14)

Agenda:

• Demo your StaticQueue
• CircularQueue walk-through
• Stacks and Queues quiz on Tuesday, Wednesday (10/14/14, 10/15/14)

Tuesday - Wednesday (10/7/14 - 10/8/14)

Agenda:

• Searching & Sorting Quiz
• Queues - Media:Queues.ppt
• Create a StaticQueue class
  • Use StaticStack as a template
  • Be sure to have all the queue attributes
    • int head
    • int tail
    • int [] queue
  • Be sure to have all the queue operations
    • default StaticQueue() and specific StaticQueue(int size) constructors
    • void enqueue(int data) - adds data to the tail of the queue if it is not full
    • void add(int data) - adds data to the tail of the queue if it is not full
    • int dequeue() - removes and returns data from the head of the queue if it is non-empty
    • int remove() - removes and returns data from the head of the queue if it is non-empty
    • boolean isFull() - returns true if the queue is full, false otherwise
    • boolean isEmpty() - returns true if the queue is empty, false otherwise
    • int peek() - returns data element at the head (but does not remove it)
  • Create any other queue methods that may be useful
    • void print()
  • Test your queue class to see if it works

Monday (10/6/14)

• Searching & Sorting Quiz
• Demo your matrix functions
• Complete the StaticStack class
  • Test it with Media:StackMain.java
  • Be able to describe the characteristics of a stack
  • Be able to explain the operations of a stack
  • Be able to describe different stack applications
  • If given a list or an array, be able to explain their use as stacks
• Queues - Media:Queues.ppt
• Create a StaticQueue class
  • Use StaticStack as a template
  • Be sure to have all the queue attributes
  • Be sure to have all the queue operations
  • Create any other queue methods that may be useful
  • Test your queue class to see if it works

Friday (10/3//14)

Agenda:

• Searching & Sorting Quiz on Monday & Tuesday (10/6/14, 10/7/14)
• Demo your matrix functions
• Complete the StaticStack class
  • Test it with Media:StackMain.java
  • Be able to describe the characteristics of a stack
  • Be able to explain the operations of a stack
  • Be able to describe different stack applications
  • If given a list or an array, be able to explain their use as stacks
• Queues - Media:Queues.ppt
• Create a StaticQueue class
  • Use StaticStack as a template
  • Be sure to have all the queue attributes
  • Be sure to have all the queue operations
  • Create any other queue methods that may be useful
  • Test your queue class to see if it works

Wednesday - Thursday (10/1/14 - 10/2/14)

Agenda:

• Searching & Sorting Quiz on Monday & Tuesday (10/6/14, 10/7/14)
• Demo your matrix functions
• Introduction to Stacks - Media:Stacks.ppt
  • Be able to describe the characteristics of a stack
  • Be able to explain the operations of a stack
  • Be able to describe different stack applications
  • If given a list or an array, be able to explain their use as stacks
• StaticStack class walk-through

Archives

• IBCS2 - 1415 - September