Answer:
a is the correct answer
Explanation:
correct me if I'm wrong hope it's help thanks
#include
Program: using namespace std;
string createPurchaseOrder0;
int main(
{
cout<return 0;
}
string createPurchaseOrder(
{
int qty;
double costPerltem;
string description,info="":
cout<<"Enter Quantity:
cin>>qty;
cout<<"Enter cost per item: "
cin>>costPerltem;
cout<<"Enter Description: "
cin>>description;
if(qty<0 I| costPerltem<0
Idescription.compare(''"')==0)
cout<<'InThe entered data is invalid!":
info="":
else
"
cout<<"'InThe entered data is valid!":
info=info+"'(nQuantity: "+to_string (qty) +" In";
info=info+"Cost per item:
"†to_string (costPerltem)+"In";
info=info+"Description: "description+" In";
return info;
Output:
Answer:
ASIC
Explanation:
Undoubtedly, it is the ASIC and not FPGA. The field programmable Gate Array is meant for general purposes, and ASIC is meant for Specific purposes. And here the application-specific condition holds. We need it for medium production of an image transformation, and this is like Bitcoin which is application-specific. And thus, the correct type of IC which we need in this case is the FPGA, And hence, FPGA is the correct option here.
Used to talk to people, chat with people on mobile.
Answer:
Following are the response to the given question:
Explanation:
Build a spring, sink, vertices, and vertices for each car for a household. Every unit in the stream is a human. Attach the source from each vertical of a family with such a capacity line equivalent to the family size; this sets the number of members in each household. Attach every car vertices to the sink with the edge of the car's passenger belt; this assures the correct number of people for every vehicle. Connecting every vertex in your household to any vertex in your vehicle with a capacity 1 border guarantees that one family member joins a single car. The link between both the acceptable allocation of people to vehicles as well as the maximum flow inside the graph seems clear to notice.
