Difference between revisions of "IB Computer Science 2"
From WLCS
(→Thursday - Friday (10/9/14 - 10/10/14)) |
|||
| Line 3: | Line 3: | ||
* Demo your StaticQueue | * Demo your StaticQueue | ||
* CircularQueue walk-through | * CircularQueue walk-through | ||
| − | * Stacks and Queues quiz on Monday, Tuesday (10/13/14, 10/14/14) | + | * '''Stacks and Queues quiz on Monday, Tuesday (10/13/14, 10/14/14)''' |
* Object and References Review | * Object and References Review | ||
** [[Media:Point.java]] | ** [[Media:Point.java]] | ||
Revision as of 07:32, 9 October 2014
Contents
Thursday - Friday (10/9/14 - 10/10/14)
Agenda:
- Demo your StaticQueue
- CircularQueue walk-through
- Stacks and Queues quiz on Monday, Tuesday (10/13/14, 10/14/14)
- Object and References Review
- Node class
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
