Slashdot Mirror

← Back to Stories (view on slashdot.org)

Advanced Data Structures?

Posted by ryuzaki0 on from the mix-and-match-your-scalars-lists-and-hashes dept.

mdf356 asks: "It's been 5 years since I left graduate school and started designing and writing software for a living. After 5 years of writing operating systems code, I feel like I've forgotten some of the more advanced data structures I used to know. The next time an interesting problem arises, I'd like to have more in my toolbox than hashes, linked lists, heaps and various binary and n-way trees. I'd like something short and sweet, more in the line of the standard C book. Algorithm Design by Kleinberg and Tardos looks likely to be too basic, but I haven't read it (I'd like to avoid paying $90 for something that won't meet my needs). CLR is far too large and almost exclusively covers basic territory. Tarjan's Data Structures book looks like it has potential, but seems focused on network algorithms, which are unlikely to be applicable to the kernel programming I do. What are some good reference books on more advanced data structures and algorithms, particularly ones with potential applicability to an operating systems kernel?"

3 of 118 comments (clear)

  1. Link lists? by tedgyz · · Score: 3, Funny

    You use linked lists in your kernel?!?

    --
    "No matter where you go, there you are." -- Buckaroo Banzai
    1. Re:Link lists? by jack_csk · · Score: 2, Funny

      Why are you surprised? He just forgot to tell you that he's working in Redmond, WA.

  2. Re:dude by mschaef · · Score: 2, Funny

    "you just made yourself look like an ass."

    Dude, I was arguing on Slashdot about the number and proper usage of data types in Lisp, of all things... I think looking like an ass was pretty much a part of the deal from the get go.