From 5156a384159173f66f66b9e4e6962537fc38cb65 Mon Sep 17 00:00:00 2001 From: Vishal Karanjekar <119437719+vsk03116@users.noreply.github.com> Date: Mon, 6 Feb 2023 11:10:51 +0530 Subject: [PATCH 01/10] Create vishal_karanjekar_Java_DSA_codes --- vishal_karanjekar_Java_DSA_codes | 1 + 1 file changed, 1 insertion(+) create mode 100644 vishal_karanjekar_Java_DSA_codes diff --git a/vishal_karanjekar_Java_DSA_codes b/vishal_karanjekar_Java_DSA_codes new file mode 100644 index 0000000..8b13789 --- /dev/null +++ b/vishal_karanjekar_Java_DSA_codes @@ -0,0 +1 @@ + From 9b883dd32790e198f1720806ead5fb0f20c6ab79 Mon Sep 17 00:00:00 2001 From: Vishal Karanjekar <119437719+vsk03116@users.noreply.github.com> Date: Mon, 6 Feb 2023 11:51:04 +0530 Subject: [PATCH 02/10] Update vishal_karanjekar_Java_DSA_codes --- vishal_karanjekar_Java_DSA_codes | 40 ++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) diff --git a/vishal_karanjekar_Java_DSA_codes b/vishal_karanjekar_Java_DSA_codes index 8b13789..089df09 100644 --- a/vishal_karanjekar_Java_DSA_codes +++ b/vishal_karanjekar_Java_DSA_codes @@ -1 +1,41 @@ +//lecture 5 (DSA) source code(vishal_karanjekar) +//priority queue +import java.util.PriorityQueue; +import java.util.Iterator; + + class myPriorityQueue{ + public static void main(String[] args){ + PriorityQueue pq = new PriorityQueue(); + System.out.println("is PQ empty: "+ pq.isEmpty()); + + + PriorityQueue pq1 = new PriorityQueue(); + + pq.add(10); + pq1.add(10); + + pq.add(5); + pq1.add(5); + + pq.add(100); + pq1.add(100); + + Iterator pqIter= pq.iterator(); + Iterator pq1Iter= pq1.iterator(); + + System.out.println("pq Priority Queue"); + + while(pqIter.hasNext()){ + System.out.println(pqIter.next()); + + } + + System.out.println("pq1 Priority Queue"); + + while(pq1Iter.hasNext()){ + System.out.println(pq1Iter.next()); + + } + } +} From 0a10ed605c257c1bdfb02c1e13dc5375d1019c07 Mon Sep 17 00:00:00 2001 From: Vishal Karanjekar <119437719+vsk03116@users.noreply.github.com> Date: Tue, 7 Feb 2023 15:31:26 +0530 Subject: [PATCH 03/10] Update vishal_karanjekar_Java_DSA_codes --- vishal_karanjekar_Java_DSA_codes | 50 ++++++++++++++++++++++++++++++++ 1 file changed, 50 insertions(+) diff --git a/vishal_karanjekar_Java_DSA_codes b/vishal_karanjekar_Java_DSA_codes index 089df09..b97baa3 100644 --- a/vishal_karanjekar_Java_DSA_codes +++ b/vishal_karanjekar_Java_DSA_codes @@ -39,3 +39,53 @@ import java.util.Iterator; } } } + + + +// lecture 6 (DSA) source code(vishal_karanjekar) +//ArrayList using parallel processing using Spliterator + +import java.util.ArrayList; +import java.util.Spliterator; + +public class MySpliteratorTest{ + + public static void main(String[] args){ + + ArrayList fbPosts =new ArrayList(); + + fbPosts.add("post1"); + fbPosts.add("post2"); + fbPosts.add("post3"); + fbPosts.add("post4"); + fbPosts.add("post5"); + fbPosts.add("post6"); + + //Parrallely process the List using Spliterator + + Spliterator splIterator =fbPosts.spliterator(); + Spliterator splIterator2 = splIterator.trySplit(); + + + System.out.println("spl1 Estimated size of data: " + splIterator.estimateSize()); + System.out.println("spl1 Exact size: "+ splIterator.getExactSizeIfKnown()); + + splIterator.forEachRemaining(System.out::println); + + System.out.println("spl1 Estimated size of data: " + splIterator.estimateSize()); + System.out.println("spl1 Exact size: "+ splIterator.getExactSizeIfKnown()); + + + + System.out.println("spl2 Estimated size of data: " + splIterator2.estimateSize()); + System.out.println("spl2 Exact size: "+ splIterator2.getExactSizeIfKnown()); + + splIterator2.forEachRemaining(System.out::println); + + System.out.println("spl2 Estimated size of data: " + splIterator2.estimateSize()); + System.out.println("spl2 Exact size: "+ splIterator2.getExactSizeIfKnown()); + + + } + +} From 36e436911822ffd14543957617f775957d14aa47 Mon Sep 17 00:00:00 2001 From: Vishal Karanjekar <119437719+vsk03116@users.noreply.github.com> Date: Tue, 7 Feb 2023 15:51:30 +0530 Subject: [PATCH 04/10] Update vishal_karanjekar_Java_DSA_codes --- vishal_karanjekar_Java_DSA_codes | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/vishal_karanjekar_Java_DSA_codes b/vishal_karanjekar_Java_DSA_codes index b97baa3..ad8508a 100644 --- a/vishal_karanjekar_Java_DSA_codes +++ b/vishal_karanjekar_Java_DSA_codes @@ -89,3 +89,29 @@ public class MySpliteratorTest{ } } + + +// lecture 7 (DSA) source code(vishal_karanjekar) +//ArrayList to Array + +import java.util.ArrayList; + +public class ToArrayTest{ + + public static void main(String[] args){ + + ArrayList partyGuests =new ArrayList(); + + partyGuests.add("Vishal"); + partyGuests.add("Ramesh"); + partyGuests.add("Harsh"); + partyGuests.add("Rohan"); + + Object[] arrayGuests = partyGuests.toArray(); + + System.out.println("Elements at Index O for array: " + arrayGuests[0]); + System.out.println("Hashcode of the array: " + arrayGuests.hashCode()); + + } + +} From 44c18b80171a9f9dbc1c15613fe0e8a5f7f5f3ae Mon Sep 17 00:00:00 2001 From: Vishal Karanjekar <119437719+vsk03116@users.noreply.github.com> Date: Wed, 8 Feb 2023 16:33:42 +0530 Subject: [PATCH 05/10] Update vishal_karanjekar_Java_DSA_codes --- vishal_karanjekar_Java_DSA_codes | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/vishal_karanjekar_Java_DSA_codes b/vishal_karanjekar_Java_DSA_codes index ad8508a..037e842 100644 --- a/vishal_karanjekar_Java_DSA_codes +++ b/vishal_karanjekar_Java_DSA_codes @@ -115,3 +115,28 @@ public class ToArrayTest{ } } + + + +// lecture 8 (DSA) sorce code (vishal_karanjekar) +//binary tree + +public class BinaryTree{ + public static void main(String[] args){ + Node node=new Node(10); + node.left=new Node(4); + node.right=new Node(5); + + + } + + static class Node{ + int value;//The value or data to be stored in the node + Node left,right; //Pointers to the left and right node + Node(int value){ + this.value=value; + left=null; + right=null; + } + } +} From e115119f2da8cada48b0dea57b1c70712f791375 Mon Sep 17 00:00:00 2001 From: Vishal Karanjekar <119437719+vsk03116@users.noreply.github.com> Date: Thu, 9 Feb 2023 12:42:37 +0530 Subject: [PATCH 06/10] Update vishal_karanjekar_Java_DSA_codes --- vishal_karanjekar_Java_DSA_codes | 66 ++++++++++++++++++++++++++++++++ 1 file changed, 66 insertions(+) diff --git a/vishal_karanjekar_Java_DSA_codes b/vishal_karanjekar_Java_DSA_codes index 037e842..67670a5 100644 --- a/vishal_karanjekar_Java_DSA_codes +++ b/vishal_karanjekar_Java_DSA_codes @@ -140,3 +140,69 @@ public class BinaryTree{ } } } + + + +// lecture 9 (DSA) sorce code (vishal_karanjekar) +//Tree in java + + public class MyTreeTest{ + public static void main(String[] args){ + Tree tree =new Tree(); + Tree.Node root=new Tree.Node(5); + + tree.insert(root,2); + tree.insert(root,4); + tree.insert(root,6); + tree.insert(root,7); + tree.insert(root,3); + tree.insert(root,9); + System.out.println("Traverse the tree"); + tree.traverseInOrder(root); + } + + + public static class Tree{ + static class Node{ + int value; + Node left ,right; + + Node(int value){ + this.value=value; + left=null; + right=null; + } + } + + public void insert(Node node,int value){ + if(valuenode.value){ + if(node.right!=null){ + insert(node.right,value); + } + else{ + node.right= new Node(value); + System.out.println("Inserted " +value + "to the right of " + node.value); + } + } + } + + public void traverseInOrder(Node node){ + if(node!=null){ + traverseInOrder(node.left); + System.out.println(" " +node.value); + traverseInOrder(node.right); + + } + } + } +} + + From 4afb538941919fbc81f27fe79f75c20b2610cdd6 Mon Sep 17 00:00:00 2001 From: Vishal Karanjekar <119437719+vsk03116@users.noreply.github.com> Date: Fri, 10 Feb 2023 12:34:02 +0530 Subject: [PATCH 07/10] Update vishal_karanjekar_Java_DSA_codes --- vishal_karanjekar_Java_DSA_codes | 77 ++++++++++++++++++++++++++++++++ 1 file changed, 77 insertions(+) diff --git a/vishal_karanjekar_Java_DSA_codes b/vishal_karanjekar_Java_DSA_codes index 67670a5..67c8df6 100644 --- a/vishal_karanjekar_Java_DSA_codes +++ b/vishal_karanjekar_Java_DSA_codes @@ -206,3 +206,80 @@ public class BinaryTree{ } + + +//lecture 10 (DSA) source code(vishal_karanjekar) + //preorder and postorder traversal in tree + + + public class MyTreeTest{ + public static void main(String[] args){ + Tree tree =new Tree(); + Tree.Node root=new Tree.Node(5); + + tree.insert(root,2); + tree.insert(root,4); + tree.insert(root,6); + tree.insert(root,7); + tree.insert(root,3); + tree.insert(root,9); + System.out.println("preorder: "); + tree.traversePreOrder(root); + + System.out.println("postorder: "); + tree.traversePostOrder(root); + } + + + public static class Tree{ + static class Node{ + int value; + Node left ,right; + + Node(int value){ + this.value=value; + left=null; + right=null; + } + } + + public void insert(Node node,int value){ + if(valuenode.value){ + if(node.right!=null){ + insert(node.right,value); + } + else{ + node.right= new Node(value); + System.out.println("Inserted " +value + " to the right of " + node.value); + } + } + } + + public void traversePreOrder(Node node){ + if(node!=null){ + System.out.println(" " +node.value); + traversePreOrder(node.left); + traversePreOrder(node.right); + + } + } + + + + public void traversePostOrder(Node node){ + if(node!=null){ + traversePostOrder(node.left); + traversePostOrder(node.right); + System.out.println(" " +node.value); + } + } + } +} From c265947f7230acd729109101ec640235b6472136 Mon Sep 17 00:00:00 2001 From: Vishal Karanjekar <119437719+vsk03116@users.noreply.github.com> Date: Sat, 11 Feb 2023 16:41:16 +0530 Subject: [PATCH 08/10] Update vishal_karanjekar_Java_DSA_codes --- vishal_karanjekar_Java_DSA_codes | 121 +++++++++++++++++++++++++++++++ 1 file changed, 121 insertions(+) diff --git a/vishal_karanjekar_Java_DSA_codes b/vishal_karanjekar_Java_DSA_codes index 67c8df6..12cbdb4 100644 --- a/vishal_karanjekar_Java_DSA_codes +++ b/vishal_karanjekar_Java_DSA_codes @@ -283,3 +283,124 @@ public class BinaryTree{ } } } + + + +// lecture 11 (DSA) source code(vishal_karanjekar) +//Breadth first search of a tree + + + public class MyTreeTest{ + public static void main(String[] args){ + Tree tree =new Tree(); + Tree.Node root=new Tree.Node(5); + + tree.insert(root,2); + tree.insert(root,4); + tree.insert(root,8); + tree.insert(root,6); + tree.insert(root,7); + tree.insert(root,3); + tree.insert(root,9); + System.out.println("preorder: "); + tree.traversePreOrder(root); + + System.out.println("postorder: "); + tree.traversePostOrder(root); + + System.out.println("Breadth First Search/Level Order: "); + tree.bfs(root); + } + + + public static class Tree{ + static class Node{ + int value; + Node left ,right; + + Node(int value){ + this.value=value; + left=null; + right=null; + } + } + + public void insert(Node node,int value){ + if(valuenode.value){ + if(node.right!=null){ + insert(node.right,value); + } + else{ + node.right= new Node(value); + System.out.println("Inserted " +value + " to the right of " + node.value); + } + } + } + + public void traversePreOrder(Node node){ + if(node!=null){ + System.out.println(" " +node.value); + traversePreOrder(node.left); + traversePreOrder(node.right); + + } + } + + + + public void traversePostOrder(Node node){ + if(node!=null){ + traversePostOrder(node.left); + traversePostOrder(node.right); + System.out.println(" " +node.value); + } + } + + public int height(Node root){ + if(root==null){ + return 0; + } + else{ + int lheight=height(root.left); + int rheight=height(root.right); + + + if(lheight>rheight){ + return (lheight+1); + } + else{ + return (rheight+1); + } + } + } + public void printCurrentLevel(Node root,int level){ + if(root==null){ + return; + } + if(level==1){ + System.out.print(root.value + " "); + } + else if(level>1){ + printCurrentLevel(root.left, level-1); + printCurrentLevel(root.right, level-1); + + } + } + + public void bfs(Node root){ + int h= height(root); + + for(int i=1;i<=h;i++){ + printCurrentLevel(root,i); + } + } + } +} From ca3d67fb453683131e278edf0559f760f8d220b0 Mon Sep 17 00:00:00 2001 From: Vishal Karanjekar <119437719+vsk03116@users.noreply.github.com> Date: Sun, 12 Feb 2023 16:39:21 +0530 Subject: [PATCH 09/10] Update vishal_karanjekar_Java_DSA_codes --- vishal_karanjekar_Java_DSA_codes | 39 ++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) diff --git a/vishal_karanjekar_Java_DSA_codes b/vishal_karanjekar_Java_DSA_codes index 12cbdb4..22b122d 100644 --- a/vishal_karanjekar_Java_DSA_codes +++ b/vishal_karanjekar_Java_DSA_codes @@ -404,3 +404,42 @@ public class BinaryTree{ } } } + + +//lecture 12(DSA) source code(vishal_karanjekar) +//single and multiple inheritance in java + + +public class BmiMachine extends HeartMonitor{ + + public static void main(String[] args) + { + System.out.println(getMaxHeartRate(20)); + } + public static int getMaxHeartRate(int age) + { + System.out.println("method executed from Sub Class"); + return 230-age; + } + +} +} + +public class HeartMonitor { + + public String maxHeartRate; + public static void main(String[] args) + { + System.out.println(getMaxHeartRate(20)); + + } + public static int getMaxHeartRate(int age) + { + System.out.println("Base Class"); + int res=0; + res=230-age; + return res; + } +} + + From 89c3f764ddbd496be3d509f2d55dc11f229c76c6 Mon Sep 17 00:00:00 2001 From: Vishal Karanjekar <119437719+vsk03116@users.noreply.github.com> Date: Mon, 20 Feb 2023 16:36:51 +0530 Subject: [PATCH 10/10] Caesar Cipher (vishal_karanjekar) --- vishal_karanjekar_Java_DSA_codes | 95 ++++++++++++++++++++++++++++++++ 1 file changed, 95 insertions(+) diff --git a/vishal_karanjekar_Java_DSA_codes b/vishal_karanjekar_Java_DSA_codes index 22b122d..dfcfc54 100644 --- a/vishal_karanjekar_Java_DSA_codes +++ b/vishal_karanjekar_Java_DSA_codes @@ -443,3 +443,98 @@ public class HeartMonitor { } + +//My first project in java (vishal_karanjekar) +//Caesar Cipher(DRDO Cryptography & Cryptanalysis Project) + + +import java.util.Scanner; + + public class CaesarCipher + { + public static String Encrypt(String text, int positions) + { + String toEncrypt = "", result = ""; + //format the text to be encrypted + for (int i = 0; i < text.length(); i++) { + //remove space characters + if (text.charAt(i) == ' ') + continue; + else { + //if the character is lowercase, make it uppercase + if (Character.isLowerCase(text.charAt(i))) + toEncrypt += Character.toUpperCase(text.charAt(i)); + //otherwise keep the uppercase character + else + toEncrypt += text.charAt(i); + } + } + + for (int i = 0; i < toEncrypt.length(); i++) { + //shift the current letter of the message with given positions to right + + char shiftedLetter = (char) (toEncrypt.charAt(i) + positions); + + //if the ASCII code exceeds Z, then bring it back in the interval A..Z + if (shiftedLetter > 'Z') + shiftedLetter = (char) (shiftedLetter + 'A' - 'Z' - 1); + result += shiftedLetter; + } + return result; + } + + public static String Decrypt(String text, int positions) { + //the encrypted code is already uppercase, + //therefore there is no need of formatting + String result = ""; + + + for (int i = 0; i < text.length(); i++) { + + //shift the current letter of the message with given positions to left + + char shiftedLetter = (char) (text.charAt(i) - positions); + + //if the ASCII code exceeds A, then bring it back in the interval A..Z + if (shiftedLetter < 'A') + shiftedLetter = (char) (shiftedLetter - 'A' + 'Z' + 1); + result += shiftedLetter; + } + return result; + } + + public static void main(String[] args) { + System.out.println("WELCOME TO THE CAESAR CIPHER\n"); + + Scanner sc = new Scanner(System.in); + + // Reading the input: plain message and the secret key + System.out.print("Type the message: "); + String message = sc.nextLine(); + System.out.print("Type the key: "); + int key = sc.nextInt(); + sc.close(); + + // Encrypting the plain message + System.out.println("\nEncrypting..."); + String encryptedMessage = Encrypt(message, key); + System.out.println("The encrypted message is: " + encryptedMessage); + + // Decrypting the encrypted message + System.out.println("\nDecrypting..."); + String recoveredMessage = Decrypt(encryptedMessage, key); + System.out.println("The decrypted message is: " + recoveredMessage); + } + } + + output:- + WELCOME TO THE CAESAR CIPHER + +Type the message: vishal +Type the key: 7 +Encrypting...The encrypted message is: CPZOHS + +Decrypting... +The decrypted message is: VISHAL + +