So a couple weeks back, I was ranting about my Data Structures I class. I heard back today that my credit by exam was successful. In order to complete my credit by exam, I had to complete a program and a written test, getting a 70% or greater on both. The program was representative of the major project taking about half of the semester. I had to write a circularly-doubly Linked List, which was boiled down to a glorified Iterator, and use that in a basic Swing image gallery program. I think it took me maybe an hour and a half. I was very happy that the professor in charge of the CBE didn't enforce the same lack-of common sense standards for the class. The fact that he was grading my program, and not WebCat, hit home as well.

I took the written exam portion of the CBE Monday afternoon (the irony is that I skipped data structures to test out of it). It hit hard on Big-O and Trees mainly, but had a couple questions on stacks and queues too. The Tree questions were pretty basic, consisting of a basic overview of a balanced vs. degenerate binary search tree, tree traversals, and identifying leaf nodes. Overall, I found it pretty straight-forward.

The CBE was a very positive experience, and it was very worthwhile in freeing up time. It was very worthwhile.