Monday, January 9, 2023

Tips

 

Taking inputs (stdin)

OneCompiler's Java online editor supports stdin and users can give inputs to the programs using the STDIN textbox under the I/O tab. Using Scanner class in Java program, you can read the inputs. Following is a sample program that shows reading STDIN ( A string in this case ).

import java.util.Scanner;
class Input {
    public static void main(String[] args) {
    	Scanner input = new Scanner(System.in);
    	System.out.println("Enter your name: ");
    	String inp = input.next();
    	System.out.println("Hello, " + inp);
    }
}

Adding dependencies

OneCompiler supports Gradle for dependency management. Users can add dependencies in the build.gradle file and use them in their programs. When you add the dependencies for the first time, the first run might be a little slow as we download the dependencies, but the subsequent runs will be faster. Following sample Gradle configuration shows how to add dependencies

apply plugin:'application'
mainClassName = 'HelloWorld'

run { standardInput = System.in }
sourceSets { main { java { srcDir './' } } }

repositories {
    jcenter()
}

dependencies {
    // add dependencies here as below
    implementation group: 'org.apache.commons', name: 'commons-lang3', version: '3.9'
}

About Java

Java is a very popular general-purpose programming language, it is class-based and object-oriented. Java was developed by James Gosling at Sun Microsystems ( later acquired by Oracle) the initial release of Java was in 1995. Java 17 is the latest long-term supported version (LTS). As of today, Java is the world's number one server programming language with a 12 million developer community, 5 million students studying worldwide and it's #1 choice for the cloud development.

Syntax help

Variables

short x = 999; 			// -32768 to 32767
int   x = 99999; 		// -2147483648 to 2147483647
long  x = 99999999999L; // -9223372036854775808 to 9223372036854775807

float x = 1.2;
double x = 99.99d;

byte x = 99; // -128 to 127
char x = 'A';
boolean x = true;

Loops

1. If Else:

When ever you want to perform a set of operations based on a condition If-Else is used.

if(conditional-expression) {
  // code
} else {
  // code
}

Example:

int i = 10;
if(i % 2 == 0) {
  System.out.println("i is even number");
} else {
  System.out.println("i is odd number");
}

2. Switch:

Switch is an alternative to If-Else-If ladder and to select one among many blocks of code.

switch(<conditional-expression>) {    
case value1:    
 // code    
 break;  // optional  
case value2:    
 // code    
 break;  // optional  
...    
    
default:     
 //code to be executed when all the above cases are not matched;    
} 

3. For:

For loop is used to iterate a set of statements based on a condition. Usually for loop is preferred when number of iterations is known in advance.

for(Initialization; Condition; Increment/decrement){  
    //code  
} 

4. While:

While is also used to iterate a set of statements based on a condition. Usually while is preferred when number of iterations are not known in advance.

while(<condition>){  
 // code 
}  

5. Do-While:

Do-while is also used to iterate a set of statements based on a condition. It is mostly used when you need to execute the statements atleast once.

do {
  // code 
} while (<condition>); 

Classes and Objects

Class is the blueprint of an object, which is also referred as user-defined data type with variables and functions. Object is a basic unit in OOP, and is an instance of the class.

How to create a Class:

class keyword is required to create a class.

Example:

class Mobile {
    public:    // access specifier which specifies that accessibility of class members 
    string name; // string variable (attribute)
    int price; // int variable (attribute)
};

How to create a Object:

Mobile m1 = new Mobile();

How to define methods in a class:

public class Greeting {
    static void hello() {
        System.out.println("Hello.. Happy learning!");
    }

    public static void main(String[] args) {
        hello();
    }
}

Collections

Collection is a group of objects which can be represented as a single unit. Collections are introduced to bring a unified common interface to all the objects.

Collection Framework was introduced since JDK 1.2 which is used to represent and manage Collections and it contains:

  1. Interfaces
  2. Classes
  3. Algorithms

This framework also defines map interfaces and several classes in addition to Collections.

Advantages:

  • High performance
  • Reduces developer's effort
  • Unified architecture which has common methods for all objects.
