//This is an ArrayReverser Problem..

import java.util.Scanner;

public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
  
// Read in the list of numbers
int[] numbers;
String input = sc.nextLine();
if (input.equals("")) {
numbers = new int[0];
} else {
String[] numberStrings = input.split(" ");
numbers = new int[numberStrings.length];
for (int i = 0; i < numberStrings.length; i++) {
numbers[i] = Integer.parseInt(numberStrings[i]);
}
}
  
// Reverse the list
int[] resultArray = reverseArray(numbers);
  
// Print the reversed list
StringBuilder resultSb = new StringBuilder();
for (int i = 0; i < resultArray.length; i++) {
resultSb.append(new Integer(resultArray[i]).toString());
if (i < resultArray.length - 1) {
resultSb.append(" ");
}
}
System.out.println(resultSb.toString());
}
  
public static int[] reverseArray(int[] originalArray) {
// TODO implement this function
throw new UnsupportedOperationException();

//put code here
}
}

//Thanks.

Question 2: How can we find the real root of a polynomial with one variable? Also discuss the Newton-Raphson method.

you may not use the Python ord() or chr() functions

you may not use the Python ord() or chr() functions

you may not use the Python ord() or chr() functions

You will write a total of four functions, each of which will take two inputs and return a string:

1. c_encrypt()
2. c_decrypt()
3. vig_encrypt()
4. vig_decrypt()

The first argument will be a string containing the plaintext (or clear text) message to be encrypted for the two encrypt functions, and a string containing a ciphertext to be decrypted. The second argument will be the key.

For this assignment, you will always leave all characters in plaintext or ciphertext that are not letters (i.e., spaces and punctuation marks) unchanged.

Plaintext message letters may be either upper or lower case, but you should output only upper case ciphertext.

Remember the string function upper() you used in lab.

Note that you are writing two functions for each cryptosystem, an encrypt and a decrypt, so one partial test of the correctness of your work is whether first encrypting and then decrypting returns the original string (except that you may have converted some lower case letters to upper case).

Caesar Cipher

Caesar part of the homework: Write c_encrypt() and c_decrypt(), both of which take two arguments, the first one a string and the second one an integer key.

Both should return a string.

This will be much easier if both functions use the cencrypt() shift function you wrote for the lab.

As with the lab, you may not use the Python ord() or chr() functions

Vigenère Cipher

The Vigenère Cipher was more or less completely unbreakable from its introduction sometime in the 1500s until well into the 1800s.

The key in Vigenère is a key word that is used over and over again to give a different key to the Caesar cipher for each letter of the encryption (and decryption), with 'A', in good Python form, representing a rotation of 0. (We Pythonistas start at 0, not 1!)

So if the key is ABACUS, then we encrypt:

• the first letter of our message with a Caesar cipher with a key/rotation of 0, because A is the first letter of the alphabet,
• the second letter with a key/rotation of 1 (for the 'B'),
• the third letter with a rotation of 0 (for the second 'A' of ABACUS),
• the fourth letter with a key/rotation of 2 for the 'C',
• the fifth letter with a key/rotation of 20 for the 'U',
• the sixth letter with a key/rotation of 18 for the 'S',
• and wrap back to the start of our keyword ABACUS and encrypt the seventh letter with a key/rotation of 0 for the first 'A' in ABACUS

Back in the 1800s people wanting to use this system would make use of a Vigenère square, also known as the tabula recta, shown in the middle of the Wikipedia entry for the Vigenère cipher, but we can use Python.

Vigenère part of the homework: Write vig_encrypt() and vig_decrypt() functions. Each takes two strings as inputs, with the first being the plaintext/ciphertext, and the second being the key. Both should be calling functions you wrote earlier to help make the work easier.

The key will be a string consisting only of letters, but the letters might be in upper, lower, or mixed case. Important: If the plaintext to be encrypted has non-alphabetic characters (e.g., spaces or punctuation):

• Leave the non-alphabetic character unchanged just as you did for Caesar Cipher.
• Do not advance in use of the key for non-alphabetic characters in the plaintext. So for vig_encrypt('Hi Mom!', 'LEMON'), the H is encrypted according to the L from the key, the i (after conversion to I) is encrypted according to the E in the key, and the M in the plaintext is encrypted according to the M in the key (rather than according to the O in the key).

One check on your work: vig_encrypt('ATTACKATDAWN', 'LEMON') should return the string LXFOPVEFRNHR; another is that vig_encrypt('Hi Mom!', 'LEMON') should return the string SM YCZ!

you may not use the Python ord() or chr() functions

