thomasave

Hello everyone, I recently built a new desktop computer, which I mostly use for software development. It contains a Ryzen 7 2700X, a Gigabyte Aorus X470 Ultra Gaming motherboard and 16 GB Corsair Vengeance LPX CMK16GX4M2B3200C16 RAM. When compiling on 16 threads, this amount of ram does not seem to be enough, so I'm thinking about adding two more DIMMs of the same memory to the system. I heard however that Ryzen can be a bit picky with memory and that is is generally better to only use 2 DIMMs if you want to have the maximal performance. What impact can I expect if I add these 2 extra DIMMs? Will I be able to still use them at 3200 Mhz? Thanks in advance

It's a Cooler Master GX 650 W PC Power Unit. Would this be fine?

Since most of you recommend the Ryzen 5 1600, this becomes the updated list: MSI GeForce GTX 1070 AERO 8G OC €413 AMD Ryzen 5 1600 Boxed Wraith Spire Cooler €224.95 Asus PRIME B350-PLUS €97,95 Corsair Vengeance LPX CMK16GX4M2B3000C15 (16GB) €127 Samsung 960 EVO 250GB €125.90 Cooler Master Hyper 212 EVO €29.95 Asus VG248QE Black (1080p 144hz) €265 With a total of €1283.75 If I were to upgrade something in this list, what would you recommend?

Thanks all for the quick replies! I don't really have a preference for AMD or Intel. I always heard clock speed is more important than core count, so why is the Ryzen 5 better? Just curious. About the PSU, I'm not really sure which model, I'll ask him.

Hi everyone, A friend asked me to build a gaming PC for him in the price range of €1000-€1500. As you can see, the prices are in euro since I live in Belgium. Being a programmer myself and not having a lot of gaming experience, I would like to know if this build makes sense for gaming. This is also my first ever complete build, so other advise is more than welcome too. He already has a 1TB HDD, 650W power supply and a case from his 5 year old PC I think I can reuse. Are these things still compatible with current hardware? These are the things I'm thinking of buying: MSI GeForce GTX 1070 AERO 8G OC €413 Intel® Core i5-7600K €253 Asus Z170 PRO GAMING €145 Corsair Vengeance LPX CMK16GX4M2B3000C15 (16GB) €127 Samsung 960 EVO 250GB €125.90 Cooler Master Hyper 212 EVO €29.95 Asus VG248QE Black (1080p 144hz) €265 Current total: €1358.85

The new Razor blade stealth. I'd use it for taking with me to university and programming.

I used to use Spotify so that I wouldn't use that much data while on my mobile plan. But I recently made myself an app, which sends a request to my server to download a YouTube video, strip the audio and send that to my phone. Now I have an easy way of downloading songs, can listen to video's with my phone in my pocket and save €9.99 a month.

Then I have no idea, and I really have to start working on a MIPS assembly program for a deadline this evening. I hope you find your answer, please let me know if you do.

Is it part of the assignment that the fallback font is of a different generic-family? (e.g. serif, sans-serif) I'm looking for examples of it on the internet myself, and I never see that being done.

Ah, okay, learned something new today, thanks! Which is kind of the opposite of what we're trying to accomplish, which is that you solve your problem.

There's a lot wrong with it: You want the same font to be both serif and sans-serif, which is a contradiction, and you are specifying two different fonts at the same time (Times and Verdana).

I'm in my first year studying informatics, so I made a bunch of small programs in the last few months. Some for school, some for my own pleasure. Here you can find two of the latter in Python(3): a solution to the Tower of Hanoi and the 8 Queens Problem respectively. #!/usr/bin/env python3class Disk: def __init__(self,size=0): self.size = size def __gt__(self,other): if self.size > other.size: return True else: return False class Tower: def __init__(self,maxsize=8): self.disks = [] self.maxsize = maxsize def push(self,disk): if self.getLength() != 0: if self[-1] > disk: self.disks.append(disk) else: raise Exception("Oepsie!",self.disks[-1].size,disk.size) else: self.disks.append(disk) def getLength(self): return len(self.disks) def pop(self): return self.disks.pop() def __getitem__(self,index): return self.disks[index] def __str__(self): result = " " * (self.maxsize-1) + "|" + " " *(self.maxsize-1) + "\n" for i in reversed(range(self.maxsize)): if self.getLength() <= i: result += " " * (self.maxsize-1) + "|" + " " *(self.maxsize-1) + "\n" else: result += " " * (self.maxsize-self.disks[i].size) + "="*(2*self.disks[i].size-1) + " " * (self.maxsize-self.disks[i].size) + "\n" return result class Hanoi: def __init__(self,n=8): self.tower1 = Tower(n) self.tower2 = Tower(n) self.tower3 = Tower(n) self.steps = 0 for i in reversed(range(self.tower1.maxsize)): self.tower1.push(Disk(i+1)) def _solve(self,source, helper, target,n): if n > 0: self._solve(source, target, helper,n-1) if source: target.push(source.pop()) self.steps += 1 print("Step: {}".format(self.steps)+"\n") print(self) self._solve(helper, source, target,n-1) def solve(self): print(self) self._solve(self.tower1,self.tower2,self.tower3,self.tower1.maxsize) def __str__(self): result = "" result1 = str(self.tower1).split("\n") result2 = str(self.tower2).split("\n") result3 = str(self.tower3).split("\n") for i in range(len(result1)): result += result1[i] + " " + result2[i] + " " + result3[i] + "\n" return resulthanoi = Hanoi(8)hanoi.solve() class EightQueensProblem: def __init__(self,n=8): self.size = n self.axis = [] for i in range(n): self.axis.append([]) for p in range(n): self.axis[i].append(0) def __str__(self): result = " "+'\033[4m'+" " for number in range(len(self.axis[0])): result += "{} ".format(number) result += '\033[0m' + "\n" for row in range(len(self.axis)): result += "{}| ".format(row) for column in self.axis[row]: result += "{} ".format(column) result += "\n" return result def _getRow(self,row): return self.axis[row] def _getColumn(self,column): result = [] for row in self.axis: result.append(row[column]) return result def _getDiagonalLeft(self,row,column): result = [] while row != 0 and column !=0: row -=1 column -=1 for i in range(self.size - column - row): result.append(self.axis[row][column]) row += 1 column +=1 return result def _getDiagonalRight(self,row,column): result = [] while row != self.size-1 and column !=0: row +=1 column -=1 for i in range(self.size - column): result.append(self.axis[row][column]) row -= 1 column +=1 return result def _isPosible(self,row,column): if sum(self._getRow(row)) != 0 or sum(self._getColumn(column)) != 0 or sum(self._getDiagonalLeft(row, column)) != 0 or sum(self._getDiagonalRight(row, column)) != 0: return False else: return True def solve(self,column = 0,verbose=False): if column < self.size: for row in range(len(self._getColumn(column))): if self._isPosible(row, column): self.axis[row][column] = 1 result = self.solve(column+1) if not result: self.axis[row][column] = 0 continue else: continue if sum(self._getColumn(column)) != 1: return False elif column != 0: return True elif verbose == True: print(self) else: return True problem = EightQueensProblem()problem.solve(0,True)