ace293’s blog

==10312== Memcheck, a memory error detector.
==10312== Copyright (C) 2002-2008, and GNU GPL’d, by Julian Seward et al.
==10312== Using LibVEX rev 1878, a library for dynamic binary translation.
==10312== Copyright (C) 2004-2008, and GNU GPL’d, by OpenWorks LLP.
==10312== Using valgrind-3.4.0, a dynamic binary instrumentation framework.
==10312== Copyright (C) 2000-2008, and GNU GPL’d, by Julian Seward et al.
==10312== For more details, rerun with: -v
==10312==
……………..

OK (17 tests)

==10312==
==10312== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 21 from 1)
==10312== malloc/free: in use at exit: 122,880 bytes in 6 blocks.
==10312== malloc/free: 1,257 allocs, 1,251 frees, 214,262 bytes allocated.
==10312== For counts of detected errors, rerun with: -v
==10312== searching for pointers to 6 not-freed blocks.
==10312== checked 124,268 bytes.
==10312==
==10312== LEAK SUMMARY:
==10312==    definitely lost: 0 bytes in 0 blocks.
==10312==      possibly lost: 0 bytes in 0 blocks.
==10312==    still reachable: 122,880 bytes in 6 blocks.
==10312==         suppressed: 0 bytes in 0 blocks.
==10312== Rerun with –leak-check=full to see details of leaked memory.

Expected number of hours: 10

Actual number of hours: 9

==3269== Memcheck, a memory error detector.
==3269== Copyright (C) 2002-2008, and GNU GPL’d, by Julian Seward et al.
==3269== Using LibVEX rev 1878, a library for dynamic binary translation.
==3269== Copyright (C) 2004-2008, and GNU GPL’d, by OpenWorks LLP.
==3269== Using valgrind-3.4.0, a dynamic binary instrumentation framework.
==3269== Copyright (C) 2000-2008, and GNU GPL’d, by Julian Seward et al.
==3269== For more details, rerun with: -v
==3269==
………..

OK (11 tests)

==3269==
==3269== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 21 from 1)
==3269== malloc/free: in use at exit: 122,880 bytes in 6 blocks.
==3269== malloc/free: 690 allocs, 684 frees, 196,316 bytes allocated.
==3269== For counts of detected errors, rerun with: -v
==3269== searching for pointers to 6 not-freed blocks.
==3269== checked 124,972 bytes.
==3269==
==3269== LEAK SUMMARY:
==3269==    definitely lost: 0 bytes in 0 blocks.
==3269==      possibly lost: 0 bytes in 0 blocks.
==3269==    still reachable: 122,880 bytes in 6 blocks.
==3269==         suppressed: 0 bytes in 0 blocks.
==3269== Rerun with –leak-check=full to see details of leaked memory.

Expected number of hours to complete: 10

Actual number of hours to complete: 5

The material in this class is just getting harder and harder to understand.  Explicit with its explicit constructor and implicit conversions.  Also methods that take in values and automatically sets them to class variables is a must for some variables and not others is very confusing, I am Unfuddled which is the replacement for the google code I am using.  I really like Google Code and I think it is a shame that I cant use it anymore.  I did use it for another project that I did in another class because it is very easy to track code.  Unfuddled works just as well though.

YES, YES, YES, I have received my grade for my hard earned test.  A 145/150, WOW! I am awesome, that is for shiszle.  I have never received such a high grade on a downing test and will never again.  I also took another test last week and I also received a 95.  This is all in a time when I was extremely tired, going without sleep.  So, I think that the more tired I am the better I do at tests.  This week is the first week that I have really stumbled on material which is the whole friend thing.  Still do not understand what it particulary means to be a friend, if an inner class can become friends then what exactly does it mean for the class, can he see its innerds, or what?  Only time will tell my Friends!

==17679== Memcheck, a memory error detector.
==17679== Copyright (C) 2002-2008, and GNU GPL’d, by Julian Seward et al.
==17679== Using LibVEX rev 1878, a library for dynamic binary translation.
==17679== Copyright (C) 2004-2008, and GNU GPL’d, by OpenWorks LLP.
==17679== Using valgrind-3.4.0, a dynamic binary instrumentation framework.
==17679== Copyright (C) 2000-2008, and GNU GPL’d, by Julian Seward et al.
==17679== For more details, rerun with: -v
==17679==
………

OK (9 tests)

==17679==
==17679== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 21 from 1)
==17679== malloc/free: in use at exit: 122,880 bytes in 6 blocks.
==17679== malloc/free: 546 allocs, 540 frees, 186,490 bytes allocated.
==17679== For counts of detected errors, rerun with: -v
==17679== searching for pointers to 6 not-freed blocks.
==17679== checked 125,004 bytes.
==17679==
==17679== LEAK SUMMARY:
==17679==    definitely lost: 0 bytes in 0 blocks.
==17679==      possibly lost: 0 bytes in 0 blocks.
==17679==    still reachable: 122,880 bytes in 6 blocks.
==17679==         suppressed: 0 bytes in 0 blocks.
==17679== Rerun with –leak-check=full to see details of leaked memory.

predicted number of hours to complete: 10
actual number of hours to complete: 7

The test was very hard.  Let me step back a moment…I had a test on Wednesday in my PL class which I did not start studying for until Tuesday evening and this rolled around till 2 am on Wednesday.  I then had to wake up just 6 hours later at 8 am because I had an interview with FactSet.  This interview was all technical questions and I actually enjoyed myself compared to the really hard behavioral question interviews.  After this interview I had a class, then at 11:30 I had another interview, this time with IBM.  Easiest interview I have ever had.  No questions just talking.  Then at 2 I had OOP then at 4 I had yet Another interview with Chevron.  This interview was the behavioral kind of (Tell me a time when you ….).  That’s all good and stuff if you can remember ever single time in your life.  Immediatly after this interview at 5 pm I had the PL test.  I thought I did OK.  The day is not over, I had to then start programming my OOP project.  Then I went to sleep.  The next day Thursday I had to do my cheat sheat.  Stayed up late yet again to get my cheat sheat all taken care of.  SO, with the totality of the weeks fatigue taking its toll on my mind body and spirit the test was very hard.

Wow, we have to make an allocator!  This sounds really hard.  This is of course a primitive allocator and not a real functioning allocator for performance.  A linked list for linear craptacular learning performance.  We also went over the overly-complicated 2D heap arrays for C++.  Still have no idea of how to use these babies.  Out of the twenty google ways we can view a 2d array the easiest is to make the column a constant value which really limits the capabilities of methods.  The C++ iterators are extremely powerful and useful compared to that of Java’s iterators.