Model: 2022 ROG Zephyrus G14 CPU: AMD Ryzen 9 6900HS RAM: 16GB dGPU: AMD Radeon RX 6700S Storage: 1TB OS: Windows/Fedora Dual Boot + Ubuntu, Debian, Kali in WSL2 February 2024 Update: As of January 2024, I, along with many other G14 users, started to experience seemingly random BSODs while using the device on battery. I’ve tried every software solution I can think of, and others have sent in their devices under RMA, yet it appears that no one has had the issue resolved....
After using an iPad for remote development for CS136 via the browser, and hearing that CS246 assignments were encouraged to be done on the school server via SSH, I decided that I would try my hand at contining to program off of my iPad (while I wasn’t in my dorm, nothing quite beats a dedicated setup). Options Ultimately, all I needed was a method to SSH into the school server. After doing some googling, I found myself with three options:...
Model: 3rd Gen M1 iPad Pro (11 inch) Storage: 128 GB
It has come to my attention that a method that I use to study is uncommon and apparently strange. As such, I have decided to record it here in the hopes that someone might find it useful. The method involves memorizing the outlines of text written in my notes. By crossing my eyes slightly, I am forced to view my notes as messy graphite blobs. By memorizing the general shapes and sizes of these blobs, I find it easier to recall information during tests....
MTHEL 99 is a math “refresher” course that is provided to undergraduate students during the summber before 1A at the University of Waterloo. The course content covers all knowledge that a student should know before beginning any math courses at Waterloo. Topics covered include: Inequalities and Absolute Values, Radicals and Rational Expression, Trigonometry, Exponential and Logarithmic Functions, Polynomials, and Introductory Calculus. Each topic has a corresponding assessment that must be completed with a minimum of 75%, and a combined average of 85% in order to receive a pass....
Model: iPhone X Storage: 64GB
Model: Dell Optiplex 360 CPU: Pentium 35200 RAM: 4GB DDR3 Storage: 256GB OS: Ubuntu Server
pred[1...n] = [null, null, ..., null] state[1...n] = [unseen, unseen, ..., unseen] dist[1...n] = [infty, infty, ..., infty] def BFS(V[1..n], adjlist[1..n], start: # Initialize stuff for the start q = new queue state[start] = seen dist[start] = 0 q.enqueue(start) # Do the actual BFS while q is not empty: u = q.dequeue() for v in adjlist[u]: if state[v] == unseen: pred[v] = u state[v] = seen dist[v] = dist[u] + 1 q....
pred[1...n] = [null, null, ..., null] state[1...n] = [unseen, unseen, ..., unseen] disc[1...n] = [0, 0, ..., 0] fin[1...n] = [0, 0, ..., 0] time = 0 def FullDFS(adjlist[1...n]): for v in 1..m: if state[v] == unseen: DFS(adjlist, v) def DFS(adjlist[1..n], v): # Update time and set discover time state[v] = seen time = time + 1 disc[v] = time # Process everything else for each w in adjlist[v]: if state[w] == unseen: pred[w] = v DFS(adjlist, w) # Update time and set finishing time state[v] = complete time = time + 1 fin[v] = time
UW - Courses and Degree UW - Other