adh529’s blog

Darwin is completed!  And what a journey that was indeed!  I am glad to have gotten such a competent partner this time ’round, as this seems to play very much into whether I have fun building the project, or whether I am simply left to my own devices on my own time to code my own project, and then proceed to slap someone else’s name atop — as was once suggested to me by someone very sage, who will remain nameless, but is this good advice or bad advice?  In my opinion, the Pair Programing model used in schools, at least this implementation of it, is in many ways open to abuse.  For example, for this last project, what is stopping me from simply not showing up to anything?  My partner will be forced to write the entire thing on his own, and turn it in for both of us.  At what penalty to me, you might ask?  Well, I’d get a “talk” very much like the talks I would get if I broke curfew or any rule for that matter, and then we would continue down the line with my probationary status intact — meaning of course that if I were to EVER do this a second time, I’d receive a failing grade in the class.  Good thing it’s project 8, right?!  Anyway, enough ranting for one blog.  Have a happy happy turkey day! I can’t w8! l8!

Wow, even weeks down the line already!  Darwin should be an interesting project.  Finally, I got a competent partner for this project — YuanLe.  He is godly with linux and even moreso with makefiles and gtest.  It’s scary.  Anyway we learned about static and dynamic binding of types in C++, and other languages too for that matter, this week.  Not sure what next week will hold as it’s a different game every day, pun intended.  The Darwin game should be fun but long to program.  Well, we’d better get started!

Estimated hours to complete: 30

Actual hours to complete: 40

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

OK (6 tests)

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

hoyle@cactuscafe:~/CS371p/Sudoku$ valgrind main.app
==13433== Memcheck, a memory error detector.
==13433== Copyright (C) 2002-2008, and GNU GPL’d, by Julian Seward et al.
==13433== Using LibVEX rev 1878, a library for dynamic binary translation.
==13433== Copyright (C) 2004-2008, and GNU GPL’d, by OpenWorks LLP.
==13433== Using valgrind-3.4.0, a dynamic binary instrumentation framework.
==13433== Copyright (C) 2000-2008, and GNU GPL’d, by Julian Seward et al.
==13433== For more details, rerun with: -v
==13433==
..57..4.1.
18..5…9
6..1.7..5
…2..8..
.2…..6.
..1..8…
3..4.9..2
2…7..46
.7.5..19.
…..
Test2:
518476239
427359618
963821574
795248361
832617945
146935827
379564182
651782493
284193756

.
Test3:
126478593
837592461
945361278
412937856
569184732
783256914
251649387
374815629
698723145

OK (7 tests)

==13433==
==13433== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 21 from 1)
==13433== malloc/free: in use at exit: 122,880 bytes in 6 blocks.
==13433== malloc/free: 496 allocs, 490 frees, 180,416 bytes allocated.
==13433== For counts of detected errors, rerun with: -v
==13433== searching for pointers to 6 not-freed blocks.
==13433== checked 124,140 bytes.
==13433==
==13433== LEAK SUMMARY:
==13433==    definitely lost: 0 bytes in 0 blocks.
==13433==      possibly lost: 0 bytes in 0 blocks.
==13433==    still reachable: 122,880 bytes in 6 blocks.
==13433==         suppressed: 0 bytes in 0 blocks.
==13433== Rerun with –leak-check=full to see details of leaked memory.
hoyle@cactuscafe:~/CS371p/Sudoku$

Expected number of hours to complete: 10

Actual number of hours to complete: 20

Wow, what a stretch.  I had 3 tests in 2 week, on top of an Operating Systems lab, which I have still yet to complete (slip days for the win!), and the Sudoku solver to finish coding up.  Tim and I are meeting today after OOP to work on it.  I have a drafted design on paper that I think will work well and plan on typing it up today in between UNIX and OOP.  It seems like my work-week and school-week never ends as I always have Sunday night deadlines looming overhead.  That is one thing I did NOT enjoy about downing’s Generic Programming and the STL class, and similarly I am not too fond of the very same stipulation this semester.  At least that gives us the weekend to work on it, because, as history is indicative of, my weeks are usually slam-packed full of other tasks and deadlines from Automata and OS, even UNIX gets in the way!  Snarl @ LaTeX.  Anyway, I’m off to code up the Sudoku solver — downing declared that it was kosher to use an algorithm only *slightly* more clever than the brute force approach.  Epic win for only *slightly* more clever than the dumbest approach!  Let’s see if I can ride that mantra ’til graduation…  And then possibly even into industry?  We shall see.  Tune in next week for how the Sudoku solver was solved.

Test 2 went well — although I could have used more time.  I have yet to start on the Sudoku solver project, as I have been busy studying Automata Theory and fighting off the influenza virus.  UHS is refusing to see anyone who does not fall into their arbitrary “high-risk of complications” category, and thus I am left to my own devices and over-the-counter meds to combat this virulent disease — and some people want SOCIALIZED MEDICINE?  Imagine what would happen if an entity like UHS were to provide healthcare to the nation, or the world?!  Blasphemy if I’ve ever hear it — sheer blasphemy.  Tune in next week for how the Sudoku solver project went.

• predicted number of hours to complete: 5
• actual number of hours to complete: 5

hoyle@booze:~/CS371p/Allocator/New/doxy/Project5$ valgrind main.app
==6237== Memcheck, a memory error detector.
==6237== Copyright (C) 2002-2008, and GNU GPL’d, by Julian Seward et al.
==6237== Using LibVEX rev 1878, a library for dynamic binary translation.
==6237== Copyright (C) 2004-2008, and GNU GPL’d, by OpenWorks LLP.
==6237== Using valgrind-3.4.0, a dynamic binary instrumentation framework.
==6237== Copyright (C) 2000-2008, and GNU GPL’d, by Julian Seward et al.
==6237== For more details, rerun with: -v
==6237==
…………………………………………..

OK (50 tests)

==6237==
==6237== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 21 from 1)
==6237== malloc/free: in use at exit: 1,050 bytes in 5 blocks.
==6237== malloc/free: 1,274 allocs, 1,269 frees, 142,551 bytes allocated.
==6237== For counts of detected errors, rerun with: -v
==6237== searching for pointers to 5 not-freed blocks.
==6237== checked 124,076 bytes.
==6237==
==6237== LEAK SUMMARY:
==6237==    definitely lost: 1,050 bytes in 5 blocks.
==6237==      possibly lost: 0 bytes in 0 blocks.
==6237==    still reachable: 0 bytes in 0 blocks.
==6237==         suppressed: 0 bytes in 0 blocks.
==6237== Rerun with –leak-check=full to see details of leaked memory.
hoyle@booze:~/CS371p/Allocator/New/doxy/Project5$