Week 12



 




This week I felt a sudden urge to try to convert my minlab1 into python to try to learn the language. The first photo is the python code and the second is the java that I did during 205. As you can see in the code it is very different in java then in python. You can sorta till the idea and goal is the same but the code and grammar is different. Python needs no semi colons, which is so weird but convenient because its one less thing I need to worry about. Print doesnt need the system.out. I need to my int variables in to string in order to print, which is interesting. Conditional statements done need parenthesis and after its condition there is a colon instead of a pair of brackets. Input is set to take  in string so I was getting a lot of errors until I found out you have to type cast it to an int. Conveniently, it makes the left side variable a float if the right has division. Down below we see the results when given the same data.




In addition to this little side quest, we did discuss in class about the way to find the square root by hand(Babylonian method). I did it in mips for one of my assignments but I want to show it in java to show you what it does and if/how much it actually works. Gonna try to give a brief run down of the code. D is to check the accuracy of the number that is being found the smaller the D the more accurate. The G value is the Guess that will be manipulated to match the square root. N is the number being square rooted. Our while is squaring G - from N and seeing how close the difference between the numbers are. The reason this works because G is suppose to be sqrt(N) and so if G^2 then we should get N and N-N is zero but G^2 isn't gonna be perfect so we use .001 or smaller to get as close as possible. The while allows it to keep checking until it reaches less than the D. We print the results and compare with an actual square root. The first pair of photos after the first shows how the D effects the result and how close you can get by changing it. The second pair shows how the G effects the result, which is none. No matter what the G is it will fall down to the answer. The last picture is an extreme example of that even though I'm pretty sure it only stored 2 billion something.














Comments

  1. EricaDecember 6, 2022 at 10:36 AM

    Very nice work, Ronin. I'm sure you'll find Python quite useful.

    ReplyDelete

Post a Comment

Popular posts from this blog

Week 9

Image
 Today I looked at some interesting videos of some leetcode videos, which use problems that show up at coding interviews. I watched a guy who was prepping for interviews by running through these problems and talking about them. First Video was about locating islands. (pic of the instructions below) So hopefully you can see how the first input has only one island because all the ones are surrounded by zeros. It's kinda hard to see at first but it helped when he points out why in the video. He talks about the problem and comes up with a pretty straightforward solution. He says he will use a breadth first search(BFS), which I've done a bit of research on before in my week 6 of last years blog. Breadth first search when used on binary search trees takes a node and searches all of its nodes, so I can see how it can apply to this problem. Breadth first search will take one island(1) and search all the 1s connected, which is an island, so when it can't find anymore it means there ...
Read more

Week 10

Image
 This week I found an interesting problem that was exactly like a problem I did in my class this semester, csc 230, but instead of mips I did it in java. The problem is fizzbuzz where you take a number and if the number is a multiple of 3 print fizz and it its a multiple of 5 print buzz and if its a multiple of both print fizzbuzz. There are two method one(first one) is the one that was in a video where I discovered the problem and the second one is me doing it the way I thought of. The problem was pretty easy but the way it did intrigued me because It was different than mine his felt much more clever than mine. What he does is creates variable fizz and buzz so when fizz equals 3 and buzz equals 5 we reset and add to the arraylist but its cool that he does this by using variables to keep track of the fizz and buzz. So fizz for the first 10 will look like this 0,1,2,0,1,2,0,1,2,0,1 for buzz its 0,1,2,3,4,0,1,2,3,4,0 at all zeros after the first zero will add the respective word....
Read more

Week 11

Image
 Today I did another leetcode problem. Like last week I found a similar problem to one I've done in class but with a different language but instead of mips this time it is in C++. I'm starting to think my 240 teacher was making us do these problems on purpose haha... anyway, the problem this time is called valid parenthesis or matching brackets is what my 240 teacher called it. I knew the basic rundown of the problem and tried to code it. But to give a brief rundown we are checking if all brackets "("  or "{"  or "[" are closed correctly. Fortunately, I was able to directly translate the code for the most part, so we can see the tiny differences between c++ and java.  We see in the two pictures below that c++ looks a little different. In java we see the stack as new stack but in C++ #include stack and we dont need to new. In C++ the string as treated a char arrays so we dont need to do charAt in C++ they already are characters and in this respect i...
Read more