Lecture 6/3: Lecture 25 Q&A
Lecture 25 Questions and Answers (Exported from Zoom Q&A log)
Q: will there be class next week?
A1: Yes, a chance to wrap up course themes, look to future, etc
Q: I think there may have been a bit of confusion about the Zoom link. Was it changed because of the new password requirement?
A1: Weâve had a password-protected Zoom link all quarter long so I donât believe we had to change ours. Did you have issues joining today?
Q: Why do we catalog pairs of frequencies instead of just a frequency at a certain time?
A1:
Q: so when we hear a new song, we compare to a hashtabe with all the possible songs ?
A1: The hash works like a âfingerprintâ where you go to the table to find a song that has that same fingerprint
Q: Oh hm I had the link copied in my notes that Iâve used all quarter and it prompted me to enter a password today which hadnât happened before. But the one on the Zoom info page worked without prompting for the password.
A1: Got it yeah I think the one on the Zoom info page has the password embedded in it, so just make sure to use that ine in the future!
Q: Thanks for that!
A1: Youâre welcome, hope itâs useful
Q: will there be office hours next week? :)
A1: Yes, Lair open Sun-Tue and Chris, Nick, my office hours through Wed
Q: Logistic questions: Included assignment 7, did we do all the assignments that are given in a normal quarter?
A1: Sometimes there is an 8th assignment, depending on length of quarter, pause for exams, etc. but most commonly it looks like what we did this quarter
Q: Will we get assignment7 feedback from SL if we turn in before Wed?
A1: You will get functionality feedback, but not style.
Q: neat!!!
A1:
Q: are the three stanford hops random computers?
A1: Those are our gateway computers I believe
Q: wait woah. this is really cool! and so the part before the ip address is that a server that is located on prem at that university? or not necessarily on prem but is what that university is paying for
A1: I know that subnet 171.6x.x.x is Stanford domain. We used to have a class A long ago, all ip address 36.x.x.x. but traded it in when the internet went viral :-)
Q: So cool! Good to know. will ask more questions later in your OH. thx!
A1: See you there!
Q: is there a way to intercept as the signal goes through other computers?
A1: There are tools called âpacket sniffersâ that can eavesdrop
A2: For that reason, most protocols pass data in encrypted format
Q: so are trees graphs?
A1: yes, graph is more general, tree is special case of graphs
Q: any relation between the naming of âgraphsâ and traditional graphs you might see in math with an x/y plane?
A1: Not that I know of.
Q: are neural networks based on weighted graphs?
A1: yes, they are! good observation
Q: in terms of graph traversal, could we use a hashset/set to store graph nodes and thus once we have all of them, we know we've traversed it all?
A1: Yes, tracking visited set could do it. You might also use a boolean âvisitedâ flag stored per-node
Q: does âweighting the edgesâ just mean that the edges contain some sort of information
A1: Yes, some kind of âweightâ field that allows to compare two options to decide which is better/cheaper/more optimal
Q: Does Chris ever teach E40?
A1: The closest us CS folks get to horning in on the EE goodness is teaching classes like CS107E check it out!
Q: will graphs be more emphasized in cs107?
A1: No, but it comes up in CS103, CS161, CS166, CS168 âŠ
Q: are graphs anything like the labyrinth we had to solve for the last pset?
A1: Yes! Thatâs another great example of a graph
Q: Will Julie or Chris be teaching cs107 in the fall? P.S great jobn guys, Iâve enjoyed the course
A1: Current schedule has us coteaching 106B in fall. Nick Troccoli has 107 and will be fabulous! I think I have 107E in winter!
Q: If you âblockâ someone on Facebook would that kind of like create an unconnected graph?
A1: it would tear down the direct edge from you to your enemy, but there may still be a path in the graph that connects you two
Q: There's a game where you try to get from one page of Wikipedia to another in the fewest number of clicks
A1: I spend way too much time playing that gameâŠ
Q: so basicgraph is directed by default?
A1: Yes
Q: Does BasicGraph have a struct for Edges, like how we've made a struct for Nodes?
A1: Yes, it does
Q: How does A* go straight to the red box?
A1: It stores the partial paths in a priority queue and uses an estimate of the remaining distance from path end to goal as part of the wieght, so it focuses on paths that quickly get to goal, rather than the totally radial breadth-first-search
Q: does the search algorithm matter whether we have a âperfectâ maze/path?
A1: live answered
Q: does the search algorithm matter whether we have a âperfectâ maze/path?
A1: live answered
Q: What is the difference of BFS and Dijkstra if we use the example graph in p21?
A1: live answered
Q: thanks!
A1: live answered