Lecture 26 - April 24^th

announced ACM meeting

announced ACM Picnic - 4:30 pm patio outside HHS lower level unless rain

if rain, ISAT/CS 259 - NTelos room

announced early submission deadline - tomorrow, April 25^th - noon

announced FINAL EXAM:

Thursday, May 3^rd

Final Examination

1:30-3:30

ISAT/CS 236

***** Students MUST take the final examination to pass this course.

Failure to take the exam will result in an automatic F in the course.

evaluations re lecture at end of class -

discussed sorting of elements in a Vector

using bubble sort on a Vector of size n where n is <= 25

suggested: using j and j+1 for the elements to be compared was simplest

discussed: off by 1 errors

discussed: at the end of 1 pass through the Vector, 1 element was in place

at the end of 2 passes through the Vector, 2 elements were in place

at the end of 3 passes through the Vector, 3 elements were in place

…

at the end of n passes through the Vector, n elements were in place

discussed: using outer loop to indicate number of passes through Vector

what if do 50 passes through Vector, n elements in place at end

what if do 75 passes through Vector, n elements in place at end

what if do 250 passes through Vector, n elements in place at end

discussed: how many passes are required in the worst case? n

code example: VectorPlay

discussed lab 27

talked about use of Symbol table

talked about attributes belonging to instantiated Object and different notation methods

talked about the advantage of re-drawing linked list at each stage of a trace

code examples:

testIntNode

testNode

testPile

testPile2

testPile3