Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming > #6339 > unrolled thread

whats good to read on programming

Back to article view | Back to comp.programming

Contents

  whats good to read on programming fir <profesor.fir@gmail.com> - 2016-03-12 08:58 -0800
    Re: whats good to read on programming Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-03-12 19:15 +0000
      Re: whats good to read on programming fir <profesor.fir@gmail.com> - 2016-03-12 11:36 -0800
        Re: whats good to read on programming Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-03-12 19:59 +0000
          Re: whats good to read on programming fir <profesor.fir@gmail.com> - 2016-03-12 12:07 -0800
            Re: whats good to read on programming fir <profesor.fir@gmail.com> - 2016-03-12 12:19 -0800
              Re: whats good to read on programming Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-03-12 20:26 +0000
                Re: whats good to read on programming fir <profesor.fir@gmail.com> - 2016-03-12 12:32 -0800
            Re: whats good to read on programming Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-03-12 20:23 +0000
      Re: whats good to read on programming Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-03-12 20:05 +0000
        Re: whats good to read on programming fir <profesor.fir@gmail.com> - 2016-03-12 12:13 -0800
        Re: whats good to read on programming fir <profesor.fir@gmail.com> - 2016-03-12 12:29 -0800
        Re: whats good to read on programming Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-03-12 22:06 +0000
          Re: whats good to read on programming fir <profesor.fir@gmail.com> - 2016-03-12 15:56 -0800
      Re: whats good to read on programming Kaz Kylheku <330-706-9395@kylheku.com> - 2016-03-13 02:08 +0000
        Re: whats good to read on programming fir <profesor.fir@gmail.com> - 2016-03-13 00:10 -0800
          Re: whats good to read on programming fir <profesor.fir@gmail.com> - 2016-03-13 00:19 -0800
      Re: whats good to read on programming "Osmium" <r124c4u102@comcast.net> - 2016-03-13 11:24 -0600
        Re: whats good to read on programming Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-03-13 23:51 +0000
    Re: whats good to read on programming Mark Carroll <mtbc@bcs.org> - 2016-03-12 19:45 +0000
      Re: whats good to read on programming fir <profesor.fir@gmail.com> - 2016-03-12 11:57 -0800
      Re: whats good to read on programming fir <profesor.fir@gmail.com> - 2016-03-12 11:59 -0800
      Re: whats good to read on programming Robert Wessel <robertwessel2@yahoo.com> - 2016-03-12 14:35 -0600
    Re: whats good to read on programming Randy Howard <rhoward.mx@EverybodyUsesIt.com> - 2016-03-12 14:35 -0600
    Re: whats good to read on programming Jacob Sparre Andersen <sparre@nbi.dk> - 2016-03-13 15:47 +0100

Page 1 of 2  [1] 2  Next page →

#6339 — whats good to read on programming

I got few days of time and would like to read 
something that could improve my skills/knowledge
on something worthy /interesting/shining

Some ideas/links maybe?

(ewentualli we could discuss it)

[toc] | [next] | [standalone]

#6342

fir <profesor.fir@gmail.com> writes:

> I got few days of time and would like to read 
> something that could improve my skills/knowledge
> on something worthy /interesting/shining
>
> Some ideas/links maybe?

These may seem a bit dated since I read them quite some time ago, but I
think my favourite books on programming are the pair of collected CACM
columns by Jon Bentely: "Programming Pearls" and "More Programming
Pearls".  I see there is a new edition of the first with new
material...

-- 
Ben.

[toc] | [prev] | [next] | [standalone]

#6343

W dniu sobota, 12 marca 2016 20:15:30 UTC+1 użytkownik Ben Bacarisse napisał:
> fir <profesor.fir@gmail.com> writes:
> 
> > I got few days of time and would like to read 
> > something that could improve my skills/knowledge
> > on something worthy /interesting/shining
> >
> > Some ideas/links maybe?
> 
> These may seem a bit dated since I read them quite some time ago, but I
> think my favourite books on programming are the pair of collected CACM
> columns by Jon Bentely: "Programming Pearls" and "More Programming
> Pearls".  I see there is a new edition of the first with new
> material...
> 
> -- 
> Ben.

