In java KKU-CS-113/ 222-CSMManug3. Write a java program corresponding to the following UML diagrams and test your codes(b)Publication#auther: String* year: int• Publication(auther: String, year:int)+ getYear():int+getAuther(): String+ setvearly: int): void+ setAuther(a: String): voidPersonname: String-address:StringPerson(name:String, address:String)getName ():String+getAddress():String+setAddress(address:String):void+tostring():String{"Person[name=?, address=?}"extends 4Book- nbpage: int+ Book(auther: String, year: int, pages: int)+ getAuther(): String+ getPagest): int+ setAuther(n: String): void+ setPages(p: int): voidStudentStaff-progran:Stringyear:int-fee:double+Student (name:String, address:String,progran: String, year:int, fee:double)+getProgram():5String+setProgram(program:String):void*getYear():int+setYear (year:int):void+getfee(): double+setfee(fee:double):void+tostring():String-school:Stringpay:double+Staff(name:String, address:String,school:String, pay:double)*getSchool():String+setSchool(school:String): void*getPay():double+setPay(pay:double):void+tostring():String•"Staff(Person[nane-?, address-?),schoole?,paya?]""Student[Person[name-?, address-?1,progran-t, year?, fee-?]"

(b) Person -name:String -address:String Person(name:String, address:String) getName ():String +getAddress():Sstring setAddress(address:String):void +tostring():String "Person(nane-?, address-?)" extends Student Staff progran: String year: int fee:double -school:String payi double +Student (name:String, address:String, progran: String. year: int, fee:double) *getProgram() :String +setProgram(program:String) void getYear(): int *setYear(year int) void getfee(): double +setfee(fee:double):void tostring()iString +Staff(nane:String, address:String, school:String, pay:double) *getSchool():String +setschool(schol:String): void *getPay():double +setPay(pay: double):void +tostrine():String "Staff(Person(nane, address), schoolet,paya?]" "Student (Person[name-?, addresse?]. progran-?, year ?, fee-?}"

(b) Person -name:String -address:String Person(name:String, address:String) getName ():String +getAddress():Sstring setAddress(address:String):void +tostring():String "Person(nane-?, address-?)" extends Student Staff progran: String year: int fee:double -school:String payi double +Student (name:String, address:String, progran: String. year: int, fee:double) getProgram() :String +setProgram(program:String) void getYear(): int setYear(year int) void getfee(): double +setfee(fee:double):void tostring()iString +Staff(nane:String, address:String, school:String, pay:double) getSchool():String +setschool(schol:String): void getPay():double +setPay(pay: double):void +tostrine():String "Staff(Person(nane, address), schoolet,paya?]" "Student (Person[name-?, addresse?]. progran-?, year ?, fee-?}"

EBK JAVA PROGRAMMING

8th Edition

ISBN:9781305480537

Author:FARRELL

Publisher:FARRELL

Chapter1: Creating Java Programs

Section: Chapter Questions

Problem 10RQ

See similar textbooks

Similar questions