you may not use the Python ord() or chr() functions

you may not use the Python ord() or chr() functions

Question 3: What is Function? Explain with examples. Provide at least 2 program examples.

C++ programming interest using for loops.

I'm fairly new to C++ programming. I really don't get for loops, and wanted help with this question. How do I go about it?

1a.

Write a program to ask the user for the starting balance of their savings account, what interest rate they are earning, and how many years they are planning to keep the account open. To calculate the new balance, including compounded interest: use a for loop to loop through the number of years the user specifies (1, 2, 3, 4, … years) and each time through the loop update the account balance using the following formula:

balance = balance * (1 + interest rate / 100.0)   // this adds one year’s interest to the account
              balance = initialBalance * (1 + interest rate / 100.0) // this will only calculate one year’s interest no matter how
                                                                                                                   many times you repeat it.

1b.

Now write the code to show the user how much money they would have after ONE year, depending on the different interest rates. Ask the user for a minimum and maximum interest rate (e.g. 3.0 and 8.5 … note you may need to swap the values if the user enters them out of order). Use a for loop to loop through the possible interest rates at 0.5 increments (3.0, 3.5, 4.0, 4.5, … 8.5) and each time through the loop calculate the user’s account balance after one year at the specified interest rate:

                             balance = initialBalance * (1 + interest rate / 100.0) // this time you want the initial balance

Write a class encapsulating the concept of a student, assuming a student has the following attributes: a name, a Social Security number, and a GPA (for instance, 3.5). Include a constructor, the accessors and mutators, and methods toString and equals. Write a client class (test driver with main method) to test all the methods in your class (create 2 student objects, print the name, social security number and GPA of the 2 students, check if the two student’s GPA is the same or equal, change the name of the first student).

FOR JAVA (ZYBOOK) Write a method swapArrayEnds() that swaps the first and last elements of its array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}.

I can't modify/change any of the code. I can only add code to implement this where it says /* Your solution goes here */.

This is the code:

import java.util.Scanner;

public class ModifyArray {

/* Your solution goes here */

public static void main (String [] args) {
Scanner scnr = new Scanner(System.in);
int numElem = 4;
int[] sortArray = new int[numElem];
int i;
int userNum;

for (i = 0; i < sortArray.length; ++i) {
sortArray[i] = scnr.nextInt();
}

swapArrayEnds(sortArray);

for (i = 0; i < sortArray.length; ++i) {
System.out.print(sortArray[i]);
System.out.print(" ");
}
System.out.println("");
}
}

You are the IT director at Big Ten University. As part of a training program, you decide to draw a DFD that includes some obvious mistakes to see whether your newly hired junior analysts can find them. You came up with the diagram 0 DFD shown in Figure 5-19. Based on the rules explained in this chapter, how many problems should the analysts find?

A cubic polynomial is of the form: f(x) = Ax^3 + Bx^2 + Cx + D   

A root of the polynomial is a value, x, such that f(x)=0.  

Write a program that takes in the coefficients of a cubic polynomial: A, B, C, and D. The program finds and reports all three roots of the polynomial.

Hint: First use bisection method to determine a single root of the polynomial. Then divide the polynomial by its factor to come up with a quadratic equation. You may use the procedure described here: https://www.purplemath.com/modules/synthdiv.htm. Subsequently, solve the quadratic equation.

The code should be written in python.

In Java

The Problem

In his book Irreligion, the mathematician John Allen Paulos tells an amusing story about the Dutch astronomer Cornelis de Jager, "who concocted the following algorithm for personalized physical constants, [and] used it to advance a charming theory about the metaphysical properties of Dutch bicycles." First select any positive real-valued universal physical or mathematical constant that seems interesting to you, e.g., π, e, Planck's constant, the atomic weight of molybdenum, the boiling point of water in Kelvin, whatever you like. Call this constant μ. Then select any four positive real numbers not equal to 1 that have personal meaning to you, e.g., your favorite number, day or month or year of birth, age in fortnights or seconds, weight in stones or grams, height in furlongs or millimeters, number of children, house number, apartment number, zip code, last four digits of SSN, whatever you like. Call these four personal numbers w, x, y, and z.

