?

Log in

No account? Create an account
academia. - Chaz Meyers [entries|archive|friends|userinfo]
Chaz Meyers

[ website | chazmeyers.com ]
[ profile | view profile ]
[ archive | view archive ]

Links
[Links:| chazmeyers.com Twitter ]

academia. [Apr. 15th, 2003|01:15 pm]
Chaz Meyers
[Current Music |They Might Be Giants - Spiderman]

I'm impressed that I managed to get up in time for my 8:10 midterm even after forgetting to set my alarm. Yay!
I still feel like a complete boob for missing it in the first place by mixing up the dates. Bad Chaz! Fortunately, that class seems to finally be stepping away from material that is review from previous classes. There was even stuff on the midterm I needed to refer to the class notes to quickly teach myself.

All in all, I think I did pretty well considering that I haven't shown up for the class since the last midterm and hadn't studied all that much. I think the test is out of 100. I missed about 16 points in short answer questions. Heh. Lots of it was stupid mistakes (I inserted improperly into a bst, and forgot that a sorted array can be searched with a binary search. doh!), although some questions I was unprepared for (Huffman coding? Eh. I doubt I'll ever see that again.).

The programming section still needs to be graded, but I don't think I'm going to lose too many points there, and I know I got the extra credit problem right. Rawk.

I feel kind of bad, though, because I know I could've aced that like it's my job, and I'll probably end up with a low B or a C. Still better than getting nothing, considering that I missed the original. I consider myself to be mad lucky.

Later today I'll be dropping my second class for this semester, which will bring me down to 8 credits for this semester. Fortunately, I took enough credits last semester that this I'm still fulltime! Still, I feel like such a bum.
LinkReply

Comments:
From: catch2002
2003-04-16 09:02 pm (UTC)

yeah

well this entry was a little while ago, so I dont know if you will see the comment...but anyway, yeah huffman coding is cool though, but it only has one application. haha on a test I had once in a cs class he made us find the huffman bits for the palandrome satanoscillatesmymettalicsonatas. that was annoying, far too many letters to figure out the bits,. but I somehow got it right, wow, I was amazed I did.

silly goose, yeah a sorted array is FAST to search, faster than a binary search. man, oh well you knew that but just forgot for the test, no biggie.
(Reply) (Thread)
[User Picture]From: cpm
2003-04-16 09:20 pm (UTC)

Re: yeah

yeah huffman coding is cool though, but it only has one application. haha on a test I had once in a cs class he made us find the huffman bits for the palandrome satanoscillatesmymettalicsonatas. that was annoying, far too many letters to figure out the bits,. but I somehow got it right, wow, I was amazed I did.

satanoscillatesmymettalicsonatas? That's a mouthful and a half. Yeesh.

I'm not sure if I'm more surprised that Huffman showed up on the test, or that I managed to unintentionally ignore the subject in two separate classes. :)

silly goose, yeah a sorted array is FAST to search, faster than a binary search. man, oh well you knew that but just forgot for the test, no biggie.

Yeah. Definitely quicker than O(N) which I put down. Ak! In my defense, I have to point out again that the test was at 8:20, and my brain tends not to thaw until around 12:30. :)

Faster to search than a binary search, though? What search algorithm am I forgetting about that's quicker than O(log N)?
(Reply) (Parent) (Thread)
From: catch2002
2003-04-17 02:38 pm (UTC)

Re: yeah

well what I mean is (and correct me if its wrong) is that for the binary search, you must sort it first anyway. so a sorted array is faster to do than a nonsorted array, thats what I mean
(Reply) (Parent) (Thread)
[User Picture]From: cpm
2003-04-17 03:59 pm (UTC)

Re: yeah

Yes, a binary search only works on sorted data. I thought you had meant that you could do something faster than a binary search on a sorted array. My bad, misread. :)

Either way, searching an unsorted array is much slower than a sorted array. Agreed.

(Well, after today's lecture, I suppose you could make an argument that hash tables implemented with arrays are unsorted arrays with a search time of O(1). I don't think that counts, though, since that's using a extremely strict definition for 'sorted', a very liberal definition for 'unsorted', covers material not presented in class before the exam, and is a silly argument of technicalities. )
(Reply) (Parent) (Thread)
From: catch2002
2003-04-17 07:07 pm (UTC)

Re: yeah

yeah agreed, even though hashes can be implmeneted with arrays I almost think of them as a seperate (albeit abstract) data structure.
(Reply) (Parent) (Thread)