Answer:
Register-it contains all the instructions that are present in the processor.
Memory location- it is the particular memory address where the data is stored.
Explanation: Difference between register and memory location are as follows :-
- Register are the found in the CPU internal storage and memory location is present on the RAM.
- Registers are faster in movement as compared to the memory location.
- Register has the capacity of holding of less data as compared to the memory location which can store data in large amount .
Answer:
Following are the answer for the given question
for(int i=1;i<=99;++i) // for loop
{
cout<<"EXAM"<<endl; // display the word EXAM
}
Explanation:
In this question we using for loop which is iterating 99 times and print the
word "EXAM " 99 times.
The variable i is initialized by 1 and check the condition if the condition in loop is true it will execute the loop and print "EXAM" .The loop will executed 99 times when the condition in loop is false then loop become terminated.
Following are the program in c++
#include<iostream>// header file
using namespace std;
int main() // main method
{
for(int i=1;i<=99;++i) // for loop
{
cout<<"EXAM"<<endl; // display the word EXAM
}
return 0;
}
Answer:
b) False.
Explanation:
Port explorers are tools used by both attackers and defenders to identify (or fingerprint) the computers that are active on a network, as well as the ports and services active on those computers, the functions and roles the machines are fulfilling, anAn IDPS can be configured to dial a phone number and produce an alphanumeric page or other type of signal or message., is a FALSE statement.
Answer:
It gives credit to the original author and shows that you are not taking credit for someone
else's work
Answer:
The answer is below
Explanation:
Given that:
Frame transmission time (X) = 40 ms
Requests = 50 requests/sec, Therefore the arrival rate for frame (G) = 50 request * 40 ms = 2 request
a) Probability that there is success on the first attempt =
but k = 0, therefore Probability that there is success on the first attempt = 
b) probability of exactly k collisions and then a success = P(collisions in k attempts) × P(success in k+1 attempt)
P(collisions in k attempts) = [1-Probability that there is success on the first attempt]^k = ![[1-e^{-G}]^k=[1-0.135]^k=0.865^k](https://tex.z-dn.net/?f=%5B1-e%5E%7B-G%7D%5D%5Ek%3D%5B1-0.135%5D%5Ek%3D0.865%5Ek)
P(success in k+1 attempt) = 
Probability of exactly k collisions and then a success = 
c) Expected number of transmission attempts needed = probability of success in k transmission = 