background preloader


Facebook Twitter

Rooting Nook

Facilitating the spread of knowledge and innovation in enterprise software development. Wordpress. Hosting. SEO. TechCrunch. The Rude Baguette. Digg - What the Internet is talking about right now. Slashdot: News for nerds, stuff that matters. Techmeme. Ars Technica. Taste for Makers. February 2002 I was talking recently to a friend who teaches at MIT.

Taste for Makers

His field is hot now and every year he is inundated by applications from would-be graduate students. "A lot of them seem smart," he said. "What I can't tell is whether they have any kind of taste. " Taste. Mathematicians call good work "beautiful," and so, either now or in the past, have scientists, engineers, musicians, architects, designers, writers, and painters. For those of us who design things, these are not just theoretical questions. If you mention taste nowadays, a lot of people will tell you that "taste is subjective. " Most of us are encouraged, as children, to leave this tangle unexamined. Your mother at this point is not trying to teach you important truths about aesthetics. Like many of the half-truths adults tell us, this one contradicts other things they tell us.

What goes through the kid's head at this point? Saying that taste is just personal preference is a good way to prevent disputes. What should every programmer know about web development.


Agile. Debugging. Heap (data structure) Example of a complete binary max-heap with node keys being integers from 1 to 100 1. the min-heap property: the value of each node is greater than or equal to the value of its parent, with the minimum-value element at the root. 2. the max-heap property: the value of each node is less than or equal to the value of its parent, with the maximum-value element at the root.

Heap (data structure)

Throughout this article the word heap will always refer to a min-heap. In a heap the highest (or lowest) priority element is always stored at the root, hence the name heap. A heap is not a sorted structure and can be regarded as partially ordered. Note that, as shown in the graphic, there is no implied ordering between siblings or cousins and no implied sequence for an in-order traversal (as there would be in, e.g., a binary search tree). A heap data structure should not be confused with the heap which is a common name for the pool of memory from which dynamically allocated memory is allocated. Heap at Wolfram MathWorld.

Web Annotation

#Beginner - mIRC Commands Listing. IRC Information.....

#Beginner - mIRC Commands Listing

Quick Reference to mIRC Commands Download here a zip/exe file which runs a program giving you easy access to these commands. Very Kewl! Download the text version of this page. / Recalls the previous command entered in the current window. Web Searching. Hypertext Transfer Protocol. Architecture. Domain Search. Tracking change and innovation in the enterprise software development community.

Publicly Available Standards. Stack Overflow.