Now consider the de Jager formula w^ax^by^cz^d, where each of a, b, c, and d is one of the 17 numbers {-5, -4, -3, -2, -1, -1/2, -1/3, -1/4, 0, 1/4, 1/3, 1/2, 1, 2, 3, 4, 5}. The "charming theory" asserts that the de Jager formula with your four personal numbers can be used to approximate μ within a fraction of 1% relative error. For example, suppose you choose to approximate the mean distance from the earth to the moon in miles: μ = 238,900. And suppose you are an OSU sports fan, so your personal numbers are the number of wins in OSU's last national championship season (14), the seating capacity of Ohio Stadium (102,329), the year of Jesse Owens' four gold medals in Berlin (1936), and your jersey number when you played high school field hockey (13). Then the value of 14^-5102329¹1936^1/213⁴ is about 239,103, which is within about 0.08% of μ.

Your job is to create a Java program that asks the user what constant μ should be approximated, and then asks in turn for each of the four personal numbers w, x, y, and z. The program should then calculate and report the values of the exponents a, b, c, and d that bring the de Jager formula as close as possible to μ, as well as the value of the formula w^ax^by^cz^d and the relative error of the approximation to the nearest hundredth of one percent (see SimpleWriter print(double, int, boolean) for a method you may find useful for this). Note that your program must find the combination of exponents that minimizes the error of the approximation of μ and then print the exponents, best approximation, and corresponding relative error. (Essentially this program could be used to disprove the "charming theory" by finding μ, w, x, y, and z such that the best approximation of μ results in a relative error that is greater than 1%.)

Method

1. Create a new Eclipse project by copying ProjectTemplate or a previous project you have created, naming the new project Pseudoscience. In the src folder of this project and the default package, create a class called ABCDGuesser1.
2. Edit ABCDGuesser1.java to satisfy the problem requirements stated above, as well as the following additional requirements:
   • Use only while loops for iteration.
   • Check that the inputs provided by the user are valid, i.e., the input for μ is a positive real value and the inputs for w, x, y, and z are each a positive real value not equal to 1. You should implement and use two new static methods declared as follows:

     1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

     /** * Repeatedly asks the user for a positive real number until the user enters * one. Returns the positive real number. * * @param in *            the input stream * @param out *            the output stream * @return a positive real number entered by the user */ private static double getPositiveDouble(SimpleReader in, SimpleWriter out) {...}    /** * Repeatedly asks the user for a positive real number not equal to 1.0 * until the user enters one. Returns the positive real number. * * @param in *            the input stream * @param out *            the output stream * @return a positive real number not equal to 1.0 entered by the user */ private static double getPositiveDoubleNotOne(SimpleReader in, SimpleWriter out) {...}

     Note that you cannot assume the user will provide a number; the user can type pretty much anything. So your methods should read the input as a String (use SimpleReader nextLine() method), then make sure that the input is a real number (use FormatChecker.canParseDouble()), and finally convert the string to a double (use Double.parseDouble()).
3. Copy ABCDGuesser1.java to create ABCDGuesser2.java. Change it so the while loops in the main method are replaced by for loops (but you should not change the loops in the bodies of getPositiveDouble and getPositiveDoubleNotOne), and so it uses at least one additional private static method.

Decision Structures Calorie Calculator Assignment Overview This assignment will give you practice with numerical calculations, simple input/output, and if-else statements. Program Objective: In this exercise, you will write a program the calculates the Daily Caloric needs for weight lose diet. According to everydayhealth.com they recommend this daily caloric formula for a weight loss diet: BMR + Activity Level - 500 calories. Calories Calculator The Harris-Benedict equation estimates the number of calories your body needs to maintain your weight if you do no exercise. This is called your basal metabolic rate or BMR. The Calories needed for a woman to maintain her weight is: BMR = 655 + (4.3 * weight in pounds) + (4.7 * height in inches) - (4.7 * age in years) The Calories needed for a man to maintain his weight is: BMR = 66 + (6.3 * weight in pounds) + (12.9 * height in inches) - (6.8 * age in years) Next, the total daily caloric requirement is calculated by multiplying your BMR by your level of activity: • If the person is inactive (rarely exercise), then increase the calculated BMR 20%. • If the person is somewhat active, then increase the calculated BMR by 30% • If the person is active, then increase the calculated BMR by 40% • If the person is highly active then increase the calculated BMR by 50% Program Specification: Write a program that allows the user to input their weight in pounds, height in inches, and age in years. Ask the user to input the string “M” if the user is a man and “W” if the user is a woman. Use only the male formula to calculate calories if “M” is entered and use only the women formula to calculate calories if “W” is entered. Ask the user if he or she is: A. Inactive B. Somewhat active (exercise occasionally) C. Active (exercise 3-4 days per week) D. Highly active (exercise every day) • If the user answers “Inactive” then increase the calculated BMR by 20 percent. • If the user answers “Somewhat active” then increase the calculated BMR by 30 percent. • If the user answers “Active” then increase the calculated BMR by 40 percent. • Finally, if the user answers “Highly active” then increase the calculated BMR by 50 percent. • The program should then output the calculated daily Calories intake for this person in order to lose one pound per week by subtracting 500 calories from the calculated BMR. Input Errors • If the user enters an age either < 1 or > 100, instantly end the program with an error message. • If the user enters a height < 10 or > 100, instantly end the program with an error message. • If the user enters a weight < 10 or > 500, instantly end the program with an error message. • You can assume that the user does not type some non-numeric value. You don't have to test for this kind of non-numeric error. • If the user does not enter ‘M' for male calculation or 'W' for female calculation, instantly end the program with an error message. • If the user does not enter A, B, C, or D when prompted, instantly end the program with an error message. These limits must be defined as symbolic constants, which should be used throughout the program. Rules: • For this assignment you are limited to the Java features in Chapters 1 through 3; you are not allowed to use more advanced features to solve the problem. Please do not use Java features that are not covered in lecture or the textbook. • Use class constants as appropriate to represent important fixed data values in your program. • Follow programming guidelines and Java’s naming standards about the format of ClassNames, variableNames, and CONSTANT NAMES. • Notice that all real numbers output by the program are printed with no more than 2 digits after the decimal point. To achieve this, you may use the System.out.printf method. • Add the header to the class file and copy/paste the output that is produced by your program into the bottom of the source code file, making it into a block comment. • Class Name: Your program class should be called CalorieCalculator.

