Welcome to our review for Exam 1 for Math 1030, Contemporary Mathematics at Southern Utah University. As usual, I'll be your professor here, Dr. Andrew Misseldine. So this is the first of our exams that we're going to see throughout this course. So what I want to do in this video is discuss the many topics that are going to appear here in Exam 1. The short answer is that this exam is going to cover the topics we've been learning about so far regarding to graph theory. So graphs, vertices, edges, Euler's Circuits, Hamilton's Circuits, all of that business right there. So as this is our first exam, a few things I do want to say about the structure of this exam, for which you can see the cover page of the practice exam right in front of you. As we go through this review, it might be helpful to have open in front of you the practice exam that you can find on Canvas or the exam syllabus. You might want to pause the video and find that right now. Now with this exam review, there are some things that I really can't talk about in this video. In particular, things like time, place, and manner of the exam. It can change from semester to semester, the dates, the times. And so those things, you'll want to take a look at the exam syllabus to make sure you're squaring all of those things. But things that won't change from semester to semester for this exam are going to be the types of questions, the topics that appear on this exam, and those are the things I want to talk about in this video here. So what should you be studying as you prepare for this exam? So one thing that you should be aware of is that this exam has two types of questions. We have so-called multiple choice questions for which you would just circle your answer amongst the choices that's present. We'll talk some more about those in just a second. And then there's also these free response questions for which you would write all of your work, all your supporting work in order to get to the final answer. This exam has nine questions in the multiple choice section. They're worth five points each. And then the remaining questions, there's 15 questions on this exam, the remaining six questions are in the free response section and the amount of points they are worth varies from question to question. You can see that right here. And so like question 10 is worth five points, the next one's worth eight. And it depends on the difficulty of the question. And so be aware of that as we're going through this exam. So all of these questions are about graphs and the things related to that. And so as you are working through this exam and the multiple choice section, you would just select the one correct answer, but in the free response show all your work. Partial credit is available in the free response section. If you don't get exactly the right answer, you can still get partial credit based upon the work you showed there. Be aware though, if you only put the final answer in the free response, even if it's correct, you'll probably get no points. The work is necessary for full credit. In the multiple choice section though, it's all or nothing. There's no partial credit for those ones. You either select the correct answer or you don't. All right. The other specific things like what materials can you use? Where do I take the exam? Take a look at that in the syllabus because that can change from term to term. So without further ado, let's talk about the topics of this exam. Now in this video here, I'm gonna talk about the types of questions you should be preparing for. I'm not gonna solve any of the problems in this review. There are solutions attached to this practice exam, so you can check your own solutions. But also I do have also solution videos prepared that you can watch for each of these questions you see on here. So if you do have questions about how these problems are solved, take a look at those videos. This review video is just gonna focus on the topics that we need to be preparing for here. Okay. So with question number one, well honestly, this is true for basically every question on this exam. You're gonna be given a graph and asked to analyze some aspect of that graph. And this test will be randomly generated. So it is actually possible that you might see the same graph on multiple questions. That's not a big deal. Each question will ask you something different about the graph. So even if you get the same graph, no biggie there whatsoever. Question one is, I usually like to start the test with one that's softball, nothing too hard here. So question number one is gonna ask you about how the vertices are connected to each other. So this might lead to something like degree. Remember the degree of a vertex is the number of edges connected to that. If a loop is present, we count the loop twice because there's a start and stop. That's what we're counting there. For degree, it's kind of like we draw a circle and we look at nothing outside of the circle and we then ask ourselves, how many edges do I see there? So for vertex A, the degree would be three in that situation. But related to this idea is the idea of adjacency, like who is adjacent to A? A is adjacent to B, it's adjacent to F, it's adjacent to G, but A is not adjacent to D because there is no edge that connects A to D together. There is a path from A to D, but that's actually a topic that you'll see in a different question. Question number one, very much softball, like what's the degree of a vertex? Which vertices are adjacent to which vertices? Just some basic vocabulary about graphs that we've seen through these lessons. And I should actually take a moment and pause and say that. This exam is gonna cover lessons one through eight about graph theory. Now, admittedly, lesson nine, as we start talking about scheduling and things beyond that, we are gonna talk about the notion of a digraph, a directed graph, but none of that directed graph conversation is gonna appear on this exam. This one only is about undirected graphs that we saw in lessons one through eight. So we'll see things like Euler circuits, Hamilton circuits, traveling salesman problems, shortest path, Dijkster's algorithm, Flurry's algorithm, Kruskal's algorithm, those are the type of things we're gonna see on this exam, okay? So yeah, question number one, I really should think it's like a lesson one type thing. Very, very basic idea. Admittedly, I confess degree was introduced in lesson three, but very, very, very low level stuff there. Okay, question number two is gonna give you a picture of a graph and it's gonna ask you to correctly identify either a bridge on the graph. Remember, a bridge is an edge, which if removed would disconnect the graph. This question is asking to find a bridge. So which of these six edges is a bridge? It could be that the graph has multiple bridges, but amongst the six options, there should only be one bridge. So by process of elimination, like it's not AX, it's not BY whatever, find the one bridge that's listed among the six there. This question could also be modified to ask about bottlenecks. Remember, a bottleneck is similar to a bridge, but a bottleneck is a vertex if removed from the graph would disconnect the graph. The notion of bridges we introduced in lesson three as we were talking about Euler circuits and Euler paths. And then when it came to bottlenecks, we introduced those in lesson five as we started talking about the traveling salesman problem. So question number two is gonna ask you to check and find either bridges or bottlenecks on a graph. So be prepared to do those. Question number three is going to ask about Euler paths and particularly it's gonna ask, I like to use Euler's theorem. So remember, Euler's theorem tells us that a graph has an Euler circuit if and only if all of the vertices are even and it also tells us that it has an Euler path. So it has a Euler path, meaning that it visits every edge once and only once, but it doesn't start and stop at the same place. It has an Euler path exactly when two vertices are odd and all the other ones are even. So with this question right here to ask, which two vertices must all Euler paths start or stop at? So this would tell us like, oh, what are the two odd vertices you're looking for that? So you should know Euler's theorem, that statement I just said. Question number three will ask you to apply Euler's theorem in some type of multiple choice section kind of like this, like find the start and stops of an Euler path. Notice it doesn't ask you to find an Euler path, it just tells you what two points do you have to start and stop at, which would be the two odd vertices. Question number four is gonna be a traveling salesman problem. In particular, it's gonna ask you to run the nearest neighbor algorithm on a complete graph that's a complete weighted graph that's provided. So something like K5 with all the various weights there. When you're running this one, it does say use the nearest neighbor algorithm. So there's some things you have to note here. The nearest neighbor algorithm needs a starting point. It's gonna specify the starting point. So you start at B on this example. As we've seen with the nearest neighbor algorithm, different starting vertices can lead to different answers. So if you do not start at the vertex that is specifically mentioned in the instructions here, you might get a different answer and that would then be marking it wrong, okay? I should also mention that the cheapest link algorithm is not what the instructions ask you to do. The cheapest link algorithm could produce a different answer than nearest neighbor starting at B. So you wanna make sure you follow the directions, use the starting point that I mentioned, otherwise you get some wrong answers here. Now, as you're looking for the answer here, it doesn't actually ask what is the circuit, the Hamilton circuit you're constructing. It just wants to know what's the cost of the circuit. So you would add together all of the edges you use. So like if you went round robin, I'm not saying that's the right answer, but if you went round robin, if you think that's the correct circuit, you would take 3.3 plus 5.3 plus what is that, 5 plus 4.5 plus 3.6, you'd add that together. On this exam, of course, you are allowed to use a calculator, so if you want, you can help with the arithmetic here. There's no questions that require a calculator, but I can confess that on a question like this, the addition, it's profitable to have a calculator, so you might wanna bring one when you take the exam here. You're just gonna write the cost of the tour that the nearest neighbor algorithm gives you, start in at B, make sure you start at B, and also don't use the cheapest link because that could give you the wrong answer. Honestly, a lot of these answers here are the answer for a different Hamilton circuit, some of which you might find if you do nearest neighbor out of the wrong vertex or if you do the cheapest link. So do make sure you follow the instructions there. Some things I should mention, I forgot to mention here, with question number three, we did Euler's Circuits in lesson three, so if you need to review Euler's Theorem and learn some more about Euler's Circuits or Euler paths, you might wanna go back to that one. And number five right here, we learned the nearest neighbor algorithm in lesson five, if I do recall, or no, that's, I'm sorry, that was lesson six. In lesson five, we introduced Hamilton circuits, but we didn't learn the nearest neighbor algorithm until lesson six right there, so do be aware. Question number five is gonna be a question about trees. So I want you to analyze, do the properties that I'm gonna give you about a graph guarantee that it's a tree or not? We introduced the notion of trees in lesson seven, and in particular, there's a couple of properties we found out that are equivalent to being a tree. A graph is a tree if it's connected and has no cycles, that's the definition of a tree. Another condition we have is that a graph is a tree if and only if every edge is a bridge. A graph is a tree if and only if every pair of vertices has a unique path between them. And then finally, a graph is a tree if and only if it's a connected graph with n vertices and n minus one edges.  And question five is gonna ask you something like that. So in this case, suppose that a connected graph, so that the tree has to be connected, it has 10 vertices, call them A through J if you need to, and there are two paths connecting C and D, all right? So that has something to do with the single path property. Is the single path property satisfied or violated? I'm not gonna say in this video, because again, I'm not gonna provide the answer.  If you're like, oh, those conditions guarantee it's a tree, then you would say A. But it could also be something like, oh, I don't have enough information. Like, let's say it tells us there's 10 vertices here. But if it's like, oh, you have a graph with 10 vertices and nine edges, right? That's tempting to say it's a tree because it doesn't sound like the N minus one edge property.  It turns out, oh, I misspelled the word. That's what it turned out. It turns out that a graph can have one less edge, but not be a tree. For example, if I did something like the following, you take two vertices right here, another one over here, and so you have three vertices and then two edges. It's not a tree in that case, because it's not connected. But in order for it to be connected, you have to do something like that in which case that would be a tree. So the answer actually could be C, that you don't have enough information that the graph that's described could be a tree or could not be a tree. So this one is definitely one you're gonna wanna think about, again, go to lesson seven to see those properties that you should be aware of. Feel free to put them in your notes. It'll be helpful for this exam. Moving on to the next page here, question number six. So that you'll be given the picture of a graph, okay? And you'll be asked which of the following is an Euler path or Euler circuit on this graph. In this case, it was asked for an Euler path so the starting and stopping points don't have to be the same. If it was a circuit, it would have to start and stop at the same spot, of course. So an Euler path, remember, this is a path which uses every vertex once and only once. And so it's not asking you to construct an Euler path. It's just saying of the six options here, which one is actually an Euler path. And so some things I could note here is like where are the odd vertices? Every Euler path has to start at one of the two odd vertices. That itself might help eliminate some of these possibilities very, very quickly. Some of them would be discarded for that reason. But at the very least, you can just go through them one by one by one. It's like, okay, looking at the first one here, I go from G to D to E to B to C to D to, and you can keep on going, of course, through all of these things here and see how that handles thing. I will finish this one out here. You go from D to A to B to E to D to E. That's not an Euler path, right?  So that one's not an Euler path, so you can rule that out. So by process elimination, determine which of the six is an Euler path and the other five will not be, okay? This question is gonna ask about Euler path, but it could be an Euler circuit as well. So again, like we said before, we introduced Euler paths and Euler circuits in lecture three, but lecture four about dead head might also be worth taking a look at as that was about Eulerization. That's not directly related to this problem, but there might be some information there that could be useful as you're preparing for this exam. Question seven is gonna be a question on shortest path. This is gonna be an unweighted graph. You're gonna see a weighted graph later on. So you can run the full force of Dijkstra's algorithm, but since there's no weights, each of the weights you wanna think of as one, and so you actually might be able to solve this without the full force of Dijkstra's algorithm. By all means, you've used Dijkstra's algorithm here, but it's like, okay, I wanna find the distance, the shortest path from A to G. With the absence of weights, I think you can find out what's going on here. This graph has an example of bridge. You're gonna have to use that. And you wanna find what is the shortest path. Particularly, you wanna figure out what's the length of the shortest path.  Okay, that is definitely not the shortest path, just so we're clear. You'd be like, okay, one, two, three, four, five, six, seven, eight, nine.  Oh, that answer's not there. So I made a mistake clearly. So you'd select just with the length of the shortest path. You don't actually have to come up with the shortest path itself. Shortest path was the main conversation we did with lecture two. Dijkstra's algorithm was introduced in lesson two as well, but we also looked at some of these smaller examples of shorter path that are for unweighted graphs. It's a little bit easier, of course, in that situation. All right, question number eight. This is gonna be very similar to question number four that we saw on the previous page. That is, you'll be given a weighted, complete graph. You'll be asked to solve a traveling salesman problem, but this time it's going to give you the cheapest link, or it says use the cheapest link algorithm to solve the problem. Again, you don't have to write down what was the Hamilton circuit you found using the cheapest link. You just have to find out what was the cost of the cheapest link tour to solve that traveling salesman problem. So again, if you think it goes, you just grabs all the edges on the boundary. You would take nine plus 25 plus 32 plus 18 plus 35. That has to be something. Let's say it's 121, you would select choice B. That's all you have to do. But like I cautioned you with question number four, with the nearest neighbor ones, you need to follow the instructions. If you try to do nearest neighbor with any of the vertices, it might not agree with what the cheapest link gives you. So run the cheapest link algorithm to guarantee that you'll get the correct answer there. Now, cheapest link was introduced in lecture seven. So if you need some more practice or want to see some more examples, please go look at the lesson or the corresponding homework assignments there. So then we get to question number nine. This is the last question on the multiple choice section. This one is actually very similar to question number six that we saw above. But this time you're going to be given a graph and you want to analyze which of the following is a Hamilton path or a Hamilton circuit. So a Hamilton path unlike an Euler path is a path which visits every vertex once and only once. And Euler's theorem doesn't exactly apply. Finding like a criteria for the existence of Hamilton paths and circuits is a little bit harder. But again, in this example, all you have to do is figure out which of these six options is a Hamilton path. One of them will be the other ones will not. And so you could try to go through them. You know, it's like, okay, I go from F to B to A to D. You can go through them and see if that gives you a Hamilton circuit or a Hamilton path. In this case, it's asking for a path on the actual test might ask for a Hamilton circuit instead. Some of these might not even be paths. Like you might jump from vertex to another vertex they're not even adjacent to, I don't know. But I do check to see which of these is Hamilton path and which one's not. So just so you're aware, the Hamilton circuit as a definition and Hamilton path was introduced into lesson five. And so you might want to go to that lesson and the corresponding homework to get some more practice if you're not ready to do that already. Now that gets us through the multiple choice section. Remember, there's nine questions total in this section. Five points each, so a total of 45 points. You would select what you think is the one correct answer and no partial credit is available on those ones. So do take your time to make sure you answer those things correctly. Now we're gonna move to the free response section of this exam. Like we mentioned before, the total points for a specific question varies based upon its difficulty. But you can get partial credit if you have partially correct answers or partially correct work. And you do need to show all the appropriate work, which I get it. In some problems, there's not really a lot of work to show. Like question number 10 right here. It's gonna ask you to draw an illustration to represent the graph when the vertex set is given and when the edge set. So you draw a graph, it's like, okay, I have five vertices. You would label them like A, B, C, et cetera. And then you connect the edges if possible. Like, oh, there's an edge A, B. There's an edge A, C, et cetera. So you draw the picture. So there's not a lot of work to show. I mean, the answer is the illustration and thus all of the points is gonna come from that final graph. Now, if you do have some mistakes in the graph, you can still get some partial credit. But this one's only worth five points. So it's actually on par with a multiple choice question in terms of its difficulty. We were doing this in lesson number one. So we should be able to understand like how can we draw a graph? And be aware that not every illustration is unique. There are different ways you can draw a graph that's still correct, that's perfectly fine. As long as you have a correct graph illustration, you can get the full points on question number 10. Question number 11 here is gonna have to do with oilerizations and finding oiler circuits. So you're definitely gonna want to come to lessons three and four for that. And lesson three, we learned Flurry's algorithm which tells us how to construct an oiler path or circuit on a graph. This graph that you can see right here, it does actually have an oiler circuit. You can argue that every vertex is degree even. And therefore by oiler's theorem, an oiler circuit exists. So then you wanna implement Flurry's algorithm which we learned about in lesson three to construct an oiler circuit. And for the sake of simplicity, since there's so many vertices, if you want to label them like A, B, C, D, you can do that assuming you know the alphabet. You can do that and then you can be like, oh, I go from A to B to C to D, whatever. But many of us, especially since the graph will probably be unlabeled, it might just be easier just to label the edges. Excuse me, so you can go like one to two to three to four to five to six, just clearly label the order and that way the grader can easily follow and see if the thing you construct it is an oiler circuit or not. There's not a unique answer to this problem because when an oiler circuit exists, there actually can be a multitude of oiler circuits. But Flurry's algorithm which tells us to avoid bridges. There's options because when you avoid a bridge there might be a lot of edges to choose from. Run Flurry's algorithm and you can construct an oiler circuit as long as it's correct you'll get the full points there. And again, on this question, there's not a lot of ways of showing your work other than the answer itself, one, two, three, four, et cetera. But depending on how close your final answer is to an oiler circuit or not, to look how close you got with using Flurry's algorithm, we can give you some partial credit potentially if there were some mistakes there. I should also mention that question 11 here, it might ask you to come up with an oiler circuit but it also might ask for you to find an oilerization. It could be that you have a graph that doesn't have an oiler circuit because edges might be odd in which case you might need to add some extra edges. So what you would do is you would draw the extra edges and remember for an oilerization just like we discussed in lesson four, for an oilerization you could only use multiple edges. That is you can only double up on edges that already exist on the graph. No new edges are allowed. And you need to do this in a minimal fashion. As in you add edges in such a way that the problem is small.  We in the homework did explore this with some un, with weighted graphs but for the sake of the exam these graphs here, the oiler circuit you would find or the oilerization, these would be unweighted graphs. So that makes it a little bit easier and I would want you to oilerize a graph based upon that. So that's what you could see in question 11 here. Either find an oiler circuit on a graph that has an oiler circuit or if it doesn't have an oiler circuit you would oilerize it and then add these edges and then you might have to label the edges as well. One, two, three, four, five, et cetera. So be prepared to do that on question number 11. And these are things we did from homeworks three and four. That question's worth eight points. Question number 12 is worth 10 points and this will have to do with minimal spanning trees like we learned about in lesson eight for which you'll run Kruskal's algorithm to find the minimal spanning tree. Remember Kruskal's algorithm is basically just the cheapest link algorithm. It's just the focus is a little bit different. With the cheapest link algorithm you're trying to find a minimum Hamilton circuit. With Kruskal's algorithm you're looking for a minimal spanning tree. And so that slight difference is like, well you can revisit the same vertex as many times as you want to because it's a tree but you can't build cycles. So and then you just grab what is the cheapest one. So looking at this graph right here like the cheapest link is like, oh I have a 10 right here. I have a 10 right here. I have a 10 right here. You keep on going from there. I can't use this anymore because that would form a cycle.  You're gonna find the tree and then you have to so notice what it says here find the minimal spanning tree shown below using Kruskal's algorithm. So if you need to you can sort of color the graph in order to show it or you can just label which tree you have over here. So I do need to see like what is the tree and then also describe its weight. So you would add together all the weights to get a final answer but I do need to see the tree. Unlike those multiple choice questions where you just gave me the weight of the Hamilton circuit I need to know what the tree is. Most of us can probably just color it on the page there which if you only have a pencil just like kind of like, you know just make it bold. So it's very clear like what edges you used. You can label it over here if you want to but that can get a little bit messy. I think drawing it on the graph is probably your best bet there. And if you have colored pencils pile means do so. I mean who doesn't just keep those in their pockets at all times. But if you don't, if you just have a pencil just kind of like shade it in to indicate very clearly what edges you're using just make sure you don't erase the numbers if you do that, okay. Question number 12 worth 10 points find as minimum spanning tree using Kruskal's algorithm and tell me the weight of that minimum spanning tree. All right, question number 13. This one I want you to solve a traveling salesman problem but you're gonna do this one by the brute force algorithm. Remember what does brute force mean? You need to try everything. You try every possibility.  So if you look at every possible circuit and because since you're trying every possibility why as well just for the sake of it started A when you go from A it's like what can you do? You go from B to C to D. There's gonna be six options you have to look at here. If you have a fixed starting point on K4 and the starting point doesn't matter so why as well pick a point to start at say that A there's gonna be six options but these options come in pairs. So there's like there's just the same option backwards. So really there's not a lot of options here. So when I say brute force it's not a big problem you can handle it. I want you to look at every possible Hamilton circuit list all of their weights and then decide which one was the best one. So indicate of your list of all of them which what's the best one and what's its cost. So for this one, this one you definitely have to show all your work on if you don't list all of the Hamilton circuits then you're gonna lose some points. You gotta show the cost of each of those Hamilton circuits and then you have to indicate of all of those Hamilton circuits what is the best option there, okay? So with the brute force we started doing this in lesson six very briefly at the beginning we did it with a K5 problem K4 is much simpler but I want you to mimic that for question number 13 there. It's worth so many points not because it's hard but because there's a lot to show as compared to some of the other ones. Question number 14 you will be asked to given a weighted graph here you'll be asked to find the shortest distance between two vertices in that graph. So for example, this one you have vertex C you have vertex G you wanna find the shortest path from C to G so you might do something like this I don't know if that's the shortest path but you're gonna have that. Now in order to find the shortest path you are gonna run Dijkstra's algorithm here. This is a problem you have to show all your work so I do need to see that you do Dijkstra's algorithm with Dijkstra's algorithm you wanna you go from C to G but you actually drive backwards on this thing so you actually start here be like okay the distance from G to G is zero and then the distance from F to G is like 21 running Dijkstra's algorithm you would fill in these boxes and so you do need to show all of these boxes until eventually you find the right distance here that's how you show your work on this one if you leave those boxes blank you're throwing away points I do need to see that what is the shortest distance and then actually write out the path for which you can either color it on your page or you can just write out like C to D to E to F to G again I'm not saying that's the shortest path just hypothetically okay Dijkstra's algorithm was the main focus of lesson number two so if you want some more practice on Dijkstra's algorithm go look at lesson number two for that one this one's worth 10 points this now gets us to our final question on this exam question number 15 for which you'll be given another traveling salesman problem but now we're gonna do the repeated nearest neighbor algorithm so remember to repeat this near neighbor you do the nearest neighbor algorithm for all of the vertices this graph has five vertices so we'll start at A find the nearest neighbor answer start at B find the nearest neighbor answer start at C write the nearest neighbor answer do all of those and so you'd write those like oh if you start at A you're gonna get this one here's the cost you start at B here's the circuit you get and here's the cost like so these are those are supposed to be dollar signs they don't quite look like them you know you do it at C and you should do it you tell me the cost you do have to do all five of them or if you did something if there was like six vertices you'd have to do more right and do all of them try all of the vertices cause that's what repeated nearest neighbor means and then whatever the correct one is you would indicate like oh this is the optimal path that we found I mean I guess I should say it's suboptimal there could be a better answer but I need to know what was the answer you got from the repeated nearest neighbor and you do have to do all of them for full credit on this one okay so that then gets us to the end of this exam we basically hit everything I guess I should also mention that repeated nearest neighbor we introduced in lesson six it was the same lesson that we introduced the nearest neighbor algorithm so as we're preparing for the exam there's clearly gonna be some randomizations variation that happens here like question number 15 it will be about the repeated nearest neighbor algorithm but this graph you can anticipate to be different so that the answer is different but you do need to prepare how to use these algorithms like all the algorithms we learned about you need to know how to use you need to know how to use Dijkstra's algorithm to find shortest path you need to know how to find you need to know how to use Flurry's algorithm to find another circuit brute force nearest neighbor repeated nearest neighbor cheapest link to find Hamilton's circuits you need to know how to use Kruskal's algorithm to find a minimal spanning tree you need to know all of the definitions of things like bottlenecks and bridges and edges and vertices adjacency degrees oh my all those things you need to know those things and therefore this exam will be a very accurate assessment of your understanding of our chapter on graph theory of course if you have any questions beyond this review please reach out to me I'll be glad to help you as best as I can best of luck in your studies everyone and I will see you next time