The language must be in python. Just do numbers 5-7 Neural Network Units Implement a single sigmoid neural network unit with weights of [-1.2, -1.1, 3.3, -2.1] Calculate the outputs for two training examples:Example 1: [0.9, 10.0, 3.1, 1]Example 2: [0.9, 2.1, 3.7, 1] Note that you don't have to explicitly include a threshold or bias since the examples include a last element of 1 which means that the last weight effectively operates as a threshold. Assuming that a sigmoid unit response >0.5 denotes a positive class and <0.5 is negative class, is example 1 positive or negative? is example 2 positive or negative? Create a single ReLU unit and provide the outputs for those examples. Calculate the derivative of the sigmoid with respect to net input for both examples Calculate the derivative of the ReLU with respect to net input for both examples
1. Study the following code and draw a control flow graph. public static void main(String[] args){final int NUMCHARS = 26;Scanner scan = new Scanner(System.in);int[] upper = new int[NUMCHARS];int[] lower = new int[NUMCHARS]; char current; // the current character being processedint other = 0; // counter for non-alphabetics System.out.println("Enter a sentence:");String line = scan.nextLine(); // Count the number of each letter occurencefor (int ch = 0; ch < line.length(); ch++){current = line.charAt(ch);if (current >= 'A' && current <= 'Z')upper[current-'A']++;elseif (current >= 'a' && current <= 'z')lower[current-'a']++;elseother++;} // Print the resultsSystem.out.println();for (int letter=0; letter < upper.length; letter++){ System.out.print( (char) (letter + 'A') ); System.out.print(": " + upper[letter]); System.out.print("\t\t" + (char) (letter + 'a') ); System.out.println(": " +…
please write it in C language. import java.util.*; public class EightQDfs { final int X = 4; void dispSol(int brd[][]) { for(int i = 0; i < X ; i++) { for(int j=0 ; j < X ; j++) { System.out.print(" " + brd[i][j]) + " "); System.out.println(); } } boolean isSafe(int brd[][] , int r , int c) //r is for row and c is column { int i , j; for(i = 0 ; i < c ; i++) if(brd[r][i] == 1) return false; for(i = r ; j = c ; i >=0 && j >= 0 ;i-- ,j--) if(brd[i][j] == 1) return false; for(i = r , j = c ; j >= 0 && i < X ; i++ , j--) if(brd[i][j] == 1) return false; return true; } boolean EQsolved(int brd[][] , int c) { if(c >= X) return true; for(int i= 0; i < X ;i++) { if(isSafe(brd , i , c)) { brd[i][c] = 1; if(EQsolved(brd , c + 1) == true ) return true; brd[i][c] = 0 ; } } return false; } boolean…
Implementation of the solution in the C++ or Java language • Implementation of the solution in ARMv8 assembly, with comments explaining the purpose of each line Task 1 An automorphic number is a number n whose square ends in n. For instance, 5 is automorphic, because 52 = 25, which ends in 5. Design and implement an ARMv8 program that reads a positive integer from the user and then calculates and prints all the automorphic numbers (decimal base) that are less than or equal to the entered integer. If the entered integer is not positive, an error message is displayed. As an example, if 100 is entered, the program will print all the automorphic numbers up to 100: 1, 5, 6, 25, 76.
Provide a detailed answer that includes an explanation and a solution. Question: Create a java for loop that maps denotational semantics Please walk me through this step by step!!!
The language of the following DFA is { w∈{0,1)* | _________ } a) w ends in a 0 b) w contains a 1 c) w has an odd number of 1’s d) w starts and ends with a 0 and has a 1 e) w contains a 1 and ends in a 0
Create a java program where you apply the concept of PDA (Pushdown automata) using stack where program will check if the input is a PALINDROME or not. See attached photo for the example (you can use conditionals to make the program possible)
Question5: Write a python program to train neural network to classify two clusters in a 2-dimensional space for implementing XOR, where the weight is -0.50 and x>-0.5. Also name the class by your name
Create two stacks in java which store initial and goal state of block world problem. Display these state to user and then create a heuristic value which give +1/-1 to each block correct position with respect its goal state.
4.Draw the recursive flow diagram/memory stack (draw each methods and their behavior in the way they are being called and executed) of the code given below: public class Surprise{ public static int mystery(int n) { System.out.println("h(" + n + ")"); if (n == 0) { System.out.println("value: 0"); return 0; } else { System.out.println("going down"); int temp = mystery (n - 1) + 1; System.out.println("h(" + n + ") --> " + temp); return temp; } } public static void main(String [] args){ mystery(4); } OR class Surprise: def mystery(self,n): print("h(" ,n,")") if(n==0): print("value: 0") return 0 else: print("going down") temp = self.mystery(n-1)+1 print("h(",n,") --> ",temp) return temp #Tester s = Surprise() s.mystery(4) 5.[Hard] Print the following pattern for the given input: Input: 5 Output: 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 Print the following pattern for the given input: Input: 5 Output: 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5
Implement in C programming language Question 1 Write a program in c to detect if the system will face any deadlock in the future. If a deadlock is detected then print “Deadlock Ahead” otherwise print “Safe here”. The situation is given below. (Allowed to use Banker’s Algorithm). Note: The code can be implemented in several different ways, but make sure the parameter remains the same as shown below. n = 5; // Number of processes m = 4; // Number of resources int alloc[5][4] = { { 0, 1, 0, 3 }, // P0 // Allocation Matrix { 2, 0, 0, 0 }, // P1 { 3, 0, 2, 0 }, // P2 { 2, 1, 1, 5 }, // P3 { 0, 0, 2, 2 } }; // P4 int max[5][4] = { { 6, 4, 3, 4 }, // P0 // MAX Matrix { 3, 2, 2, 1 }, // P1 { 9, 1, 2, 6 }, // P2 { 2, 2, 2, 8 }, // P3 { 4, 3, 3, 7 } }; // P4 int avail[4] = { 3,…
Write the code in Java language The problem states that there are five philosophers sitting around a circular table. The philosophers must alternatively think and eat. Each philosopher has a bowl of food in front of them, and they require a fork in each hand to eat. However, there are only five forks available. You need to design a solution where each philosopher can eat their food without causing a deadlock.