Hello I need a small fix in my program. I need to display the youngest student and the average age of all of the students. It is not working Thanks.

#include <iostream>

#include <iomanip>

#include <fstream>

#include <vector>

#include <algorithm>

using namespace std;

struct Student {

string firstName;

char middleName;

string lastName;

char collegeCode;

int locCode;

int seqCode;

int age;

};

struct sort_by_age {

inline bool operator() (const Student& s1, const Student& s2)

{

return (s1.age < s2.age); // sort according to age of student

}

};

// main function to run program

int main() {

//CHANGE: vector students; TO vector students;

vector<Student> students; // create vector object to hold students data

ifstream Myfile; // create input file stream object

Myfile.open("a2data.txt"); // open file

// check if file is open

if (!Myfile.is_open()) {

// display error message if file could not be opened

cout << "Could not open the file!";

return 0; //terminate

}

//CHANGE: vector words; TO vector words;

vector<string> words; // create vector object to store words from input file

//read input from file line by line

string line;

while (!Myfile.eof()) {

getline(Myfile, line); // readline from input file stream

line.c_str(); // convert string in to char array

// file given in eample does not contain one record each line

// but it hase some patern for reading

// each word is seprated by space

//read the liine till space is encountered and get the word

int i = 0; // iterator to iterate over line

string word = "";

while (line[i] != '\0') {

// loop till end of line

if (line[i] != ' ') {

word = word + line[i]; // build word with char

i++;

}

else {

if(word!="")

words.push_back(word); // add word to vector

word = ""; //reset word to empty string

i++; //ignore white space

}

}//end of line

words.push_back(word); // add word to vector

}//end of file

//when done reading input from file close the file stream

Myfile.close();

int count = 0; // counts the words proceesed from vector object words

string fname = words.at(count); // variable to store first name of student

count++; //move to next element in the vector

//CHANGE: count < words.size() TO count < words.size() - 2

// at least two words are read in an iteration, so at least two should remain to be read - last name + student id

while (count < words.size() - 2) {

// loop till end of vector words

// create student object

Student s;

//assign first name to student

s.firstName = fname;

//next element in words is middle name

//assign first char to middle name

string mname = words.at(count);

s.middleName = mname[0];

count++;

//next element is last name of student

//assign next word to student

s.lastName = words.at(count);

//CHANGE: start

//If there was no middle name, this is the student id + first name of next student

if(words.at(count).size() >= 12) // college code + locCode + seq + age

{

if(words.at(count)[1] >= '0' && words.at(count)[1] <= '9') // if second character is a digit

{

// this is the student id field, and there is no middle name

count --; // move one step back for next iteration

s.middleName = ' '; //blank middle name

s.lastName = words.at(count);

}

}

//CHANGE: end

count++;

//next element is student id + first name of next student

//id contains college code at first latter

string id = words.at(count);

count++;

//assign college code to the student

s.collegeCode = id[0];

//next 2 char in id contain location

string loc = "";

loc = loc + id[1];

loc = loc + id[2];

// assign location to student

s.locCode = stoi(loc); // convert string to integer

//next 6 char in id contain seqcode

string seq = "";

for (int j = 3; j < 9; j++) {

seq = seq + id[j];

}

// assign seqcode to student

s.seqCode = stoi(seq); //convert string to int

//next 3 char in id contains age

string age = "";

age = age + id[9];

age = age + id[10];

age = age + id[11];

//assign age to student

s.age = stoi(age); // convert string to int

//remainig latters in id contains next student's first name

// delete id of previous student to get name of next student

fname = id.erase(0, 12); // delete first 12 char from id and assign remaining to fname

// add student to student

students.push_back(s);

}

// clear the vector as done working with words

words.clear();

//sort vector according to age of students

sort(students.begin(), students.end(), sort_by_age());

// formating output

cout << setw(15) << left << "Last Name";

cout << setw(15) << left << "Midlle Name";

cout << setw(15) << left << "First Name";

cout << setw(15) << left << "College Code";

cout << setw(12) << left << "Location";

cout << setw(12) << left << "Sequence";

cout << setw(12) << left << "Age" << endl;

cout << "=======================================================================================" << endl;

// print all students

for (int i = 0; i < students.size(); i++) {

cout << setw(15) << left << students.at(i).lastName;

cout << setw(15) << left << students.at(i).middleName;

cout << setw(20) << left << students.at(i).firstName;

cout << setw(13) << left << students.at(i).collegeCode;

cout << setw(10) << left << students.at(i).locCode;

cout << setw(12) << left << students.at(i).seqCode;

cout << students.at(i).age << endl;

}

//print average age

cout << endl;

  

int avg_age = ageCalc(arry, youngest);

cout<<"Average age is: "<<avg_age<<endl;

cout<<"Youngest student is "<<youngest->firstName<<" "<<youngest->MiddleN<<" "<<youngest->LastN<<endl;

for(int i=0; i<index; i++){

delete arry[i];

}

return 0;

}

