Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
CODE PROJECT For Those Who Code
  • Home
  • Articles
  • FAQ
Community
M

Member_14660942

@Member_14660942
About
Posts
3
Topics
0
Shares
0
Groups
0
Followers
0
Following
0

Posts

Recent Best Controversial

  • Sooo, how can I start learning about OSs
    M Member_14660942

    Go for books by

    Andrew S Tanenbaum

    It is *the* book on this subject. I cannot praise it enough. This guy wanted his students to learn this subject so bad that he wrote an operating system from scratch (Minix, the actual birthplace of Linux).

    The Lounge question learning

  • Very smart pointers
    M Member_14660942

    You can do a test with a circular reference. A => B => C => A So, if I have an initial pointer to A object, because of the construct, it is going to have a count of 2 (because of C). The need for the Garbage Collector is that if you remove the initial pointer to A (either in the Stack or Heap), A's reference count only decreases to 1, and because of C it never goes to 0. Is your code prepared to deal with that? The problem here with reference counting is that one above; it doesn't count how many "access paths" you have to an object, just the number of references you have to it.

    Algorithms c++ swift com algorithms data-structures

  • Help with allocation algorithm
    M Member_14660942

    1 - I would make people prioritize the records they want - only 1 number, let's say, from 1 to 100. 2 - They would then choose the records they want, in the rank they want. Not allowed to repeat numbers. With that information, I would assign a priority value for each ranking, the higher the priority (1 is highest), the higher this number is. The balancing of these values is going to be a big part on your "justice". I would do a cumulative priority number, and upon collision, the person that asked first for the record would get it. Let's review this, in a slower way: Let's say you use 1 => 400, 2 => 200, 3 => 100, 4 => 80, 5 => 70, 6 => 60 Now we have the first choice round. Everyone gets 400 priority points. Let's say 5 people. But there is a collision. 2 people chose MC Hammer record. The one that asked for it before is going to get it. The other one... well, tough luck. Now, we have the second choice round. Everyone gets 200 priority points. But, the "un-hamnmered" guy now has 600 priority points. Whatever he chose for choice 2, if available, is going to get picked. After that, everyone else can get their choice of number 2, if available. Just repeat until no more records. This should be a fairly fair system - everyone is probably going to be equally pissed... lol... You are seriously underestimating human beings' capacity for being petty - I hope all goes well, but I really think you're going to have some headache.

    Algorithms question database algorithms help tutorial
  • Login

  • Don't have an account? Register

  • Login or register to search.
  • First post
    Last post
0
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups