Answer:
#include <iostream>
#include <time.h>
#include <string>
using namespace std;
int main(){
srand(time(NULL));
cout<<"Throw dice"<<endl;
int b =0;
int a=0;
a=rand()%6;
b=rand()%6;
for (int i =0;i<1;i++)
{cout<<"dice one: "<<a<<endl;}
for (int i =0;i<1;i++)
{cout<<"dice two: "<<b<<endl;}
if(a>b)
{cout<<"first dice won"<<endl;}
if(b>a)
{cout<<"second dice won"<<endl;}
else{cout<<"they are same"<<endl;
return main();
}
return 0;
}
Explanation:
/*best dice roll game just for you change it as you want but all necessary things are there/*
Answer:
Explanation:
Keep in mind a lossy algorithm will lose information while a lossless algorithm maintains all your original information.
Therefore:
A. False, a lossy algorithm will not allow perfect reconstruction.
B. True, if you don't care about keeping all your information it's easier to compress.
C. False, you can use a lossless algorithm for anything.
D. False, the point of lossless is that you keep all information.
<h2>Answer:</h2>
Truck drivers probably can't see your vehicle if you cannot see them in their side mirror
<h2>Explanation:</h2>
In driving terminology there is a term called the bind spot. Blind spot is the area where the driver is not able to see the vehicle behind him and this area is present just behind the truck and very close to the gates of the car. Since trucks do not have the rare mirror therefore if a car is present in their blind spot they wont be able to see it. The driver behind the truck can spot it if he does not see the truck driver in the side mirror of the truck.
D)Animated abstract shapes