Jeremy Lopez

* predicted number of hours to complete: 10
* actual number of hours to complete: 8
* TestDarwin.out
* Partner: Mike Pena

* predicted number of hours to complete: 6
* actual number of hours to complete: 4.5
* TestSudoku.out
* Partner: Peter Baum

* predicted number of hours to complete: 3
* actual number of hours to complete: 2.5
* TestAllocator.out
* Partner: Rusty Fausak

* predicted number of hours to complete: 3
* actual number of hours to complete: 2
* TestMatLab.out
* Partner: Jeffery Zhu

* predicted number of hours to complete: 4
* actual number of hours to complete: 5
* execution time: 0.348
* rank: 71
* Voting.out
* TestVoting.out
* Partner: Josh Sayers

* predicted number of hours to complete: 2
* actual number of hours to complete: 3
* execution time: 0.024s
* rank: 78
* Primes.out
* TestPrimes.out
* Partner: Sean Spencer

* predicted number of hours to complete: 3
* actual number of hours to complete: 6
* execution time: 0.008s
* rank: 149
* Collatz.out
* TestCollatz.out

Here is a list of additional test cases I added. I used these test cases for my initial submission of the Collatz problem.

void test_eval_5 () {
i = 113383;
j = 113383;
v = 0;
eval();
CPPUNIT_ASSERT(v == 248);}

void test_eval_6 () {
i = 10;
j = 1;
v = 0;
eval();
CPPUNIT_ASSERT(v == 20);}

void test_eval_7 () {
i = 113380;
j = 120000;
v = 0;
eval();
CPPUNIT_ASSERT(v == 349);}

void test_eval_8 () {
i = 1;
j = 999999;
v = 0;
eval();
CPPUNIT_ASSERT(v == 525);}

void test_eval_9 () {
i = 999999;
j = 1;
v = 0;
eval();
CPPUNIT_ASSERT(v == 525);}

Hope it helps.

This is the first project in my OOP class.

The problem specification is here: 3n + 1

I have completed the problem using a “stupid” algorithm. I received “wrong answer” on the first submission but realized that the problem specifications are a little bit ambiguous and also that our algorithm must support 32-bit calculations. Made the correct changes and everything is working correctly now. The only optimizations that have been made have to do with using bitwise operations to multiply and check if a number is even or odd.

Initial Results:

Ranking: 5328

Time: 0.568

The next step is to implement a cache to complete this problem in a more efficient way.

This is my first blog post ever. Never really thought I’d ever have a blog but here we go. This blog will mainly serve as a place to track all my work and progress in CS 371P, which is an Object-Oriented Programming class that I am taking for the Fall 2009 semester at UT.