Install android studio in ubuntu

Install android studio in ubuntu

  • guide you through the process of installing Android Studio on Ubuntu. Please follow these steps:
    1. Download Android Studio:
    2. Extract the downloaded file:
      • Open a terminal and navigate to the directory where you downloaded Android Studio.
      • Extract the archive using the following command:
        bash
    • tar -xvzf android-studio-*.tar.gz

  • Move Android Studio to a suitable location:
    • Move the extracted folder to a location where you want to install Android Studio. For example:
      bash
    • sudo mv android-studio /opt

  • Set up environment variables:
    • Open your ~/.bashrc or ~/.zshrc file using a text editor (e.g., nano, vim, or gedit).
    • Add the following lines at the end of the file:
      bash
  • export ANDROID_HOME=$HOME/Android/Sdk
export PATH=$PATH:$ANDROID_HOME/emulator
export PATH=$PATH:$ANDROID_HOME/tools
export PATH=$PATH:$ANDROID_HOME/tools/bin
export PATH=$PATH:$ANDROID_HOME/platform-tools

  • Save and close the file.
  • Run the following command to apply the changes:
    bash
    • source ~/.bashrc

  • Install dependencies:
    • Android Studio requires some additional dependencies. Run the following command to install them:
      bash
    • sudo apt-get install libc6:i386 libncurses5:i386 libstdc++6:i386 lib32z1 libbz2-1.0:i386

  • Start Android Studio:
    • Navigate to the Android Studio bin directory and run the studio.sh script:
      bash
    • cd /opt/android-studio/bin
./studio.sh

    • Follow the on-screen instructions to complete the installation.
  • Create a desktop entry:
    • To create a desktop entry for Android Studio, you can use the following commands:
      bash
    • echo -e "[Desktop Entry]\nName=Android Studio\nComment=Android Studio IDE\nExec=/opt/android-studio/bin/studio.sh\nIcon=/opt/android-studio/bin/studio.png\nTerminal=false\nType=Application\nCategories=Development;IDE;Java;" | sudo tee /usr/share/applications/android-studio.desktop

  • Run Android Studio:
    • You can now launch Android Studio from the application menu or by running the following command in the terminal:
      bash
    • android-studio

 

Comments

Post a Comment

Popular posts from this blog

Convert binary to decimal in c using built in function

Image
 Convert binary to decimal in c using built in function     In C, you can use the strtol function from the <stdlib.h> library to convert a binary string to a decimal number. strtol stands for "string to long integer."  Syntax:  long strtol(const char *nptr, char **endptr, int base); nptr : The string you want to convert to a number. endptr : The address of the first character that's not part of the number (if provided). base : The numerical base of the string (e.g., 2 for binary, 10 for decimal).         This code snippet demonstrates converting the binary string "101010" to its decimal equivalent using strtol . The base parameter 2 specifies that the string is in binary format. Adjust the binaryString variable to contain the binary string you want to convert. ```c #include <stdio.h> #include <stdlib.h> int main () { char binaryString [] = "101010" ; long decimal = strtol ( binaryString , NULL...
Read more

Install nodeJs in linux

Install nodeJs in linux   Download the NodeJS https://nodejs.org/en  Extract the tar file  Rename the file to nodejs  Run the below command:  cd nodejs  sudo cp '/home/dev/Downloads/nodejs/bin/node' '/usr/bin'  node -v  sudo ln -s /home/dev/Downloads/nodejs/bin/npm /usr/local/bin/npm  ./npm install npm@latest  npm -v      
Read more

DFS in Complete Tree

Image
  DFS in Complete Tree  "DFD" typically stands for "Data Flow Diagram." It's a graphical representation used in software engineering and systems analysis to illustrate how data moves through a system. However, it's not an algorithm like BFS or DFS. Completeness: DFDs depict data flow in a system but might not cover every detail, depending on the diagram's level of abstraction. Time & Space Complexity: the time complexity of both DFS and BFS is O(V + E) , where V represents the number of vertices and E represents the number of edges in the graph. And, the space complexity of DFS and BFS is O(V), in the worst case Optimality: DFDs are design tools; their value lies in effectively illustrating data flow for system understanding and analysis, rather than being inherently optimal or non-optimal. Tree:    Code: class Node : def __init__ ( self , value ): self . data = value self . left = None self . right = None...
Read more