well indeed this seems good compact style writting - i readed the first piece on counting words

links here
https://tfetimes.com/wp-content/uploads/2015/04/ProgrammingPearls2nd.pdf

can somebody explain me - is this hashing in c version perfect one? i mean it counts with no mistakes? if so why? (i know the idea of hashing but its inperfection always keeps me away - is there reliable way of perfect hashing on cases like that?

[toc] | [prev] | [next] | [standalone]

#6349

fir <profesor.fir@gmail.com> writes:

> W dniu sobota, 12 marca 2016 20:15:30 UTC+1 użytkownik Ben Bacarisse napisał:
<snip>
>> These may seem a bit dated since I read them quite some time ago, but I
>> think my favourite books on programming are the pair of collected CACM
>> columns by Jon Bentely: "Programming Pearls" and "More Programming
>> Pearls".  I see there is a new edition of the first with new
>> material...
>
> well indeed this seems good compact style writting - i readed the
> first piece on counting words
>
> links here
> https://tfetimes.com/wp-content/uploads/2015/04/ProgrammingPearls2nd.pdf
>
> can somebody explain me - is this hashing in c version perfect one? i
> mean it counts with no mistakes? if so why?

The program in the book makes no mistakes because the table does not
rely only on the hash function.

> (i know the idea of
> hashing but its inperfection always keeps me away - is there reliable
> way of perfect hashing on cases like that?

Perfect hashing is a technical term for something rarely seen.  When you
want to do a lot of lookups from a fixed set of keys very fast, you can
construct a function that maps the set of n keys to the numbers 0 to n-1
in such a way that every key maps to a distinct number (i.e. the
function is a bijection).  This is called a perfect hash function.

Normal hashing works by handling the collisions, so the case where two
keys hash to the same value does not produce an error.  There are many
ways to do this.  The Bentley book uses a linked list, I think.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]

#6351

W dniu sobota, 12 marca 2016 20:59:34 UTC+1 użytkownik Ben Bacarisse napisał:
> fir <profesor.fir@gmail.com> writes:
> 
> > W dniu sobota, 12 marca 2016 20:15:30 UTC+1 użytkownik Ben Bacarisse napisał:
> <snip>
> >> These may seem a bit dated since I read them quite some time ago, but I
> >> think my favourite books on programming are the pair of collected CACM
> >> columns by Jon Bentely: "Programming Pearls" and "More Programming
> >> Pearls".  I see there is a new edition of the first with new
> >> material...
> >
> > well indeed this seems good compact style writting - i readed the
> > first piece on counting words
> >
> > links here
> > https://tfetimes.com/wp-content/uploads/2015/04/ProgrammingPearls2nd.pdf
> >
> > can somebody explain me - is this hashing in c version perfect one? i
> > mean it counts with no mistakes? if so why?
> 
> The program in the book makes no mistakes because the table does not
> rely only on the hash function.
> 
> > (i know the idea of
> > hashing but its inperfection always keeps me away - is there reliable
> > way of perfect hashing on cases like that?
> 
> Perfect hashing is a technical term for something rarely seen.  When you
> want to do a lot of lookups from a fixed set of keys very fast, you can
> construct a function that maps the set of n keys to the numbers 0 to n-1
> in such a way that every key maps to a distinct number (i.e. the
> function is a bijection).  This is called a perfect hash function.
> 
> Normal hashing works by handling the collisions, so the case where two
> keys hash to the same value does not produce an error.  There are many
> ways to do this.  The Bentley book uses a linked list, I think.
> 
> -- 
> Ben.

here it is

>>Even by our loose definition of ``word'', the Bible has only 29,131 distinct words. We'll follow the old lore of using
a prime number near that for our hash table size, and the popular multiplier of 31:
#define NHASH 29989
#define MULT 31
nodeptr bin[NHASH];
Our hash function maps a string to a positive integer less than NHASH:

unsigned int hash(char *p)
 unsigned int h = 0
 for ( ; *p; p++)
 h = MULT * h + *p
 return h % NHASH

Using unsigned integers ensures that h remains positive<<

is this a perfect hashing - i mean separate words will point to separate array entries? this is unclear to me

[toc] | [prev] | [next] | [standalone]

#6353

W dniu sobota, 12 marca 2016 21:07:58 UTC+1 użytkownik fir napisał:
> W dniu sobota, 12 marca 2016 20:59:34 UTC+1 użytkownik Ben Bacarisse napisał:
> > fir <profesor.fir@gmail.com> writes:
> > 
> > > W dniu sobota, 12 marca 2016 20:15:30 UTC+1 użytkownik Ben Bacarisse napisał:
> > <snip>
> > >> These may seem a bit dated since I read them quite some time ago, but I
> > >> think my favourite books on programming are the pair of collected CACM
> > >> columns by Jon Bentely: "Programming Pearls" and "More Programming
> > >> Pearls".  I see there is a new edition of the first with new
> > >> material...
> > >
> > > well indeed this seems good compact style writting - i readed the
> > > first piece on counting words
> > >
> > > links here
> > > https://tfetimes.com/wp-content/uploads/2015/04/ProgrammingPearls2nd.pdf
> > >
> > > can somebody explain me - is this hashing in c version perfect one? i
> > > mean it counts with no mistakes? if so why?
> > 
> > The program in the book makes no mistakes because the table does not
> > rely only on the hash function.
> > 
> > > (i know the idea of
> > > hashing but its inperfection always keeps me away - is there reliable
> > > way of perfect hashing on cases like that?
> > 
> > Perfect hashing is a technical term for something rarely seen.  When you
> > want to do a lot of lookups from a fixed set of keys very fast, you can
> > construct a function that maps the set of n keys to the numbers 0 to n-1
> > in such a way that every key maps to a distinct number (i.e. the
> > function is a bijection).  This is called a perfect hash function.
> > 
> > Normal hashing works by handling the collisions, so the case where two
> > keys hash to the same value does not produce an error.  There are many
> > ways to do this.  The Bentley book uses a linked list, I think.
> > 
> > -- 
> > Ben.
> 
> here it is
> 
> >>Even by our loose definition of ``word'', the Bible has only 29,131 distinct words. We'll follow the old lore of using
> a prime number near that for our hash table size, and the popular multiplier of 31:
> #define NHASH 29989
> #define MULT 31
> nodeptr bin[NHASH];
> Our hash function maps a string to a positive integer less than NHASH:
> 
> unsigned int hash(char *p)
>  unsigned int h = 0
>  for ( ; *p; p++)
>  h = MULT * h + *p
>  return h % NHASH
> 
> Using unsigned integers ensures that h remains positive<<
> 
> is this a perfect hashing - i mean separate words will point to separate array entries? this is unclear to me

well i see this is unperfect but they then check 'collisions' with some list indeed.. well this is probably reasonably good - but if some would do it better this is another question maybe

[toc] | [prev] | [next] | [standalone]

#6355

fir <profesor.fir@gmail.com> writes:

> W dniu sobota, 12 marca 2016 21:07:58 UTC+1 użytkownik fir napisał:
<snip>
>> is this a perfect hashing - i mean separate words will point to
>> separate array entries? this is unclear to me
>
> well i see this is unperfect

Right.  I will try to remember to wait a while before replying.

<snip>
-- 
Ben.

[toc] | [prev] | [next] | [standalone]

#6357

W dniu sobota, 12 marca 2016 21:26:03 UTC+1 użytkownik Ben Bacarisse napisał:
> fir <profesor.fir@gmail.com> writes:
> 
> > W dniu sobota, 12 marca 2016 21:07:58 UTC+1 użytkownik fir napisał:
> <snip>
> >> is this a perfect hashing - i mean separate words will point to
> >> separate array entries? this is unclear to me
> >
> > well i see this is unperfect
> 
> Right.  I will try to remember to wait a while before replying.
> 
> <snip>
> -- 
> Ben.

not a problem - i could also wait before asking - but i do not care for such things (usually i may learn by reading but slower reading and asking in parralel makes it al faster and the second side also can get some value from that imo, and the grup spammed by ramin my grow a little alive again)
now its clear tnx

[toc] | [prev] | [next] | [standalone]

#6354

fir <profesor.fir@gmail.com> writes:

<snip>
> here it is
>
>>>Even by our loose definition of ``word'', the Bible has only 29,131
>>> distinct words. We'll follow the old lore of using
> a prime number near that for our hash table size, and the popular multiplier of 31:
> #define NHASH 29989
> #define MULT 31
> nodeptr bin[NHASH];
> Our hash function maps a string to a positive integer less than NHASH:
>
> unsigned int hash(char *p)
>  unsigned int h = 0
>  for ( ; *p; p++)
>  h = MULT * h + *p
>  return h % NHASH
>
> Using unsigned integers ensures that h remains positive<<
>
> is this a perfect hashing - i mean separate words will point to
> separate array entries? this is unclear to me

The answer depends on the words.  It's possible that it is perfect for
some very specific edition of Bible (wven changing one hyphenated word
might make the difference between it being perfect and not) but I doubt
it very much.

But that's a technical quibble.  The code assumes that it isn't and
handles the expected cases where hash(a) == hash(b) but a != b.  The
code should work (albeit a bit slower) if the table were were smaller
than the total number of words.

(You might consider editing the quoted material in your replies.)

-- 
Ben.

[toc] | [prev] | [next] | [standalone]

#6350

ram@zedat.fu-berlin.de (Stefan Ram) writes:

> Ben Bacarisse <ben.usenet@bsb.me.uk> writes:
>>These may seem a bit dated since I read them quite some time ago, but I
>>think my favourite books on programming are the pair of collected CACM
>>columns by Jon Bentely: "Programming Pearls" and "More Programming
>>Pearls".  I see there is a new edition of the first with new
>>material...
>
>   The Art Of Computer Programming
>   Design Patterns by Gamma, et. al.
>   Refactoring by Martin Fowler
>   Applying UML and Patterns, 3rd Ed. by Craig Larman
>   Structure and Interpretation of Computer Programs 
>   Dragon Book by Aho et al.
>   Algorithms + Data Structures = Programs
>   Artificial Intelligence: A Modern Approach
>   Structured Systems Analysis (DeMarco)
>   Patterns of Enterprise Application Architecture by Fowler
>   Object Oriented Software Construction by Bertrand Meyer
>   Object Oriented Software Engineering by Ivar Jacobson
>   Code Complete, 2nd Ed. by Steve McConnell
>   Test-Driven Development by Kent Beck
>   The Pragmatic Programmer by Andrew Hunt
>   The Mythical Man-Month by Frederick Brooks
>   Domain Driven Design by Eric Evans
>   Working Effectively with Legacy Code by Michael Feathers

I, for one, will not have the enthusiasm to read a long list of books
like this (I've read only five of them so far).

A more interesting question would be what is your favourite book ever
about the subject of programming either in general or some specific
aspect thereof?

-- 
Ben.

[toc] | [prev] | [next] | [standalone]

#6352

W dniu sobota, 12 marca 2016 21:05:52 UTC+1 użytkownik Ben Bacarisse napisał:
> ram@zedat.fu-berlin.de (Stefan Ram) writes:
> 
> > Ben Bacarisse <ben.usenet@bsb.me.uk> writes:
> >>These may seem a bit dated since I read them quite some time ago, but I
> >>think my favourite books on programming are the pair of collected CACM
> >>columns by Jon Bentely: "Programming Pearls" and "More Programming
> >>Pearls".  I see there is a new edition of the first with new
> >>material...
> >
> >   The Art Of Computer Programming
> >   Design Patterns by Gamma, et. al.
> >   Refactoring by Martin Fowler
> >   Applying UML and Patterns, 3rd Ed. by Craig Larman
> >   Structure and Interpretation of Computer Programs 
> >   Dragon Book by Aho et al.
> >   Algorithms + Data Structures = Programs
> >   Artificial Intelligence: A Modern Approach
> >   Structured Systems Analysis (DeMarco)
> >   Patterns of Enterprise Application Architecture by Fowler
> >   Object Oriented Software Construction by Bertrand Meyer
> >   Object Oriented Software Engineering by Ivar Jacobson
> >   Code Complete, 2nd Ed. by Steve McConnell
> >   Test-Driven Development by Kent Beck
> >   The Pragmatic Programmer by Andrew Hunt
> >   The Mythical Man-Month by Frederick Brooks
> >   Domain Driven Design by Eric Evans
> >   Working Effectively with Legacy Code by Michael Feathers
> 
> I, for one, will not have the enthusiasm to read a long list of books
> like this (I've read only five of them so far).
> 
> A more interesting question would be what is your favourite book ever
> about the subject of programming either in general or some specific
> aspect thereof?
> 
> -- 
> Ben.

some may be intersting but there are maybe too general (about 
nothing to create) - i would like to read maybe mostly some creative
stuff (know what i mean, explaining how to do something i do not know or how done is something which some other person made - if its interesting ) (im tired of clc where they wash all the same topics for long time instead of coding something new and shining)

[toc] | [prev] | [next] | [standalone]

#6356

W dniu sobota, 12 marca 2016 21:05:52 UTC+1 użytkownik Ben Bacarisse napisał:
> ram@zedat.fu-berlin.de (Stefan Ram) writes:
> 
> > Ben Bacarisse <ben.usenet@bsb.me.uk> writes:
> >>These may seem a bit dated since I read them quite some time ago, but I
> >>think my favourite books on programming are the pair of collected CACM
> >>columns by Jon Bentely: "Programming Pearls" and "More Programming
> >>Pearls".  I see there is a new edition of the first with new
> >>material...
> >
> >   The Art Of Computer Programming
> >   Design Patterns by Gamma, et. al.
> >   Refactoring by Martin Fowler
> >   Applying UML and Patterns, 3rd Ed. by Craig Larman
> >   Structure and Interpretation of Computer Programs 
> >   Dragon Book by Aho et al.
> >   Algorithms + Data Structures = Programs
> >   Artificial Intelligence: A Modern Approach
> >   Structured Systems Analysis (DeMarco)
> >   Patterns of Enterprise Application Architecture by Fowler
> >   Object Oriented Software Construction by Bertrand Meyer
> >   Object Oriented Software Engineering by Ivar Jacobson
> >   Code Complete, 2nd Ed. by Steve McConnell
> >   Test-Driven Development by Kent Beck
> >   The Pragmatic Programmer by Andrew Hunt
> >   The Mythical Man-Month by Frederick Brooks
> >   Domain Driven Design by Eric Evans
> >   Working Effectively with Legacy Code by Michael Feathers
> 
> I, for one, will not have the enthusiasm to read a long list of books
> like this (I've read only five of them so far).
> 
> A more interesting question would be what is your favourite book ever
> about the subject of programming either in general or some specific
> aspect thereof?
> 
> -- 
> Ben.

i got no such separate special book,
gettin knowing c was impresive route but this was no matter of the book but only c itself (learned from many sources)

[toc] | [prev] | [next] | [standalone]

#6361

ram@zedat.fu-berlin.de (Stefan Ram) writes:

> Ben Bacarisse <ben.usenet@bsb.me.uk> writes:
>>A more interesting question would be what is your favourite book ever
>>about the subject of programming either in general or some specific
>>aspect thereof?
>
>   I have observed that even a bad or mediocre book still might
>   give you some good inspiration, and a book everyone praises
>   might be boring to you.
>
>   Ok, one book I enjoyed reading at that time was the now
>   arcane »LISP - Anwendungsgebiete, Grundbegriffe,
>   Geschichte« by Herbert Stoyan, published in 1980. It treated
>   the fundamentals and the history of LISP.

Interesting that LISP comes up again.  I was going to give a LISP book
too, but I considered it rather arcane (even at the time) and since it
is out of print I thought it not worth while mentioning, but, for the
record it's "Anatomy of LISP" by John Allen, McGraw Hill, 1978.  It gave
me an entirely new perspective on what programing was really about,
though that might have been more to do with how little I knew when when
I read it!

<snip>
-- 
Ben.

[toc] | [prev] | [next] | [standalone]

#6362

W dniu sobota, 12 marca 2016 23:06:08 UTC+1 użytkownik Ben Bacarisse napisał:
> ram@zedat.fu-berlin.de (Stefan Ram) writes:
> 
> > Ben Bacarisse <ben.usenet@bsb.me.uk> writes:
> >>A more interesting question would be what is your favourite book ever
> >>about the subject of programming either in general or some specific
> >>aspect thereof?
> >
> >   I have observed that even a bad or mediocre book still might
> >   give you some good inspiration, and a book everyone praises
> >   might be boring to you.
> >
> >   Ok, one book I enjoyed reading at that time was the now
> >   arcane »LISP - Anwendungsgebiete, Grundbegriffe,
> >   Geschichte« by Herbert Stoyan, published in 1980. It treated
> >   the fundamentals and the history of LISP.
> 
> Interesting that LISP comes up again.  I was going to give a LISP book
> too, but I considered it rather arcane (even at the time) and since it
> is out of print I thought it not worth while mentioning, but, for the
> record it's "Anatomy of LISP" by John Allen, McGraw Hill, 1978.  It gave
> me an entirely new perspective on what programing was really about,
> though that might have been more to do with how little I knew when when
> I read it!
> 
> <snip>
> -- 
> Ben.

lisp is common if i would search something interesting it is in workable matter not in language syntax
- it seem lame to me to wash languages over and over instead of talking on some creation

[toc] | [prev] | [next] | [standalone]

#6363

On 2016-03-12, Ben Bacarisse <ben.usenet@bsb.me.uk> wrote:
> fir <profesor.fir@gmail.com> writes:
>
>> I got few days of time and would like to read 
>> something that could improve my skills/knowledge
>> on something worthy /interesting/shining
>>
>> Some ideas/links maybe?
>
> These may seem a bit dated since I read them quite some time ago, but I
> think my favourite books on programming are the pair of collected CACM
> columns by Jon Bentely: "Programming Pearls" and "More Programming
> Pearls".  I see there is a new edition of the first with new
> material...

Casting some Pearls before the swine?

[toc] | [prev] | [next] | [standalone]

#6364

W dniu niedziela, 13 marca 2016 03:08:53 UTC+1 użytkownik Kaz Kylheku napisał:
> On 2016-03-12, Ben Bacarisse <ben.usenet@bsb.me.uk> wrote:
> > fir <profesor.fir@gmail.com> writes:
> >
> >> I got few days of time and would like to read 
> >> something that could improve my skills/knowledge
> >> on something worthy /interesting/shining
> >>
> >> Some ideas/links maybe?
> >
> > These may seem a bit dated since I read them quite some time ago, but I
> > think my favourite books on programming are the pair of collected CACM
> > columns by Jon Bentely: "Programming Pearls" and "More Programming
> > Pearls".  I see there is a new edition of the first with new
> > material...
> 
> Casting some Pearls before the swine?

weak non-thought crap-man
this level of crap defines you internally and for me it is quite fun to wach this style a crap non-mind

[toc] | [prev] | [next] | [standalone]

#6365

W dniu niedziela, 13 marca 2016 09:11:01 UTC+1 użytkownik fir napisał:
> W dniu niedziela, 13 marca 2016 03:08:53 UTC+1 użytkownik Kaz Kylheku napisał:
> > On 2016-03-12, Ben Bacarisse <ben.usenet@bsb.me.uk> wrote:
> > > fir <profesor.fir@gmail.com> writes:
> > >
> > >> I got few days of time and would like to read 
> > >> something that could improve my skills/knowledge
> > >> on something worthy /interesting/shining
> > >>
> > >> Some ideas/links maybe?
> > >
> > > These may seem a bit dated since I read them quite some time ago, but I
> > > think my favourite books on programming are the pair of collected CACM
> > > columns by Jon Bentely: "Programming Pearls" and "More Programming
> > > Pearls".  I see there is a new edition of the first with new
> > > material...
> > 
> > Casting some Pearls before the swine?
> 
> weak non-thought crap-man
> this level of crap defines you internally and for me it is quite fun to wach this style a crap non-mind

sorry errata
*to watch this style of crap-defined non-mind

[toc] | [prev] | [next] | [standalone]

#6367

"Stefan Ram" wrote:

> Ben Bacarisse <ben.usenet@bsb.me.uk> writes:
>>These may seem a bit dated since I read them quite some time ago, but I
>>think my favourite books on programming are the pair of collected CACM
>>columns by Jon Bentely: "Programming Pearls" and "More Programming
>>Pearls".  I see there is a new edition of the first with new
>>material...
> 
>  The Art Of Computer Programming
>  Design Patterns by Gamma, et. al.
>  Refactoring by Martin Fowler
>  Applying UML and Patterns, 3rd Ed. by Craig Larman
>  Structure and Interpretation of Computer Programs 
>  Dragon Book by Aho et al.
>  Algorithms + Data Structures = Programs
>  Artificial Intelligence: A Modern Approach
>  Structured Systems Analysis (DeMarco)
>  Patterns of Enterprise Application Architecture by Fowler
>  Object Oriented Software Construction by Bertrand Meyer
>  Object Oriented Software Engineering by Ivar Jacobson
>  Code Complete, 2nd Ed. by Steve McConnell
>  Test-Driven Development by Kent Beck
>  The Pragmatic Programmer by Andrew Hunt
>  The Mythical Man-Month by Frederick Brooks
>  Domain Driven Design by Eric Evans
>  Working Effectively with Legacy Code by Michael Feathers

Nice list.  I would add

Coding and Information Theory by Richard W Hamming
Data Structures by Stubbs & Webre
A Discipline of Programming by Edsger Dijkstra

[toc] | [prev] | [next] | [standalone]

#6368

"Osmium" <r124c4u102@comcast.net> writes:
<snip>
> A Discipline of Programming by Edsger Dijkstra

Ah, yes.  Many +1s for that one -- I'd forgotten about it.  I never
looked at a loop or an if in quite the same way again after reading
that!

-- 
Ben.

[toc] | [prev] | [next] | [standalone]

#6345

On 12 Mar 2016, fir wrote:

> I got few days of time and would like to read 
> something that could improve my skills/knowledge
> on something worthy /interesting/shining
>
> Some ideas/links maybe?

I'm afraid that general texts aren't coming to my mind but now you have
me thinking about advanced texts for specific languages so I'll hijack
this subthread to ask about those. For instance, Paul Graham's "On Lisp"
is great and I am astonished that it remains out of print. Or, Joshua
Bloch's "Effective Java" is excellent stuff too. I wonder what other
such books exist for other programming languages, helping one transition
from competency to excellence.

-- Mark

[toc] | [prev] | [next] | [standalone]

Page 1 of 2  [1] 2  Next page →

Back to top | Article view | comp.programming

csiph-web