Skip to main content

Linux Timeline

Linux started as hobby by "Linus Torvalds"

August 1991

“Hello everybody out there using minix - I'm doing a (free) operating system (just a hobby, won't be big and professional like gnu) for 386(486) AT clones. This has been brewing since april, and is starting to get ready. I'd like any feedback on things people like/dislike in minix, as my OS resembles it somewhat (same physical layout of the file-system (due to practical reasons) among other things).I've currently ported bash(1.08) and gcc(1.40), and things seem to work. This implies that I'll get something practical within a few months, and I'd like to know what features most people would want. Any suggestions are welcome, but I won't promise I'll implement them :-) Linus (PS. Yes - it's free of any minix code, and it has a multi-threaded fs. It is NOT protable (uses 386 task switching etc), and it probably never will support anything other than AT-harddisks, as that's all I have :-(.”

September 1991

Linux version 0.01 is released and put on the Net.

April 1992

The first Linux newsgroup, comp.os.linux, is proposed and started by Ari Lemmke.
 
October 1992

Peter MacDonald announces SLS, the first standalone Linux install. At least 10MB of space on disk was recommended.
 
June 1993

Slackware, by Patrick Volkerding, becomes the first commercial standalone distribution and quickly becomes popular within the Linux community.
 
August 1993

Matt Welsh's Linux Installation and Getting Started, version 1 is released. This is the first book on Linux.

May 1998

The Google search engine pops up. Not only is it one of the best search engines around, but it's based on Linux and features a Linux-specific search page.
Big databases start to arrive. Support for Linux is announced by Computer Associates for their Ingres system and by Ardent Software for their O2 object database.


These are few stories want more check the site http://www.linuxjournal.com/article/6000



Comments

Post a Comment

Popular posts from this blog

Ecosia

ECOSIA - A Green search engine “ Ecosia donates 80% profits to planting trees” Site: www.ecosia.org Lauched on 7 th December 2009 and created by Christian Kroll available in more than 26 language. It is located in Berlin, Germany.It is also called as CO2-neutral company.Ecosia has donated to different tree-planting programs. Until December 2010 Ecosia’s donations went to a program by WWF Germany that protected the Juruena-National park in the Amazonas. In order to make sure the protection was kept up, the program also drew up and financed plans with timber companies and the  local communities. According to B-labs, as of January 2015, "In donating 80 percent of its ad revenue, the search engine has raised over $1.5 million for rainforest protection since its founding in December 2009." According to Ecosia, by 2015, the search engine had almost 2.5 million active users, and searches through it had resulted in more than 2 million trees being planted.Since October 201...
Post a Comment
Read more

C program jackpot

/*Program to show sum of 10 elements of array & show the average.*/ #include<stdio.h> int main () { int a[ 10 ],i,sum = 0 ; float av; printf( "enter elements of an aaray: " ); for (i = 0 ;i < 10 ;i ++ ) scanf( "%d" , & a[i]); for (i = 0 ;i < 10 ;i ++ ) sum = sum + a[i]; printf( "sum=%d" ,sum); av = sum / 10 ; printf( "average=%.2f" ,av); return 0 ; } Output: enter elements of an array : 4 4 4 4 4 4 4 4 4 4 sum = 40 average = 4.00 /*Program to find the maximum no. in an array.*/ #include<stdio.h> void main () { int a[ 5 ],max,i; printf( "enter element for the array: " ); for (i = 0 ;i < 5 ;i ++ ) scanf( "%d" , & a[i]); max = a[ 0 ]; for (i = 1 ;i < 5 ;i ++ ) { if (max < a[i]) max = a[i]; } printf( "maximum no= %d" ,max); } Output: enter elements for array : 5 4 7 1 2 maximum no = 7 /*Swapp...
Post a Comment
Read more

C program for bracket matching

# include < stdio.h > int main ( ) { char a [ 24 ] , stack [ 24 ] ; int n , i , top = 0 , cnt = 0 ; scanf ( " %s " , a ) ; n = strlen ( a ) ; if ( n % 2 = = 0 ) { for ( i = 0 ; i < n ; i + + ) { switch ( a [ i ] ) { case '(' : case '{' : case '[' : case '<' : stack [ top + + ] = a [ i ] ; break ; case ')' : if ( stack [ - - top ] = = '(' ) { cnt + + ; } break ; case '}' : if ( stack [ - - top ] = = '{' ) cnt + + ; break ; case ']' : if ( stack [ - - top ] = = '[' ) cnt + + ; break ; case '>' : if ( stack [ - - top ] = = '<' ) cnt + + ; break ; default : break ; } } //printf("%s %d %d",stack,cnt,n); if ( n / 2 = = cnt ) printf ( " valid " ) ; else printf ( " invalid " ) ; } else printf ( " invalid " ) ; return 200 ; } if u have ...
Post a Comment
Read more