Dennis Ritchie, father of C programming language, is in Paradise now

The New York Times reported that Ritchie died on October 12 after a prolonged illness at age 70.


Ritchie died at his home over the weekend,
His Wikipedia entry was updated to say he had died in Murray Hill, N.J.


In addition to being the creator of C, Ritchie co-authored "The C Programming Language", commonly referred to as K&R (after the authors, Brian Kernighan and Ritchie) and widely considered the definitive work on C. He also made significant contributions to the development of the Unix operating system, for which he received the Turing Award in 1983 along with Kenneth Thompson.

President Bill Clinton awarded Ritchie and Thompson the National Medal of Technology in 1999 for their contributions to Unix and C. He won many other national and international awards for his work and was elected to the National Academy of Engineering in 1988 for "development of the C programming language and for co-development of the Unix operating system".

Dennis was well loved by his colleagues at Bell Labs, and will be greatly missed. He was truly an inspiration to all of us, not just for his many accomplishments, but because of who he was as a friend, an inventor, and a humble and gracious man.


 Ritchie had the lifestyle and habits to match his position as an early guru of IT. Long-haired and bearded, and famously more owl than lark, he started work at midday in his industry-standard chaotic office, emerging late in the evening to go home and carry on working through to the small hours at the end of a leased line connected to the Bell Labs computers....

His ideas live on, in the rudest of health, at the centre of modern operating system design, in new programming languages, and in every electron and bit of open systems.

I wish god may give them peace and paradise.

All About Java Collection : Useful Point wise information

What Do You Do with a Collection?

• Add objects to the collection.
• Remove objects from the collection.
• Find out if an object (or group of objects) is in the collection.
• Retrieve an object from the collection (without removing it).
• Iterate through the collection, looking at each element (object) one after another.

Key Interfaces and Classes of the Collections Framework

• Collection
• Set
• SortedSet
• List
• Map
• SortedMap
• Queue 

Maps

·         HashMap

·         Hashtable

·         TreeMap

·         LinkedHashMap

Sets

·         HashSet

·         LinkedHashSet

·         TreeSet

Lists

·         ArrayList

·         Vector

·         LinkedList

Queues

·         PriorityQueue

Utilities

·         Collections

·         Arrays

Note : Basically You will find three kinds of collection words in this framework but each has its own importance given as below

i)        collection (lowercase c), which represents any of the data structures in

which objects are stored and iterated over.

ii)       Collection (capital C), which is actually the java.util.Collection interface

 from which Set, List, and Queue extend. (That's right, extend, not implement. 
There are no direct implementations of Collection.)

iii)     Collections (capital C and ends with s) is the java.util.Collections class

that holds a pile of static utility methods for use with collections.

List Interface

• A List cares about the index.

ArrayList

• This as a growable array
• It gives you fast iteration and fast random access
• It is an ordered collection (by index), but not sorted

Vector

• Vector is a holdover from the earliest days of Java
• Vector and Hashtable were the two original collections
• Vector is basically the same as an ArrayList
• Vector methods are synchronized for thread safety
• You'll normally want to use ArrayList instead of Vector because
• the synchronized methods add a performance hit you might not need
• Vector is the only class other than ArrayList to implement RandomAccess

LinkedList

• A LinkedList is ordered by index position, like ArrayList, except that the elements are doubly-linked to one another

• LinkedList  is best for adding and removing from the beginning or end, which makes it an easy choice for implementing a stack
• or queue.

• LinkedList may iterate more slowly than an ArrayList

Set Interface

• A Set cares about uniqueness—it doesn't allow duplicates

HashSet

• A HashSet is an unsorted, unordered Set
• It uses the hashcode of the object being inserted
• Use this class when you want a collection with no duplicates and you don't care about order when you iterate through it

LinkedHashSet

• A LinkedHashSet is an ordered version of HashSet that maintains a doubly-linked List across all elements.
• Use this class instead of HashSet when you care about the iteration order.

• When you iterate through a HashSet the order is unpredictable, while a LinkedHashSet lets you iterate through the elements in the order in which they were inserted.

TreeSet

• The TreeSet is sorted collections

• It uses a Red-Black tree structure, and guarantees that the elements will be in ascending order, according to natural order

• TreeSet, lets you define a custom sort (your own rule to sort) order via a Comparable or Comparator)

Map Interface

• A Map cares about unique identifiers

HashMap

• The HashMap gives you an unsorted, unordered Map

• A Map cares about unique identifiers.

• You map a unique key (the ID) to a specific value

• Map implementations let you do things like search for a value based on the key

Hashtable

• Like Vector, Hashtable has existed from prehistoric Java times

• Looks HashMap vs. Hashtable. Where's the capitalization of t?

• Hashtable is the synchronized counterpart to HashMap

• Hashtable are synchronized,  means that the key methods of the class are synchronized

• HashMap lets you have null values as well as one null key, a Hashtable doesn't let you have anything that's null.

LinkedHashMap

• LinkedHash-Map collection maintains insertion order

• It will be somewhat slower than HashMap for adding and removing elements,

• Iteration with a LinkedHashMap will be faster

TreeMap

