1
General Discussion / Re: Fixing a Pioneer Elite Pro 200 RPTV
« on: June 11, 2009, 05:36:20 pm »
Capacitors will only blow once, the "Zap" sound is going to be electricity arc'ing off the transformer.
So the widespread use of emojis these days kinda makes forum smileys pointless, yeah?
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
It definitely is going to be one of the more enjoyable classes I'm taking this semester, but I'm really looking forward to "Random Network Algorithms" in Spring '10.We see some basic data structures in the Intro. Software Engineering Class, basically, stacks/queues in STL, then we take an entire class on Algo and Data Structures which is the most overly difficult class I have ever taken, and this is the graduate level continuation of it.
Ah, cool. I took a graduate level algorithms course last semester. It was definitely one of the more fun classes I've taken.
I think my favorite things out of that class were van Emde Boas trees and Splay/Linking&Cutting trees. You'll have to let me know if you guys do either of those. VEB trees are especially 'fun' to talk about, haha.
We see some basic data structures in the Intro. Software Engineering Class, basically, stacks/queues in STL, then we take an entire class on Algo and Data Structures which is the most overly difficult class I have ever taken, and this is the graduate level continuation of it.Yes it is, and I don't have a full syllabus but the course description is:QuoteReview of basic data structures and Java syntax. Data abstraction and object-oriented design in the context of high-level languages and databases. Design implementation from the perspective of data structure efficiency and distributed control. Tailoring priority queues, balanced search trees, and graph algorithms to real-world problems, such as network routing, database management, and transaction processing.
Description is pretty much what I meant. Looks pretty interesting. Is this a graduate course? I assume you guys have seen priority queues, BSTs, network flow, etc. before and this is a more rigorous continuation or something?
Review of basic data structures and Java syntax. Data abstraction and object-oriented design in the context of high-level languages and databases. Design implementation from the perspective of data structure efficiency and distributed control. Tailoring priority queues, balanced search trees, and graph algorithms to real-world problems, such as network routing, database management, and transaction processing.
It's more like laugh at the 95% of the class that doesn't have a clue as to how to implement an atomic lock, but what I am doing here is the extra credit part of the assignment, and I was right it's not entirely possible to do it like he stated without having mutexs instead of the lock, so know I get to implement the whole thread blocking/queueing/signaling by hand.Yeah, same. It's to learn how the stuff works, not how to use things properly. It's the same as the old "implement a bubble sort" thing.Why in the world are you using a spin lock here? I sure hope lock contention is low or the critical section is trivial.I would guess it's for school. (I had much worse assignments in my operating systems class).