Week 6

 Going a bit of course and starting my journey into learning algorithms. I will continue trying to get my parser to work, I have yet to ask my professor about some of the bugs in my code, so it will need to be done after spring break when I see him next. Doing a bit of research on algorithms, it is said that DFS(depth first search) and BFS(breadth first search) are very important algorithms to know, so I looked up some example codes and YouTube videos with explanations to get a basic understanding of both of these algorithms. Depth first search is search algorithm that goes to the furthest child nodes of each vertices and adds each passing node to a stack, knocking off each vertices that no more nodes to explore, which starts when the search has gotten to the furthest node and pops each searched node of the stack seeing if any of the previous nodes have nodes that haven't yet been explored. Similarly, for Breadth first search we search each vertices but instead of going to the furthest vertex you explore each node you touch and knock it off a queue, adding each node to the queue and knocking it off once there are no further nodes touching it that haven't been searched. Having looked at some of the code that was used to utilized the algorithms, I have decided to delay my algorithm journey because I do not yet understand all the code being used for the algorithm. Instead, I shall increase my java knowledge by trying to do some projects and expanding my java code knowledge, so I can one day be ready to implement these algorithms and resume my journey. 




The pic above shows the process of a depth first search, how it navigates and adds to a stack.




The pic above is the breadth first search process and how it adds to a queue.

The Sites I Used(cited) :

Bari, Abdul. “5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search.” YouTube, YouTube, 24 Feb. 2018, https://www.youtube.com/watch?v=pcKY4hjDrxk.

“Breadth First Search or BFS for a Graph.” GeeksforGeeks, 18 Oct. 2021, https://www.geeksforgeeks.org/breadth-first-search-or-bfs-for-a-graph/?ref=lbp.

“Depth First Search or DFS for a Graph.” GeeksforGeeks, 30 Jan. 2022, https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/.

Sites for the Pics used:

“Breadth First Search: Complete Guide to Breadth First Search Strategy.” EDUCBA, 3 Mar. 2021, https://www.educba.com/breadth-first-search/.

“Depth-First Search (DFS) – Algorithms and Data Structures.” CrazyforCode, 9 Apr. 2016, http://www.crazyforcode.com/depth-first-search-dfs-algorithms-data-structures/.


Comments

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