From e3109dd5edae9106258f0e5fea856103b844cee7 Mon Sep 17 00:00:00 2001 From: HalehQadyani <125292407+HalehQadyani@users.noreply.github.com> Date: Thu, 20 Apr 2023 00:46:09 +0430 Subject: [PATCH 1/2] commit --- src/main/java/Lecture4Exercises.java | 2 +- src/main/java/Lecture5Exercises.java | 2 +- src/main/java/Lecture6Exercises.java | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/src/main/java/Lecture4Exercises.java b/src/main/java/Lecture4Exercises.java index 868721c..3af7a8f 100644 --- a/src/main/java/Lecture4Exercises.java +++ b/src/main/java/Lecture4Exercises.java @@ -1,4 +1,4 @@ -public class Lecture4Exercises { +public class Lecture4Exercises{ /* * implement a function that returns factorial of given n diff --git a/src/main/java/Lecture5Exercises.java b/src/main/java/Lecture5Exercises.java index 2fb9556..68fcb34 100644 --- a/src/main/java/Lecture5Exercises.java +++ b/src/main/java/Lecture5Exercises.java @@ -1,4 +1,4 @@ -public class Lecture5Exercises { +public class Lecture5Exercises{ /* * implement a function to create a random password with diff --git a/src/main/java/Lecture6Exercises.java b/src/main/java/Lecture6Exercises.java index 2a89978..293089e 100644 --- a/src/main/java/Lecture6Exercises.java +++ b/src/main/java/Lecture6Exercises.java @@ -1,6 +1,6 @@ import java.util.List; -public class Lecture6Exercises { +public class Lecture6Exercises{ /* * implement a function that takes an array of int and return sum of From 33d64047cd105beee9a82cedc5aee721ff14e452 Mon Sep 17 00:00:00 2001 From: HalehQadyani <125292407+HalehQadyani@users.noreply.github.com> Date: Thu, 20 Apr 2023 00:49:15 +0430 Subject: [PATCH 2/2] last Commit --- src/main/java/Lecture4Exercises.java | 57 ++++++++++++++-- src/main/java/Lecture5Exercises.java | 99 ++++++++++++++++++++++++++-- src/main/java/Lecture6Exercises.java | 68 +++++++++++++++++-- 3 files changed, 207 insertions(+), 17 deletions(-) diff --git a/src/main/java/Lecture4Exercises.java b/src/main/java/Lecture4Exercises.java index 3af7a8f..0fbb364 100644 --- a/src/main/java/Lecture4Exercises.java +++ b/src/main/java/Lecture4Exercises.java @@ -1,11 +1,21 @@ -public class Lecture4Exercises{ +import java.lang.reflect.Array; +import java.util.Locale; + +public class Lecture4Exercises { /* * implement a function that returns factorial of given n * lecture 4 page 15 */ public long factorial(int n) { - return 0L; + int ans = 1,i=n; + + while (i!=0){ + ans*=i; + i--; + } + + return ans; } /* @@ -14,7 +24,21 @@ public long factorial(int n) { * lecture 4 page 19 */ public long fibonacci(int n) { - return 0; + Long a= Long.valueOf(1),b= Long.valueOf(1),i= Long.valueOf(2); + + while(i=0;i--){ + reversed = reversed + word.charAt(i); + } + + return reversed; } /* @@ -32,7 +62,10 @@ public String reverse(String word) { * lecture 4 page 19 */ public boolean isPalindrome(String line) { - return false; + String line1 = line; + line1 = line1.replaceAll("\\s", ""); + line1 = line1.toLowerCase(Locale.ROOT); + return reverse(line1).equals(line1); } /* @@ -47,6 +80,18 @@ public boolean isPalindrome(String line) { * lecture 4 page 26 */ public char[][] dotPlot(String str1, String str2) { - return null; + char [][] ans = new char[str1.length()][str2.length()]; + for (int i=0;i opts = new ArrayList<>(); + optMaker(opts); + + while (true) { + password = ""; + + + for (int i = 0; i < length; i++) { + password = password + opts.get(randomNum(0, opts.size() - 1)); + } + + System.out.println(password); + + String par ="([a-z]+)(\\d+)([+*?^$(){}&|]+)"; + + if (password.matches(par)){ + return password; + } + } } /* @@ -27,6 +53,71 @@ public String strongPassword(int length) throws Exception { * lecture 5 page 17 */ public boolean isFiboBin(int n) { - return false; + int i=0; + while (fibonacci(i) + binSum(i) < n){ + i++; + } + + return fibonacci(i) + binSum(i) == n; + } + + public int randomNum(int a, int b) { + Random r = new Random(); + int result = r.nextInt(b - a + 1) + a; + return result; + } + + + + static int binSum(int n) { + int[] binaryNum = new int[1000]; + + int i = 0; + while (n > 0) { + binaryNum[i] = n % 2; + n = n / 2; + i++; + } + + int sum = 0; + for (int value : binaryNum) { + sum += value; + } + + return sum; + } + + public long fibonacci(int n) { + Long a= Long.valueOf(1),b= Long.valueOf(1),i= Long.valueOf(2); + + while(i opts){ + for(int i=48;i<58;i++){ + opts.add((char) i); + } + + for(int i=97;i<123;i++){ + opts.add((char) i); + } + + String specials = ".+*?^$(){}|"; + + for (int i=0;i=0;i--){ + reversed[j]=arr[i]; + j++; + } + return reversed; } /* @@ -25,7 +38,19 @@ public int[] reverseArray(int[] arr) { * lecture 6 page 21 */ public double[][] matrixProduct(double[][] m1, double[][] m2) throws RuntimeException { - return null; + int row = m1.length; + int coloumn_row = m1[0].length; + int coloumn = m2[0].length; + double[][] r = new double[row][coloumn]; + for (int i=0;i> arrayToList(String[][] names) { - return null; + List> ans = new ArrayList<>(); + for (int i=0;i< names.length;i++){ + ans.add(new ArrayList(List.of(names[i]))); + } + return ans; } /* @@ -43,7 +72,16 @@ public List> arrayToList(String[][] names) { * lecture 6 page 30 */ public List primeFactors(int n) { - return null; + List primes = new ArrayList(); + for (int i=2;i<=n;i++){ + if (isPrime(i)){ + if (n%i==0){ + primes.add(i); + } + } + } + + return primes; } /* @@ -51,6 +89,22 @@ public List primeFactors(int n) { * lecture 6 page 30 */ public List extractWord(String line) { - return null; + line = line.replaceAll("[$&+,:;=?@#|'<>.-^*()%!]" , ""); + List myList = new ArrayList(Arrays.asList(line.split(" "))); + return myList; + } + + public boolean isPrime(int num) + { + if(num<=1) + { + return false; + } + for(int i=2;i<=num/2;i++) + { + if((num%i)==0) + return false; + } + return true; } }