I love going to the picture show a lot of people are not doing that anymore But no, but we had to create watching movies Right, so now boom Sony got their own movie theater Warner Brothers got their own movie theater and Netflix Hulu boom boom Radlite district I watched his documentary on how brothel's built America and I said what? And then I was thinking about said Mark Zuckerberg He got these people out here on only fans. They're making all this money on and guess what Mark Zuckerberg owns your content guys He owns your content.  We're building a city in the metaverse because that's where we're going right the end game is Metaverse right everybody's you know sandbox all this stuff, but I saw problems there in the metaverse You want to go hang out with Snoop?  So we set I put those proper securities in place to build O'Connor the first metatropolis in the metaverse It's gonna be a full city like the movie free guy Like when you land in there or O'Connor Hospital back-lining with Teta medicine if you want to come in you and cancun you ran out of your anxiety meds or your Diabetes whatever whatever meds blood pressure medicines boom you get a immediate your orchid holder You're immediately, you know right there with your doctor in the oculus is boom and then have a real-life utility in real life Right CVS can pick up your prescription, you know partnering with Sony thinking about everything No, it's like and not only that he came that he comes into this world, and he don't just sit He starts to try to figure out ways to be a creative mind to help defensive Mechanisms toward right weaknesses within the whole rail correct So like partnering with Sony and Warner Brothers and paramount universal now we're giving the studios no more I'm sorry. No more no more movie theaters. I mean we can have them as a what's it called some A pastime, yeah, right, but you know like a you know something that's I love going to the picture show But yeah, but we have to create watching movies Right, so now boom Sony got their own movie theater Warner Brothers got their own movie theater and Netflix Hulu boom Boom boom red light district. I watched his documentary on how brothel's built America, and I said what? And then I was thinking about that mark Zuckerberg He got these people out here on only fans. They're making all this money on and guess what mark Zuckerberg owns your content guys He owns your content. He does he owns your everything your data. We've been talking about that I just posted lil brook. He takes your Instagram boo see and he does what he want to do with People's people lose them every day and they just drop them and and and then people's income change too Well, here's the deal monetize. So here's the deal What's the difference between and I'm gonna shut it down right here. I can't say nothing else after this Mm-hmm. I already know so Prenuer So I'm an owner in this company called Prenuer. Mm-hmm Prenuer. What's Prenuer?  Can I get a can I get it? Yeah, boom fantastic Why why? So anything you do breath boss talk 101 anything you send out guys on Instagram Only 1.2% of your followers are seeing that it's in the algorithm Mark Zuckerberg put it there on Facebook and I can tell and I don't know why he did it So if you have 600 followers, I'll say the number let's say 600 followers 1.2 That's 12 12 people they could be ghosts. They could be non like not even real they could be box So we're falling on deaf ears. So that how are you reaching your market? How are you reaching your people? Prenuer is Now you're creating your own phone book Like and all of your followers by show of hands use your you know, you you can bring them over from social media little by little right and and use social media just to bring them over but what's the point if Mark Zuckerberg can own our data Facebook can own our data if maker American Express can own our data Macy's can own our data if you I mean Bloomingdale's and all these people can own our data. Why can't we own our own data? So so so now what Prenuer does it allows you to own your data. Okay, period So they so Prenuer is so every time you say hey check it out bruh e ceo here boss talk Ba ba ba click in when we click the number of my bio right now boom or click Prenuer in my bio Call the number of my bio or text the number of my bio code Ceo or boss talk. I'm gonna send you all the latest updates and boom boom boom boom boom now instead of 1.2% Visibility you're getting a hundred percent visibility because everybody in your contact Everybody in your phone book that says I wanted I want I want to know everything boss talk is the one I want I show you guys got fans and it doesn't it doesn't show it doesn't reflect Because even in you cheers by the way cheers cheers YouTube is the same even when we are on YouTube and we go live and as much as everybody hit Jamaica And everybody hit the Notification bell when they come on our lives and they're like, but we didn't get a notification So I could literally what I'm gonna do is I think we should do next week And I would love to do this with you guys. I'm gonna set you guys up an account. Okay That's on me on the love boss talk You know boss talk for newer account because you have a huge network.   Okay. How to do it, right? What do you know it's stored? I don't mean it's been around for a little bit, but it didn't start till I showed up Yeah, I'm I'm you know, so did you are you part owner? Yes, I am So how did you how did you it brings up the question? How did you get into renewal? No, that's not how because I wasn't impressed by it when I first saw it, okay Because I didn't know understand what it was what it was and nobody did just like I didn't know about NFTs Just I didn't I didn't understand a lot of stuff, but I had to dive in to understand So what I realized what Purnuer provides is bringing back what this is what the DAO a DAO DAO Decentralized autonomous organization. We are decentralized autonomous Organization meaning we are not we're not controlled all of us, right? We are so in that DAO Things move differently. You understand what I'm saying. So for example My guy that started Purnuer is my CTO for Oracle United. Okay, so he builds companies, right? He built up the Adobe technologically, right built Adobe. He built him to send gets him to IPO and sells them, which is Supposed to do yeah, right, but now he's like man. I want to just I want to help my people What's amazing about this NFT crypto space metaverse all this stuff that people want him are so spooked out about Is that majority of the people behind the scenes a young African-American brilliant text? Really? brilliant like Brilliant silicon valley didn't let him in and they figured out they back way and this is the back way because well You know I mean now we got a voice. So, you know, I'm doing my rounds. This is my first stop Hey, boss. I want to work Stop by boss talk This is my first stop I'm going to see sit down with the sacks the screen actors guild the directors guild of America I'm sitting down with PGA WGA teamsters. I want to bring us together to understand what we got to come together and do as Locking on this down. What does that mean now if we have a dow coin?  Is it the way you explain it earlier? If we have a dow coin everything works on the down We can we exchange in the dow we change the way we exchange. Yeah Yeah, we can't change changes and change until we change Know how to exchange, right? He's right. So let's change it Decentralized autonomous organization. The time is down. Yeah, we on boss talk one-on-one. Yeah, we gonna


