I’m sorry but I can’t see anything. I won’t be able to answer this question if there is no picture.
Answer:
If you're given a set of coordinates that Gracie has travelled to, you can find the farthest in each direction with something like this (I'll use pseudocode in lieu of a specified language):
left = right = top = bottom = null
for each location traveled{
if left == null or location.x < left {
left = location.x
}
if right == null or location.x > right {
right = location.x
}
// note that I'm assuming that the vertical position increases going downward
if top == null or location.y < top {
top = location.y
}
if bottom == null or location.y > bottom {
bottom = location.y
}
}
As for the four print statements and other information, insufficient information is provided to complete that.
Answer:
Give three(3) difference between Dot-matrix printer and the Daisy-wheel printer
False, because just... common sense, there's always going to be people who disagree.
Answer:
See Explanation
Explanation:
The question is incomplete as there is no link pointing to the houseType struct of chapter 1.
So, I've answered the question from scratch
See attachment for explanation where I used comments to explain each line.
The program is as follows:
#include <iostream>
using namespace std;
struct houseType{
int firstHouse, secondHouse;
};
int main()
{
houseType hT;
cout << "Enter the price of both house: ";
cin>> hT.firstHouse;
cin>> hT.secondHouse;
if(hT.firstHouse == hT.secondHouse){ cout<<"true"; }
else{ cout<<"false"; }
return 0;
}