• TreeMap is a sorted Map by natural order

• Like TreeSet, TreeMap lets you define a custom sort order via a Comparable or Comparator

Queue Interface

• A Queue is designed to hold a list of "to-dos," or things to be processed in some way.

PriorityQueue

• We PriorityQueue is to create a "priority-in, priority out" queue as opposed to a typical FIFO queue

• A PriorityQueue's elements are ordered either by natural ordering (in which case the elements that are sorted first will be accessed first) or according to a Comparator

• In either case, the elements' ordering represents their relative priority

Oracle Social Network

Features
------------

Conversations

Real-Time

Everything within Oracle Social Network happens in real-time.

Multimedia

Text, content, video, and voice all within a stream.

Share

Internal and external groups collaborating securely together.

Business Updates

Application Integration

Connect to Applications such as CRM and HCM.

Feeds

Business events posted within Social Network streams.

Gadgets

Update your Applications from within Oracle Social Network.

Content

Annotation

Real-time, shared document markup.

Real-Time Tools

Chat, web and application conference sharing.

Search

Full content, real-time auto complete and context filtering.

 Activity Streams

Live Digest

Receive snapshots of your unread activity stream.

Followup

Flag critical information for yourself or others.

Filtering

Focus on what matters to you.

When Does the Garbage Collector Run in JVM ?

• The garbage collector is under the control of the JVM. 

• The JVM decides when to run the garbage collector.

• Using Java program you can ask the JVM to run the garbage collector

        but there are no guarantees, under any circumstances, that the JVM       
        will comply.

• JVM will typically run the garbage collector when it senses that memory is running low. 

• Experience indicates that whenyour Java program makes a request for garbage collection, the JVM will usually grant your request in short order, but there are no guarantees. Just when you think you can count on it, the JVM will decide to ignore your request.

9 VERY VERY USEFUL TRICKS TO SEARCH YOUR NEEDS IN GOOGLE

1. Here are some tips that google refers to as "advanced"

A. "xxxx" / will look for the exact phrase. (google isnt case sensitive)
B. -x / will search for something excluding a certain term
C. filetype:xxx / searches for a particular file extention (exe, mp3, etc)
D. -filetype:xxx / excludes a particular file extention
E. allinurl:x / term in the url
F. allintext:x / terms in the text of the page
G. allintitle:x / terms in the html title of that page
H. allinanchor:x / terms in the links

2. OR
Self explanatory, one or the other... (ie: binder OR joiner)

3. ~X
Synonyms/similar terms (in case you can't think of any yourself)

4. Numbers in a range.
Lets say you're looking for an mp3 player but only want to spend up to $90. Why swim through all the others? MP3 player $0..$90 The 2 periods will set a numeric range to search between. This also works with dates, weights, etc

5. +
Ever type in a search and see something like this:
"The following words are very common and were not included in your search:"
Well, what if those common words are important in your search? You can force google to search through even the common terms by putting a + in front of the denied word.

6. Preferences
It amazes me when I use other peoples PCs that they dont have their google search preferences saved. When you use google as much as I do, who can afford to not have preferences? They're located on the right of the search box, and have several options, though I only find 2 applicable for myself...
A. Open results in new browser
B. Display 10-100 results per page. (I currently use 50 per page, but thats a resolution preference, and 5X's the default)

7. *
Wildcard searches. Great when applied to a previously mentioned method. If you only know the name of a prog, or are looking for ALL of a particular file (ie. you're DLing tunes) something like *.mp3 would list every mp3.

8. Ever see this?
"In order to show you the most relevant results, we have omitted some entries very similar to the X already displayed. If you like, you can repeat the search with the omitted results included." The answer is YES. yes yes yes. Did I mention yes? I meant to.

9. Search EVERYWHERE
Use the engine to its fullest. If you dont find your answer in the web section, try the group section. Hell, try a whole different search engine. Dont limit yourself, because sometimes engines seem to intentionally leave results out.
ex. use google, yahoo, and altavista. search the same terms... pretty close, right? Now search for disney death. Funny, altavista has plenty of disney, but no death...hmmm.

FRIENDS READ THESE MIND BLOWING THOUGHTS

SOME OF THE VERY USEFUL GOOGLE SEARCH TIPS

• 

   

  Calculator

  To use Google’s built-in calculator function, simply enter the calculation you’d like done into the search box.
  Example:  

Stock Quotes

To see current market data for a given company or fund, type the ticker symbol into the search box. On the results page, you can click the link to see more data from Google Finance.

Example:  

Time

To see the time in many cities around the world, type in “time” and the name of the city.

Example:  

Sports Scores

To see scores and schedules for sports teams type the team name or league name into the search box. This is enabled for many leagues including the National Basketball Association, National Football League, National Hockey League, and Major League Baseball.

All sports data provided by STATS LLC

Example:  

Sunrise & Sunset

To see the precise times of sunrises and sunsets for many U.S. and worldwide cities, type “sunrise” or “sunset” followed by the city name.

Example: 

 

Weather

To see the weather for many U.S. and worldwide cities, type “weather” followed by the city and state, U.S. zip code, or city and country.

Example: