Manvith Reddy Dayam 
My experience
The classes in RIT have really made me better. The code examples we had for every concept made me learn so much. The exams and the homeworks were also good.
Contact me for the git repo
Check out my notes for this class on Notion https://marmalade-horn-388.notion.site/CS605-published-111127a6b72580229712e4b7223dda4a?pvs=4
Here is an interesting example from the Threads lecture…
Dining Philosophers Problem
In this code, the philosophers represent individual threads, and the forks represent shared resources (synchronized using synchronized blocks on the left and right chopsticks). The goal of each philosopher is to “think” and then “eat,” but they need two forks (chopsticks) to eat.
package threads.threads2;
// will this cause a deadlock?
import java.util.Random;
import java.util.Vector;
public class Philosopher extends Thread {
protected static Random random = new Random(); // randomize
protected int me; // number for trace
protected Integer left, right; // my chopsticks
public Philosopher (int me, Integer left, Integer right) {
this.me = me;
this.left = left;
this.right = right;
}
// philosopher's behavior: thinks and eat 5 times
public void run () {
while ( true ) {
System.out.println(me+" thinks");
try { Thread.sleep((long)(random.nextFloat()*1000)); } catch(Exception e) { }
if ( me != 4 ) {
synchronized ( right ) {
System.out.println("\t" + me + " takes right fork");
synchronized ( left ) {
System.out.println("\t\t" + me + " takes left fork");
try {
Thread.sleep((long)(random.nextFloat()*1000)); } catch(Exception e) { }
}
}
} else {
synchronized ( left ) {
System.out.println("\t" + me + " takes left fork");
synchronized ( right ) {
System.out.println("\t" + me + " takes right fork");
System.out.println("\t\t" + me + " eats");
try {
Thread.sleep((long)(random.nextFloat()*1000)); } catch(Exception e) { }
}
}
}
}
}
public static void main (String args []) {
Integer forks[] = new Integer[5];
for (int n = 0; n <= 3; ++ n)
forks[n] = new Integer(n);
Philosopher thePhilosophers[] = new Philosopher[4];
thePhilosophers[0] = new Philosopher(0, forks[3], forks[0]); // backwards
for (int n = 1; n <= 3; ++ n)
thePhilosophers[n] = new Philosopher(n, forks[n-1], forks[n]);
for (int n = 0; n < 4; ++ n) thePhilosophers[n].start();
}
}
```