Description
i) Write a program in MATLAB/Octave/Scilab or Python (any other language, please contact me) that randomly generates a positive definite matrix. You cannot use any built-in function other than the one that generates the random numbers.
ii) In order to check your previous code, write a function that implements Sylvester’s criterion and use this function to check your code in i). Provide outputs of your code.
![This is it, the big night! Everything comes together here. Variables: - TrickOrTreater[] cryptKickerFive - array of length 5 - TrickOrTreater[] ghoulGang - array of length 5 Constructors: - A constructor that takes in arrays for cryptKickerFive and ghoulGang (in this order). - You may assume that each input array is not null, and that neither array has null entries. Further, you may assume that each input array is of the expected length. You may shallow copy these arrays. Note: Even though this assignment guarantees each team will have five trick-or-treaters, do not hardcode the literal value 5 throughout this class. Write your code so that it would accommodate any pair of positive length arrays that share a length. Methods: - toString: To get a basic idea for the matchup, format a String representing HalloweenNight to this specification (no leading nor trailing whitespace, no angle brackets, no quotation marks, a single space following each colon and comma, and a single space preceding and following "versus"): versus ghoulGang: , , , , " - Use the String representations defined for each trick-or-treater. - Note: CKF represents the cryptKickerFive and GG represents the ghoulGang. The digit following the initials represents the index in the corresponding array. - Note: It is acceptable to hardcode your format string to anticipate five members on each team for this method. - compareTeams: Trick-or-treaters in each group could be off to a head start. Minding that, this method establishes rough criteria for which team begins at an advantage. Compare trick-or-treaters at matching indices of both teams (e.g., 0 and 0 ). The team with a higher count of greater trick-or-treaters is at an advantage. Print out the appropriate string based upon the conclusion followed by a newline: - "cryptKickerFive is favored." - "ghoulGang is favored." - "Neither team is favored." - battle: This method takes in a positive int representing the winning candy threshold. A team's total candy count must be at least this amount to win. If the input is nonpositive, default to 60. The instructions below describe the actions that a team should perform in one "turn". Each trick-or-treater on the team will trick-or-treat. Following trick-or-treating, each ghost on the team will attempt to rob the trick-or-treater at the same index (e.g., 0 and 0) of the other team. Hint: Think of an operator that checks if a given reference has an "is-a" relationship with a class or interface. Although this HW defines only two specific kinds of trick-or-treaters, design your code to hold up even if there were more than two kinds. The battle should begin with the cryptKickerFive taking a turn. Each team must take at least one turn. The first team to meet the winning candy threshold after both teams take an equal number of turns wins. If both teams meet this threshold, they tie. Print out the appropriate string based upon the results followed by a newline: - "cryptKickerFive won!" - "ghoulGang won!" - "It is a tie!"](https://gotit-pro.com/wp-content/uploads/2023/10/beb898e9-40c1-4ccf-b6e5-9c62a908758c.png)
![Large Integers Part #1 Largelnteger Class An array can be used to store large integers, one digit at a time. For example, the integer 1234 could be stored in the array num by setting num[0] to 1, num[1] to 2, num[2] to 3, num[3] to 4. However, for this class implementation, you might find it more useful to store the digits backward; that is, place 4 in num[0], 3 in num[1], 2 in num[2], and 1 in num[3]. For the sake of simplicity, we will be storing and manipulating only with positive large integers. Implement a class named Largelnteger that stores a large integer as an array of its digits. Class must extend HasState class (provided). This is needed to make sure clone() method is written correctly. Class must have the following: - Fields - Constant arraySize must be set to 23 - Partially filled array of integers of length 23 - int digitCount keeps the number of digits in large integer, e.t. how many elements of the partially filled array are used to store the number - No-argument constructor that stores number 0 in the array. Sets digitCount to 1 - Constructor that takes a string as a parameter. The constructor parses the given string and converts it into Large Integer by storing digits in the partially filled array. - Create a new custom Exception class called LargelntegerNumberFormatException. The constructor throws exceptions of this type when - string is too long to be stored as a 23-digit number or - when string is empty or - when the string contains non-digits and thus cannot be converted into a number. - Constructor that takes a number of type long as a parameter and builds an object from it by storing digits in an array. - This constructor also throws a custom LargelntegerNumberFormatException when a parameter passed to the constructor is a negative number. - getDigitCount() accessor to the digit count variable. - toString() method that converts an array into a string of numbers in the correct order. Number 12345 is converted into a string "12345" - add(Largelnteger) method that returns the sum of this integer and the one passed as a parameter. The method adds two large integers by implementing the usual "paper and pencil" addition algorithm. This is when the backward storage arrangement of those numbers in arrays will pay off. Carry-over will be easier to do when the integer is stored backward. - Create another custom Exception class called LargelntegerOverflowException. If the resulting number is more than 23 digits long, the add() method throws a LargelntegerOverflowException type exception. - Implement clone() method. - Make your class implement Relatable interface. Code of the interface is provided. Implement all three methods of the Relatable interface. Part #2 Polymorphic Class This class exists only to house one static method called isSorted(). The method must take an array of objects of type Relatable and check if the array is sorted with the help of methods of Relatable interface. The method returns true if the array is sorted and false if it is not. The whole purpose of this exercise is to illustrate the concept of polymorphism. The purpose of this class is to house three static methods. 1. Method void writeLargelntegerArray(Largelnteger[], String) takes an array of Large Integers and a name of a file as parameters. The method writes the contents of the given array into the given binary file (in binary mode). The method throws IOExceptions. The IOExceptions may originate in the methods but must not be handled. Instead, they must be propagated to the calling code. - Make sure to add implements Serializable to the Largelnteger class header. Binary IO will fail to work without that. 2. Method Largelnteger[] readLargelntegerArray(String) method reads the contents of a binary file with the given name as an array of objects of type Largelnteger. Assume you do not know the amount of data in the file. Read data one Largelnteger object at a time and store the objects in ArrayList first. After the end of the file has been reached, convert the ArrayList into a regular array of objects that can be returned from the method. - Please study EOFDemo.java code example to learn how to use exceptions when checking for the end of the file while reading from a binary file. - This method also throws IOExceptions. The IOExceptions may originate in the methods but must not be handled. Instead, they must be propagated to the calling code. 3. Method Largelnteger addLargelntegersFromFile(String) takes a text file name as a parameter. It reads an arbitrary number of strings of text from the file, converting them into Largelntegers as it reads. The Large Integers are added one by one to the running total with the help of add() method. The sum of all the Large Integers stored in the file as strings is then returned from the method. - The structure of the file may be imperfect. Some strings may contain corrupted data and will fail to be converted into Largelnteger. This must not interrupt the process of reading from the file. The corrupted string must be skipped over, and the next string must be read and converted. Use a try/catch block to catch and ignore LargelntegerNumberFormatException. - The sum of all numbers stored in the file may become too big to be stored in a Large Integer. In that case, a LargeIntegerOverflowException exception will be thrown by the add() method. If this happens, catch the exception and return a null value from the method. - This method also throws IOExceptions. The IOExceptions may originate in the methods but must not be handled. Instead, they must be propagated to the calling code.](https://gotit-pro.com/wp-content/uploads/2023/10/a2443259-5cf9-45ff-9909-fdcfa036711f.png)
Wanda Mckinley –
Second time coming to this website for a paper and it worked out great.
Caroline Riberdy –
Follows the required notes. Right on time. Amazing solution.
Carmen Hoggard –
great work as usual thanks
Tad Summerfield –
Great job, very quick and informative! Done in an hours! Thank you for a job well done.
Alice Elkins –
Very well written and finished ahead of schedule!