[solved] – Question 74698
Under data transformation, list five different functions you can think of.
Expert Answer
[solved] – Question 74699
Why do you need a separate data staging component?
Expert Answer
[solved] – Question 74701
Make a Update Query that will add the phrase “Free Champagne for this Preferred Guest” to the Comments field, but only if the guest stays for days or more.
CHECK-IN DATECHECK-OUT DATE
2/28/20183/28/2018
3/27/20183/31/2018
3/5/20183/17/2018
3/1/20183/3/2018
3/11/20183/15/2018
3/6/20183/14/2018
4/8/20184/19/2018
3/5/20183/10/2018
3/11/20183/17/2018
3/22/20183/24/2018
3/18/20183/24/2018
2/28/20183/3/2018
3/18/20183/24/2018
3/19/20183/30/2018
3/18/20183/23/2018
3/1/2018 3/3/2018
3/4/2018 3/9/2018
Expert Answer
[solved] – Question 74703
Does anyone know how to write a code that allows the user enters a valid decimal value for the length.
Expert Answer
[solved] – Question 74717
Course JAVA Programming
Case Study
Case Study:
Read the following and create appropriate java applets
a.Create a try block that is likely to generate two types of exception and then incorporate necessary catch block to handle them appropriately.
b.Create a java applet with a button “Display”. On click of the button it should display rectangle, oval and circle within the applet
c.Create the following form in Java:
Q1. Subject should display name of subjects: C++, VB, Java
Q2. Foreign language should display choice of foreign languages French, German and Japanese
Q3. Submit button should submit the result.
Expert Answer
[solved] – Question 74773
Improve the algorithm so can sort below array:
void counting_sort(struct SResult scoreArr[], int N, int final[])
{
int freq[11] = {0}, cfreq[11] = {0};
int i, curScore;
//1. Compute Frquency
for (i = 0; i < N; i++){
freq[ scoreArr[i].score ] ++;
}
//2. Compute Cumulative Frequency
cfreq[0] = freq[0];
for (i = 1; i < 11; i++){
cfreq[i] = cfreq[i-1] + freq[i];
}
//3. Produce Final Position
for (i = 0; i < N; i++){
curScore = scoreArr[i].score;
final[ cfreq[ curScore ] – 1 ] = curScore;
cfreq[curScore]–;
}
}
struct SResult sample[] = {
{“A1234”, 10},
{“A1239”, 5},
{“A1394”, 7},
{“A1434”, 3},
{“A1454”, 5},
{“A2884”, 7},
{“A3235”, 7},
{“A4334”, 9},
{“A4884”, 2},
{“A6934”, 5},
{“A7265”, 7},
{“A9559”, 3}
};
Expert Answer
[solved] – Question 74774
A point represents a coordinate in an x-y plane. It is supported by the following functions:
Point * make_point(double x, double y)
double x_of(Point *p)
double y_of(Point *p)
void print_point(Point *p)
Write a function Point * mid_point that accepts two points as arguments and returns a point that is the mid-point of these two input coordinates.
Expert Answer
[solved] – Question 74793
a.The sum of a series can be computed as sum=x+x^2/2+x^3/3+x^4/4+x^5/5+⋯ ∞<x<∞ stopping when either n terms have been added or when the magnitude of a term in the series is less than 10-6, whichever comes first.
You are required to write a function, sumSeries, which given x, n returns the sum of the series. Use #include <cmath> and the abs function. Do not use the pow function.
Expert Answer
[solved] – Question 7483
#include<stdio.h>
#include<conio.h>
main()
{
int i=3,r;
r=(i*10) + ++i;
printf(“%d”,r);
getch();
}
result must be 33 but is 44.
Expert Answer
[solved] – Question 74859
how to change the code so that it can sort
struct SResult sample[] = { {“A1234”, 10}, {“A1239”, 5}, {“A1394”, 7}, {“A1434”, 3}, {“A1454”, 5}, {“A2884”, 7}, {“A3235”, 7}, {“A4334”, 9}, {“A4884”, 2}, {“A6934”, 5}, {“A7265”, 7}, {“A9559”, 3} };
void counting_sort(struct SResult scoreArr[], int N, int final[]) {
int freq[11] = {0}, cfreq[11] = {0};
int i, curScore;
//1. Compute Frquency
for (i = 0; i < N; i++){
freq[ scoreArr[i].score ] ++;
}
//2. Compute Cumulative Frequency
cfreq[0] = freq[0];
for (i = 1; i < 11; i++){
cfreq[i] = cfreq[i-1] + freq[i];
}
//3. Produce Final Position
for (i = 0; i < N; i++){
curScore = scoreArr[i].score;
final[ cfreq[ curScore ] – 1 ] = curScore;
cfreq[curScore]–;
}
}
Expert Answer
