Answer:
see explaination
Explanation:
If I am to select I will select the strategy Impute the missing values . Because rather than deleting and all the other strategies. This is the best option because, this is an optional field as described there is no need for such accurate information about salary.
If we want to maintain this field we can just fill the value by identifying the similar records which is the other customers who is visiting the same no of times and fill that.
Write a BASH script to create a user account. The script should process two positional parameters: o First positional parameter is supposed to be a string with user name (e.g., user_name) o Second positional parameter is supposed to be a string with user password (e.g., user_password) The script should be able to process one option (use getopts command): o Option -f arg_to_opt_f that will make your script direct all its output messages to file -arg_to_opt_f
#!/bin/bash
usage() {
echo "Usage: $0 [ -f outfile ] name password" 1>&2
exit 1
}
while getopts "f:" o; do
case "${o}" in
f)
filename=${OPTARG}
;;
*)
usage
;;
esac
done
shift $((OPTIND-1))
name=$1
password=$2
if [ -z "$password" ] ; then
usage
fi
set -x
if [ -z "$filename" ] ; then
useradd -p `crypt $password` $name
else
useradd -p `crypt $password` $name > $filename
fi
// isOrdered
//
// return true if the queue contents are in increasing order (back to front)
// Queue may be empty ; in which case the function should return true
// You must solve this USING RECURSION; you will need to use a helper function
// You may not use:
// any other Java classes, algorithms,
// the toString instance method
// You may not alter the invoking queue
//
// here are some conceptual examples ( they also mirror what your linked lists will look like)
// the back is on the left and the front is on the right.
// Example 1. A B C D E F G H I J --> answer true ,
// Example 2. C B A --> answer false
// Example 3. C --> answer true
//
Answer:
honestly i dont know but I used to have computer programming classes on java and I'd get all my answers from repl.it forums. Wist you best of luck!!
You and your friends are driving to Tijuana for springbreak. You are saving your money for the trip and so you want to minimize the cost of gas on the way. In order to minimize your gas costs you and your friends have compiled the following information.
First your car can reliably travel m miles on a tank of gas (but no further). One of your friends has mined gas-station data off the web and has plotted every gas station along your route along with the price of gas at that gas station. Specifically they have created a list of n+1 gas station prices from closest to furthest and a list of n distances between two adjacent gas stations. Tacoma is gas station number 0 and Tijuana is gas station number n. For convenience they have converted the cost of gas into price per mile traveled in your car. In addition the distance in miles between two adjacent gas-stations has also been calculated. You will begin your journey with a full tank of gas and when you get to Tijuana you will fill up for the return trip.
You need to determine which gas stations to stop at to minimize the cost of gas on your trip.
1. Express this problem formally with input and output conditions.
2. State a self-reduction for your problem.
3. State a dynamic programming algorithm based off your seld reduction that computes the minimum gas cost.
Answer:
Explanation:
.Car can Travel a m miles tank on a gas
2.For N distance there are n+1 adjacent gas stations.
Output Conditions:
Tacoma will fill the gas station while going.
Tijuana will fill up gas for the return trip
3.Dynamic self Reduction Algorithm
Start
if(n==0)
Tacoma is a gas station number 0;
else
Tijuana is a gas station n+1;
stop
2 point) Express this problem formally with input and output conditions.2.(2 points) Describe a simple algorithm to compute the upper median. How manyoperations does it take asymptotically in the worst case?3.(7 points) Show how you can use the (upper) medians of the two lists to reduce thisproblem to its subproblems. State a precise self-reduction for your problem.4. (7 points) State a recursive algorithm that solves the problem based on your reduction.5.(2 point) State a tight asymptotic bound on the number of operations used by youralgorithm in the worst case.
Answer:
See attached images
A company wants to implement a wireless network with the following requirements:
i. All wireless users will have a unique credential.
ii. User certificate will not be required for authentication
iii. The company's AAA infrastructure must be utilized
iv. Local hosts should not store authentication tokesn
1. Which of the following should be used in the design to meet the requirements?
O EAP-TLS
O WPS
O PSK
O PEAP
Answer:
PEAP is the correct answer to the given question .
Explanation:
The PEAP are implemented to meet the demands because it is very much identical to the EAP-TTLS design also it includes the server-side PKI authentication .
The main objective of PEAP is to establish the protected TLS tunnel for protecting the authentication process, as well as a server-side encryption authentication.The PEAP is also used for validating the application it validating her process with the help of the TLS Tunnel encryption between the user and the verification.All the other options are not suitable for the to meet the requirements of the design that's why these are incorrect option .ALAP Help
what is a computer
Answer:An electronic device for storing and processing data, typically in binary form
Explanation:
A contiguous subsequence of a list S is a subsequence made up of consecutive elements of S. For example, if S is 5,15,-30,10,-5,40,10 then 5,15,-30 is a contiguous subsequence but 5,15,40 is not.
1. Give a linear-time algorithm for the following task:
Input: A list of numbers, A(1), . . . , A(n).
Output: The contiguous subsequence of maximum sum (a subsequence of length zero has sum zero).
For the preceding example, the answer would be 10,-5,40,10 with a sum of 55.
Answer:
We made use of the dynamic programming method to solve a linear-time algorithm which is given below in the explanation section.
Explanation:
Solution
(1) By making use of the dynamic programming, we can solve the problem in linear time.
Now,
We consider a linear number of sub-problems, each of which can be solved using previously solved sub-problems in constant time, this giving a running time of O(n)
Let G[t] represent the sum of a maximum sum contiguous sub-sequence ending exactly at index t
Thus, given that:
G[t+1] = max{G[t] + A[t+1] ,A[t+1] } (for all 1<=t<= n-1)
Then,
G[0] = A[0].
Using the above recurrence relation, we can compute the sum of the optimal sub sequence for array A, which would just be the maximum over G[i] for 0 <= i<= n-1.
However, we are required to output the starting and ending indices of an optimal sub-sequence, we would use another array V where V[i] would store the starting index for a maximum sum contiguous sub sequence ending at index i.
Now the algorithm would be:
Create arrays G and V each of size n.
G[0] = A[0];
V[0] = 0;
max = G[0];
max_start = 0, max_end = 0;
For i going from 1 to n-1:
// We know that G[i] = max { G[i-1] + A[i], A[i] .
If ( G[i-1] > 0)
G[i] = G[i-1] + A[i];
V[i] = V[i-1];
Else
G[i] = A[i];
V[i] = i;
If ( G[i] > max)
max_start = V[i];
max_end = i;
max = G[i];
EndFor.
Output max_start and max_end.
The above algorithm takes O(n) time .
mm
Donte needs to print specific sections in the workbook, as opposed to the entire workbook. Which feature should he use?
Page Setup
Backstage view
Print Area
Option
Mark this and retum
Save and Exit
Answer:
Print Area
Explanation:
First, I'll assume Donte is making use of a spreadsheet application (Microsoft Office Excel, to be precise).
From the given options, only "Print Area" fits the given description in the question.
The print area feature of the Excel software allows users to print all or selected workbook.
To print a selection section, Donte needs to follow the steps below.
Go to File -> Print.
At this stage, Donte will have the option to set the print features he needs.
Under settings, he needs to select "Print Selection"; this will enable him Print sections of the entire workbook.
Refer to attachment for further explanation
Answer:
C. print area
Explanation:
During testing, a student receives the incorrect answer back from a function that was supposed to be designed to return the largest value found in an array of double values provided as a parameter. Read the function definition used for this purpose, and identify the error:
int findMax (double arr [ ], int s )
{
int i;
int indexOfMax = 0;
double max = arr[0];
for ( i=1; i < s ; i++ )
{
if ( arr[ i ] > arr [indexOfMax] )
{
indexOfMax = i;
max = arr[indexOfMax];
}
}
return indexOfMax;
}
Answer:
dude what r u doin
Explanation:
Write a script that declares and sets a variable that’s equal to the total outstanding balance due. If that balance due is greater than $10,000.00, the script should return a result set consisting of VendorName, InvoiceNumber, InvoiceDueDate, and Balance for each invoice with a balance due, sorted with the oldest due date first. If the total outstanding balance due is less than $10,000.00, return the message "Balance due is less than $10,000.00."
Answer:
see explaination
Explanation:
SCRIPT :
drop table Vendor;
create table Vendor (VendorName varchar2(20), InvoiceNumber number (20), InvoiceDueDate date, Balance number(32,6));
insert into VENDOR (VENDORNAME,INVOICENUMBER,INVOICEDUEDATE,BALANCE) values ('ABC',121,TO_TIMESTAMP('01-01-18','DD-MM-RR HH12:MI:SSXFF AM'),1000);
Insert into Vendor (VENDORNAME,INVOICENUMBER,INVOICEDUEDATE,BALANCE) values ('XYZ',1212121,to_timestamp('02-01-18','DD-MM-RR HH12:MI:SSXFF AM'),100000);
declare
cursor c1 is select * from Vendor;
begin
for i in c1
loop
if I.BALANCE < 1001 then
DBMS_OUTPUT.PUT_LINE('Vendor Name '||I.VENDORNAME||', Invoice Number '||I.INVOICENUMBER||', Invoice DueDate '||I.INVOICEDUEDATE||',BALANCE '||I. BALANCE);
else
dbms_output.put_line('Vendor Name '||i.VendorName||', Invoice Number '||i.InvoiceNumber||', Invoice DueDate '|| i.InvoiceDueDate||' Balance due is less than $1000');
end if;
end LOOP;
end;
output : SCRIPT OUTPUT
table VENDOR dropped.
table VENDOR created.
1 rows inserted.
1 rows inserted.
anonymous block completed
dbms output :
Vendor Name ABC, Invoice Number 121, Invoice DueDate 01-JAN-18,BALANCE 1000
Vendor Name XYZ, Invoice Number 1212121, Invoice DueDate 02-JAN-18 Balance due is less than $1000
which of the following correctly declares an array:
Choose one answer .
a. int array
b.array(10);
c.int array(10);
d.array array(10);
Answer:
a.
Explanation:
The option that correctly declares an array is int array.
What is an array?This is a term that connote a regular system or arrangement. Here, numbers or letters are said to be arranged in rows and columns.
In computing, An array is a term that describe memory locations box having the same name. All data in an array is said to be of the same data type.
Learn more about array from
https://brainly.com/question/26104158
Highlights the possible risks and problems that should be addressed during the implementation process
Answer:
The answer is below
Explanation:
Since the type of Implementation is not stated specifically, it is believed that, the question is talking about ERP Implementation, because it is related to subject in which the question is asked.
Hence, Enterprise Resource Planning (ERP) implementation deals basically, by carrying out installation of the software, transferring of finanancial data over to the new system, configuring application users and processes, and training users on the software
ERP Implementation Risks involve the following:
1. Inefficient Management and Project Activities.
2. Inadequate or No Training and Retraining of Customers or End-Users.
3. Inability to Redesign Business Processes to meet the Software requirements.
3. Incompetent or lack of Technical Support Team and Infrastructure.
4. Incapability to Obtain Full-Time Commitment of Employee.
5. Failure to Recruit and Maintained Qualified Systems, and Developers.
Consider the following C program: void fun(void) { int a, b, c; /* definition 1 */ ... while (...) { int b, c, d; /* definition 2 */ ... <------------------ 1 while (...) { int c, d, e; /* definition 3 */ ... <-------------- 2 } ... <------------------ 3 }... <---------------------- 4 } For each of the four marked points in this function, list each visible variable, along with the number of the definition statement that defines it.
Answer:
Check the explanation
Explanation:
1.
void func(void){
int a,b,c; /*definition 1*/
/////* a,b,c for definition 1 are visible */
//// d, e are not visible
while(...){
int b, c, d; /* definition 2*/
////*
a from definition 1 is visible
b, c, d from definition 2 are visible
*/ ///
while(...){
int c, d, e;/* definition 3*/
////*
a from definition 1 is visible
b from definition 2 is visible
c, d, e from definition 3 are visible
*/ ///
}
////*
a from definition 1 is visible
b, c, d from definition 2 are visible
e not visible
*////
}
/////* a,b,c for definition 1 are visible */
///// d, e are not visible
}
A Transmission Control Protocol (TCP) connection is in working order and both sides can send each other data. What is the TCP socket state?
Answer:
The TCP socket state will be as 'Closed'.
Explanation:
TCP seems to be a framework that describes how well a web discussion can be established and maintained through which software applications could access information.
The accompanying is the finished status whenever the connection is suspended by TCP:
CLOSE-WAIT:
This means that the end destination had already chosen to take a similar requirement from the 'remote endpoint.'
CLOSING:
This indicates the position for the cancellation of server access verification from either the faraway TCP.
LAS-ACK:
This indicates the view for approval including its extermination previously sent through the cell tower TCP.
TIME-WAIT:
This symbolizes a lengthy delay for all the remote to accept verification of its cancellation request.
CLOSED:
This means that there is no link region or anything like that.
Which body of water is most likely to be a marine ecosystem?
Answer:
The body of water that is most likely to be a marine ecosystem would be an estuary.
Explanation:
An estuary is a widened, often funnel-shaped mouth of a river, where fresh river water and salt sea water are mixed and thus brackish water is created, and where tidal differences can be observed. When a river flows as a system of branches, it is called a delta.
Estuaries often have a great natural value. They typically consist of swallows and salt marshes that are very rich in invertebrates and thus have a great attraction for birds, among other things.
Tamera and Rupert each applied for the same credit card through the same company. Tamera has a positive credit history. Rupert has a negative credit history.
Which compares their credit limits and likely interest rates?
Answer:
it is two by five credit limit
Answer:
Your answer is A Tamera’s credit limit is most likely higher than Rupert’s, and her interest rate is most likely lower.
Explanation:
I got it right on the test and I hope this answer helps
Write a method that sums all the numbers in the major diagonal in an n x n matrix of double values using the following header: public static double sumMajorDiagonal(double[][] m) Write a test program that first prompts the user to enter the dimension n of an n x n matrix, then asks them to enter the matrix row by row (with the elements separated by spaces). The program should then print out the sum of the major diagonal of the matrix.
Answer:
Following are the code to this question:
import java.util.*; //import package for user input
public class Main //defining main class
{
public static double sumMajorDiagonal(double [][] m) //defining method sumMajorDiagonal
{
double sum = 0; //defining double variable sum
int i, j; //defining integer variable
for(i = 0; i <m.length; i++) //defining loop to count row
{
for(j = 0; j < m.length; j++) //defining loop to count column
{
if(i == j) //defining condition to value of i is equal to j
{
sum=sum+ m[i][j]; //add diagonal value in sum variable
}
}
}
return sum; //return sum
}
public static void main(String args[]) //defining main method
{
int n,i,j; //defining integer variable
System.out.print("Enter the dimension value: "); //print message
Scanner ox = new Scanner(System.in); //creating Scanner class object for user input
n = Integer.parseInt(ox.nextLine()); //input value and convert value into integer
double m[][] = new double[n][n]; //defining 2D array
for(i = 0; i < m.length; i++)
{
String t = ox.nextLine(); // providing space value
String a[] = t.split(" "); // split value
for(j = 0; j < a.length; j++) //defining loop to count array value
{
double val = Double.parseDouble(a[j]); //store value in val variable
m[i][j] = val; //assign val in to array
}
}
double d_sum = sumMajorDiagonal(m); //call method store its return value in d_sum variable
System.out.println("diagonal matrix sum: "+ d_sum); //print sum
}
}
output:
Enter the dimension value: 3
1 2 3
1 2 3
1 2 4
diagonal matrix sum: 7.0
Explanation:
Program description:
In the given java language code, a method "sumMajorDiagonal" is declared, that accepts a double array "m" in its parameter, inside the method two integer variable "i and j" and one double variable "sum" is defined, in which variable i and j are used in a loop to count array value, and a condition is defined that checks its diagonal value and use sum variable to add its value and return its value. In the main method first, we create the scanner class object, that takes array elements value and passes into the method, then we declared a double variable d_sum that calls the above static method, that is "sumMajorDiagonal" and print its return value with the message.Write a program that prompts the user to enter the area of the flat cardboard. The program then outputs the length and width of the cardboard and the length of the side of the square to be cut from the corner so that the resulting box is of maximum volume. Calculate your answer to three decimal places. Your program must contain a function that takes as input the length and width of the cardboard and returns the side of the square that should be cut to maximize the volume. The function also returns the maximum volume.
Answer:
A program in C++ was written to prompts the user to enter the area of the flat cardboard.
Explanation:
Solution:
The C++ code:
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
double min(double,double);
void max(double,double,double&,double&);
int main()
{double area,length,width=.001,vol,height,maxLen,mWidth,maxHeight,maxVolume=-1;
cout<<setprecision(3)<<fixed<<showpoint;
cout<<"Enter the area of the flat cardboard: ";
cin>>area;
while(width<=area)
{length=area/width;
max(length,width,vol,height);
if(vol>maxVolume)
{maxLen=length;
mWidth=width;
maxHeight=height;
maxVolume=vol;
}
width+=.001;
}
cout<<"dimensions of card to maximize the cardboard box which has a volume "
<<maxVolume<<endl;
cout<<"Length: "<<maxLen<<"\nWidth: "<<maxLen<<endl;
cout<<"dimensions of the cardboard box\n";
cout<<"Length: "<<maxLen-2*maxHeight<<"\nWidth: "
<<mWidth-2*maxHeight<<"\nHeight: "<<maxHeight<<endl;
return 0;
}
void max(double l,double w,double& max, double& maxside)
{double vol,ht;
maxside=min(l,w);
ht=.001;
max=-1;
while(maxside>ht*2)
{vol=(l-ht*2)*(w-ht*2)*ht;
if(vol>max)
{max=vol;
maxside=ht;
}
ht+=.001;
}
}
double min(double l,double w)
{if(l<w)
return l;
return w;
}
Note: Kindly find the output code below
/*
Output for the code:
Enter the area of the flat cardboard: 23
dimensions of card to maximize the cardboard box which has a volume 0.023
Length: 4.796
Width: 4.796
dimensions of the cardboard box
Length: 4.794
Width: 4.794
Height: 0.001
*/
Write the method scrambleWord, which takes a given word and returns a string that contains a scrambled version of the word according to the following rules.
a. The scrambling process begins at the first letter of the word and continues from left to right.
b. If two consecutive letters consist of an "A" followed by a letter that is not an "A", then the two letters are swapped in the resulting string.
c. Once the letters in two adjacent positions have been swapped, neither of those two positions can be involved in a future swap.
The following table shows several examples of words and their scrambled versions.
word Result returned by scrambleWord(word)
"TAN" "TNA"
"ABRACADABRA" "BARCADABARA"
"WHOA" "WHOA"
"AARDVARK" "ARADVRAK"
"EGGS" "EGGS"
"A" "A"
"" ""
Answer:
Let's implement the program using JAVA code.
import java.util.*;
import java.util.ArrayList;
import java.io.*;
public class ScrambledStrings
{
/** Scrambles a given word.
* atparam word the word to be scrambled
* atreturn the scrambled word (possibly equal to word)
* Precondition: word is either an empty string or contains only uppercase letters.
* Postcondition: the string returned was created from word as follows:
* - the word was scrambled, beginning at the first letter and continuing from left to right
* - two consecutive letters consisting of "A" followed by a letter that was not "A" were swapped
* - letters were swapped at most once
*/
public static String scrambleWord(String word)
{
// iterating through each character
for(int i=0;i<word.length()-1;)
{
//if the condition matches
if(word.charAt(i)=='A' && word.charAt(i+1)!='A'){
//swapping the characters
word=word.substring(0,i)+word.charAt(i+1)+word.charAt(i)+word.substring(i+2);
//skipping the letter
i+=1;
}
//skipping the letter
i+=1;
}
return word;
}
Explanation:
Note: Please replace the "at" on the third and fourth line with at symbol that is shift 2.
One factor in algorithm performance that we've not had a chance to speak much about this quarter, but one that is certainly relevant in practice, is parallelism, which refers to the ability to speed up an algorithm by doing more than one thing at once. Nowadays, with most personal laptop or desktop computers having multicore processors, and with many workloads running on cloud infrastructure (i.e., potentially large numbers of separate machines connected via networks), the ability to run an algorithm in parallel is more important than ever.
Of course, not all problems can be parallelized to the same degree. Broadly, problems lie on a spectrum between two extremes. (In truth, most problems lie somewhere between these extremes, but the best way to understand what's possible is to know what the extremes are.)
Embarrassingly parallel problems are those that are composed primarily of independent steps that can be run in isolation from others and without respect to the results of the others, which makes them very easy to parallelize. Given n cores or machines, you could expect to run n steps simultaneously without any trouble.
Inherently serial problems are those whose steps have to be run sequentially, because the output of the first step makes up part of the input to the second step, and so on. Multiple cores or machines aren't much help for problems like this.
Now consider all of the sorting algorithms we learned about in our conversation about Comparison-Based Sorting. For which of the algorithms would you expect a multicore processor to be able to solve the problem significantly faster than a single-core processor would be able to solve it? For each of the ones that would benefit, briefly explain, in a sentence or two, why multiple cores would be beneficial. (There's no need to do any heavy-duty analysis here; we just want to see if you've got a sense of which might benefit from parallelism and why.)
Answer:
Quick sort and Merge sort supports parallelism
Explanation:
When we talk about parallelism, we are referring to the idea of breaking down a problem into a number of many subproblems after which we combine the solutions of these subproblems into a single solution. Here we allocate these subtasks to the multicore processors where each core gets assigned each of the subtasks are assigned to a core according to its ability or functionality. After each of the core are through with its evaluation, all their results are collated and combined to come up with a full rounded and complete solution to the given problem.
If we take a look at sorting algorithms such as selection sort, bubble sort and insertion sort, we will find out that these algorithms cant be simulated on a multicore processor efficiently because they are sequential algorithms.
On the other hand, we have sorting algorithms that can easily be simulated in a multicore processor since they can divide the given problem into subproblems to solve after which the solutions can be combined together to arrive at or come up with a complete solution to the problem. This algorithms includes Quick sort and Merge sort, they make use of Divide and Conquer paradigm.
The purpose of this assignment is to determine a set of test cases knowing only the function’s specifications, reported hereafter:The program takes as input a 2D matrix with N rows. The program finds the column index of the first non-zero value for each row in the matrix A, and also determines if that non-zero value is positive or negative. It records the indices of the columns, in order, in the array W. It records whether each value was positive or negative, in order, in the array T (+1 for positive, -1 for negative). Assume that all rows have at least one column with a non-zero value.As this is black-box testing, you will not have access to the source so you must use what you have learned.You need to include a comment that describes how you chose your test cases.Students should identify the input equivalence partitions classes and select test cases on or just to one side of the boundary of equivalence classes.Students will gain 25 points for each input equivalence partition classes and valid test cases reported.Any language can be used, preferably C or C++ but it's not an issue if it's not in these two. Thanks!
Answer:
The program is written using PYTHON SCRIPT below;
N=int(input(" Enter number of Rows you want:"))
M=[] # this for storing the matrix
for i in range(N):
l=list(map(int,input("Enter the "+str(i+1)+" Row :").split()))
M.append(l)
print("The 2D Matrix is:\n")
for i in range(N):
print(end="\t")
print(M[i])
W=[] # to store the first non zero elemnt index
T=[] # to store that value is positive or negative
L=len(M[0])
for i in range(N):
for j in range(L):
if (M[i][j]==0):
continue
else:
W.append(j) # If the value is non zero append that postion to position list(W)
if(M[i][j]>0): #For checking it is positive or negative
T.append(+1)
else:
T.append(-1)
break
print()
print("The first Non Zero element List [W] : ",end="")
print(W)
print("Positive or Negative List [T] : ",end="")
print(T)
Explanation:
In order for the program to determine a set of test cases it takes in input of 2D matrix in an N numbet of rows.
It goes ahead to program and find the column index of the first non-zero value for each row in the matrix A, and also determines if that non-zero value is positive or negative. The If - Else conditions are met accordingly in running the program.
How the full address space of a processor is partitioned and how each partition is used?
Answer:
?
Explanation:
?
Research and a well-written problem statement are important because
ANSWER: A) they give a clear understanding of the problem and its solution
Answer:
they give a clear understanding of the problem and its solution
Answer:
The answer is in the question,A
Explanation:
They give a clear understanding of the problem and its solution
Only one calendar can be visible at a time
in Outlook.
Select one:
a. False
b. True
Answer:
a. False
Explanation:
It is false as more than one calendar is visible in outlook.
Explanation:
it is false
i think it helps you
You are planning to use Spark to create a machine learning model that recommends restaurants to users based on user details and past ratings for restaurants What is the simplest way to implement this model? Use a Logistic Regression algorithm to train a classifier. Use a K-Means algorithm to create clusters. Use an alternating least squares (ALS) algorithm to create a collaborative filtering solution. Use a Decision Trees algorithm to train a regression model.
Answer:
The third point i.e " Use an alternating least squares (ALS) algorithm to create a collaborative filtering solution" is the correct answer .
Explanation:
The Alternating Less Squares is the different approach that main objective to enhancing the loss function.The Alternating Less Squares process divided the matrix into the two factors for optimizing the loss .The divided of two factor matrix is known as item matrix or the user matrix.
As we have to build the machine learning model which proposes restaurants to restaurants that are based on the customer information and the prior restaurant reviews the alternating least squares is the best model to implement this .All the other options are not the correct model also they are not related to given scenario that's why they are incorrect options.Modify the selectionSort function presented in this chapter so it sorts an array of strings instead of an array of ints. Test the function with a driver program. Use program 8-8 as a skeleton to complete.
Program 8-8
#include
#include
using namespace std;
int main()
{
const int NUM_NAMES = 20
string names [NUM_NAMES] = {"Collins, Bill", "Smith, Bart", "Allen, Jim", "Griffin, Jim", "Stamey, Marty", "Rose,Geri", "Taylor, Terri", "Johnson, Jill", "Allison, Jeff", "Looney, Joe", "Wolfe, Bill", "James, Jean", "Weaver, Jim", "Pore, Bob", "Rutherford, Greg", "Javens, Renee", "Harrison, Rose", "Setzer, Cathy", "Pike, Gordon", "Holland, Beth" };
//Insert your code to complete this program
return 0;
}
Answer:
Following are the method to this question:
void selectionSort(string strArr[], int s) //defining selectionSort method
{
int i,ind; //defining integer variables
string val; //defining string variable
for (i= 0; i< (s-1);i++) //defining loop to count value
{
ind = i; //assign loop value in ind variable
val = strArr[i]; // strore array value in string val variable
for (int j = i+1;j< s;j++) // defining loop to compare value
{
if (strArr[j].compare(val) < 0) //using if block to check value
{
val = strArr[j]; //store value in val variable
ind= j; //change index value
}
}
strArr[ind] = strArr[i]; //assign string value in strArray
strArr[i] = val; // assign array index value
}
}
void print(string strArr[], int s) //defining print method
{
for (int i=0;i<s;i++) //using loop to print array values
{
cout << strArr[i] << endl; //print values
}
cout << endl;
}
Explanation:
In the above-given code, two methods "selectionsort and print" is declared, in which, both method stores two variable in its parameter, which can be described as follows:
Insides the selectionSort method, two integer variable "i and ind" and a string variable "val" is defined, inside the method a loop is declared, that uses the if block condition to sort the array. In the next line, another method print is declared that declared the loop to prints its value. Please find the attachment for full code.How many seconds are required to make a left turn and join traffic?
The data structure used for file directory is called
Select one
a. process table
b. mount table
C. hash table
d file table
We have three containers whose sizes are 10 pints, 7 pints, and 4 pints, respectively. The 7-pint and 4-pint containers start out full of water, but the 10-pint container is initially empty. We are allowed one type of operation: pouring the contents of one container into another, stopping only when the source container is empty or the destination container is full. We want to know if there is a sequence of pourings that leaves exactly 2 pints in the 7-pint or 4-pint container.
(a) Model this as a graph problem: give a precise definition of the graph involved and state the specific question about this graph that needs to be answered.
(b) What algorithm should be applied to solve the problem?
(c) Find the answer by applying the algorithm.
Answer:
well, idc
Explanation:
Why is it difficult to convince top management to commit funds to develop and implement a Strategic Information System
Answer:
It is difficult to convince top management to commit funds to develop and implement an SIS because it can lead to reengineering, which requires businesses to revamp processes to undergo organizational change to gain an advantage.
Explanation: