RAID 0 and RAID 1 JAVA Implementation

RAID has seven levels.It stands for Redundand Array Of Independent Disk.The code in JAVA gives the implementation of RAID 0 followed by a seperate code for RAID 1
// Aim:To implement RAID 0 in java import java.util.*; import java.io.*; class raid0 { public static void main(String args[]) throws Exception { Scanner scr=new Scanner(System.in); InputStreamReader isr=new InputStreamReader(System.in); BufferedReader br=new BufferedReader(isr); char r[][]=new char[4][4]; System.out.println("RAID 0 Non-redundant"); System.out.println("Enter 16 characters or numbers"); String s=scr.nextLine(); int c=0; for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { r[i][j]=s.charAt(c); c=c+2; } } int choice=0; do { System.out.println("Enter your choice: 1.display 2.update 3.delete 4.exit"); choice=scr.nextInt(); switch(choice) { case 1: System.out.println("Disk0\tDisk1\tDisk2\tDisk3"); for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { System.out.print(r[i][j]+"\t"); } System.out.println(); } break; case 2: int pos=0; String s1; char val; System.out.println("Enter position to be updated(start pos=0) "); pos=scr.nextInt(); System.out.println("Enter value to be inserted "); s1=br.readLine(); val=s1.charAt(0); int count=0; for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { if(count==pos) { r[i][j]=val; } ++count; } } System.out.println("Value at position "+pos+" has been updated"); break; case 3: System.out.println("Enter position to be deleted(start pos=0) "); int pos1=scr.nextInt(); int count1=0; for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { if(count1==pos1) { r[i][j]=' '; } ++count1; } } System.out.println("Value at position "+pos1+" has been deleted."); break; } } while(choice!=4); } } /* OUTPUT C:\Users\Aditya\Desktop\aditya>java raid0 RAID 0 Non-redundant Enter 16 characters or numbers 1 2 3 a b c 4 5 6 d e f 7 8 9 g Enter your choice: 1.display 2.update 3.delete 4.exit 1 Disk0 Disk1 Disk2 Disk3 1 2 3 a b c 4 5 6 d e f 7 8 9 g Enter your choice: 1.display 2.update 3.delete 4.exit 2 Enter position to be updated(start pos=0) 4 Enter value to be inserted T Value at position 4 has been updated Enter your choice: 1.display 2.update 3.delete 4.exit 1 Disk0 Disk1 Disk2 Disk3 1 2 3 a T c 4 5 6 d e f 7 8 9 g Enter your choice: 1.display 2.update 3.delete 4.exit 3 Enter position to be deleted(start pos=0) 12 Value at position 12 has been deleted. Enter your choice: 1.display 2.update 3.delete 4.exit 1 Disk0 Disk1 Disk2 Disk3 1 2 3 a T c 4 5 6 d e f 8 9 g Enter your choice: 1.display 2.update 3.delete 4.exit 4 */ // Aim:To implement RAID 1 in java import java.util.*; import java.io.*; class raid1 { public static void main(String args[]) throws Exception { Scanner scr=new Scanner(System.in); InputStreamReader isr=new InputStreamReader(System.in); BufferedReader br=new BufferedReader(isr); char r1[][]=new char[4][4]; char r2[][]=new char[4][4]; System.out.println("RAID 1 Mirrored"); System.out.println("Enter 16 characters or numbers"); String s=scr.nextLine(); int c=0; for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { r1[i][j]=s.charAt(c); r2[i][j]=r1[i][j]; c=c+2; } } int choice=0; do { System.out.println("Enter your choice: 1.display 2.update 3.delete 4.exit"); choice=scr.nextInt(); switch(choice) { case 1: System.out.println("Disk0\tDisk1\tDisk2\tDisk3\t\tMD0\tMD1\tMD2\tMD3"); for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { System.out.print(r1[i][j]+"\t"); } System.out.print("|\t"); for(int j=0;j<4;++j) { System.out.print(r2[i][j]+"\t"); } System.out.println(); } break; case 2: int pos=0; String s1; char val; System.out.println("Enter position to be updated(start pos=0) "); pos=scr.nextInt(); System.out.println("Enter value to be inserted "); s1=br.readLine(); val=s1.charAt(0); int count=0; for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { if(count==pos) { r1[i][j]=val; r2[i][j]=val; } ++count; } } System.out.println("Value at position "+pos+" has been updated"); break; case 3: System.out.println("Enter position to be deleted(start pos=0) "); int pos1=scr.nextInt(); int count1=0; for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { if(count1==pos1) { r1[i][j]=' '; r2[i][j]=' '; } ++count1; } } System.out.println("Value at position "+pos1+" has been deleted."); break; } } while(choice!=4); } } /*OUTPUT C:\Users\Aditya\Desktop\aditya>java raid1 RAID 1 Mirrored Enter 16 characters or numbers 1 2 3 4 5 6 7 8 9 a b c d e f g Enter your choice: 1.display 2.update 3.delete 4.exit 1 Disk0 Disk1 Disk2 Disk3 MD0 MD1 MD2 MD3 1 2 3 4 | 1 2 3 4 5 6 7 8 | 5 6 7 8 9 a b c | 9 a b c d e f g | d e f g Enter your choice: 1.display 2.update 3.delete 4.exit 2 Enter position to be updated(start pos=0) 4 Enter value to be inserted R Value at position 4 has been updated Enter your choice: 1.display 2.update 3.delete 4.exit 1 Disk0 Disk1 Disk2 Disk3 MD0 MD1 MD2 MD3 1 2 3 4 | 1 2 3 4 R 6 7 8 | R 6 7 8 9 a b c | 9 a b c d e f g | d e f g Enter your choice: 1.display 2.update 3.delete 4.exit 3 Enter position to be deleted(start pos=0) 12 Value at position 12 has been deleted. Enter your choice: 1.display 2.update 3.delete 4.exit 1 Disk0 Disk1 Disk2 Disk3 MD0 MD1 MD2 MD3 1 2 3 4 | 1 2 3 4 R 6 7 8 | R 6 7 8 9 a b c | 9 a b c e f g | e f g Enter your choice: 1.display 2.update 3.delete 4.exit 4 */

VIEW OUR SPECIAL PAGE FOR SEM 7 STUDENTS -  sem 6 java codes