I recently asked my YouTube community for suggestions on upcoming videos. Two people suggested, maybe more, but these are the ones that I saw in the five minutes I glanced back at it. If I would indulge them on my most anticipated movies of 2022, I think that's a great idea. I'm always eager to see what's gonna come out next in Hollywood, even if it has been a massive disappointment in the last couple years. So special shout out to Arman, Sharma, and Kyle. Before I jump into this, I should also ask you to subscribe to the channel. Adam does movies as I post content each and every week here for your enjoyment and sometimes disappointment. But either way, I'm TRYING, MOM! Jackass is like a fine wine. It only gets better with age, and I'm hoping that that's the same with the sequel. The stunts will be more over the top. The injuries will be far more grand because these guys are getting old now. I grew up with Jackass.  These guys were the original TikTokers. The original Viners, the original YouTubers.  That's hard core. That's free content. They're not getting anything for that other than exposure and the chance to wow people with their hijinks. Running shopping carts into walls, falling off of things. Nothing that took skill, but it took passion and it took dedication.  I mean, that's ballsy. That's ballsy. It's funny, too, because I barely relate to these guys. I'm so boring and uninteresting compared to them.  And I'm at home on a Friday night playing Mario Kart. After my kids are sleeping and my wife has passed out next to me in bed and it's the only free time I have to myself! Made some good choices in life. Seeing Johnny Knoxville, seeing Steve-o, seeing Bam, Margerin. I don't remember how to say his last name. It's going to be great. I'm looking forward to it. I like that taco. Whatiti is coming back. I don't know how to say his name, so I'm just going to aggressively pronounce it. Takah. Whatiti is coming back. He's doing the- He did Thor Ragnarok. I have hopes. I have high hopes because this guy doesn't let me down. He always does a fantastic job in the writing and directing department and his movies. I mean, if you didn't like Thor Ragnarok, I understand not being excited in the slightest for this. Natalie Portman's coming back. She was about as exciting as a piece of driftwood in the first two Thor films.  But that's coming back now. She's back in it. And I thought she had no interest, but now that she's Lady Thor, I guess she's willing to pick up the hammer herself. I am putting all of my faith in the script department on this one. I know it's visually going to look pretty cool. I know the humor is going to be great. The Guardians of the Galaxy are going to be in this for a while, probably just an extended cameo. But still, that's better than nothing. I just really hope they can work on this relationship between the two leads. And I think Portman's going to come out of her shell a little bit in this series.  I saw Black Swan, but you can also tell when she has zero interest in the property. I've seen the Star Wars movies, too. You're breaking my heart. The last time Guillermo del Toro did a fairy tale, Pan's Labyrinth, I was freaking blown away. My jaw was on the floor. I had to pick it up after the movie was done.  I was in the parking lot. I didn't even realize it. I didn't realize why there was nothing down here. And a guy came over, is this done? Are we done with this shtick? Yeah, I think so. Pan's Labyrinth is phenomenal, though. Guillermo del Toro does not miss. Although Roma, I think he did Roma. That movie wasn't for me. I mean, legitimately it wasn't for me. I didn't understand anything about it. The culture is clearly over my head. But hearing that he's working in tandem with another director and an animation company to bring Pinocchio to the big screen again, I'm telling you, this is going to be one to look out for. The producer of John Wick, the director of Atomic Blonde and Deadpool 2, is bringing us bullet train. The plot revolves around said bullet train where five assassins all realize they're part of the same project. They have the same target. I just, this sounds like a great concept on paper. And in execution, I think he's going to pull it off just based on his track record. Plus, you have Brad Pitt in this. You got the Kissing Booth's Joey King. Oh, that's not a, that's not a plus. You got Deadpool 2, Zazzy Beats. Okay, back on track. You got Aaron Taylor, John Sin, shtick. We're off the rails again. But then you have America's sweetheart, Sandra Bullock. Okay, here we are. We're on the train. And then you got Bad Bunny. What? Why?  Is that a rapper? Is Bad Bunny related to Bad Robot? JJ Abrams production company? Probably not. Just keep going. Anyway, I'm excited for this, regardless of the kind of random assortment of characters we have. The order of this list means nothing.  Halloween kills was, I guess, polarizing. People were either in the love it camp or hated camp. I was more in the love it. I thought it was good. I enjoyed it. It definitely was a lot dumber. I thought then Halloween slash Halloween 2, which is the sequel to Halloween of the same name. Man, this is so bad. Why do they keep doing this? The new Scream movies called Scream. Stop it. Stop rebranding your sequels as the first ones. It's like the Xbox One.  Hopefully Jamie Lee Curtis is back this time and not laid out in a hospital bed for the majority of the picture.  And she probably killed him in a different one in the past. It's hard to keep track of what's going on. H2O, I guess, isn't canon anymore. Because the reboot of Halloween, which is the sequel to Halloween called Halloween.  And you don't have to take my word for it. The crowd chanted it every five minutes in the last one. Hopefully, hopefully we see that through.  I know I'm not. Because we got into the Spider-Verse part one coming out this year. I'm very excited for this. I'm pumped, baby. That last one. Oh, it was so freaking good. Miles Morales introduction. We have all these different Spider-Men coming into the fold. Clearly kind of inspired the new Spider-Man No Way Home to bring back some of the old legacy characters. I don't know how this one misses, honestly. Although Sony is tied to the production, which can sometimes be troubling. They don't have the best track record of decisions. But I have faith in the writing department. I have faith in these brilliant animators. And I just love me some more Miles Morales. It looks like by the little tease we've had so far, he's the one that's going to be doing the traveling off world into the multiverse. If they can keep surprising us with the brilliant art style and some of the story beats we might not see coming, I think they're going to have an easy win here. I am very curious why it's called part one. Are we doing like a Deathly Hallows thing here? We're an evil Spider-Man Voldemort. It's going to get access to the elder Spider-Web. And at the end of part one, he's just going to go, I've had a good day. When the webs are going to go up and then we fade to black. I'd be cool with that. Very little is known about Babylon. Other than the director is Damien Chazelle. I think that's how you, I don't know. I'm terrible with names. I butcher them all the time. People, you can try to correct me in the comments. It's not going to change anything. I'm from Minnesota. I have a little bit of an accent.  So nothing, I'm not going to learn. I'm not going to learn from my mistakes. I freaking love this director though. So far, he's three for three in my book of the movies I've seen. I think he's only directed three.  Lollaland blew me away. And I don't like musicals really. I'll, I'll, I'll respect Greece, but I'm not going to watch it again. And then flippin' first man. Are you kidding me? That movie made me openly weep in the theaters. I was one of seven people there. Nobody saw first man. We live in such sad times, don't we? When movies like first man go unnoticed, unappreciated. Oh my god. As a father. If you're a father, I implore you to watch first man. It will break your heart. If the director I listed isn't doing anything for your swimsuit area, and the movies I listed have gone unnoticed so far by you, how about this? We have another Brad Pitt vehicle. Margot Robbie. Dear god Margot Robbie, my god. Uh, I gotta keep going. Toby Maguire. Oh my god, Toby Maguire. I gotta keep going. Olivia Wilde. Spike Jones. And a film. Revolving around classic Hollywood. I think you add those ingredients together. You have a delicious main course. I'm ready to eat. Tom Cruise's mission that he has chosen to accept for the seventh time is to get Mission Impossible out the goddamn door. COVID has been running amuck with his productions of both this and of Top Gun 2. The guy's got a handful. He's yelling at people that aren't wearing the masks. He's trying to act. He's trying to produce. The guy's doing it all. Oh, and, oh yeah, he's also practicing for a year to get these motorcycle stunts and skydiving stunts off the ground. L-literally. Listen, say what you want about Scientology, but if it's wrong, I don't want to be right.  He's like one of the junkies from Arcane.  And go to something more refined. Not too refined. Not James Bond.  Go to Mission Impossible. That's where it's at. He's killing guys. He's doing his own stunts. He's almost dying all the time. There's hot chicks in the film. They're all so awesome. We don't have time to veer off into social inequality or political injustices.  We have people to shoot. We got motorcycles to drive into the air off a ramp. I'm so excited. And I just can't hide it. I don't want to lose control, but I think I like it. When the first trailer for The Batman came out, I was very underwhelmed. I didn't see what the big fuss was about. The internet went crazy. They went hog wild. That's an expression people used to say for some reason. And I just didn't have it. I didn't see it. I didn't get it. But then the second trailer came out. And then I realized, wait, Matt Reeves, that's the guy that did Cloverfield, which I love. That's the guy that did Dawn of the Planet of the Apes, which I freaking loved. That's the guy that did War for the Planet of the Apes, which it looked nice. And that trailer was so fire, as kids at one point also said for some reason, because it's hot. That's why. That's why. And since then, they've released more promotional material for it.  The Penguin looks awesome. Catwoman. Ooh, Selena Kyle. Ooh. Zoe Kravitz. She's doing it. She's working it just right. She's got that Anne Hathaway. She's got that Michelle Pfeiffer. You know what? Every Catwoman. Every Catwoman's been great. We really have been eating well when it comes to the Catwoman. The movie's dark, man. It's grisly. I know we said this in the past, but these movies keep trying to up each other. This has some David Fincher vibes going on, and I'm all for it. David Fincher, one of my favorite directors. And this is looking like seven. I didn't see it at first, but now I do. There's some seven on the wall, and I'm all for it. I was never down on Robert Pattinson playing the character. I always liked him as Cedric. He'll always be my Cedric Diggory. So, yeah, having him in the cape and cowl, that was fine with me. I figured he could pull it off, and it really looks like he is. He's got the range, the action looks phenomenal, the CG's looking top notch. I'm all in for the Batman. I can't wait for it. In the number one spot is Avatar 2, a film that is 13 years in the making. I had to practice doing that little finger thing like five times. Meanwhile, James Cameron is making a goddamn epic. There's countless jokes about Avatar, how it smurfs in space, how it dances with smurfs. Save what you will. The script is not the most creative. The story's been done a couple of times over. Revolutionary, yeah. Engaging, of course. Gripping, another word I'm using. But after 13 years, is it worth it? Is James Cameron worth it? What did he really do? Besides aliens, Terminator 2 judgment day, the abyss, Titanic, True Lies, Avatar 1, which has its own theme park and video games and is one of the highest grossing movies of all time. Is he still worth it 13 years later? Always. This isn't a man who's just making a movie. He's making the future, baby. A lot of this is filmed under water with state-of-the-art cameras that he helped create. We have some of the cast backs, Zoe Saldana. Just a gorgeous woman, a brilliant actress. I love her. One way to see her again is as that blue-navy creature, that beautiful specimen. We also have that not Matt Damon guy that no one really cares about. What else did he do? I don't know, he's in it. Jake, I think, is the character's name. It doesn't matter. He's gonna do what he needs to, to push the story. What James Cameron has built, kids, is a foundation with the first avatar. You might not see it, but it's there. Rich planet lore. Different characters, different civilizations to be uncovered. And he's going to bring us there, deeper in the depths of the planet in Avatar 2. We'll probably go off-world. We'll see different places. We'll explore the galaxy. Because there's five of these movies as of now. I believe. Five, four, five. This is a saga. This is epic. This is his tour de force.  Ah, believe you me, it will blow you away. You can naysay. You can judge. They did the same thing for Titanic. Look how that turned out. So yes, the number one movie I am very interested in if it can make it this year is Avatar. Avatar 2. I'm so excited to see what he brings out.  You have no idea. Maybe you do. Maybe you're not in with me.  Your chair will probably sweat and pulsate.  I'm tingly all over thinking about it. Yeah, so there we are. Those are my top 10 most anticipated films of 2022. That doesn't mean there's not more. I'm excited about. These are just the ones that, as I did a quick glance through the lineup, these ones jumped off the page. Some of them don't have a trailer. Some of them barely even have a plot at this point. But based on the quality of character assigned to it, the actors, the directors, the screenwriters, these are the ones that stood out. Now I'd love to hear from you in the comments below. Let me know your most anticipated movies of 2022. Like the video if you had a good time. Subscribe if you haven't, and I hope to see you soon.