CollectionDescription
SetSet is a collection of elements which can not contain duplicate values. Set is implemented in HashSets, LinkedHashSets, TreeSet etc
ListList is a ordered collection of elements which can have duplicates. Lists are classified into ArrayList, LinkedList, Vectors
QueueFIFO approach, while instantiating Queue interface you can either choose LinkedList or PriorityQueue.
DequeDeque(Double Ended Queue) is used to add or remove elements from both the ends of the Queue(both head and tail)
MapMap contains key-values pairs which don't have any duplicates. Map is implemented in HashMap, TreeMap etc.

An array is called balanced if it's even numbered elements (a[0], a[2], etc.) are even and its odd numbered elements (a[1], a[3],etc.) are Odd. Write a function named is Balanced that accepts an array of integers and returns 1 if the array is balanced otherwise it returns 0.


 ..

/**
* * An array is called balanced if its even numbered elements (a[0], a[2], etc.) are even and its odd
* * numbered elements (a[1], a[3], etc.) are odd.
* *
* * Write a function named isBalanced that accepts an array of integers and returns 1 if the array is
* * balanced, otherwise it returns 0.
* *
* * Examples: {2, 3, 6, 7} is balanced since a[0] and a[2] are even, a[1] and a[3] are odd. {6, 7, 2, 3, 12}
* * is balanced since a[0], a[2] and a[4] are even, a[1] and a[3] are odd.
* * {7, 15, 2, 3} is not balanced since a[0] is odd.
* * {16, 6, 2, 3} is not balanced since a[1] is even.
* *
* * If you are programming in Java, the function signature is
* * int isBalanced(int[ ] a)
*/

..

public class Balanced {


    public static void main(String[] args) {


        int[] arrayOfNumbers = {2, 3, 6, 7};

          //      int[] arrayOfNumbers = {6, 7, 2, 3, 12};

        //     int[] arrayOfNumbers = {7, 15, 2, 3};

        //     int[] arrayOfNumbers = {16, 6, 2, 3};


        System.out.println(isbalanced(arrayOfNumbers));


    }


    public static int isbalanced(int[] a) {

        int i, j;

        for (i = 0; i < a.length; i = i + 2) {

            if (a[i] % 2 != 0) {

                return 0;

            }

        }


        for (j = 1; j < a.length; j = j + 2) {

            if (a[j] % 2 == 0) {

                return 0;

            }

        }

        return 1;


    }

}



https://github.com/bijay-shrestha/practice/blob/master/src/main/java/com/basic/practice/Balanced.java

/*An array is called balanced if its even numbered elements (a[0], a[2], etc.) are even and its  odd numbered elements (a[1], a[3], etc.) are odd.  Write a function named isBalanced that accepts an array of integers and returns 1 if the array is balanced, otherwise it returns 0. Examples:  {2, 3, 6, 7} is balanced since a[0] and a[2] are even, a[1] and a[3] are odd. {6, 7, 2, 3, 12} is balanced since a[0], a[2] and a[4] are even, a[1] and a[3] are odd. {7, 15, 2, 3} is not balanced since a[0] is odd. {16, 6, 2, 3} is not balanced since a[1] is even.

If you are programming in Java or C#, the function signature is  

int isBalanced(int[ ] a)

If you are programming in C or C++, the function signature is  

int isBalanced(int a[ ], int len) 

where len is the number of elements in the array.   */


public class HelloWorld {

   public static void main(String []args){

       int[] arr={7, 15, 2, 3} ;

        int result=isbalanced(arr);

        System.out.println("isbalanced->"+result);

         

     }

    public static int isbalanced(int[] a)

     {int i,j;

      for(i=0;i<a.length;i=i+2)

      {

          if(a[i]%2!=0)

          {

              return 0;

          }

      }

      

      for(j=1;j<a.length;j=j+2)

      {

          if(a[j]%2==0)

          {

              return 0;

          }

      }

      return 1;

   

         }

     }

https://onecompiler.com/java/3wzmwmh46

Question :
A balanced array is defined to be an array where for every value n in the array, -n also is in the array. For example {-2, 3, 2, -3} is a balanced array. So is {-2, 2, 2, 2}. But {-5, 2, -2} is not because 5 is not in the array.
Write a function named isBalanced that returns 1 if its array argument is a balanced array. Otherwise it returns 0.
If you are programming in Java or C#, the function signature is
int isBalanced (int [ ] a);
If you are programming in C or C++, the function signature is


