Git best!

check website is alive ? [python]

```python import urllib

mount with python

```python

mount with bash

Toast - Android

    Toast toast =Toast.makeText(Main.this,"Silindi", Toast.LENGTH_SHORT);
                    toast.setGravity(Gravity.CENTER, 0,0);
                    toast.show();
                    finish();

AlertDialog Example

    @Override
        public boolean onOptionsItemSelected(MenuItem item) {
            if(item.getItemId()==R.id.hakkimda)
            {
                AlertDialog.Builder  builder = new AlertDialog.Builder(MainActivity.this);
                builder.setMessage("THIS IS A TEST");
                builder.setCancelable(false);
                
                    builder.setNegativeButton("ok", new DialogInterface.OnClickListener() {
                        
                        @Override
                        public void onClick(DialogInterface dialog, int which) {
                            dialog.cancel();
                        }
                    });
                AlertDialog alert = builder.create();
                alert.show();    
            
            }
            
            return super.onOptionsItemSelected(item);
        }

Linux Deepin Distro

listview in csharp

algorithms knapsack problem solution in C

```c++ #include int max(int a,int b) { return a>b ? a:b; //return a if a>b, else return b } int Knapsack(int items,int weight[],int value[],int maxWeight) { int dp[items+1][maxWeight+1]; /* dp[i][w] represents maximum value that can be attained if the maximum weight is w and items are chosen from 1...i */ /* dp[0][w] = 0 for all w because we have chosen 0 items */ int iter,w; for(iter=0;iter<=maxWeight;iter++) { dp[0][iter]=0; } /* dp[i][0] = 0 for all w because maximum weight we can take is 0 */ for(iter=0;iter<=items;iter++) { dp[iter][0]=0; } for(iter=1;iter<=items;iter++) { for(w=0;w<=maxWeight;w++) { dp[iter][w] = dp[iter-1][w]; /* If I do not take this item */ if(w-weight[iter] >=0) { /* suppose if I take this item */ dp[iter][w] = max(dp[iter][w] , dp[iter-1][w-weight[iter]]+value[iter]); } }

Algorithm Fast-Exponentiate

``` Algorithm Fast-Exponentiate(x, n) if n = 0 then return 1 else if n is even then return Fast-Exponentiate(x^2, n / 2) else return x * Fast-Exponentiate(x^2, (n - 1) / 2) fi