Java Program 11:24 *( NázevWrite a method which can read and parsea file containing information about weeklyfeedback from apprentices about a mentor.The mentor is rated in 4 different metrics,those are respectively (matReview,presSkills, helpfulness, explanation)separated with 1 space:m = matReviewp= presSkillsh = helpfulnesse = explanationmphe // this is just an info line which isnol in the aclual file1353 / this line is an answer trom anapprentice2343 / this is another responseThe method should return a map/dictionary containing the average rating (ineach metric) of the mentor.ExampleExample file can be found here.ETT.17II 1124AI 96( NázevOutput{"matReview": 2.25,"presSkills": 4.0, // or 4 is fine as well"helpfulness': 4.5,"explanations": 3.75ET17-

Actually, program is a executable software that runs on a computer.

Write a method which can read and parse a file containing information about weekly feedback from apprentices about a mentor. The mentor is rated in 4 different metrics, those are respectively (matReview, presSkills, helpfulness, explanation) separated with 1 space: m = matReview p= presSkills h = helpfulness e = explanation mphe // this is just an into line which is nol in the aclual file 1353 / this line is an answer from an apprentice 2343 / this is another response The method should return a map/ dictionary containing the average rating (in 1/9 each metric) of the mentor. Еxample Example file can be found here. ET 17

Write a method which can read and parse a file containing information about weekly feedback from apprentices about a mentor. The mentor is rated in 4 different metrics, those are respectively (matReview, presSkills, helpfulness, explanation) separated with 1 space: m = matReview p= presSkills h = helpfulness e = explanation mphe // this is just an into line which is nol in the aclual file 1353 / this line is an answer from an apprentice 2343 / this is another response The method should return a map/ dictionary containing the average rating (in 1/9 each metric) of the mentor. Еxample Example file can be found here. ET 17

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

5.21 In Python: A year in the modern Gregorian Calendar consists of 365 days. In reality, the earth takes longer to rotate around the sun. To account for the difference in time, every 4 years, a leap year takes place. A leap year is when a year has 366 days: An extra day, February 29th. The requirements for a given year to be a leap year are: 1) The year must be divisible by 4 2) If the year is a century year (1700, 1800, etc.), the year must be evenly divisible by 400 Some example leap years are 1600, 1712, and 2016. Write a program that takes in a year and determines whether that year is a leap year. Ex: If the input is: 1712 the output is: 1712 is a leap year. Ex: If the input is: 1913 the output is: 1913 is not a leap year. Your program must define and call the following function. The function should return true if the input year is a leap year and false otherwise.def is_leap_year(user_year)
Python 3.7.4 Given that add, a function that expects two int parameters and returns their sum, and given that two variables, euro_sales and asia_sales, have already been defined: Write a statement that calls add to compute the sum of euro_sales and asia_sales and that associates this value with a variable named eurasia_sales.
Complete and modify the code. 1 def to_share(total_candies, n_friends=4): 2 """Return the number of leftover candies that must be 3 smashed after distributing 4 the given number of candies evenly between 3 friends. 5 6 >>> to_share(91) 7 1 8 """ 9 return total_candies 10 11 to_share(10, 4) 12 to_share(5) 13 to_share(1, 5)
13. Implement function triangleArea(a,b,c) that takes as input the lengths of the 3 sides of a triangle and returns the area of the triangle. By Heron's formula, the area of atriangle with side lengths a, b, and c is √ s ( s−a )( s−b)( s−c ) , where s=(a+b+ c )/ 2 .>>> triangleArea(2,2,2)1.7320508075688772
**11.18** Java Solve (ArrayList of Character) Using the following header, create a method that produces an array list of characters from a string: toCharacterArray public static ArrayListCharacter> (String s) ToCharacterArray("abc"), for example, returns an array list containing the characters 'a', 'b', and 'c'.
Part 2: Binary Arithmetic One of the most common operations we perform on binary numbers (and all numbers) is addition. It can be cumbersome to convert your binary numbers to decimal just to add them and convert them back, so instead we will be learning how to add binary numbers directly. Binary addition works the same way as decimal addition, with the added restriction that each digit can only go up to 1. Let's consider the possibilities for adding the values of any 2 single digits together: 0 + 0 0 + 1 1 + 0 1 + 1 0 1 1 10 (remember that 10 in binary represents the number 2) In that last case, the result is larger than a single digit. When adding larger binary numbers, that means we have to carry the 1 over to the next column. This presents us with another new case: what happens if we have 1 + 1 + carried 1? In that case, the result is 11, which means that column's result is 1, and we carry 1 to the next column. Below is an example of adding two binary numbers that shows all…
21.2 Project 1 (Checkpoint B): DNA Write the full C++ code for this Implement the following functions: /** * Reads from standard input a list of Short Tandem Repeat (STRs) * and their known counts for several individuals * * @param nameSTRs the STRs (eg. AGAT, AATG, TATC) * @param nameIndividuals the names of individuals (eg. Alice, Bob, Charlie) * @param STRcounts the count of the longest consecutive occurrences of each STR in the DNA sequence for each individual * @pre nameSTRs, nameIndividuals, and nameSTRs are empty * @post nameSTRs, nameIndividuals and STRcounts are populated with data read from stdin **/ void readData(vector<string>& nameSTRs, vector<string>& nameIndividuals, vector<vector<int>>& STRcounts) For example, consider the input: 3 AGAT AATG TATC Alice 5 2 8 Bob 3 7 4 Charlie 6 1 5 In the first line, the number of STRs followed by the names of those STRs, which will be populated into the vector nameSTRs. The remaining lines contain…
1(a): Implement the following C function : concatenate the lowest byte of each of two integers. The output should have 0's in the two most significant bytes , followed by the least significant byte of the first then second argument . For example , concatLowBytes (0x12345678 , 0xaabbccdd) 0x000078dd . You may use hexidecimal constants of any size. You should not use binary notation , function calls , loops or conditional statements. Examples : concatLowBytes ( 0x00000011 , 0x00000022)=0x00001122 concatLowBytes (0x12345678 , 0xaabbccdd )= 0x000078dd int concatLowBytes (int x, int y){ }
5.12.2: Switch statement to convert letters to Greek letters. Write a switch statement that checks origLetter. If 'a' or 'A', print "Alpha". If 'b' or 'B', print "Beta". For any other character, print "Unknown". Use fall-through as appropriate. End with newline. import java.util.Scanner; public class ConvertToGreek {public static void main (String [] args) {Scanner scnr = new Scanner(System.in);char origLetter; origLetter = scnr.next().charAt(0); /* Your solution goes here */ }}
9.5.1: Use the addChoice method to add any needed instance variables. Provide a different implementation of ChoiceQuestion. Instead of storing the choices in an array list, the addChoice method should add the choice to the question text. For this purpose, an addLine method has been added to the Question class. ChoiceQuestion.java: /** A question with multiple choices.*/public class ChoiceQuestion extends Question{ // Add any needed instance variables, but don't store the choices // The choices should be added to the text of the superclass /* Your code goes here */ /** Constructs a choice question with a given text and no choices. @param questionText the text of this question */ public ChoiceQuestion(String questionText) { /* Your code goes here */ } /** Adds an answer choice to this question. @param choice the choice to add @param correct true if this is the correct choice, false otherwise */ public void…
Python code Here are n posts at particular directions on a plane. It is ensured that no three fence posts lie on a similar line. There are a limitless number of cows on the plane, one at each point with whole number directions. Gregor is an individual from the Illuminati, and needs to construct a three-sided fence, interfacing 3 unmistakable existing wall posts. A cow stringently inside the fence is supposed to be encased. In case there are an odd number of encased cows and the space of the fence is a whole number, the fence is supposed to be intriguing. Track down the quantity of intriguing wall. Information : The primary line contains the whole number n (3≤n≤6000), the quantity of fence posts which Gregor can decide to shape the vertices of a fence. Every one of the following n line contains two whole numbers x and y (0≤x,y≤107, x and y are even), where (x,y) is the arrange of a fence post. All fence posts lie at unmistakable directions. No three fence posts are on a similar…
PYTHON CODE: In order to beat AlphaZero, Grandmaster Hikaru is improving her chess calculation skills.Today, Hikaru took a big chessboard with N rows (numbered 1 through N) and N columns (numbered 1 through N). Let's denote the square in row r and column c of the chessboard by (r,c). Hikaru wants to place some rooks on the chessboard in such a way that the following conditions are satisfied:• Each square of the board contains at most one rook.• There are no four rooks forming a rectangle. Formally, there should not be any four valid integers r1, c1, r2, c2 (≠r2,c1≠c2) such that there are rooks on squares (r1,c1), (r1,c2 (r2,c1)and (r2,c2).• The number of rooks is at least 8N.Help Hikaru find a possible distribution of rooks. If there are multiple solutions, you may find any one. It is guaranteed that under the given constraints, a solution always exists.InputThe first line of the input contains a single integer T denoting the number of test cases. The first and only line of each test…