Skip to content
HomeVideosBooks
AllTopicsTrends
BlogsPodcasts
HistoryListsWatch laterLiked videosFollowing

The videos, books, blogs and podcasts Hacker News keeps recommending, all in one place.

VideosBooksBlogsPodcastsAboutPrivacySettings

Data from Hacker News, HackerTube, HackerBooks, HackerBlogs and Open Library. Credits · Not affiliated with Y Combinator.

HomeVideosBooksBlogsPodcasts
Ctrl K
    Cover of Data structure techniques

    Data structure techniques

    Thomas A. Standish · 1980

    Computer Science
    Open LibraryAmazon
    Stats for nerds
    2recommend
    3mentions
    2people
    2019–2022years
    100% recommend

    Mentions per year

    2019202020212022

    What Hacker News says

    1. vgivanovicNov 2022
      I taught (ahem) data structures and algorithms from a book I really liked (T. Standish, Data Structure Techniques, 1980) which emphasized the mathematical aspects of the subject. (It's still available on Amazon for the bargain price of $6.40.) My students hated it. I told them that it can't be read like a novel; that every line has to be studied and understood, individually, in order. I failed as a teacher, either because they didn't follow my advice, or it was the wrong advice. My suspicion was that Standish's approach required too much effort; that the reward was not instantaneous.

      I was taught high school "new math" from an English (O-level?) text that started with sets and was not divided into algebra, trig, geometry, etc. but provided an integrated approach that covered topics as they naturally arose. My teacher (Eric Turner, now deceased, so I was unable to let him know how much he affected my life) probably had much to do with it. He also taught physics, so perhaps he really understood both the abstract and the practical.

      I have two only complaints about my mathematics education: the knowledge of how to construct and deconstruct proofs, and no statistics (too much calculus).

      My kids, 17 and 15, don't grok mathematics the way I think they should. Tis a pity since underneath it all is mathematics.

      By the way, there are some really excellent mathematics video channels on YouTube: 3 Blue 1 Brown comes to mind.

      thread
    2. rramadassNov 2021
      There are literally hundreds of threads with this topic on the Web. Most of them contain the same standard references which IMO are not always the best for people without much mathematical maturity and wishing to learn from first principles. That said, here are my recommendations for them (pdfs of almost all are available online and they can also be purchased cheaply as used books);

      * 1) Functions and Graphs and 2) The Method of Coordinates by I.M.Gelfand et. al. - These give you the basics on functions and how to visualize them which is crucial for understanding.

      * Introductory Logic and Sets for Computer Scientists by Nimal Nissanke - Nice succinct introduction to various required topics for Comp. Sci.

      * Compared To What?: Introduction to the Analysis of Algorithms by Gregory Rawlins - This is a classic book which takes you by hand and walks you through Algorithm Analysis and the reqd. mathematics. You will find this more approachable than most other text books and well worth a study.

      * How to Think about Algorithms by Jeff Edmonds - Practical techniques without too much mathematical formalism.

      * Data Structure Techniques by Thomas Standish - A Classic text; good adjunct to more modern texts.

      * Advanced Data Structures by Peter Brass - Nice succinct text but not necessarily "advanced".

      One final point; try to get a Algorithms and Data Structures book with code in the language with which you are most familiar. That way you understand the mapping from "Abstract Algorithm" to "Concrete Language Implementation" which is not always trivial.

      thread
    3. rramadassNov 2019
      Surprisingly there is no one book AFAIK but techniques are spread across many books;

      The first thing is to understand FSMs and State Transition Tables using a simple two-dimensional array. Implementing a FSM using a while/ifthenelse code vs. Transition table dispatch will really drive home the idea behind data-driven programming. There is a nice explanation in Expert C Programming: Deep C secrets.

      SICP has a detailed chapter on data-driven programming.

      An old text by Standish; Data Structure Techniques.

      Also i remember seeing a lot of neat table based data-driven code in old Data Processing books using COBOL. Unfortunately i can't remember their names now. Just browse some of the old COBOL books in the library.

      thread

    Related

    Cover of Advanced data structures
    2016–2021

    Advanced data structures

    Peter Brass
    3 recommend · 4
    Cover of Compiler construction for digital computers
    2015–2026

    Compiler construction for digital computers

    David Gries
    1 recommend · 7
    Cover of Network Algorithmics,
    2008–2021

    Network Algorithmics,

    George Varghese
    8 recommend · 11
    Cover of Structured Computer Organization
    2008–2024

    Structured Computer Organization

    Andrew S. Tanenbaum
    21 recommend · 34
    Cover of Understanding Computation
    2013–2026

    Understanding Computation

    Tom Stuart
    13 recommend · 26
    Cover of Algorithms + data structures=programs
    2007–2026

    Algorithms + data structures=programs

    Niklaus Wirth
    35 recommend · 81
    Cover of Algorithms in C++
    2009–2025

    Algorithms in C++

    Robert Sedgewick
    27 recommend · 45
    Cover of Algorithms
    2007–2026

    Algorithms

    Robert Sedgewick
    50 recommend · 100