Answer:
- common = []
- num1 = 8
- num2 = 24
- for i in range(1, num1 + 1):
- if(num1 % i == 0 and num2 % i == 0):
- common.append(i)
- print(common)
Explanation:
The solution is written in Python 3.
Firstly create a common list to hold a list of the common factor between 8 and 24 (Line 1).
Create two variables num1, and num2 and set 8 and 24 as their values, respectively (Line 3 - 4).
Create a for loop to traverse through the number from 1 to 8 and use modulus operator to check if num1 and num2 are divisible by current i value. If so the remainder of both num1%i and num2%i will be zero and the if block will run to append the current i value to common list (Line 6-8).
After the loop, print the common list and we shall get [1, 2, 4, 8]
Answer:
<em> where the attacker secretly relays and possibly alters the communications between two parties who believe that they are directly communicating with each other.</em>
Explanation:
Answer: Filler content
Explanation: I think what the question is getting at is using filler content. This includes filler images and sample text. Once the website is all set up, the filler content is replaced with the actual content.
Complete Question:
Recall that with the CSMA/CD protocol, the adapter waits K. 512 bit times after a collision, where K is drawn randomly. a. For first collision, if K=100, how long does the adapter wait until sensing the channel again for a 1 Mbps broadcast channel? For a 10 Mbps broadcast channel?
Answer:
a) 51.2 msec. b) 5.12 msec
Explanation:
If K=100, the time that the adapter must wait until sensing a channel after detecting a first collision, is given by the following expression:
The bit time, is just the inverse of the channel bandwidh, expressed in bits per second, so for the two instances posed by the question, we have:
a) BW = 1 Mbps = 10⁶ bps
⇒ Tw = 100*512*(1/10⁶) bps = 51.2*10⁻³ sec. = 51.2 msec
b) BW = 10 Mbps = 10⁷ bps
⇒ Tw = 100*512*(1/10⁷) bps = 5.12*10⁻³ sec. = 5.12 msec
