Explanation:
A computer is a machine that can be programmed to accept data (input), process it into useful information (output), and store it away (in a secondary storage device) for safekeeping or later reuse. The processing of input to output is directed by the software but performed by the hardware.
The program is
num = int(input("Enter Numerator "))
den = int(input("Enter Denominator "))
print("quotient is ",str(num//den)," remainder is ", str(num%den))
<h3>
How to create a division sign in HTML?</h3>
To create a division sign ( ÷ ) in HTML you can use any of the following codes.
÷
÷
÷
<h3>
How to divide in computer programming?</h3>
Perl code
use strict;
my $first = 15;
my $second = 5;
my $answer = $first / $second;
print "You get $answer if you divide $first by $second";
When the script above is run, it displays "You get 3 if you divide 15 by 5" on the screen.
To learn more about programming, refer
https://brainly.ph/question/4743
#SPJ4
Local server so you can all you use if you guys are near
Answer: True
Explanation: Domain name system(DNS) is the kind of attack that exploits the functioning of the DNS .This process is also known as the DNS spoofing .The corrupted data is invoked in the cache database and thus creates spoof.
It creates diversion of the traffic from the actual servers to the fake servers and entering the exploited data in the cache database.Thus, the given statement is true.
Answer:
C++ Code:
void sort3(double &a, double &b, double &c)
{
if(a > b)
swapdoubles(a,b);
if (b > c)
swapdoubles(b,c);
if (a > b)
swapdoubles(a,b);
}
Explanation:
To change the values of a,b,c within the function, we pass the values by reference. Let us assume that number a = 3.14, b = 2.71, c = 3.04. Since a > b, values of a and b will be swapped.Now a = 2.71 and b = 3.14. Similariy, since b > c, they will be swapped. This way, we move the largest number to its correct position in the first two steps. If there are only three numbers, and the largest number is in its correct position, then for the two remaining numbers, we will only need atmost one swap to exchange their positions. hence, we perform a comparison of a > b once again to see if the b is smaller than a. if its not, then all a,b,c are in sorted order.
