Skip to main content

Linux User Survey

The most popular distro is Mandriva, with 17.9% of the respondents using it, followed by Suse, with 16.2%.

The most popular application is Firefox, with 47.9% of the respondents using it, followed by OpenOffice, with 31.6% and Thunderbird, with 12.0%.

Also appended below is a table with the break-down of the survey participants by country.

Top Distros
1 Mandriva 17.9%
2 Suse 16.2%
3 Fedora 11.1%
4 Debian 7.7%
5 Red Hat 6.8%
6 Xandros 5.1%
7 Slackware 5.1%
8 Ubuntu 3.4%
9 Centos 3.4%
10 Mepis 3.4%
11 Gentoo 3.4%
12 Knoppix 2.6%
13 Linspire 1.7%
15 Novell 0.9%
17 Phlak 0.9%
19 Simplymepis 0.9%
20 Kubuntu 0.9%
21 Pclouxos 0.9%

Top Applications

1 Firefox 47.9%
2 OpenOffice 31.6%
3 Thunderbird 12.0%
4 Xmms 7.7%
5 Evolution 6.8%
6 Apache 6.8%
7 Mozilla 6.8%
8 Gaim 5.1%
9 Kmail 5.1%
10 Gimp 4.3%
11 Samba 4.3%
12 Emacs 3.4%
13 Kde 3.4%
Top Countries
1 USA 43.6%
2 Australia 6.0%
3 UK 5.1%
4 India 4.3%
5 Canada 4.3%
6 Indonesia 2.6%
7 Romania 1.7%
8 Namibia 1.7%
9 Poland 1.7%
10 Brazil 1.7%
11 Thailand 1.7%
12 New Zealand 1.7%
13 The Netherlands 1.7%
14 Greece 0.9%
15 Spain 0.9%
16 Ecuador 0.9%
17 China 0.9%
18 Bangladesh 0.9%
19 Lithuania 0.9%
20 Pakistan 0.9%
21 Sweden 0.9%
22 Germany 0.9%
23 Turkey 0.9%
25 Egypt 0.9%



This Survey was conduct at about.linux.com

Comments

Post a Comment

Popular posts from this blog

Singly Linked List

/**     Program Name: Singly Linked List     Description: This Program is for Implemeting Singly Linked List     Author:  Tauqirul Haque         */ struct Linklist {     int item;     struct Linklist *next; }; typedef struct Linklist node; void insertAtBeginning(node **); void createAppendNode(node **); void insertInMiddle(node **); void deleteNode(node **); void displayNode(node **); void countNode(node **);  void searchElement(node **); void reverse(node **); void main() {     node *head = NULL;     int choice = 0;     while(choice != 9)     {             printf("\n\t\t\t1. Add Node At The Beginning ");     printf("\n\t\t\t2. Insert Element in the Middle ");     printf("\n\t\t\t3. Append New Node "); ...
23 comments
Read more

FINDING FACTORIAL OF A NUMBER

/**     Program Name: FINDING FACTORIAL     Description: This Program finds a Factorial of a Given Number     Author:  Tauqirul Haque         */ long fact(long n); void main() {     long n;     printf("Enter N : ");     scanf("%d",&n);         if(n < 0)   //if its a neg number then changing the sign     {         n = -n;     }         printf("The fact of %ld  =  %ld \n\n",n,fact(n)); } long fact(long n) {     if(n==0 || n==1)     {         return 1;     }     else     {         return n*fact(n-1);     } }
Post a Comment
Read more

BUBBLE SORT

/**     Program Name: BUBBLE SORT     Description: This Program sorts a Given Array in Ascending Order     Author:  Tauqirul Haque         */ #define SIZE 10 void bubbleSort(int data[SIZE]); void displayElement(int data[SIZE]); void main() {     int data[SIZE] = { 45,34,66,89,45,34,76,22,79, 12};         printf("\nThe Original Array Before Sorting ... ");     displayElement(data);         printf("\nArray After Sorting ... ");     bubbleSort(data);     displayElement(data);     } void displayElement(int data[SIZE]) {     int i;     for(i=0; i     {         printf("\nData[%d]  =  %d",i,data[i]);     }     printf("\n"); } void ...
Post a Comment
Read more