How to setup Eclipse and Android on Windows 7 - A Step-by-Step guide



One of the most detailed step-by-step guide ever to setup Android with Eclipse Juno on Windows 7 and run your first Android Hello World Application

Who is this guide for?
This guide is for anyone (especially Non-JAVA people from MS world like me), looking for help to setup Android Development Environment on a Windows 7 box.


This tutorial (pretty detailed) will help you installing all required software and run a simple Android Hello World project on Android 2.3.3 emulator. When I thought to learn Android (few weeks ago), being accustomed to .msi file double clicks for installation, found Android setup a little less easy. But if you go through this document carefully, setting up android development environment on Windows 7 will be a breeze.

Requirements
Windows 7 (32-bit or 64-bit)
Internet

What all this guide covers

  • How to install JDK 7(JAVA Development Kit)
  • How to install Eclipse Juno (Free IDE for JAVA like paid Visual Studio is there for .NET)
  • How to install ADT Plugin (Android development plugin is extension to Eclipse to work with Android projects)
  • How to install Android SDK 20.0.3(Library and developer tools for making Android Apps)
  • How to create AVD (Android Virtual Device a.k.a. Emulator, to run applications)
  • How to create "Hello World" android project and run it on Emulator

You'll also find resolution to installation issues like:

+++++++++++++++++++++++++++++++++++++++++++++++++++++
| A java Runtime Environment (JRE) or Java Development kit (JDK) must
| be available in order to run Eclipse. No Java virtual machine was found  
| after searching the following locations: C:\eclipse\jre\javaw.exe       
| javaw.exe in your current PATH                                           
+++++++++++++++++++++++++++++++++++++++++++++++++++++

+++++++++++++++++++++++++++++++++++++++++++++++++++
|  This template depends on the Android Support library, which   
|  is either not installed, or template depends on a more recent 
|  version than the one you have installed                      
+++++++++++++++++++++++++++++++++++++++++++++++++++


Its too big for blog post (~25 pages due to lot of screenshots), hence I've created a PDF instead!
Hope it helps someone!!

guide to setup android on win7
Over 200 downloads but no comments.. :(
If it helps, Please be courteous to like/comment/Tweet this post ... Thanks!
P.S.: If you didn't find this useful, I'd appreciate a comment for the same too, so that I can improve it!

Comments

Post a Comment

Popular posts from this blog

How to show only month and year fields in android Date-picker?

Image
Android default DatePicker show day/month/year fields but you have to customize this DatePicker as your requirements. Suppose that you want to show only month and year fields in android datepicker . To do this, you have to customize the Dialog DatePicker source code but it is not an easy task. In this tutorial I will show you a tricky way to solve this problem. Lets see how to show only month and year field in android DatePicker as a dialog.   Step to show only month and year fields in android date-picker: Some days ago I got this same problem and here I am trying to explain this in a sequential manner. I want to show a dialog datepicker when user click on an EditText. So if user click on EditText, A dialog datepicker will be invocked and it will show only month and year fields. To do this, at first we have to create a xml layout to hold the EditText fields. So create an android project and name it DatePickerExample. In the main.xml file just try to write this simple code....
Read more

How to construct a B+ tree with example

Image
A B+ tree contains n-1 search key values K1K2…….Kn-1 and have n pointers.   In a B+ tree the data are ordered  sequentially.  The leaf node may hold up to n pointers and must hold at least N/2 pointers. The root node must hold at least two pointers, unless the tree consists of only one node.  Now we construct a B+ tree. Construct a B+ tree for the following set of key values: (2,3,5,7,11,17,19,23,29,31) Assume that the tree is initially empty and values are added in ascending order. Construct a B+ tree where the pointer number is Four. Solution: When a node exceeds n-1 search key value then we split it into two nodes. First node contains (ceiling(n-1)/2) values.  2 nd node contains remaining node. Copy the smallest search key value of the second node to the parent node. Let's start, we know each node has N pointer and has N-1 search key values. In our example pointer number is 4, so the search key value is 4-1=3. So each node has 4 pointers and 3 search key val...
Read more

Conflict Serializability in database

Image
To maintains database state consistency we introduce serializability. Using serializability we can understand which schedule will ensure consistency, and which schedule will not. When we are capable of converting a concurrent schedule into a serial schedule then we cal it serializable schedule. A schedule is serializable if it is equivalent to a serial schedule. We divided this concepts into two parts 1. Conflict serializability  & 2. View serializability In this discussion I just clarify you the conflict serializability. Consider two instruction read, write and the data item A and B. When two instruction execute different data item such as read(A) and read(B), then we can swap the instruction without affecting the result of the schedule. But when the data item is equivalent to one another we need to consider following four condition.    a.   read (A ),    read ( A ).   they   don’t conflict.    b.   read ( Q),  ...
Read more