Create RandomGenerator.java

 


Create RandomGenerator.java


import java.util.*;

class RandomGenerator extends Thread { 

public String tname; 

public Random r;


public Thread t1, t2; 

public RandomGenerator(String s)

{

 tname = s;

}


public void run()

{

 int num = 0;

 r = new Random();

try

{


for (int i = 0; i< 50; i++)

{

num = r.nextInt(100);


System.out.println("Main Thread and Generated Number is " + num); 

if (num % 2 == 0)

{

 t1 = new Thread(new Even(num)); 

 t1.start(); 

}

else

{

 t2 = new Thread(new Odd(num));

 t2.start();

}


Thread.sleep(1000); 

System.out.println ("--------------------------------------------");

}

}

catch (Exception ex)

{

 System.out.println(ex.getMessage());

}

}

}











public class Mthread

{

public static void main(String[] args)

{

 RandomGenerator a = new RandomGenerator("One");

 a.start();

}

}








import java.util.*;


class Even implements Runnable

{

public int x;


public Even(int x)

{

this.x = x;


}

public void run()

{


System.out.println("Thread Name:Even Thread and " + x + "is even Number and Square of " + x + " is: " + x * x);


}

}


class Odd implements Runnable

{

public int x;


public Odd(int x)

{

this.x = x;


}

public void run()

{

System.out.println("Thread Name:ODD Thread and " + x + " is odd number and Cube of " + x 

+ " is: " + x * x * x);


}

}



Comments

Post a Comment

Popular posts from this blog

Create and Insert data in circular linked list

  #include <stdio.h> #include <stdlib.h> // Create a node struct Node {   int data;   struct Node* next; }; // Insert at the beginning void insertAtBeginning(struct Node** head_ref, int new_data) {   // Allocate memory to a node   struct Node* new_node = (struct Node*)malloc(sizeof(struct Node));   // insert the data   new_node->data = new_data;   new_node->next = (*head_ref);   // Move head to new node   (*head_ref) = new_node; } // Insert a node after a node void insertAfter(struct Node* prev_node, int new_data) {   if (prev_node == NULL) {   printf("the given previous node cannot be NULL");   return;   }   struct Node* new_node = (struct Node*)malloc(sizeof(struct Node));   new_node->data = new_data;   new_node->next = prev_node->next;   prev_node->next = new_node; } // Insert the the end void insertAtEnd(struct Node** head_ref, int new_data) {   struct Node* n...
Read more

Week2

 abstract class Shape { public int x, y; public abstract void printArea(); } class Rectangle extends Shape { public void printArea() { System.out.println("Area of Rectangle is " + x * y); } } class Triangle extends Shape { public void printArea() { System.out.println("Area of Triangle is " + (x * y) / 2); } } class Circle extends Shape { public void printArea() { System.out.println("Area of Circle is " + (22 * x * x) / 7); } } public class Abstex { public static void main(String[] args) { Rectangle r = new Rectangle (); r.x = 10; r.y = 20; r.printArea(); System.out.println(" "); Triangle t = new Triangle(); t.x =30; t.y =35; t.printArea(); System.out.println(" "); Circle c = new Circle(); c.x = 2; c.printArea(); System.out.println(" "); } }
Read more

Week13

 import java.io.File;   public class DisplayFileExample   {   public void printFileNames(File[] a, int i, int lvl)   {   // base case of the recursion   // i == a.length means the directory has    // no more files. Hence, the recursion has to stop   if(i == a.length)   {   return;   }   // checking if the encountered object is a file or not   if(a[i].isFile())   {   System.out.println(a[i].getName());   }   // recursively printing files from the directory   // i + 1 means look for the next file   printFileNames...
Read more