Write a function "hailstone"that takes an int "n2"and prints the hailstone sequence. Hailstone Numbers:This sequence takes the name hailstone as the numbers generated bounce up and down. To generate the sequence, follow these rules:a.If the number isodd multiply it by 3 and add 1 b.If the number is even, divide by two.c.Repeat until you reach number 1.Sample Inputs & Outputsn2= 3-> 10, 5, 16, 8, 4, 2, 1 n2 =6-> 3, 10, 5, 16, 8, 4, 2, 1 n2 =7-> 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1
Answers
Answer:
Here is the C program
#include<iostream> //for input output functions
using namespace std; //to identify objects like cin cout
int Hailstone(int n2); //function declaration of function Hailstone
int main() { // start of main() function body
int num; // stores number entered by user
cout<<"Enter a number: "; // prompts user to enter a number
cin>>num; // reads the input number
while(num!=1) { // loop continues until the value of num becomes 1
num = Hailstone(num); // calls hailstone method and passes num to it
cout<<num<<"\n"; } } // prints the hailstone sequence
int Hailstone(int n2) { //function takes int n2 and prints hailstone sequence
if(n2 % 2 == 0) { // if the number is even
return n2 /=2; } // divide the n2 by 2 if n2 value is even
else { // if n2 is odd
return n2 = (3 * n2) + 1; } } // multiply n2 by 3 and add 1 if n2 is odd
Explanation:
The function Hailstone() takes as parameter an integer which is int type and is named is n2. This function prints the hailstone sequence. The function has an if statement that checks if the number n2 input by the user is even or odd. If the value of n2 is even which is found out by taking modulus of n2 by 2 and if the result is 0 this means that n2 is completely divisible by 2 and n2 is an even number. So if this condition evaluates to true then n2 is divided by 2. If the condition evaluates to false and the value of n2 is odd then n2 is multiplied by 3 and 1 is added.
In the main() function the user is prompted to enter a number and the Hailstone() function is called which keeps repeating until the value of n2 reaches 1.
Related Questions
Consider a Web form that a student would use to input student information and rèsumè information into a career services application at your university. Sketch out how this form would look and identify the fields that the form would include. What types of validity checks would you use to make sure that the correct information is entered into the system?
Answers
Answer:
valid check: Completeness check, Format check, Range check, Consistency check
Explanation:
Form validations required are:
Completeness check:-all fields are filled accordingly
Format check:-Each field entered data is correct format or not
Range check:-Range of data min or max
Consistency check:-Entering consistent data
Database check
Fields are:
Text Boxes,Drop down list box,radio button,check box,button,slider(if you want to rate or show interest of a subject),combo box(group together radio buttons/check boxes/sliders).
See attachment please for the sketch
This programming project is to simulate a few CPU scheduling policies discussed in the class. You willwrite a C program to implement a simulator with different scheduling algorithms. The simulator selects atask to run from ready queue based on the scheduling algorithm. Since the project intends to simulate aCPU scheduler, so it does not require any actual process creation or execution. When a task is scheduled,the simulator will simply print out what task is selected to run at a time. It outputs the way similar to Ganttchart style.
Answers
Answer:
FCFS Scheduling Algorithm:-
// C++ program for implementation of FCFS
// scheduling
#include<iostream>
using namespace std;
// Function to find the waiting time for all
// processes
void findWaitingTime(int processes[], int n,
int bt[], int wt[])
{
// waiting time for first process is 0
wt[0] = 0;
// calculating waiting time
for (int i = 1; i < n ; i++ )
wt[i] = bt[i-1] + wt[i-1] ;
}
// Function to calculate turn around time
void findTurnAroundTime( int processes[], int n,
int bt[], int wt[], int tat[])
{
// calculating turnaround time by adding
// bt[i] + wt[i]
for (int i = 0; i < n ; i++)
tat[i] = bt[i] + wt[i];
}
//Function to calculate average time
void findavgTime( int processes[], int n, int bt[])
{
int wt[n], tat[n], total_wt = 0, total_tat = 0;
//Function to find waiting time of all processes
findWaitingTime(processes, n, bt, wt);
//Function to find turn around time for all processes
findTurnAroundTime(processes, n, bt, wt, tat);
//Display processes along with all details
cout << "Processes "<< " Burst time "
<< " Waiting time " << " Turn around time\n";
// Calculate total waiting time and total turn
// around time
for (int i=0; i<n; i++)
{
total_wt = total_wt + wt[i];
total_tat = total_tat + tat[i];
cout << " " << i+1 << "\t\t" << bt[i] <<"\t "
<< wt[i] <<"\t\t " << tat[i] <<endl;
}
cout << "Average waiting time = "
<< (float)total_wt / (float)n;
cout << "\nAverage turn around time = "
<< (float)total_tat / (float)n;
}
// Driver code
int main()
{
//process id's
int processes[] = { 1, 2, 3};
int n = sizeof processes / sizeof processes[0];
//Burst time of all processes
int burst_time[] = {10, 5, 8};
findavgTime(processes, n, burst_time);
return 0;
}
Explanation:
See output
Write a method called swapPairs that switches the order of values in an ArrayList of strings in a pairwise fashion. Your method should switch the order of the first two values, then switch the order of the next two, then the next two, and so on. If the number of values in the list is odd, the method should not move the final element. For example, if the list initially stores ["to", "be", "or", "not", "to", "be", "hamlet"], your method should change the list's contents to ["be", "to", "not", "or", "be", "to", "hamlet"].
Answers
Answer:
import java.util.ArrayList; public class Main { public static void main(String[] args) { ArrayList<String> strList =new ArrayList<String>(); strList.add("to"); strList.add("be"); strList.add("or"); strList.add("not"); strList.add("to"); strList.add("be"); strList.add("hamlet"); swapPairs(strList); System.out.println(strList); } public static void swapPairs(ArrayList<String> list){ for(int i=0; i < list.size()-1; i+=2){ String temp = list.get(i); list.set(i, list.get(i+1)); list.set(i+1, temp); } } }Explanation:
Firstly, let's create a method swapPairs that take one ArrayList (Line 18). In the method, use a for-loop to traverse through each item in the ArrayList and swap the items between the current items at index-i and at index-i+1 (Line 19-22). The index-i is incremented by two in next loop and therefore the next swapping will proceed with third and fourth items and so forth.
In the main program, create a sample ArrayList (Line 5-12) and then test the method (Line 14) and print the output (Line 15). We shall get [be, to, not, or, be, to, hamlet].
Using a text editor, create a file that contains a list of at least 15 six-digit account numbers. Read in each account number and display whether it is valid. An account number is valid only if the last digit is equal to the remainder when the sum of the first five digits is divided by 10. For example, the number 223355 is valid because the sum of the first five digits is 15, the remainder when 15 is divided by 10 is 5, and the last digit is 5. Write only valid account numbers to an output file, each on its own line. Note that the contents of the file AcctNumsIn.txt will change when the test is run to test the program against different input. Grading Write your Java code in the area on the right. Use the Run button to compile and run the code. Clicking the Run Checks button will run pre-configured tests against your code to calculate a grade. Once you are happy with your results, click the Submit button to record your score. AcctNumsIn.txt ValidateCheckDigits.java
Answers
Answer:
See explaination
Explanation:
/File: ValidateCheckDigits.java
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
public class ValidateCheckDigits {
public static void main(String[] args) {
String fileName = "numbers.txt"; //input file name
String validFileName = "valid_numbers.txt"; // file name of the output file
//Open the input file for reading and output file for writing
try(Scanner fileScanner = new Scanner( new File(fileName));
BufferedWriter fileWriter = new BufferedWriter( new FileWriter(validFileName))) {
//Until we have lines to be read in the input file
while(fileScanner.hasNextLine()) {
//Read each line
String line = fileScanner.nextLine().trim();
//calculate the sum of first 5 digits
int sum = 0;
for(int i = 0; i < 5; i++) {
sum += Integer.parseInt( line.charAt(i) + "");
}
//Get the last digit
int lastDigit = Integer.parseInt(line.charAt(5)+"");
//Check if the remainder of the sum when divided by 10 is equal to last digit
if(sum%10 == lastDigit) {
//write the number in each line
fileWriter.write(line);
fileWriter.newLine();
System.out.println("Writing valid number to file: " + line);
}
}
System.out.println("Verifying valid numbers completed.");
} catch(IOException ex ) {
System.err.println("Error: Unable to read or write to the file. Check if the input file exists in the same directory.");
}
}
}
Check attachment for output and screenshot
Final answer:
The process involves reading six-digit account numbers, summing the first five digits, and validating if the last digit matches the remainder of the sum modulo 10, outputting only the verified numbers to a file.
Explanation:
The goal is to validate six-digit account numbers to ensure their authenticity. The last digit of each account number must match the remainder when the sum of the first five digits is divided by 10. This concept utilizes simple mathematical operations like addition and modulo in conjunction with programming to accomplish the task of validation. Here's an outline of the procedure:
Read account numbers from a file.Add the first five digits of each number.Take the sum and perform a modulo operation by 10.Compare the result to the sixth digit of the account number.If they match, write the account number to an output file.This process highlights the importance of validating data and using programming to automate otherwise time-consuming tasks.
The major objective of this lab is to practice class and object-oriented programming (OOP), and separate files: 1. We will reuse lab 6, a direct current simulator with extensions to let you practice OOP. Pay special attention to the difference between procedural programming and OOP. 2. This is the first time you break a program into several files such that you do not need to have all functions included in one program. The idea of breaking a program into several files has many benefits that will be explained in lecture notes and ZyBook reading assignment. It is NOT the purpose of this lab to train your logical thinking capability. We select a simple problem to help you fully understand OOP and separate files in an efficient manner.
Answers
Answer:
Implementation of resistor.cpp
#include "resistor.h"
Ohms::Ohm()
{
// default constructor
voltage=0;
}
Ohms::Ohm( double x) // parameterised constructor
{
voltage = x; // voltage x set to the supply voltage in the private data field called voltage
}
Ohms:: setVoltage(double a)
{
voltage = a;// to set supply voltage in private data field called voltage
}
Ohms::setOneResistance( String s, double p)
{
cin>>p; //enter the resistance value
if(p<=0) // if resistance is less than or equals to 0
return false
else // if re
cin.getline(s);
}
Ohms::getVoltage()
{
return voltage; //return voltage of ckt
}
Ohms::getCurrent()
{
return current; //return current of ckt
}
Ohms:: getNode()
{
return resistors; //return resistors of ckt
}
Ohms::sumResist()
{
double tot_resist = accumulate(resistors.begin(),resistors.end(),0); //std::accumulate function for calculating sum //of vectors and following are the starting and ending points
return tot_resist;
}
Ohms::calcCurrent()
{
if(current <=0) // if current is less than or equal to 0
return false;
else // if current is greater than 0
return true;
}
Ohms:: calcVoltageAcross()
{
if(voltage<=0) // if voltage is less than or equal to 0
return false;
else //if voltage greater than 0
return true;
}
Explanation:
in the case of main.cpp its simple just make a class object and remember to include resistors.cpp with it for which the second last picture describes the process precisely. (Hint: Use theunit test case functions in the main.cpp).
As you can see node is a structure consisting of member variables, followed by a class Ohms representing a DC circuit.
By looking at these pictures, it is needed to implement the main.cpp and resistor.cpp files. The user defined header file resistor.h already consists of all contents of Class Ohm, struct node. You don't need to modify it in anyway in such case.
Consider the following requests to read data from sectors of a hard drives, where the current position of the head is at sector 103 and the head is moving towards sector 0. What is the order in which the sectors in the queue would be services using the SCAN disk scheduling algorithm? 19, 5, 109, 23, 10, 87, 32, 120, 74, 14, 151, 81, 1, 123, 198
Answers
Answer:
168
Explanation:
=(109-103)+(120-109)+(123-120)+(151-123)+(198-151)+(87-74)+(74-32)+(32-23)+(23-19)+(19-14)+(14-10)+(10-5)+(1-0)
=6+11+3+28+47+3+42+9+4+5+4+5+1
=168
gAssume that you are writing a program to merge two files named FallStudents and SpringStudents. Each file contains a list of students enrolled in a programming logic course during the semester indicated, and each file is sorted in student ID number order. After the program compares two records and subsequently writes a Fall student to output, the next step is to _________.
Answers
Answer:
read a FallStudents record
Explanation:
When data is input from a file, the data is processed and then placed in the output file. In order to verify the validity of this process, the output file is checked.
After comparing data in the FallStudents and SpringStudents files, and placing in sorted order by StudentID. The output data is placed in file FallStudents record. After the complete process is done, the output/file record which is the FallStudents record is read.
A Musician class has been built that takes the name, number of albums sold, and number of weeks that artist has been on the Top40 list. The Musician class also has a boolean instance variable isPlatinum that determines if the musician has gone platinum, meaning they’ve sold over a million copies of the same record. The Billboard class currently has a top10 ArrayList that will store the top 10 musicians as a list. In the Billboard class, create an add method that will add a musician to the list if there are less than 10 musicians in the list, and if the musician has Platinum status. If there are 10 musicians in the list, then the method should call the replace method. Otherwise, a message should be displayed to the user that the musician could not be added to the top10 list. The replace method compares the total number of weeks that the musician has been on the top40 list. If the musician with the lowest number of weeks on the top40 is lower than the number of weeks on the top40 of the new musician, then the old musician is replaced by the new one. There should be a message to the user that the old musician has been replaced by the new one. Otherwise, the user should be notified that the new musician cannot be added because they don’t have enough weeks on the top40. This method should be created in the Billboard class. Use the BillboardTester class to test if the new musicians being added are being correctly replaced, or omitted from the Top 10.
Answers
Answer:
See explaination for program code
Explanation:
Java code below:
Musician.java :
public class Musician {
private String name;
private int weeksInTop40;
private int albumsSold;
private boolean isPlatinum;
public Musician(String name, int weeksInTop40, int albumsSold) {
this.name = name;
this.weeksInTop40 = weeksInTop40;
this.albumsSold = albumsSold;
setPlatinum(albumsSold);
}
public void setPlatinum(int albumsSold) {
if(albumsSold >= 1000000) {
isPlatinum = true;
}else {
isPlatinum = false;
}
}
public int getWeeksInTop40() {
return this.weeksInTop40;
}
public String getName() {
return this.name;
}
public boolean getIsPlatinum() {
return this.isPlatinum;
}
public String toString() {
return this.name;
}
}
Billboard.java :
import java.util.ArrayList;
public class Billboard {
private ArrayList<Musician> top10 = new ArrayList<Musician>();
public void add(Musician newMusician) {
if(this.top10.size()<10 && newMusician.getIsPlatinum()==true) {
/**
* Less than 10 musician are present in the list currently
* And also the newMusician is platinum
* */
this.top10.add(newMusician);
}else {
if(newMusician.getIsPlatinum()==false) {
System.out.println("The new musician "+newMusician+" cannot be added because not enough records are sold");
}else {
/**
* We need to call the replace method
* */
replace(newMusician);
}
}
}
public void replace(Musician newMusician) {
/**
* First we need to find what is the lowest number of weeks
* an musician was there in top40.
* */
int lowestOnTop40 = Integer.MAX_VALUE;
int index=-1;
for(int i=0;i<this.top10.size();i++) {
if(this.top10.get(i).getWeeksInTop40()<lowestOnTop40) {
lowestOnTop40 = this.top10.get(i).getWeeksInTop40();
index = i;
}
}
/**
* We have at what position the lowest number of week on top value in variable
* lowestOnTop40 at index
* We need to compare this value with newMusician's number of weeks on top 40
* */
if(lowestOnTop40 < newMusician.getWeeksInTop40()) {
System.out.println("The old musician "+this.top10.get(index)+" has been replaced by new musician "+newMusician);
this.top10.set(index, newMusician);
}else {
System.out.println("The new musician "+newMusician+" cannot be added because not enough weeks on top40.");
}
}
public void printTop10() {
System.out.println(top10);
}
}
BillboardTester.java :
public class BillboardTester {
public static void main(String[] args) {
Billboard top10 = new Billboard();
top10.add(new Musician("Beyonce", 316, 100000000));
top10.add(new Musician("The Beatles", 365, 600000000));
top10.add(new Musician("Drake", 425, 150000000));
top10.add(new Musician("Pink Floyd", 34, 250000000));
top10.add(new Musician("Mariah Carey", 287, 200000000));
top10.add(new Musician("Rihanna", 688, 250000000));
top10.add(new Musician("Queen", 327, 170000000));
top10.add(new Musician("Ed Sheeran", 536, 150000000));
top10.add(new Musician("Katy Perry", 317, 143000000));
top10.add(new Musician("Justin Bieber", 398, 140000000));
//This musician should not be added to the top10 because they don't have enough records sold
top10.add(new Musician("Karel the Dog", 332, 60));
//This musician should replace the artist
top10.add(new Musician("Tracy the Turtle", 332, 150000000));
//This musician should not replace an artist, but is a Platinum artist
top10.add(new Musician("Alex Eacker", 100, 23400000));
top10.printTop10();
}
}
Create a Sub called "daisyDecisions" that runs when you click a button. In this sub, you will create a program that determines whether he/she loves you, or loves you not. The program should receive, as an input, the number of petals on the flower (i.e., have a variable for petals) and then use that number to determine the output of the program: if the number of petals is even, then the program should output that he/she loves you not, if odd, then he/she loves you.
Answers
Answer:
see explaination
Explanation:
Please find the screenprint and the VBA code. As shown in the screenprint, range B1 is used to enter the number of petals. If you want to use a different cell for petals input, then change the code accordingly.
Also, the VBA code is placed in the Sheet1 module. No new modules are inserted.
Screenprint: see attachment for screenshot
VBA Code:
Private Sub CommandButton1_Click()
Call daisyDecisions
End Sub
Private Sub daisyDecisions()
Dim remainder As Integer
Dim noOfPetals As Integer
noOfPetals = Sheet1.Range("B1").Value
remainder = noOfPetals Mod 2
If remainder <> 0 Then
MsgBox "He/She loves you!!!"
Else
MsgBox "He/She loves you not!!!"
End If
End Sub
A terrible new disease, HORSEVID, has begun to spread among horses worldwide. Stable manager Jimmy is trying to take as many precautions as possible to protect his herd from infection.
Stable manager Jimmy's barn is a long narrow building containing N stalls in a row (2≤N≤105). Some of these stalls are currently occupied by horses, and some are vacant. Having read about the importance of "social distancing", Stable manager Jimmy wants to maximize D, where D is the distance between the closest two occupied stalls. For example, if stalls 3 and 8 are the closest that are occupied, then D=5.
Two new horses recently joined Jimmy's herd and he needs to decide to which formerly-unoccupied stalls they should be assigned. Please determine how he can place his two new horses so that the resulting value of D is still as large as possible. Stable manager Jimmy cannot move any of his existing horses; he only wants to assign stalls to the new horses.
INPUT:
The first line of input contains N.
The next line contains a string of length N of 0s and 1s describing the sequence of stalls in the barn. 0s indicate empty stalls and 1s indicate occupied stalls. The string has at least two 0s, so there is at least enough room for two new horses.
OUTPUT:
Please print the largest value of D
(the closest distance between two occupied stalls) that Stable manager Jimmy can achieve after adding his two new horses in an optimal fashion.
SAMPLE INPUT:
14
10001001000010
SAMPLE OUTPUT:
2
In this example, Stable manager Jimmy could add horses to make the occupancy string look like 10x010010x0010, where x's indicate the new horses. In this case D=2. It is impossible to add the new horses to achieve any higher value of D.
Answers
Answer:
Explanation:
Well here you only have to add 2 new horses .... so simply what you can do is find 2 slots where the gap is maximum ... lets take the given example in detail to understand the same.... here 10001001000010 here you can observe that the difference between the first two filled slots is 3 then 2 then 4 then 1....... make it a separate array ...... now as i said that we just need to place two new horses so we just need two of the biggest numbers from this array and place the new horses at the center of the corresponding slots ... like here 3 and 4 are greatest ... so one horse is placed in between the gap corresponding to 3 while other at 4 ..... after making the new array answer can be find in linear time itself... I hope this makes sense ....
Now lets understand how to program it easily so firstly after scanning all stuff ..... we will make a gap array .... then just think now what we will do is find the greatest two numbers then again putting the horses and then find our answers .... so now an easy approach is that instead of making the string again and again searching for answer .... what we do is just do half of the two greatest ones and again find the greatest one in array....
Write a code segment that uses a loop to create and place nine labels into a 3-by-3 grid. The text of each label should be its coordinates in the grid, starting with (0, 0) in the upper left corner. Each label should be centered in its grid cell. You should use a nested for loop in your code.
Answers
Answer:
Check the explanation
Explanation:
# List to store text values
grid=list()
# LOOP FOR 3 ROWS
for i in range(3):
# LIST TO STORE COLUMN
row = list()
# LOOP FOR 3 COLUMNS
for j in range(3):
# CREATING TEXT WITH
# COORDINATES FORMAT
text = "({},{})".format(i,j)
# APPEND TEXT TO ROW
row.append(text)
# APPEND ROW TO GRID
grid.append(row)
# AFTER THE ABOVE LOOP
# GRID WILL BE CREATED IN TO
# 3 X 3 GRID
# PRINTING GRID
# FOR ALL ROWS
for i in grid:
# FOR ALL COLUMNS
for j in i:
# PRINTING VALUE AT
# ROW I, COLUMN J
print(j,end=" ")
print()
Kindly check the screenshot and output below.
a. Assume a computer has a physical memory organized into 64-bit words. Give the word address and offset within the word for each of the following byte addresses:
0, 9, 27, 31,120, and 256.
b. Extend the above exercise by writing a computer program that computes the answer. The program should take a series of inputs that each consist of two values: a word size specified in bits and a byte address. For each input, the program should generate a word address and offset within the word. Note: although it is specified in bits, the word size must be a power of two bytes.
Answers
Answer:
Check the explanation
Explanation:
For 9th byte , it is from 8*8 bit to 9"8th bit so each word consists of 64 bits , to find word address u have to divide 8*8 by 64.
Offset within word = 9*8modulo 64.
For 27th byte , word address = 8*27/64.
Offset within word = 27* 8 modulo 64
For 21th byte , word address = 8*31/64
Offset within the word = 31*8 modulo 64
For 120 , word address = 8*120/64
Offset within the word = 120*8 modulo 64.
Write a program with functions that accepts a string as an argument and returns the number of vowels that the string contains. The application should have another function that accepts a string as an argument and return the number of consonants that the string contains. The application should let the user enter a string and should display the number of vowels and the number of consonants it contains.
Answers
Answer:
import java.util.Scanner;
public class num11 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.println("Enter a word or phrase");
String word = in.nextLine();
//Calling the methods
System.out.println("Total vowels in "+word+" are "+numVowels(word));
System.out.println("Total consonants in "+word+" are "+numConsonants(word));
}
public static int numVowels(String word){
//Remove spaces and convert to lowercase
//Assume that only correct character a-z are entered
String newWord = word.toLowerCase().replaceAll(" ","");
int vowelCount = 0;
for(int i = 0; i <= newWord.length()-1; i++){
if(newWord.charAt(i)=='a'||newWord.charAt(i)=='e'||newWord.charAt(i)=='i'
||newWord.charAt(i)=='o'||newWord.charAt(i)=='u'){
vowelCount++;
}
}
return vowelCount;
}
public static int numConsonants(String word){
//Remove spaces and convert to lowercase
//Assume that only correct character a-z are entered
String newWord = word.toLowerCase().replaceAll(" ","");
int consonantCount = 0;
//Substract total vowels from the length of the word to get the consonants
consonantCount = newWord.length()-numVowels(word);
return consonantCount;
}
}
Explanation:
Create two methods vowelCount() and consonantCount() both accepts a string parameter and returns an intvowelCount() Uses a for loop to count the occurrence of the vowels (a,e,i,o,u) in the string and returns the count.consonantCount calls vowelCount and subtracts the vowelCount from the string lengthIn the main Method the user is prompted to enter a stringThe two methods are called to return the number of vowels and consonantsObserve also that it is assumed that user entered only strings containing the character a-Z. Observe also that the string is converted to all lower cases and whitespaces removed.JAVA
In this exercise, you are given a phrase that starts with ‘A’. If the word after ‘A’ begins with a vowel, add an ‘n’ after the ‘A’, otherwise, return the phrase as is.
Example:
grammer("A word") --> "A word"
grammer("A excellent word") --> "An excellent word"
public String grammar(String phrase)
{
}
Answers
Answer:
Answer is provided in the attached screenshot
Explanation:
The character in the 2nd position will be always be the one we need to check. We then check if that character is a vowel, and replace the string as required.
Final answer:
To modify a phrase that starts with 'A' followed by a word that starts with a vowel by adding an 'n', one must write a Java function that checks the following character and adjusts the string accordingly.
Explanation:
The student's question pertains to a programming exercise in Java where the user needs to modify a string based on whether the word following an 'A' begins with a vowel or not. To solve this, you would need to check the character after the 'A ' for a vowel. If it's a vowel, an 'n' should be added to form 'An'. The Java function would use conditionals to check this and then return the modified or original phrase accordingly.
Here is an example of how the grammar function can be implemented:
public String grammar(String phrase) {
if(phrase.length() > 2 && phrase.substring(0, 2).equalsIgnoreCase("A ")) {
char nextChar = phrase.charAt(2);
if(nextChar == 'a' || nextChar == 'e' || nextChar == 'i' || nextChar == 'o' || nextChar == 'u') {
return "An " + phrase.substring(2);
}
}
return phrase;
}
5. Assume a computer has a physical memory organized into 64-bit words. Give the word address and offset within the word for each of the following byte addresses: 0, 9, 27, 31,120, and 256.
6. Extend the above exercise by writing a computer program that computes the answer. The program should take a series of inputs that each consist of two values: a word size specified in bits and a byte address. For each input, the program should generate a word address and offset within the word. Note: although it is specified in bits, the word size must be a power of two bytes.
Answers
Answer:
see explaination and attachment
Explanation:
5.
To convert any byte address, By, to word address, Wo, first divide By by No, the no. of bytes/word, and ignores the remainder. To calculate a byte offset, O, in word, calculate the remainder of By divided by No.
i) 0 : word address = 0/8 = 0 and offset, O = 0 mod 8 = 0
ii) 9 : word address = 9/8 = 1 and offset, O = 9 mod 8 = 1
iii) 27 : word address = 27/8 = 3 and offset, O = 27 mod 8 = 3
iv) 31 : word address = 31/8 = 3 and offset, O = 31 mod 8 = 7
v) 120 : word address = 120/8 = 15 and offset, O = 120 mod 8 = 0
vi) 256 :word address = 256/8 = 32 and offset, O = 256 mod 8 = 0
6. see attachment for the python programming screen shot and output
The word address is the integer division of the physical address by 8, while the offset is the remainder of the physical address divided by 8.
(a) Calculate the word address and offset
The number of bit is given as 64.
So, we have:
[tex]2^n = 64[/tex]
Express 64 as a base of 2
[tex]2^n = 2^8[/tex]
Cancel out the base of 2
[tex]n = 8[/tex]
So, we have:
(i) Physical address: 0
Word address = 0\8 = 0Offset = 0 mod 8 = 0
(ii) Physical address: 9
Word address = 9\8 = 1Offset = 9 mod 8 = 1(iii) Physical address: 27
Word address = 27/8 = 3Offset = 27 mod 8 = 3(iv) Physical address: 31
Word address = 31/8 = 3Offset = 31 mod 8 = 7(v) Physical address: 120
Word address = 120/8 = 15Offset = 120 mod 8 = 0(v) Physical address: 256
Word address = 256/8 = 32Offset = 256 mod 8 = 0(b) The program
The program written in Python, where comments are used to explain each line is as follows:
#This creates a list of physical address
pA = [0, 9, 27, 31,120, 256]
#This iterates through the list
for i in range(len(pA)):
#This prints the word address
print("Word Address:",(pA[i]//8))
#This prints the offset
print("Offset:",(pA[i]%8))
Read more about word address at:
https://brainly.com/question/17493537
Three batch jobs, A through E, arrive at a computer center at almost the same time. They have estimated running times of 10, 6, 2, 4 and 8 minutes. Their priorities are 3, 5, 2, 1 and 4 respectively, with 5 being the highest priority.
(a) For each of the following scheduling algorithms, determine the mean turnaround time. Ignore any process switching overhead.
1. Round Robin
2. Priority scheduling
3. First come, First served (run in order 10, 6, 2, 4, 8)
4. Shortest job first
For (a), assume that the system is multiprogrammed, and that each job gets its fair share of the CPU. For (b) through (d) assume that only one job runs at a time, until it finishes. All jobs are completely CPU bound.
Answers
Answer:
1. The average turn around time is 21.2 minute using round robin scheduling algorithm with a quantum time of 1 minute.
2. The average turn around time is 20 minute using Priority scheduling algorithm.
3. The average turn around time is 19.2 minute using First Come First Serve scheduling algorithm.
4. The average turn around time is 14 minute using Shortest Job First scheduling algorithm.
Explanation:
Gantt chart was used to solve the scheduling problem.
Image showing the Gantt chart and working solution is attached.
Round Robin scheduling algorithm is a type of scheduling that uses a time slice for each process/job. Once the time slice is complete, the process leave to join the queue again if it has not finished execution.
Priority scheduling algorithm is a type of scheduling algorithm that allows a process/job to execute/complete based on the order of priority. In this case, the higher the number, the higher the priority. With 5 having the highest priority.
First Come First Serve scheduling algorithm is a type of scheduling algorithm that allows execution of a process/job based on first come first server i.e based on order of arrival time. In this case the order is ABCDE.
Shortest Job First scheduling algorithm is a type of scheduling algorithm that allocate the CPU to the process/job having the shortest completion time first. In this case, Job C has the shortest completion time.
2. Write the binary representation of number 1037.379 in IEEE 754 standard in single precision. Express the result in binary, oct, and hex formats. 3. Write the binary representation of number 64.48 in IEEE 754 standard in double precision. Express the result in binary, oct, and hex formats. 4. Register f3 contains the 32-bit number 10101010 11100000 00000000 00000000. What is the corresponding signed decimal number
Answers
Answer:
-1.75
Explanation:
kindly refer to attachment for a detailed step by step solution to the problem.
After reading the case presented in the module, write a short response to the following discussion questions and ethical decision making scenario. Discussion Questions
What questions should Iris ask Charlie about the new job, Kelvin’s team, and the future of the company?
What questions should Iris ask Kelvin about the new job?
Had you been in Kelvin’s place, what would you have done differently to prepare for this meeting?
Answers
Final answer:
Iris should ask Charlie and Kelvin thorough questions about the job's responsibilities, the team dynamics, and the company's future. Reflecting on past decisions with an understanding of cognitive bias leads to better outcomes. It's essential to commit to ongoing critical reflection to avoid future biases in decision-making.
Explanation:
Discussion Questions for Iris
When considering questions that Iris should ask Charlie, she should be inquisitive about the specifics of the new job, the dynamics within Kelvin's team, and the future of the company. This includes asking about the job responsibilities, the team's current projects and goals, the team's working style and culture, any potential for advancement, and the company's vision for the future and stability.
Questions for Kelvin
Regarding questions for Kelvin, Iris could probe deeper into how the role fits into the company's larger strategy, how success will be measured for the new position, what the expectations are during the first few months, and how Kelvin envisions the position evolving. These questions would provide Iris with a comprehensive understanding of how her potential role manifests within the company's framework.
Hypothetical Scenario as Kelvin
If placed in Kelvin's position, to prepare for the meeting, I would ensure that I clearly understood the objectives for the new role, prepared a structured plan outlining how I would integrate the new member into the team, and had a thorough understanding of the company's future plans to address any inquiries. Reflecting on past decisions through the lens of cognitive bias would help mitigate any irrational elements involved in decision-making.
Impact of Different Behaviors
Had a different approach been taken, such as being more critical or self-aware, the consequences may have included more informed decision-making and reduced chances of miscommunication. Understanding the cognitive bias and employing critical reflection and metacognition could have led to better outcomes and a healthier decision-making process.
Conclusion and Lessons Learned
In conclusion, reflecting on experiences and understanding cognitive biases can profoundly impact personal growth and decision-making. This level of self-awareness can lead to improved choices in the future and help avoid repeating the same mistakes. Committing to ongoing critical reflection and seeking diverse perspectives are steps one can take today to prevent cognitive bias from clouding judgment.
public class Test { public static void main(String[] args) { try { method(); System.out.println("After the method call"); } catch (ArithmeticException ex) { System.out.println("ArithmeticException"); } catch (RuntimeException ex) { System.out.println("RuntimeException"); } catch (Exception e) { System.out.println("Exception"); } } static void method() throws Exception { System.out.println(1 / 0); } }
Answers
Answer:
"ArithmeticException" is the correct answer for the above question.
Explanation:
Missing Information : The above question does not hold that "what is the output of the program".
The above question has a class that holds the two functions one function is the main function which calls the other function in a try-catch block.The method function holds one run time exception which is 1/0 which is an arithmetic exception.It can be handle by the help of an arithmetic class object which is defined in the first catch block.Hence the print function of this catch is executed and prints "ArithmeticException".A professor wants to know if students are getting enough sleep. Each day, the professor observes whether the students sleep in class, and whether they have red eyes. The professor has the following domain theory:
• The prior probability of getting enough sleep, with no observations, is 0.7.
• The probability of getting enough sleep on night t is 0.8 given that the student got enough sleep the previous night, and 0.3 if not.
• The probability of having red eyes is 0.2 if the student got enough sleep, and 0.7 if not.
• The probability of sleeping in class is 0.1 if the student got enough sleep, and 0.3 if not.
Answers
Answer:
Each day, the professor observes whether the students sleep in class, and whether they have red eyes. The professor has the following domain theory: • The prior probability of getting enough sleep, with ... The probability of having red eyes if the student did not get enough sleep. • The probability of sleeping in class is if the ...
Explanation:
JAVA
Write a method that takes the last two values of a String and adds those two values three more times on to the end of the String.
For example, repeatTwo("karel") would return "karelelelel".
public static String repeatTwo(String word){
}
Answers
Answer:
Is in the provided screenshot
Explanation:
Get the last two characters and concatenate.
Final answer:
To solve the task, a method in Java is written that appends the last two characters of the input string three additional times to the end, using the substring method.
Explanation:
The task is to write a method in Java that takes a given string and appends the last two characters of that string three more times onto the end of it. This operation modifies the original string by repeatedly adding a substring that consists of its last two characters.
Method Implementation:
Here is how you can write the method:
public static String repeatTwo(String word) {
if (word == null || word.length() < 2) {
return word; // handle null and short strings
}
String lastTwoChars = word.substring(word.length() - 2);
return word + lastTwoChars + lastTwoChars + lastTwoChars;
}
This method first checks if the input string is null or shorter than two characters. If it isn't, it proceeds to use the substring method to extract the last two characters and concatenates this substring three times to the end of the original string.
We are interested in creating a grid of n boxes by n boxes. Each box in the grid is 5 x 5 pixels and the surrounding black border is 1 pixel thick. The second last row and the second last column of the boxes are of cyan color (RGB = [0, 255, 255]), rest all are white. Write a program which displays such a grid based on the number of boxes given by the user. Assume that the user will always input a value greater than 4.
Answers
Answer:
clc
clear
size = input('Enter the number of boxes in a row : ');
for i=1:size
for j=1:size
if i==size-1 || j==2
rectangle('Position',[i*size,j*size,size,size],'FaceColor',[0,1,1],'EdgeColor','black',...
'LineWidth',3)
else
rectangle('Position',[i*size,j*size,size,size],'FaceColor',[1 1 1],'EdgeColor','black',...
'LineWidth',3)
end
end
end
Explanation:
Privacy laws in other countries are an important concern when performing cloud forensics and investigations. You've been assigned a case involving PII data stored on a cloud in Australia. Before you start any data acquisition from this cloud, you need to research what you can access under Australian law. For this project, look for information on Australia's Privacy Principles (APP), particularly Chapter 8: APP 8 – Cross-border disclosure of personal information. Write a 2 to 3 page paper (not including title and reference pages) using APA format summarizing disclosure requirements for getting consent from data owners, and any exceptions allowed by this law. Writing Requirements
Answers
Answer:
See the explanation for the answer.
Explanation:
Australian regulations makes extremely difficult for the enterprises to move organizations sensitive data to the cloud which is storing outside the Australian network. These are all managed by the Office of Australian Information Commissioner(OAIC) which provides oversight on the data privacy regulations designed to govern the dissemination of the sensitive information.
One rule they applied under this is The Australian National Privacy Act 1988 which tells how the organizations collect, use, secure, store the information. The National Privacy Principles in the Act tells how organizations should use the people's personal information. The NPP has a rule that An organization must take the responsibility to hold the information without misuse or modified by unauthorized access. They require enterprises to put security service level agreements with the cloud service providers that define audit rights, data location, access rights when there is cross border disclosure of information.
In later time they introduced a new principle called The Privacy Amendment Act 2012. This principle gives set of new rules along with the changes in the many rules in the previous act and also this is having a set of new principles those are called Australian Privacy Principles (APP).
In this there is principle for cross border disclosure of personal information which is APP8. This rule regulates the disclosure or transfer of personal information by an agency or company to a different location outside the country.
Before disclosure the information outside they have to take responsible steps that the company outside the Australia must not breach the APP 's.
Tiny College wants to keep track of the history of all its administrative appointments, including dates of appointment and dates of termination. (Hint: Time- variant data is at work.) The Tiny College chancellor may want to know how many deans worked in the College of Business between January 1, 1960, and January 1, 2018, or who the dean of the College of Education was in 1990. Given that information, create the complete ERD that contains all primary keys, foreign keys, and main attributes. To upload and submit your assignment, click the Choose File button below to find and select your saved document. Make sure that the file is saved with your last name in the file name. (Example: ch5_problem1_Jones.doc)
Answers
Answer:
Explanation:
check below for the answer in d attached file
1- (8 point) The following questions relate to an array called numfrc. a) Define the size of the array to 25 by using a constant macro SIZE. b) Declare the array to be of type double and initialize the elements to 0. c) Assign the value of 6.666 to the 14 th element of the array from beginning. d) Refer to array element index 14 and assign the value of -6.666 to it. e) Assign the value 1.667 to array element index nine. f) Assign the value 3.333 to the seventh element of the array from beginning. g) Print array elements index 14 and 9 with two digits of precision to the right of the decimal point, and show the output that is displayed on the screen. h) Print all the elements of the array, using a for repetition statement. Assume the variable i has been defined as a counter control variable for the loop. Show the output as a table with index number and element value.
Answers
Answer:
Explanation:
Note: Alphabets refers to respective problem in question
Program:
#include<stdio.h>
#define SIZE 25
int main()
{
double numfrc[SIZE]; // (a)
for(int i=0;i<SIZE;i++) // (b)
numfrc[i]=0;
numfrc[13]=6.666; // (c)
numfrc[14]=-6.666; // (d)
numfrc[9]=1.667; // (e)
numfrc[6]=3.333; // (f)
for(int i=14;i>=9;i--)
printf("%2d ---> %.2lf\n",i,numfrc[i]); // (g)
printf("\n");
for(int i=0;i<SIZE;i++)
printf("%2d ---> %.2lf\n",i,numfrc[i]); // (h)
}
Output:
1) The program reads an integer, that must be changed to read a floating point. 2) You will need to move that number into a floating point register and then that number must be copied into an integer register. 3) You will need to extract the exponent from the integer register and stored in another register. 4) You will need to insert the Implied b
Answers
Answer:
1. Get the number
2. Declare a variable to store the sum and set it to 0
3. Repeat the next two steps till the number is not 0
4. Get the rightmost digit of the number with help of remainder ‘%’ operator by dividing it with 10 and add it to sum.
5. Divide the number by 10 with help of ‘/’ operator
6. Print or return the sum
# include<iostream>
using namespace std;
/* Function to get sum of digits */
class gfg
{
public:
int getSum(float n)
{
float sum = 0 ;
while (n != 0)
{
sum = sum + n % 10;
n = n/10;
}
return sum;
}
};
//driver code
int main()
{
gfg g;
float n = 687;
cout<< g.getSum(n);
return 0;
}
Explanation:
1) Your program must contain functions to: deposit, withdraw, balance inquiry and quit. 2) Based on the selection made by the user the functions must be called with the following criteria: a. A user can deposit any amount of money in their account. The function must display the new balance after depositing. by. A person can withdraw an amount as long as it is lower than or equal to his current balance. The function must also display a warning if the new balance is below $100. Must not allow the user to withdraw if amount is great than current balance. Before this function ends - the new balance must be displayed. c. Balance inquiry function must display the balance.
Answers
Answer:
import java.util.Scanner;
public class num6 {
static double balance = 10000.5; //Current Balance
//The main Method
public static void main(String[] args) {
//Request User Input
System.out.println("Enter 1 for deposit \nEnter 2 for Withdraw\nEnter 3 for Balance Enquiry\n0 to quit ");
Scanner in = new Scanner(System.in);
int op = in.nextInt();
//Check to determine the Operation the user wants
if(op == 1){
System.out.println("Enter amount to deposit");
double depositeAmount = in.nextDouble();
deposit(depositeAmount); //Call the deposit method
}
if(op == 2){
System.out.println("Enter amount to Withdraw");
double withdrawAmount = in.nextDouble();
//validate the withdraw amount
if(withdrawAmount > balance){
System.out.println("Insuffucient fund");
System.out.println("Your current balance is "+balance);
}
else {
withdraw(withdrawAmount);//Call withdraw Method
}
}
if(op == 3){
balanceEnquiry();
}
}
//Deposit Method
public static double deposit(double depositAmount){
double newBalance = balance + depositAmount;
System.out.println("You deposited "+depositAmount+"Your new balance is "+newBalance);
return newBalance;
}
//Withdraw Method
public static double withdraw(double withdrawAmount){
double newBalance = balance - withdrawAmount;
System.out.println("You Withdrew "+withdrawAmount+"Your new balance is "+newBalance);
if(newBalance < 100){
System.out.println("Your Balance is low");
}
return newBalance;
}
//Balance Enquiry Method
public static void balanceEnquiry(){
System.out.println("Your current balance is "+balance);
}
}
Explanation:
This is solved in Java programming language
See code explation provided as comments
Write a complete program that declares an array of 1000 integers and initializes each element in the array to have a value equal to the index of that element. That is, the value at index 0 should be 0, the value at index 1 should be 1, the value at index 2 should be 2, and so on. Then, ask the * user for a single integer input. Triple the value of each element in the * array whose value is divisible by that user input. You do not need to print out the array or anything else except for the user input prompt. You can assume that the user will input an integer when prompted.
Answers
Answer:
see explaination
Explanation:
import java.util.Scanner;
class Main
{
public static void main (String[] args)
{
int []A = new int[1000]; // Declaration of array which will store 1000 integers
for( int i = 0; i<1000; i++ )
A[i] = i; // will initialise elements of array equal to their index
System.out.print("Enter a value: ");
Scanner sc = new Scanner(System.in);
int num = sc.nextInt(); // Prompts the user to enter value
for( int i = 0; i<1000; i++ )
{
if( A[i]%num==0 ) //checks if the element is divisible by the entered value
A[i] = 3*A[i]; // Triples the value and reassigns to the same element
}
}
}
2. Using the Enhanced for Statement, write an application that uses an enhanced for statement to sum the double values passed by the command-line arguments. [Hint: Use the static method parseDouble of class Double to convert a String to a double value.] This is sample run of your program: The·sum·of·the·double·values·passed·in·from·the·command·line·is·0.0↵
Answers
Answer:
Here is the program:
public class DoubleValue
{ public static void main(String[] args) { //start of the main function
double sum = 0.0; // initialize double type sum by 0.0
//for statement to sum the double values passed by the command-line //arguments
for (String str : args) {
sum += Double.parseDouble(str);
//returns double representation of the passed str argument and takes the //sum of these double values }
System.out.printf("The sum of the double values passed in from the command line is %.1f\n", sum); } }
//prints the above message with output 0.0
Explanation:
The above program has a static method parseDouble of class Double to convert a string str to a double value and the for statement is used to sum the double values passed by command line arguments. This sum is stored in sum variable and is displayed in the output. The program along with its output is attached.
If you want to get the input from the user you can use the following code. Just use the Scanner class to take input from the user.
import java.util.Scanner;
public class DoubleValue
{ public static void main(String[] args) {
//two string type variables
String str1;
String str2;
//scans and reads input from user
Scanner input = new Scanner(System.in);
System.out.println("Enter value of str1: ");
str1 = input.next();
System.out.println("Enter value of str2: ");
str2 = input.next();
double sum = 0.0;
//sum double values and parseDouble function is used to convert string to //double value
sum += Double.parseDouble(str1) + Double.parseDouble(str2);
System.out.printf("The sum of the double values passed in from the command line is %.1f\n", sum); } } //prints result of the sum
Final answer:
The code provided illustrates how to sum double values passed through command-line arguments in Java, using Double.parseDouble and an enhanced for loop, demonstrating important concepts in parsing and arithmetic operations in programming.
Explanation:
The question involves writing a Java application to sum double values passed through command-line arguments using an enhanced for loop, illustrating a practical application in parsing and arithmetic operations in programming. This task requires knowledge of Java's Double.parseDouble method and the enhanced for loop. To accomplish this, a main method is created where the command-line arguments are accessed. Each argument, which is initially a String, is converted to a double using Double.parseDouble, and then summed in an enhanced for loop. Here is a simple implementation:
public class SumDoubles {
public static void main(String[] args) {
double sum = 0.0;
for (String arg : args) {
sum += Double.parseDouble(arg);
}
System.out.println("The sum of the double values passed in from the command line is " + sum);
}
}
This code snippet effectively addresses the task by converting command-line arguments from String to double and summing them. It demonstrates the use of command-line arguments, Double.parseDouble, and an enhanced for loop in Java.
1. An integer in C (int) is represented by 4 bytes (1 byte = 8 bits). Find the largest integer that can be handled by C. Verify that number by computer (try to printf that number, and printf that number +1). No programming is required for this. Hint: (a) Conversion from binary to decimal: 3 2 1 0 2 1101 =1 2 + 0 2 +1 2 +1 2 = 8 + 0 + 2 +1 10 =11 (b) If an integer is represented by 1 byte (8 bits), the maximum integer number is 1111111 (Seven 1's as one bit must be reserved for a sign). 6 5 0 2 1111111 =1 2 +1 2 ++1 2 1 2 1 7 = − =128 −1 (c) The number looks like a telephone number in Dallas.
Answers
Answer:
Check the explanation
Explanation:
In C, int requires 4 butes to sotre a integer number. that means it requires 4*8 = 32 bits. The maximum number can be stored using 32 bits is
[tex](11111111111111111111111111111111)_2[/tex]
The first digit is used for sign. decimal equivalent to this number can be computed as
[tex](1111111111111111111111111111111)_2= 1\times2^{30}+1\times2^{29}+...+1\times2^0[/tex]
=[tex]1\times2^{31}-1[/tex]
= [tex]2147483647-1=2147483646[/tex]
That means int can store a up to 2147483646.
Testing with C code
#include<stdio.h>
int main()
{
int a = 2147483647; // a with max number
printf("%d\n",a);// printing max number
a = a+1;// adding one to the number
printf("%d\n",a);// printing the number after adding one
return 0;
}
THE OUTPUT
$ ./a.out
2147483647
-2147483648
The largest integer that can be represented by an int in C is 2,147,483,647. Adding 1 to this maximum value leads to an integer overflow, resulting in the smallest possible integer that can be handled in C, which is -2,147,483,648.
Explanation:In C, an integer (int) is typically represented using 4 bytes, or 32 bits. However, one bit is reserved for indicating the sign of the integer (positive or negative), leaving 31 bits for the numerical value. In binary notation, the maximum number that can be represented with 31 bits all set to 1 is 231-1. By direct calculation, this is 2,147,483,647. Therefore, the largest integer that can be represented by an int in C is 2,147,483,647.
When you try to add 1 to this maximum value (e.g., printf the number 2,147,483,647 + 1), the result will not be as expected because it leads to an integer overflow. Instead, it would give you the smallest possible integer that can be handled in C, which is -2,147,483,648.
Learn more about C Programming here:https://brainly.com/question/34799304
#SPJ3