Let's solve a couple of questions on single slit diffraction where the slit width is changed. For the first one we have a diffraction experiment where the slit is made smaller by a fifth. And this causes a change in the diffraction pattern on the screen. The question is to figure out what happens to the central maximum. There is a note which says that assume that the central maximum casts a tiny angle on the slit. And we have to choose two answers out of these four. As always, why don't you pause the video and first give this a try. Alright, hopefully we have given this a shot. Now the question is asking us to think about what happens to the central maximum if the slit width is changed. So before we go into the options, before we see what angle of width or size means, let's try and draw the setup. So here we have the screen and here we have the single slit. We can see that the distance between them is capital D and the slit width is A. And now the diffraction pattern on the screen because of the light waves interfering at different points, it looks like this. You have a central maximum with a great intensity and the intensity decreases as you go further away from the center. The question is asking us to think about central maximum. So let's just focus our attention on this region of the interference pattern. And we need to think about angle of width and size. We can think about size first. Size could be just the width of this central maximum. It could be the width. So it could be this distance right here, the entire width of the central maximum. And the angle of width is the angle that the central maximum makes on the slit. So wherever the central maximum is ending, whatever angle it makes on the slit, that would be the angle of width. And that could look somewhat like this. This complete angle, this complete angle would be the angle of width of the central maximum. And I've divided this into two as half of the central maximum is over here and half is over here. So these two angles are the same. But this total angle is the angle of width of the central maximum. Since the angles are the same, we can call both of them as theta. Now in single slits, we know that the part difference A sin theta, A sin theta, the part difference between the waves coming out from the single slit. This was equal to, this was equal to M lambda for destructive interferences. So wherever we have a minima, the part difference is equal to M lambda, an integral multiple of lambda. So this condition is wherever a minima is formed. And we can see that the first minima, that would be the first order minima or M equal to 1, that would be A sin theta equal to equal to lambda. The first minima is formed where the central maximum ends and theta over here is small because a note says that the central maximum is casting a tiny angle on the slit. So this entire angle is tiny, so half of it will be tiny as well. We can approximate sin theta as theta. We can write this as A theta that is equal to lambda. And particularly for this point where the central maximum ends, where the first minima forms, this is the first order minima. So we can call this as theta 1, this is also theta 1. And over here theta 1, theta 1 becomes equal to lambda by A. Now the angle of width of the central maximum will be double of this. It will be 2 theta 1. So when we write that, when we write 2 theta 1, this becomes equal to 2 lambda by A. This is the angle of width of the central maximum. And now we can see what is happening to the slit. The slit is being made smaller by a fifth. So this is A old, we can say this is the original A. The new A, the new A becomes equal to A by 5. And we see what can that do to the angle of width. This 5 will go up and it will be 10 lambda by A. So what happens is your angle of width increases by 5 times. It increases by 5 times. We can now think about the size, this entire width of the central maximum. For this, we can take help of the triangles that are being formed over here. We can focus on this top right angle. So the angle is theta 1, this angle is 90. And this side of the triangle is half of the total width. So we can call that W. Later we can write 2W to figure out the total size. We can write this as tan theta 1 equal to W, W could be the side, this side length. W divided by capital D. Capital D is the base of this right angle triangle. And that theta 1 is sin theta 1 divided by cos theta 1. When theta 1 is small, sin theta 1 can be approximated as theta 1. And cos theta 1 is just 1. Because when theta 1 becomes really small, tending towards 0, let's say, cos 0 is 1. So we approximate cos theta 1 as 1 for smaller angles. Now let me write this over here. This becomes theta 1 equal to W by D. And W is just 1 half. So we can write 2W, that is the size of the central maximum. So this is 2D theta 1. And in place of theta 1, we can write lambda by A. So this becomes 2 lambda D by A. And now again, when the slit is made smaller by a fifth, this A, the new A, the new A becomes A by 5. A by 5. And again, this 5 goes to the top, gets multiplied by 2. And the width just increases by five times. You have this 5 going to the numerator. So the size, the size increases by five times. All right, now let's go to the next question. Here we have the width of the slit being tripled in size. And we can see how the size changes. What happens to the intensity of the central maximum? We need to choose one answer out of these five. Again, pause the video and give this a try. All right, so over here, we need to think about intensity of the central maximum. And when we try to recall the intensity of a wave, we can say that intensity was always proportional to the square of the amplitude. And we can think of the slit. We can think of this slit as being made up of, let's say N, N secondary, N number of secondary sources. So you have the primary source, which is sending all these light waves. And then when it passes through the slit, you have all these secondary sources which act as individual sources, creating their own waves. And that results in an interference and you see the pattern on the screen. This is what Huygens' principle said. All of these points act as secondary sources, creating the pattern. So if there are N number of such sources, let's say there are N number of such sources, and each source creates a wave with an amplitude of, we can say the amplitude is A with an amplitude of A. Then the amplitude at the central maximum, the amplitude at the central maximum will be the sum of all of the amplitudes produced by each of these sources. That is what central maximum is. This is a constructive interference. All of the sources are interfering constructively. So total amplitude at the central maximum, that would be N into A. So this is the amplitude. Intensity, we can say, is proportional to N A square, N A whole square. Now the width is being tripled. So now there are three N sources. And each source produces a wave of amplitude A. So the total amplitude of the central maximum, that would be three N A. And now the intensity, now the intensity is proportional to three N A whole square. When we take three outside, this becomes nine N A whole square. So we see that the intensity has increased nine times. And that makes this option B. All right, you can try more exercises from this lesson. And if you're watching on YouTube, do check out the exercise link in the description.


