Skip to main content

Different Package system used in linux


Worried Of Dependency Hell in Linux?
To install a package, we need to run some commands or software center(like Ubuntu software center) and system should be connected to Internet (online) and each package has dependencies which must be satisfied to run the software properly .The offline installation of package in Linux is not easy .We cannot assure that everyone using computer is connected to Internet. It changes from person to person. To eradicate this, Microsoft windows uses .EXE files, simply double clicking it and with few clicks the software is installed and we can work with it. In Linux, it is just a dream but now the dreams come true .Yes now you can download a single package and install it offline system

FlatPak:
The package manager formerly known as xdg-app aims to provide cross platform sandboxed packages to every Linux distribution.
Advantage :
• Built with security i.e. programs are isolated from each other (sandbox).
• Support for different distribution.


Snappy: 
It’s a transactional package manager originally designed and built by Canonical Ltd. A single snap can work across range of Linux environments, making snaps a universal Linux package.
Advantage :
• Deployed in Internet of Things environment.
• In Ubuntu touch devices.
• No dependency.

ORB :(My Favourite)
The other project which provide portable version of package are ORB (Open Runnable Bundle) which can be downloaded from their website and can be used from pen drives, SD card. The ORB also provides Superdeb which can be used to install software offline
Advantage :
• Fast
• Portable
• Secure

Website:
• Snapcraft.io
• Orbital-apps.com
• Flatpak.org

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