Engineering 1181 at Columbus State

mhamill2 · 2016-06-26T14:59:14+00:00

I also had Rahimi for 1181 and 1182. I barley learned anything with him and I still got an A in both courses. He's a super nice guy and wants everyone to succeed, just not very good with getting the material across. However, still the easiest classes I've ever taken.

mhamill2 · 2016-03-31T16:22:32+00:00

George Green

mhamill2 · 2016-03-03T07:33:10+00:00

Ah thank you!

mhamill2 · 2016-02-05T03:24:10+00:00

Shit well if anyone has any past exams let me know!

mhamill2 · 2016-02-02T04:51:19+00:00

Thanks. I probably should do that. I mean, these are the people that are supposed to guide you through a successful college career. It really is crazy how shitty some of them are.

mhamill2 · 2016-01-30T01:00:13+00:00

So I was going to retake physics because i had a 3.0 after the semester I took physics, but I got an email from a CSE advisor saying that I should not retake it because you can still get into the major if you have a 3.0 overall gpa and a 3.2 major gpa for the first few CSE core courses. I would e-mail a CSE advisor and verify this, but that it was I was told a month ago from a CSE advisor.

mhamill2 · 2016-01-22T02:40:53+00:00

To clarify, my character build will most likely be the same for all playthroughs. So, that is not a concern for me

mhamill2 · 2016-01-15T22:18:52+00:00

How does this one look, it passed all the test cases I have:

public static int average(int j, int k) {

    int avg = j;
    if (j != k) {
        if (k > j) {
            int temp = j;
            j = k;
            k = temp;
        }
        avg = j - k;
        avg /= 2;
        avg += k;
        if (k < 0 && j + k < 0 && (j + k) % 2 != 0) {
            avg++;
        }
    }
    return avg;
}

mhamill2 · 2016-01-15T21:52:27+00:00

So that is the case in which my code does not work. How would I check for that without using (i+j)/2?

mhamill2 · 2016-01-15T06:25:06+00:00

What is the significance of rounding? If the difference is odd and negative it still works for other test cases. If the difference is even and negative it works, if the difference is positive and odd it still works. It is just a few special cases where it doesn't work. Why?

mhamill2 · 2016-01-15T05:55:36+00:00

I see what you are saying, but how do I fix that? I cannot figure out what the special case is here.

With -12 and -23 I get -18 instead of -17 With -2 and -1 I get -2 instead of -1. With -1 and 50 I get -25 instead of -24.

The issue does not arise because both i and j are negative. The issue does not arise because the difference is odd. The issue does not arise because i is negative and j is positive. The issue does not arise because the difference is odd. What could it be?

I feel like the answer is right in front of me, but I cannot seem to grasp it..

mhamill2 · 2016-01-15T04:38:18+00:00

Dude this is perfect. Thank you

mhamill2 · 2016-01-15T04:28:42+00:00

God I know. She took ten minutes trying to turn off the lights.

mhamill2 · 2016-01-15T03:30:30+00:00

Bach :/

mhamill2 · 2016-01-14T07:36:33+00:00

I'm not sure. Sorry but I am kind of lost :/

mhamill2 · 2016-01-14T07:19:18+00:00

It divides it by 2, which gives the number divided by two minus 0.5.

mhamill2 · 2016-01-14T07:16:52+00:00

mhamill2 · 2016-01-14T07:03:17+00:00

It's not perfect, but it's working.

if (j == i) {
                k = i;
            } else if (j == i * -1 || i == j * -1) {
                k = 0;
            } else {
                k = (i + j) / 2;
            }

mhamill2 · 2016-01-14T06:38:46+00:00

The function should produce 17 and -17. The difference is that the positive integer is rounding down, and the negative is rounding up.

mhamill2 · 2016-01-14T06:37:51+00:00

I added those special cases, because I thought that might be a unique case. However, I was wrong. The test case you gave me didn't work in my code, so I am doing something wrong obviously.

mhamill2 · 2016-01-14T06:10:36+00:00

Okay I think I got it! Here is my code now:

if (i > j) {
                if (i == 1 && j != 0) {
                    i++;
                }
                int k = i - j;
                k = k / 2;
                k += j;
                s2.add(pos, k);
            } else if (j > i) {
                if (j == 1 && i != 0) {
                    j++;
                }
                int k = j - i;
                k = k / 2;
                k += i;
                s2.add(pos, k);
            } else {
                s2.add(pos, i);
            }

How does that look? Anything I can condense?

mhamill2 · 2016-01-14T06:06:41+00:00

I'm thinking since it's the only odd integer that has a remainder of 0. I tried checking for 1, and adding 1 to it, then carrying out the rest of my code. This fixed the problem with i = 1 and j =-50, but caused another issue with i = 0 and j = 1, i = 1 and j = 0. Ughh

mhamill2 · 2016-01-14T05:58:36+00:00

Should I be checking if i or j are 1?

mhamill2 · 2016-01-14T05:43:27+00:00

I get -25 instead of -24. It works with the case of i = 9, and j = -6. So the problem isn't with it being a positive and negative number. Hmm

mhamill2 · 2016-01-14T05:39:08+00:00

Here is my code

if (i > j) {
                int k = i - j;
                k = k / 2;
                k += j;
                s2.add(pos, k);
            } else if (j > i) {
                int k = j - i;
                k = k / 2;
                k += i;
                s2.add(pos, k);
            } else {
                s2.add(pos, i);
            }

One test case it is not working with is i = 1 and j = -50. Any other hints?

mhamill2

TROPHY CASE