Question: hello ..c++ help assignment..MA System.out.print(5 entered); else if (answer != 0 & 1 & 3 & 5) System.out.print(Other value entered);The fragment executes more times through

hello ..c++ help assignment..MA

System.out.print("5 entered"); else if (answer != 0 & 1 & 3 & 5) System.out.print("Other value entered");The fragment executes more times through the loop than is necessary. What change to the fragment can be made that removes the unneeded passes through the loop and doesn't change the values of i and sum that are printed out?switch (answer)When answering the next 5 questions, consider this program; comments indicate where missing needed components of the program are to be placed.public class MainClass { //definition of a function that prints out a greeting public static void main(String[] args) { //(2) print the greeting //(3) construct a MyClass object called myObject //(4) update myObject // print myObject } } class MyClass { // (1) definition of MyClass constructor public static void greetings() { // definition of greets } public void update(int num, String title) { // definition of update } public void print() { // definition of print } private int numOfItems; private String reportTitle; }

public static int theValue() { boolean notDone = true; int foundIt = -9; do { System.out.print("Enter score: "); int cntScore = getInt(); //assume getInt() is defined as in lab if (cntScore != -99) { if ((cntScore >= 0) && (cntScore foundIt) foundIt = cntScore; } else notDone = false; } while (notDone == true); return foundIt; }

First i need help creating a function in ASM language that multiplies 2 unsigned 64 bit values, using the function prototype called multiply64u. Then i need help creating another function in ASM language that multiplies 2 signed 64 bit values using the function prototype multiply64s. Both of these functions will be called in a C program, which i also need help creating.

Next i need help creating function in ASM language that will read 16 GPRs and the flag register. Use the function prototype called readRegs that i will write down below this question.

Remember the multiply and read register functions should be written in ASSEMBLY CODE x86-64. NOT C language. The C program needs to call the functions and output the results provided by the ASM code.

For the multiply functions you must test 16 digit hex values that do not exceed 128 bit result and print all 16 GPRs and the flag register.

Here are the prototypes:

long readRegs(long *rptr ); //read all regs into rptr

unsigned char multiply64u (unsigned long m1, unsigned long m2, unsigned long *highptr, unsigned long *lowptr);

unsigned char multiply64s (long sm1, long sm2, long *highptrs, long *lowptrs)

These prototypes need to be called in C program but written in ASM code in a separate program.

I need 2 programs. Not one, not 3. Two! Please help!!!!! Don't tell me i'm missing a reference either. That makes no sense and isn't needed to answer this question.

Briefly comment on the regression results, such as which independent variables are statistically significant and how they are related to audit fees. Are the associations between each independent variables and audit fees same when firms report losses versus when they report profits? (5 points, show codes only) Propose a model to examine tax fees. Write down your dependent variable (Y) and independent variables (Xs). Show your codes on how to

hello ..c++ help assignment..MASystem.out.print("5 entered"); else if (answer != 0 & 1

Logistic regression: Suppose we have labeled data (X;, yi), where x; E Rd, y E {0, 1}. We want to compute w that minimizes the following negative log-likelihood function: N minimize yi log(1 + exp(-w x;)) + (1 - yi) log(1 + exp(w xi)). (1) W i= 1 Let us denote the objective of this function as J(w). (Note that we could also define y; E {-1,1} and rewrite the objective in (1) as J(w) = Em log(1 + exp(-yiw/xi).) (a) Show the the following log-logistic function is convex: (10 pts) f(w) = log(1 + exp(-w x)). You may assume that x is a scalar and show that the second derivative of f(w) w.r.t. w is always positive. (b) Next you will write a Python script for logistic regression that solves (1) using gradient descent algorithm with a fixed step size o. You will then use your code to learn to classify images of

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!