int isBalanced(int a[ ], int len) where len is the number of elements in the array.
Solution :
public static int isBalanced(int [] a)
        {
            int isBalanced = 1;
            for(int i=0;i<a.Length;i++)
            {
                int isValid = 0;
                for(int j=0;j<a.Length;j++)
                {
                    if(a[i]==-a[j])
                    {
                        isValid = 1;
                        break;
                    }
                }
                if (isValid==0)
                    isBalanced = 0;
            }
            return isBalanced;
        }

..

A non-empty array A of length n is called on array of all possibilities if it contains all numbers between 0 and A.length-1 inclusive. Write a method named isAllPossibilities that accepts an integer array and returns 1 if the array is an array of all possiblities, otherwise it returns 0.

 

/**
* * A non-empty array a of length n is called an array of all possiblities if it contains all numbers between 0
* * and a.length-1 inclusive.
* *
* * Write a method named isAllPossibilities that accepts an integer array and returns 1 if
* * the array is an array of all possiblities, otherwise it returns 0.
* *
* * If you are programming in Java or C#, the function signature is
* * int isAllPossibilities(int[ ] a)
* *
* * If the input array is return
* *
* * {1, 2, 0, 3} 1
* * {3, 2, 1, 0} 1
* * {1, 2, 4, 3} 0 (because 0 not included and 4 is too big)
* * {0, 2, 3} 0 (because 1 is not included)
* * {0} 1
* * {} 0
*/
Question :
A non-empty array a of length n is called an array of all possiblities if it contains all numbers between 0 and a.length-1 inclusive. Write a method named isAllPossibilities that accepts an integer array and returns 1 if the array is an array of all possiblities, otherwise it returns 0.
If you are programming in Java or C#, the function signature is
int isAllPossibilities(int[ ] a)
If you are programming in C or C++, the function signature is
int isAllPossibilities(int a[ ], int len) where len is the number of elements in the array
Examples
If the input array is
return
{1, 2, 0, 3}
1
{3, 2, 1, 0}
1
{1, 2, 4, 3}
0 (because 0 not included and 4 is too big)
{0, 2, 3}
0 (because 1 is not included)
{0}
1
{}
0

public static int allPossibilities(int[] a)
        {
            bool isNice = true, step = false;
            int i, j, x, y;
            for (i = 0; i < a.Length; i++)
            {
                step = false;
                for (j = 0; j < a.Length; j++)
                {
                    if (a[i] == j)
                        step = true;
                }
                if (j == a.Length && step == false)
                {
                    isNice = false;
                    break;
                }
            }
            return isNice == true ? 1 : 0;
        }


_________________________________________

solution is not easy to understand.

for any one interested try this

public static int isAllPossibilities(int[] a){
if(a.length < 1){
return 0;
}
else{
for(int i = 0; i < a.length; i++){
boolean iIsInSide = false;

for(int j : a){
if( i == j){
iIsInSide = true;
break;
}
}

if(!iIsInSide){
return 0;
}
}

return 1;
}
}
_________________________________________

//Java

public class allPossibilitiesDemo { 
    public static int allPossibilities(int[] a)
        {
            Boolean isNice = true, step = false;
            int i, j, x, y;
            for (i = 0; i < a.length; i++)
            {
                step = false;
                for (j = 0; j < a.length; j++)
                {
                    if (a[i] == j)
                        step = true;
                }
                if (j == a.length && step == false)
                {
                    isNice = false;
                    break;
                }
            }
            return isNice == true ? 1 : 0;
        }
    
    public static void main(String[] args) {
        System.out.println(allPossibilities(new int[]{1, 2, 0, 3}));
        System.out.println(allPossibilities(new int[]{3, 2, 1, 0}));
        System.out.println(allPossibilities(new int[]{1, 2, 4, 3}));
        System.out.println(allPossibilities(new int[]{0, 2, 3}));
        System.out.println(allPossibilities(new int[]{0}));
        System.out.println(allPossibilities(new int[]{}));
    }
}

_________________________________________

https://github.com/sachinkeshav/JavaExam/blob/master/src/com/knight/exam/java/allPossibilities/AllPossibilitiesArray.java

https://gist.github.com/bijay-shrestha/cb13986207bc1a9f2bb2ccef94fa6070

CORBA Java Tutorial using Netbeans and Java 8.

CORBA-Example A simple CORBA implementation using Java Echo.idl module EchoApp{ interface Echo{ string echoString(); }; }; ...