MySQL Setup

  • Download MySQL zip (https://dev.mysql.com/downloads/mysql/)
  • Save zip file any location
  • Unzip file
  • Enter bin folder of unzip directory

    - Open a command prompt on this directory path
    - Run following command
                mysqld --initialize --console
   - Copy temporary generated password
   

    - Run following command
                  mysqld --console

    For changing password :

    - Open a new command prompt on this bin directory path 
    - Run following command and press Enter key
               mysql -u root -p
    - Then command prompt wants password. Please enter the copied password. And press Enter key.

    - Then run following command for changing root password.
                alter user 'root'@'localhost' identified by 'NEW PASSWORD';
       write your desire password in NEW PASSWORD position with invert comma.
       For example, In my case, I want to set Shoaib05 as root password. Then I executed following command.
       alter user 'root'@'localhost' identified by 'Shoaib05';



Comments

Post a Comment

Popular posts from this blog

uva 481 - What Goes Up Solution

uva 481 - What Goes Up Solution #include<iostream> #include<vector> using namespace std; void binary_search(int *arr, int search_value, int start, int end, int &index){ if (start == end){ index = start; return; } int mid = (start + end) / 2; if (arr[mid] == search_value){ index = mid; return; } else if (arr[mid + 1] == search_value){ index = mid + 1; return; } else if (arr[mid]<search_value && arr[mid + 1]>search_value){ index = mid + 1; return; } else if (arr[mid] > search_value){ binary_search(arr, search_value, start, mid, index); } else{ binary_search(arr, search_value, mid + 1, end, index); } } void calculate_lis(vector<int>&arr,vector<int>&result){ int *temp, i, max = 0, j, index, n = arr.size(), *res; temp = new int[n]; res = new int[n]; temp[0] = 0; for (i = 1; i < n; i++){ if (arr[temp[max]] < arr[i]){ res[i] = temp[max]; max++; ...
Read more

UVA 10986 Solution - Sending email

UVA 10986 Solution - Sending email uva id: shoaib05 Accepted Time: 0.379 I used priority queue and Dijkstra Algorithm. Code: #include<iostream> #include<vector> #include<algorithm> #include<map> #include<queue> #include<cstring> using namespace std; typedef pair<int,int> pii; typedef vector<pii> vecpii; map<int,vecpii> mymap; map<int,int> result; bool visit[20010]; class Compare { public: bool operator()(pii p1,pii p2) { return p1.second>p2.second; } }; int DjKastra(int x,int y) { priority_queue<pii,vector<pii>,Compare> q; pii p,temp; int i; memset(visit,false,sizeof(visit)); q.push(pii(x,0)); while(!q.empty()) { p=q.top(); if(p.first==y) return p.second; q.pop(); if(visit[p.first]) continue; visit[p.first]=true; for(i=0;i<mymap[p.first].size();i++) { temp=mymap[p.first][i]; if(!visit[temp.first]) { q.push(pi...
Read more

UVA 11504 Solution- Dominos

UVA 11504 Solution- Dominos uva id: shoaib05 Accepted Time: 0.312   #include<iostream> #include<set> #include<vector> #include<algorithm> #include<string.h> using namespace std; typedef pair<int,int> Pair_Int_Int; vector<int> edge[100010]; vector<Pair_Int_Int> answer; set<int> myset; bool visit[100010]; int in_time; Pair_Int_Int p; bool mysort(Pair_Int_Int p1, Pair_Int_Int p2) {     return p1.second>p2.second; } void topological_sort(int x) {     visit[x]=true;     myset.erase(x);     int i,y;     for(i=0;i<edge[x].size();i++)     {         y=edge[x][i];         if(visit[y]==false)         {             in_time++;             topological_sort(y);...
Read more