Laborator 3 - Java Problema 1 Calculeaza salariul angajatilor unei companii. Toti angajatil primesc un salariu de baza de 200 $ la care se adauga o suma calculata in functie de numarul de ore suplimentare pe care il efectueaz’. Formula de calcul este numar_ore_suplimentare*prima unde prima este de 10$ pentru fiecare ora suplimentarea efectuata, Trebuie luat in considerare ca fiecare angajat trebuie sa plateasc’ un impozit de 30%. Crearea proiectului + Lansim in executie NetBeans IDE ‘+ Tn NetBeans utilizdm comanda: File —> New Project (figura 1.01.) + Se va deschide un wizard de unde, din categoria general, alegem Java Application apoi Next (figura 1.02,). ‘+ Scriem numele aplicatiei (Aplicafia 05), alegem directorul in care vrem si fie creat proiectul si bifam cele doud checkbox-uri: Create Main Class, Set as Main Project apoi Finish. Adaugarea codului 1) Se adaug’ codul pentru import import java. aplicatia05; 2) La metoda main se va adduga secventa throws IOException. Aceasta va arata astfel: public static void main(String[] args) throws IOException 3) Se adaug’ codul pentru afigarea textului prin inlocuirea liniei /[ TODO code application logic here cu secventele: *; dupa linia package int oresuplimentare, salariu=200; double prima=10.0, impozit= 0.30, salariu_net, salariu_brut; BufferedReader stdinl = new BufferedReader (new InputStreamReader (3} System.out.println String dateintrare: stem.in}]# Ir. de ore sup. stdil oreSuplimentare = Integer.parseInt (dateintrarel]; ntare*pril entare este: "Jj readLine(}; salariu += oreSuplir salariu_brut-salariu; salariu_net=salariu* at.println ariu_brut system.out.println salariu_net}; 1-impo: Salariul brut este : "+ System.o alariul net este : "+Problema 2 Calcularea factorialului unui numar: import java-util.Scanner; class Factorial rl public static void main(String arg=[1) 1 int n, c, fact = 1; System-out.printIn ("Enter an integer to calculate it's factorial"); Scanner in = new Scanner (System. in); n= in.nextint(); a) n.out.println("Number should be non-negative."); for (c= 1; ¢ con; ot) fact = fact*o; System.out.println("Factorial of "tnt" is — "+fact); Problema 3 Determinarea primelor n numere prime: amport java-util.*; class PrimeNunbers fl public statie void main(String azge()) 1 ant n, status - 1, num ~ 3; Scanner in = new Scanner (System. in); system.out.printin ("Enter the number of prime mmbers a= dnsnextInt()? want”) ; ag (n >= 1) i out.println ("First “+n+* prime numbers are 1 jyatem.out .printla(2); } for ( dnt count = 2; count = 0; 4--) reverse ~ reverse + original.charAt (i); 4£ (original.equals(reverse)) System.out.println ("Entered string is a palindrome."); else Syaten.out.println ("Entered etring Le not a pallndrome."); Varianta 2: amport jay. suthl.¥s class Palindrome public static void main(String args(1) { string inputstring;Scanner in = new Scanner (Systen.in); System.cut-printIn("Input a string"); inputString - in.nextLine(); ant length = inputString. length (); ant i, begin, end, middle; begin end = length - 1; middle - (begin + end) /2; for (i = begin; i = middie; i++) ( if (inputString. charAt (begin) inputstring-charat (end)) ( begint+; end~ } else | break; 1 ) if (1 == middle + 1) [ System. out.printIn ("Palindrome"); 1 else | System-out-printin ("Not a palindrome") ; 1 Problema 4 ‘Compararea a doua siruri import Java.utll.scanner; class Conparestrings fl public static void main(String args (1) 1 string st, 927 Scanner Ln = new Scanner (Syeten. in); system.out.printin ("Enter the first string"); el = in.nextLine(}; System.out.print1n ("Enter the second string"); 82 = insnextLine(}; Af ( sl.compareTo(s2) > 0 ) System.out.println("First string is greater than second. else 1€ ( sl.comparefo(s2) <0 ) System.out.println("First string is smaller than second. else System.out.print1n("Both strings are equal. GcProblema 5 Lucrul cu vector’ in Java: public class TestAarray [ public static void main(string[] args) { double[] myList = (1.9, 2.9, 3.4, 3.51% // Print all the array elements for (int i = 0; i < myList.length; i++) { System.out.printla(myList [i] +" "); } // Summing all elements double total = 0 for (int i = 0; i < myList-length; i++) { total += myList [i]; ) System.cut.println ("Total is “ + total); // Finding the largest element double max = myList [0]; for (int i = 1; 1 < myList.length; i++) [ if (myList[i] > max) max = myList [i]; 1 System.out.println ("Max is “+ max); Implementare vectori folosind clasa ArrayList: import java.util. public class ArrayListDeno | public static void main(String args[]) { J/ create an array list ArrayList al = new ArrayList (}; System.out.printIn ("Initial size of al: "+ al.size()); J/ add elements to the array list al-add ("Cc"); alsadd ("A"); al-add ("2"); al-add("B"); al-add("D"); al-add ("FP"); al-add(1, "A2"); System.out-printIn ("Size of al after additions: " + al.size()); // display the array list System.cut.println ("contents of al: " + al); 77 Remove elements from the array list al-remove ("PF"); al.remove (2)?system.out.printin ("size of al after deletions: " + al.eize(}}; System.out.printIn ("Contents of al: " + al); Problema 6 Sortare BubbleSort amport java-util.scanner; class Bubblesort | Public static void main(String [Jargs) | ant n, ¢, a, swap; seannér in — mew Scanner (system. in); system.cut.println ("Input mumber of integera to sort"); n= in.nextInt (); int array[] = new ant (1); System.cut-printin("Enter "+n + " integers"); for (c ~ 0; o< ny ott) arcay[c] im-nextInt (); for (c= 0; o< (n- 1); et) [ for (d= 07 d< n= c= 1; dt) [ 4 (array[d] > array[d+l]) /* For descending order use < * fl swap = arrayldl; array(d] = array[d+1]; array[d+1] = swap: b 1 1 system.out-printIn ("Sorted list of numbers"); for (2 = 0; 2 < aj c++) System. out -printIn (array {cl}: Sortare Quicksort implementata in clasa Arrays import java.util.Arrays; class Sort t public static void main(String args[])ant data] Arrays. sort (data) ; for (int c: data) i system.out.printin(e) ; 1 Problema 7 Cautare binara in java: Amport java-util.scanner; class BinarySearch ( public static void main(String args[]) { int c, first, last, middle, a, search, array[]: Scanner in — mew Scanner (Syaten.in); System.cut.println ("Enter number of elements"); n= in.nextInt (): array = new int{n]; system.cut.printin ("enter "+n + " integers") for (c = 0; o < nj ott) array[e] = in.nextInt (); system.cut-println ("enter value to find"); search = in.nextInt(); first = 0; last =n- 1; middle = (firet + last) /2; while{ first < i af ( array|middie] < search ) Firat = middle + 1; else if ( array[middle] ( system.out.peintin(search +" found at location " + (middle + last } search ) ei) break; 1 else last middle - 1; middle = (first + last)/2:de ( first > last ) System.out.printin(search + " is not present in the list.\n"); b 1 Cautare binara folosind o metoda a clasei Arrays amport java.util.Arrays; class ES i public static void main(String args(1) { char characters{] = { a", "b', ie ha Rb rch (characters, 'a')); arch (characters, "p')]i System.cut-printin (Arrays.binarys System.cut-printin (Arrays. binarys: