Forum Nokia Calling All Innovators Competition

The Forum Nokia Calling All Innovators Competition is open to all mobile application developers, and features three distinct categories for submissions.

What we need from you

• General information (Name, Address, E-mail)
• Your application, uploaded in .JAD, .JAR, .WGZ, or .SIS format.
• A brief description of the problem that your application solves.
• Any supporting documentation on how your application works, uploaded in .doc, .pdf. .xls, .ppt, or .rtf format. (Optional)
• A video demo of your application (Optional, 2 Minutes Maximium)
  
  

What we are looking for

We are calling for phone applications that solve real problems that face real people. Please submit an application that solves a problem in one of the following areas.

• Eco-Challenge - "Make a Difference": Here is your chance to join an important world-wide movement! Assist Nokia in creating mobile devices, software and services that reduce our impact on the environment.  Make a difference by submitting the application that will minimize mobility’s global environmental impact and help people make sustainable choices.  Developers who submit for this category will be building tools to help people take care of the environment - from charger reminders to mobile learning applications, from navigation info to recycling tips.
• Emerging Markets - "IMAGINE the Possibilities": Get involved in defining and creating services for the Next Billion mobile users. The mission of the Emerging Markets Challenge is to open up new opportunities for developers to pioneer & monetize services impacting the daily lives of millions in developing nations.  Examples of Emerging Market solutions include applications providing health information and data access, apps offering low-cost infotainment, SMS-driven apps that inform rural agricultural workers of the best time and place to bring products to market, as well as literacy and general education solutions.
• Technology Showcase - "Developer Showdown": This category offers the opportunity to show off your technical kung fu and introduce the world to your true killer app! Open to all technologies, if it runs on S60 or Series 40, then we want to see it! Regardless if it has just been created or you have been selling it for a while, casual or commercial, we want to showcase the best of the best. Be it on Flash Lite, Java, Python, or open source. If it’s a game, enterprise solution, Web-based widget, or just a cool application that will enhance the mobile user experience, then this is the category to enter.
•  More Information Click here

FAQ In Interview

Friends I have set of programs that commonly asked in interviews. I hope it will very useful to freshers. (pgm in java)

1)  Return a new array with only positive numbers from the given array. The elements in the resulting array shall be sorted in the ascending order.

public static int[] retainPositiveNumbers(int[] a) {

        List array=new ArrayList();

     for(int i : a)

     {

     if(i>=0)

     array.add(i);

     }

     Object t[];

     t=array.toArray();

     Arrays.sort(t);  

     int idx = 0;

     int[] arrayInt = new int[array.size()];

     for(Integer v : array)

       arrayInt[idx++] = v;    

     return arrayInt;

    }

2)  Reverse each word in the original String while maintaining the word order. 

       For example:   parameter: "Hello world",   result: "olleH dlrow"

    public static String reverseWords(String s) {

        String arr[]=s.split(" ");

     StringBuffer buf=new StringBuffer();

     for(int j=0;j

     for(int i=arr[j].length()-1;i>=0;i--){

     buf.append(arr[j].charAt(i));

     }

     buf.append(" ");

     }

     s=buf.toString();

     return s;        

    }

3)  Implement Palindrome function.

public static boolean isPalindrome(String s) {

       int low = 0;

       int high = s.length() - 1;

       while(low <>

         if(s.charAt(low) != s.charAt(high))

                return false; 

        low++;

        high--;

    }

   return true;

 }

4)   Return a new array where the order of elements has been reversed from the original  array. 

public static Object[] reverseArray(Object[] a) {

         Object t[];

     t=new Object[a.length];

      for(int i=a.length-1,j=0;i>=0;i--,j++)

       t[j]=a[i];

         return t;  

    }

Illuminati Conspiracy

Hi Friends!

We all had glimpse of illuminati since our Angel&Demons novel. The following article provides gist of illuminati. Feel free to take a view

Part I

http://www.conspiracyarchive.com/NWO/Illuminati.htm

Part II

http://www.conspiracyarchive.com/Articles/Illuminati_Conspiracy_2.htm