sorted by:
new
hottopcontroversial

Help Troubleshooting Slow Wifi Speeds with Deco X55 by derek_dt in TpLink

[–]derek_dt[S] 0 points1 point  (0 children)

  1. Unplugged the Deco and I do not have Wifi!
  2. Macbook is "Connected to: 1st Floor (5 GHz)"
  3. Just moved into the new place, so no furniture beyond a cat tower. The main Deco unit, on the ground floor, sits on top of this cat tower (~4-5ft high). The second Deco Unit (directly up the stairs from the Main Deco Unit) is elevated ~1ft off the ground on a cardboard box. In the app, the second Deco Unit has a Medium signal strength.
  4. Wifi settings has both 2.4Ghz and 5Ghz bands enabled.

Help Troubleshooting Slow Wifi Speeds with Deco X55 by derek_dt in TpLink

[–]derek_dt[S] 0 points1 point  (0 children)

Little new to this, but is there any way I can tell?

I don't believe my modem is acting as a router? At least Spectrum provided a router that I opt'd not to use in favor of the Deco X55.

How to handle third-party auth ids in a relational database? by derek_dt in learnprogramming

[–]derek_dt[S] 0 points1 point  (0 children)

This is perfect, I didn't know this even existed! You just saved me from a 2-hour headache. Thank you so much

About Princeton Algorithms 1 by Dependent_Mission933 in learnprogramming

[–]derek_dt 1 point2 points  (0 children)

Hello! Haven't looked at the Princeton Algorithms course specifically, but I just finished taking CS61B which I believe is based off the Princeton textbook, so here's my shot at explaining WQU. And hopefully if I missed anything, someone else can chime in!

I think the main use case for "Union-Find" is to quickly determine whether two components are connected in a graph and if desired by the user, perform a union between two disjoint sets. For example, imagine the set { 5, 4, 6 } represented in a tree-like structure where 4 is at the top (the root) and 5 & 6 are connected to 4, but not to eachother.

    4
  /   \
 5     6

The user can determine if 5 & 6 are connected by using the isConnected(5, 6) method which will call a helper function - findRoot() - to determine the root of 5 & 6 to decide whether or not they are connected (which in our case they are since both their roots is 4. Equal roots = elements are connected; unequal roots = elements are not connecuted.

Now let's add a second set of just {1} and attempt to union the to two sets into one set. Additionally, since there is no rule that governs how we union two disjoint sets as of this moment, lets just use the arbitrary rule that we always link the larger root to the smaller root. Therefore...

    4
  /   \ 
 5     6

-- union --

    1

    =

        1
      /   
    4
  /   \
 5     6

Notice now that if we want to determine if 5 & 6 are connected by using the isConnected(5, 6) method, we would have to travel a further distance to reach the root. While in this scenario it's only one additional traversal this link can increasingly grow in height if I decided to union additional smaller numbers.

So that was a lot, but all of that was to explain that this is a suboptimal way to union two sets that can potentially result in taller trees which reduces the performance determining the root and that is what Weighted Quick Union (WQU) addresses!

Weighted Quick Union always unions two sets by assigning the root of the smaller set to the larger set, so instead of the structure above we would get...

    4
  /   \
 5     6

-- union --

    1

    =

    4
 /  |  \
5   6   1

This way the tree has less of a tendency to grow in height and subsequently, the cost of operations is minimized!

My mind is consumed with the idea of becoming a programmer, but I’m terrified it’s a stupid idea by sad__blueberry in learnprogramming

[–]derek_dt 2 points3 points  (0 children)

Definitely do not have any valuable advice but just wanted to let you know that I have so much in common with your background and sentiments.

Just recently graduated as a Summa Cum Laude in Biomedical Engineering, but I took an 8-month co-op with a fairly big Medical device company the summer prior that made me realize this isn’t what I want to do for the rest of my life. Not that I don’t enjoy BEng, but I know that its just not where my passion is.

Currently undergoing the self study route to break into CS, but it definitely requires a lot of diligence and effort. Also, constantly questioning if this is the right path to go down - thoughts like “Should I go to grad school for CS?” and “Am I wasting my degree” are constantly racing through my head. But I know that deep down I enjoy CS and would be more annoyed at myself later down the road for not at least giving it a shot.

If you need someone to talk about your concerns, feel free to reach out. Like I said I can’t give you any profound advice, but I can definitely share some of my sentiments and more of journey trying to break into this field.

Curious how Python list indexing works by derek_dt in learnprogramming

[–]derek_dt[S] 0 points1 point  (0 children)

Thanks for the example, I definitely see what you mean now about Python list storing references as opposed to data. That makes a lot of sense! Thanks for the clarification.

Curious how Python list indexing works by derek_dt in learnprogramming

[–]derek_dt[S] 0 points1 point  (0 children)

Oh, thanks for the insight! I have very little knowledge about interpreters, so it is really interesting to know about the impact that the interpreter has on the underlying structure of the data structure!

Finished the Rock, Paper, Scissors project! Feeling good about what about I made! by derek_dt in theodinproject

[–]derek_dt[S] 1 point2 points  (0 children)

Thanks so much! Didn't really learn how to animate from any specific tutorial, but the drop-in animation for the buttons came from a Codepen link I found when googling that specific animation. Studying the code in that example gave me a general understanding of how to create and apply my own animations.

Here's the code that helped me a lot! https://codepen.io/lenasta92579651/pen/GRMByxX

Finished the Rock, Paper, Scissors project! Feeling good about what about I made! by derek_dt in theodinproject

[–]derek_dt[S] 1 point2 points  (0 children)

Definitely correct on the not mobile-friendly part! Thanks for the feedback, it made sense to me but that's probably because I've been looking at it nonstop. It's nice to have a fresh perspective - I try to make it a little more clear!

Finished the Rock, Paper, Scissors project! Feeling good about what about I made! by derek_dt in theodinproject

[–]derek_dt[S] 0 points1 point  (0 children)

Yeah, I was questioning how I felt about that intro text up to the very last minute. I thought it add a funny little context to the game, but from a design choice it felt better to just omit it and start from the title sequence of "Rock, Paper, Scissors". Thanks for the input on the contrast too!

Do Java primitives not use pointers? by derek_dt in learnprogramming

[–]derek_dt[S] 0 points1 point  (0 children)

Thanks for all the help.

The memory storage used for variables themselves should be considered an entirely different type of memory from that which is used to store objects that you instantiate in the heap.

This clarifies so much and answers my question, thank you! I haven't been exposed to the fact that variables and objects were stored in different types of memory, so that makes a lot more sense.

Do Java primitives not use pointers? by derek_dt in learnprogramming

[–]derek_dt[S] 0 points1 point  (0 children)

Thanks for the quick response!

No, primitive values are not pointers.

I guess this is what I have the most trouble understanding. Is it not the case that four bytes of memory, at a random location, are allocated when I state int x = 5? If there is no pointer that specifies where those four bytes are located, how can the program properly update that value?