Skip to main content

Use of setPriority method of Thread Class in java


import java.io.*;

class A extends Thread
{ public void run()
   { System.out.println("Thread A started");
      for(int i=5;i>0;i--)
      { System.out.println(i);
       }
    }
}

class B extends Thread
{ public void run()
   { System.out.println("Thread B started");
      for(int i=5;i>0;i--)
      { System.out.println(i);
      }
    }
}

class C extends Thread
{ public void run()
   { System.out.println("Thread C started");
      for(int i=5;i>0;i--)
      { System.out.println(i); }
    }
}

class thread3
{ public static void main(String args[])
   { A thread_a=new A();
      B thread_b=new B();
      C thread_c=new C();

      thread_c.setPriority(Thread.MAX_PRIORITY);
      thread_b.setPriority(thread_a.MAX_PRIORITY);
      thread_a.setPriority(Thread.MIN_PRIORITY);

      System.out.println("Thread A");
      thread_a.start();

      System.out.println("Thread B");
      thread_b.start();

      System.out.println("Thread C");
      thread_c.start();
     
      System.out.println("End of Main Thread");
   }
}
 

Comments

Popular posts from this blog

Use Case Diagram for Online Book Store

Online Movie Ticket Booking Sequence Diagram

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};