Raks-coder
diff --git a/‎FAT-Practice/.idea/workspace.xml
Lines changed: 44 additions & 30 deletions b/‎FAT-Practice/.idea/workspace.xml
Lines changed: 44 additions & 30 deletions
diff --git a/‎FAT-Practice/out/production/FAT-Practice/Attendance.class
1.45 KB b/‎FAT-Practice/out/production/FAT-Practice/Attendance.class
1.45 KB
diff --git a/‎FAT-Practice/out/production/FAT-Practice/VITHonors.class
1.73 KB b/‎FAT-Practice/out/production/FAT-Practice/VITHonors.class
1.73 KB
diff --git a/‎FAT-Practice/out/production/FAT-Practice/count.class
411 Bytes b/‎FAT-Practice/out/production/FAT-Practice/count.class
411 Bytes
diff --git a/‎FAT-Practice/src/VITHonors.java
Lines changed: 54 additions & 0 deletions b/‎FAT-Practice/src/VITHonors.java
Lines changed: 54 additions & 0 deletions
diff --git a/‎README.md
Lines changed: 2 additions & 0 deletions b/‎README.md
Lines changed: 2 additions & 0 deletions
@@ -0,0 +1,54 @@
+import java.util.Vector;
+
+class Attendance{
+    static int winners = 0;
+    static Vector<Integer> arr = new Vector<>();
+
+    static synchronized void counting(int n){
+        System.out.println(Thread.currentThread().getName() + " is counting");
+        for(int i = n-1000; i < n; i++){
+            if(arr.get(i) == 100)
+                winners++;
+        }
+    }
+}
+
+class count extends Thread{
+    int n;
+
+    count(int n){
+        this.n = n;
+    }
+    public void run(){
+        Attendance.counting(n);
+    }
+}
+
+public class VITHonors {
+    public static void main(String[] args) {
+
+        int max = 100;
+        int min = 75;
+
+        for(int i = 0; i < 2000; i++){
+            int n = (int)(Math.random() * ((max - min) + 1) + min);
+            Attendance.arr.add(n);
+        }
+
+        Thread t1 = new count(1000);
+        Thread t2 = new count(2000);
+        t1.start();
+        t2.start();
+
+        try{
+            t1.join();
+            t2.join();
+        }catch(InterruptedException e){
+            System.out.println(e);
+        }
+
+        System.out.println(Attendance.arr);
+        System.out.println("Winners are = " + Attendance.winners);
+
+    }
+}
@@ -211,6 +211,8 @@ previous numbers, i.e., `T(n)=T(n-1)+T(n-2)+T(n-3), T(1)=T(2)=1, and T(3)=2`). [
     * Define a package ‘Package1’ with the class ‘NumberManipulation’ which contains an integer array (size 9) as its instance variable and two methods `extractDigits( )` and `findLastDigit( )`. The `extractDigits( )` method must take an integer number as argument and extract the individual digits of the number and store them in the 9-element integer array. The method `findLastDigit( )` should find out the 10th digit using the above formula and return it. [NumberManipulation.java](https://github.com/jacobjohn2016/Java-Programming/blob/master/FAT-Practice/src/Package1/NumberManipulation.java)
     * Define a main class outside of the package created above and read the 9-digit number as a String. Throw a user defined exception "InvalidInputException" if the length of the input String is not exactly 9 digits and prompt the user to enter the input again. If valid, convert the input into integer and pass it to the method `extractDigits( )` and also invoke `findLastDigit( )` method which would return the last digit. If the last digit is 10, append ‘X’ to the original string else append the digit itself’ and display the ISBN number. [ISBN.java](https://github.com/jacobjohn2016/Java-Programming/blob/master/FAT-Practice/src/ISBN.java)
 
+19. VIT honors its employees with 100% attendance in an academic year with a certificate of appreciation. Assume there are 2000 employees. Create an array to store their attendance percentage. The array can be populated with random numbers. Create two threads so that thread1 determines the total count of employees eligible for certificate in the first half of the array and thread2 in second half of the array. The main( ) has to wait till both the threads complete their task and arrive at a final count indicating the total number of employees eligible for the certificate of appreciation.
+
 ## Contributions
 * Initial Author - [jacobjohn2016](github.com/jacobjohn2016)
 * [varunreddy24](github.com/varunreddy24)