You are being recorded and transcribed.
Please grab about eight small white cards (and a pen, if you don’t have one).
Approximate overview
We bring you an advertisement from the mothers of pearl.
Will there be other opportunities to redo LAs beyond Saturday night’s?
Yes. See the schedule above.
It appears that I have some LAs that are now under review. Some formerly said “talk to Sam”, but I didn’t. What’s going on?
It appears you used ChatGPT for your solution. I’m figuring out what to do.
Does the number of E’s/M’s/I’s on MPs matter at all?
Well, if you have 40 LA’s, which should be a B, and all E’s, you’ll probably end up with a B+.
Is it okay if I have I’s/0’s on some MPs? Will I still get an A for 43 LAs? Yes.
Grab white cards. Write things down. Whee!
https://grinnell.smartevals.com
A comment about the introductory text.
The instructor and mentor will leave the classroom
Intentionally not documented.
Idea: In most cases, instead of asking you to answer particular questions, I ask you to find appropriate evidence that you’ve mastered the topic.
Why Sam likes it:
Other than spreading them out more, what can I do to improve the LAs?
I’ll gather questions and then try to answer them.
What is the difference between linked structures and lists?
There are many different kinds of linked structures. For example, we implemented (a) linked queues, (b) linked stacks, (c) binary search trees, (d) bit trees, (e) graphs. Of course, we also did linked lists.
Not all lists are linked structures. For example, we’ve implemented (or considered implementing) our List ADT as linked lists and array-based lists. (There’s a weird tree implementation that you might consider in CSC-301.)
Are all lists linked structures?
No.
How should we solve the build libraries LA?
Identify a class or classes you’ve written that might be used (or have been used) in another project.
If they’ve been used in another project, describe how.
If they haven’t been used in another project, descibe how they might be used.
Please be realistic. The following is not realistic.
public class MathUtils {
public static int add(int x, int y) {
return x + y;
}
} // class MathUtils
What’s the difference heaping an array and heapsorting?
Heaping the array is the first part of heapsorting. But a heaped array is not yet sorted. You should be able to pull values out of the heap in order and shove them into the right place in the array.
The concept is similar to what we might call “Priority Queue Sort”. “Add everything to the priority queue. Pull it out in order.”
The big difference is that we can do it all in the same array.
Can I use my hackathon code for “build libraries”?
No. Use something you built in this class.
Can I use the AAC example for ethical reuse given that there’s no license?
Sure. There’s an implied “you can use this” (e.g., the assignment page).
Selection sort wasn’t in the mini-project. Is selection sort somewhere?
Notes on last class?
Made optional.
Can we give pseudocode for heap sort?
Yes.
For the documentation is it okay if I don’t do all the @stuff?
Since I don’t always write them, it’s okay if you don’t write them.
Not documented because Sam doesn’t want it available on the Interweb.