int ageCalc(Student *studs[], Student *&youngest){

youngest = studs[0];

int i = 0;

int avg_age = 0;

while(studs[i]!=NULL){

avg_age += studs[i]->age;

if(youngest->age>studs[i]->age)

youngest = studs[i];

i++;

}

return avg_age/i;

}

File needed:

https://drive.google.com/file/d/15_CxuGnFdnyIj6zhSC11oSgKEYrosHck/view?usp=sharing

Iterative Merge Sort is not working

#include
#include
#include
int* b;
void merge(int a[], int left, int mid, int right)
{
   int i = left, j = mid + 1, k = left;

   while (i <= mid && j <= right)
   {
       if (a[i] < a[j])
           b[k++] = a[i++];
       else
           b[k++] = a[j++];
   }
   for (; i <= mid; i++)
   {
       b[k++] = a[i];
   }
   for (; j <= right; j++)
   {
       b[k++] = a[j];
   }
   for (int i = left; i <= right; i++)
   {
       a[i] = b[i];
   }

}
void mergesort(int a[], int n)
{
   int p, left, right, mid, i;
   for (p = 2; p <= n; p = p * 2)
   {
       for (i = 0; i + p - 1 < n; i = i + p)
       {
           left = i;
           right = i + p - 1;
           mid = (left + right) / 2;
           merge(a, left, mid, right);
       }
   }
   if (p / 2 < n)
   {
       merge(a, 0, (p / 2) - 1, n - 1);
   }
}
void main()
{
   int max, * a;
   scanf("%d", &max);
   a = (int*)malloc(sizeof(int) * max);
   b = (int*)malloc(sizeof(int) * max);
   for (int i = 0; i < max; i++)
   {
       scanf("%d", &a[i]);
   }
   mergesort(a, max);
   for (int i = 0; i < max; i++)
   {
       printf(" %d", a[i]);
   }
}

input 50

50 49 48 47 46 45 ~ 5 4 3 2 1

output

3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 1 2 19 20 21 22 23 24 ~ 50

why 1,2 are between in 18 and 19?

please answer and correct code

1 Please answer the following:

a) Rank the following storage systems from slowest to fastest: a. Hard-disk drives b. Registers c. Optical disk d. Main memory e. Nonvolatile memory f. Magnetic tapes g. Cache

b) How are iOS and Android similar? How are they different?

Write a Python program that reads in an amount in cents and prints the dollar amount in that and the remaining value in cents. For example, if the amount reads in is 360 (cents), the program would print 3 dollars and 60 cents. if the amount read in is 75 (cents), the program would print 0 dollars and 75 cents.