58.9. What the Dukes! I was just fishing 72 degree water in Flowrida. This is chilly man. Everything's on the bottom like they're cold. I don't want to see that. No. All right, let's take a look at the map. Let's see what we got here. Some little Flowtoids. I don't know what they are. When you're watching fish on your electronics, usually the fastest moving fish is going to be a striper or a white bass. They're always moving. Always. And you can tell that on 2D sonar as well. Then crappie really don't move. Catfish, slow, usually around the bottom. It can be suspended. And then bass are kind of somewhere in between. Sort of behave like crappie. Just way more aggressive. There it is boys. First official crappie of the day. That's a giant. I was just messing around. I gotta land this thing. Hang on. Gosh. Snacky swimmer down the hatch. That is a two pound crappie ladies and gentlemen. I could just tell you. And it came a ways to get it too, which is a good sign. I'm actually going to go back to my truck and I'm going to get another pole. It's a little more suited for this. This is the only one that I've found worth casting at so far. Just coming out towards the main lake and that's a dandy. This is actually so big I'm not even going to keep it. I want this one to be a good spawner. Create more big ones for the lake. Unless you're not going to swim away, don't make me keep you. Give her a 20 feet of water. She's got the bins. I may have to put her in the box. God this is big. Whatever it is. Catfish maybe. My hope for today was to go out and catch some crappie around the bank, but when I saw the water temperatures were really low, I knew it was going to be a toughie and I thought the live scope might save the day and I popped off a big one to start started off and I thought we might hammer some really big ones, but what ended up actually happening is I caught a couple of catfish and a giant drum that I thought was a big bass and that was it. But at least we're leaving the lake with dinner and yes that is not my normal truck right there. Long story, I'll tell you later. Oh my good old buddy, LucasTV hit me up that afternoon and he was wanting to do a little bass fishing exploration the next day at another lake that we hadn't been to in a while and I bledged and I had to bring my crappie pole along because it's just what I do. And we hit the lake for a little while and tried to do a little bass dangling. Tell us, tell us how you're doing here today on this fine day, bro. I'm doing fantastic. I'm here for it. You're being interviewed over there. This is like some old rack, at least over here. I like this. Yeah, back when I had the microphone. One of my old videos I interviewed John B. Hey guys. John, what do you think about being in Texas? It was so good, guys. I'm so glad I came down here from Chicago. I caught all the fish, it was good. I love wiener dogs. What kind of grass is this? I honestly don't know. It's not filtering clearly. It kind of looks like pond weed but it's in leaflets like my hand. What do you call that? What's the scientific term? It's like clean but muddy. It's very strange. Eloquently described. Clean but muddy. We'll check back in with more proverbs from Rob here in just a minute. It was quickly evident that all the rain in the cold front had definitely knocked these fish back. It was honestly quite terrible but started noticing a little something off in the distance of the scopes. Scanning out in the open water and there's this thing that happens after rain and the water gets kind of milky. It's like the crappie will sort of suspend and they'll get up high on the surface and sun themselves and that's exactly what we started seeing and they started to pick up that crappie pole and just fire out there and see if any of these floaters wanted to play ball. Oh just had one there on the edge. I just had one. Dropped it. Especially with the cold front you would think the flipping ought to be good.  Look at that. That's a school of bass. It's got to be. It's a school of somethings. Good. Get out there. Get on them. Here they go. Here they go because I'm throwing out the deal. The crappie deal. Crappies they could be. Let me check. Oh just got slammed there buddy. Oh yeah one hit it again. Felt like a bluegill though quite honestly. Crappiesies baby. Oh my gosh double crappiesies. Let's go baby. Hey come on now. Work with me Rob. Work with me baby. Let's see what we got going on out here. Those are decent. Those are nice.  Look at that. Dude just make your wife happy right here. Yeah. Dude this is actually. Hey. You want to get after a buck? We might be getting after a little bit of a crappie sesh. You don't want to keep this big boy. Well that's a nice one. Mine had. Do you want to take some of these home Absolutely. Absolutely. This actually could be kind of interesting. Yeah I like that they hit it reeling. That's good. Means they're aggressive. Coming after it pretty hard. There you go. I got another one. Dude I am about to beat a crappie king. There you go Rob. I'm about to beat the absolute crappie slayer right now. Get after it buddy. They are getting after that. Okay. I'm about to hook up too. I'm gonna throw that thing back. Yeah that one's just a hair small. It's a good eater but. Oh god I just had one. He sucked it. They're in like pods which is kind of strange. Quite a few pods out here. Oh my gosh. I love it. I love it buddy. Oh yeah we're rocking and rolling here now. This is kind of interesting here boys. Do you have a measuring thing in here? I have that.  Man some you know 10 to 12 inch. Are you serious Rob? I've been waiting for this moment with you for a long time. Because we're about to dangle right here buddy. We're about to really have some fun because there's a lot of pods. Kind of a weird turn of events.  Let's see if we can throw a little dangle dart on top of these son of a gun. Oh here we go. Should be getting close now. Oh my gosh. Oh my god there we go. Spanky McGee buddy. You snatched them right out of that thing too. Oh yeah. They're all up in there. The thing I love about crappies is they stay still. See they just hang there dude. I'm about to be about to be. This one's a little small. There's some good ones in there.  These are pre-spawn. These are pre-spawn crappies. The crappie chased me all the way to the bottom. I gotta put a lighter head on. No it's wild is so we have this rain and the water's kind of muddied up and they're like suspended pretty high up. It's like they're warming they're warming themselves so they could have been like close to the spawn too but just didn't quite feel the love either. Oh yeah.  I got one. There you go. Oh my golly here we go. Let me double up. Dude this is this is it right here. Oh it's a good one too. There you go keeper. The old dangle dart dude. Hey yes sir crappie machine. I should bring these back for candy dig. All right you ready to do a little catching clean and cook action? Oh yeah. My favorite dude crappie cakes. What do you think? I got some of the batter at the house too. Perfect. These are perfect eaters. I'm about to get another one for you. Like 25. 10. Oh gosh. Oh my god. Just blind casting. Just blind casting crappie out here. Oh this is pretty fun. Yeah buddy. There we go. Oh yeah. No you can get crappie close at the boat. That way you get close which is pretty ideal. They will get finicky on you. All right we are going to switch it up look what I just I carried in my in my pocket today. The only baits I had in my pocket. I have snacky swimmers. Look at these. Hungry hippos. There you go. Is this a better one? I don't know. Yeah it's definitely going to be well. Keeper. Switch it up so it's racally special. Oh yeah dude first cast with that thing. First cast with this one. You know it. This is the most non-traditional crappie setup probably in the history of man. I've got 12 pound fluoro as a leader on a short rod and a heavy heavy look at this. Did you get another one? Yeah I got another one dude. I am jacking up some crappie today folks with the old snacky swimmer. This color is something there's something about that color. Yo Guggen bait. They yeah they just chase mine but didn't eat it so they could the toxic that's what I was getting bit on at first was toxic waste. They're about to eat me though aren't they? Oh my god. Yep they're eating this one I'll tell you that much. They're cast. They are eating that one. Three crappie. Look at this. That's crazy. This is it. That's a good one. That's a good little crappie right there. Oh yes. Crappie flopping. Crappie flopping around dude. I'm feeling it right now. This is fun.  Oh my god. It doesn't suck. You know what it really is like I'm bass fishing well no I'm crappie fishing how I would like to bass fish for them. Yeah but you're catching. Just as fun. I think I totally missed. I don't know trying to get used to your thing here. Turn that down. There he is. Well bam. He doesn't make a cut. He's yeah he's a little on the smaller side. Just a little male out here doing his thing. Being a crappie. Oh my gosh what an attack. That's an aggressive one there. Gaw that thing came up 10 feet. He did five fish. That thing is incredible. That thing is amazing. I'm gonna put this one back on. Yeah well I don't know. He's a keeper. Dude I'm getting I'm getting hit just like randomly. I didn't even hit the school. There's just a lot out here. That was great. That was fun. We could put out full spider rigs right now. Just have like eight poles off the sides slow trolling these babies. Really like when you just float it over their heads like that. Oh you're about to get eaten. Oh you're about to get eaten. It's so exciting isn't it. It's crazy isn't it. The crappie. They just sit here right under the trolling motor. That's what they really want. They want it floated over him. It's just hard to do.  I need another one. That's why you that's why you have a 14 15 foot rod. So you just stick it out there. Look at this. I'm going straight. Oh god I'm excited. Come on now. Come on now. Come on now. Doink.  You doinked me. I need another tail. They will they will nip it quite a bit. They just kind of nip it. I think they're like they're staging to go up there and spawn. This is all I'm going to do when I get old. I'm going to have a chair.  A couple of big bee boppers.   No that was a full attack. Wow. I'm coming in. Am I coming in? I'm coming in. I'm coming in baby. Let's go. We're attacking. They're moving. Attack mode. I got them. You got them dude. There we go. Now we get to see what I get. Come on baby. It's a good one. Oh crappie. Get down. Older crappie man. Get down. There's a good one there boy. That was fun. That was fun. Those were just two together and so aggressive man. I'm talking it came like five feet away and stroked it. Really fun. Just a good eater but really fun. Woo man. Rob you're starting to get a little. You ever had this many crappie in your live well? You've never had a crappie at your live well. What do you do now? We are without the long pole today so we're just casting. You got them dude? You got the blown one. Come on baby. Be a big one. He's boxed. Better one. Nice. Hose it. Look at this. Look how far down he's go. It's gone. Show the folks at home on my channel that. Oh my god. Came all the way up from the bottom. This is the greatest. This is the greatest in my opinion. Oh gosh. Get him. Get him son. It looked like the big one on the scope. I don't know. It's a keeper. That gum. Oh god he got me with his big old fins. Son. Good one. I mean pretty much everyone that we're catching out here is a nice eater keeper and I do believe Rob is going to take these home to his lovely family and feed them. I'm probably going to take some home too. I like this combo right here with the 16th ounce and the bigger snackie because it falls really slow. That's what I want right now for these fish because I don't have the longer pole. I want a slower presentation. Let's rig one of these up. Oh my god. Oh gosh. Oh no. Oh gosh. Oh I'm sorry. Stepped all up on my unit. You got him? Oh yeah he came up and just hammered down. I might not have a pole now. For that thing right there. For that thing. I'm sorry but I don't know you had a rod laying down behind me. Oh remember that one time you just like stepped on one of my Shimano whatever it was. Yeah you sat on it and bent the reel handle. I thought I was going to watch my rod break. We're still in business. We're still in business. All right back in action. These are really high. These are less before feed. They're up there like sunning themselves. Yes. Come on. Here I am coming. Come on. Come on. Come on. Come on. It's all you. It's all you. It's all you. Eat it. Eat it. Eat it. Eat it. He got it. Oh my god. He got it dude. He smacked it.  I don't know what is happening. I don't know what is happening. They are spanking it but it's not a full inhale. We almost we need like a different color. I left my big crappie assortment at home. I didn't think we were going to be doing this.  That was on me. No he hit mine. He's coming back to you. He's coming back to you. He got him that time. Yes. He got him that time. All that work for that crappie. I don't understand what they're doing though. These people on this lake are the only ones catching fish dude. I don't care. I love it. That one's a Harris Mommy. He's a keeper but we'll throw him back. Absolutely a good time. A good time guys. We are here for a good time in the crappie zone. I often relish when I'm out here catching crappie and I see the bass danglers. No. They're like not catching. I'm like you don't even know right now. You don't even know the fun you could be having right now. Megapods. Where's the pod at? Where's the pod? That's something and I'm going right after that. That's a high pod. High pod. High pod. High pod. So Rob's coming through. He's going to come through. He's going to keep that lure above the fish. Look at that. What's happening? Are you on? Nope. They bumped it though, didn't they? They're right here. They're right here by the trolling motor. Just give them a straight angle. Just a hover. Here baby. Look at this. Look at them. Oh yeah. There's the pod and there's just groups of them like this out here. You know five to ten at a time. So that's what we're looking at. Just wads of crappie. This would normally be like where you would want a spider rig which is an insane deal to have on your boat with a bunch of rods and you just kind of troll, shallow troll the lake and get run across these groups but we're just encountering them with the forward fencing and it's a lot of fun. The whole herd said let's go to that thing whatever that is. This should be easier. Just hit me a second ago. Come on. Got him. Nope. On? No. Just nipping my tail bud. All right. I think we might need to downsize. We might need it for what you're doing. I think the dangle dart might be better because you're like actively shaking it. Good one. Come on baby. Good. There we go. Hope that stump. Let's go Sally. Yes. There's a toad on the stump where it should be. That was fun. Get one that pulls drag a little bit. Smoked it. It's down the hatch. There you go. There's actually a couple more on the top of it. There you go buddy. Wow. That's a good one. Yeah. Feels better, huh? That's a good one. Oh good lord. Watch it be a large. Good one on a piece of cover. Oh yeah. No, it's a big crappie dude. It's a big old crappie. Nice job Rob. There we go baby. There we go baby. Wow. Big old crappie. That is a big crappie. That's an old one. It was just plucked up there on the log. Just pulling it out doing its thing. And you're like oh it's going to be tough and it will. Sidewind. Sidewind action. Yep. I'm disoriented now. I got lost. I blacked out.  Oh my god. I G'd out dude. Rob's on. Dude that was like 80 foot out there man. Look at this. Old crappie. Oh crappie. Oh crappie. He's having a good time today. This is great. Got him on the old dangle dart that time baby. Look at that. This is fun. That's fun. Look at that thing. So yeah folks we did it. We got Lakers TV out there on the crappie game and got him to actually enjoy it and I think he's going to be going back again. I gave him my crappie cake recipe that me and Stephanie love and I'm going to leave it down in the description as well. If you guys haven't tried this, if you're new to crappie and you haven't and maybe you don't like fish, crappie aren't a delicious fish. And this is an excellent recipe. If you don't like a fishy taste at all, my whole family loves it. And there's also a video here so you guys can see how we cook the crappie cakes at our house. So I learned something big in this last 24 hours of fishing where when we have those heavy rains and the water gets sort of milky and maybe those fish were moving up to spawn but things, the water conditions changed, it backed them up. They like to suspend high up in the water column. I'm talking only a couple of feet down if you got a nice sunny day and warm themselves up. And we were able to catch them on life scope but if we were not using forward facing sonar, how we could have caught these fish was to just troll around. Use spider rigs, things like that. Blind casting would have been tough but they are suspended and I learned that. That's something I would have not known and noticed if I didn't use forward facing sonar. I know it's a controversial technology but man, when the days are tough, it is something to fall back on and put some fish in the box. So thank you guys for checking out today's crappie fishing episode. If you want to get any of the baits that we were using, make sure to go to googiesquad.com, use my promo code LFG and save 10% on everything at checkout. Hope your rods are staying bent, fishing freaks and I will see you on the next one. Yeah, there's a big one right here. You got big hairy floaters down there? I'm just checking out your hawkas. So when did you decide I'm a hawka kind of guy? These are like the on power rods or whatever. Power rods? When you start getting old you just wear big funky tennis shoes. It's part of life. You know, main rod will eventually just be wearing like velcro straps.


Gunmen on Friday night killed two members of the all-progressive Congress APC in Buma, Kwataakwa community, Izilokul government area of Eboni state. Eyewitnesses told journalists on Saturday that the gunman stomped the venue of an APC meeting in the area on a motorcycle and open fire on people at the gathering. Two others who sustained injuries in the attack are receiving treatment in a hospital in Abakleke. An incident came just one month after three people died in a clash between supporters of APC chieftains in the state.