Skip to main content

Print odd even number using 2 threads

 


So we have 2 thread, one will be printing odd numbers and others will be printing even number. We have to print them in a synchronized fashion. 


class Lock {

    Boolean isOdd;

    Lock(Boolean odd) {

        this.isOdd = odd;

    }

    synchronized void print(Integer number) {

        Boolean numberEven = number %2 == 0;

        while (isOdd == numberEven) {

            try {

                wait();

            } catch( InterruptedException e) {

               Thread.currentThread().interrupt();

            }

        }

        System.out.println(number);

        isOdd = !isOdd;

        notify();

    }

}


class PrintThread extends Thread{


  Integer limit; 

  Integer value;

  Lock lock;

  PrintThread( Integer start,Integer limit, Lock lock) {

     this.value = start;

     this.limit = limit;

this.lock = lock;

  } 

  

  public void run() {

   while( value < limit ) {

           lock.print(value);

   value +=2;

   

    }

  }

}


public class Test {

 static public void main(String args[]) {

 

    Lock lock = new Lock(false);

PrintThread oddThread = new PrintThread(1,10, lock);

PrintThread evenThread = new PrintThread(0,10, lock);

evenThread.start();

oddThread.start();

  }

}

Comments

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part

DEShaw Interview Questions

ther are N numbers frm 1 to N and starting from index 1 we will keep deleting every alternate going in cyclic order with array. Only one element will be left at the end. Tell us the index of element in array we started. e.g. there are 5 nums 1 2 3 4 5 then after 1st iteration 1 3 5 will be remained. .. then 1 will be next to be elliminated and then 5 3 will remain alone... give sum efficient algorithm to calculate which numer will remain at the end Answer: 2*(n-2^p)+1 where p=floor(log2 n)

[Tree]..Is parent or grandparent?

There are two nodes given in a tree(not binary tree). Find whether one node is parent/grand parent of other. order should be O(1). tag root as 0 , tag left child as 00 , right child as 01. left child's left child as 000 , left's child's right child as 001 ... and so on. now let input be tags t1 and t2 if( (t1 == (t2>>1)) || (t2==(t1>>1))) return child parent relationship if( (t1 == (t2>>2)) || (t2==(t1>>2))) return child grand-parent relationship ... This solution can take a lot of space as the three grows. We can tag the node by number .. Root -0 1 -2-3-4 SO given two node get their tags.. Get Max of both t1, t2. Go for parent of that node if other node then return or check for parent of parent and check again for other node. With 2^32 value avaialable for indexing ..u wont run out of values.