Synchronization Basics Quiz Questions and Answers PDF Download eBook - 91

MCQ: Situations that prevent the next instruction in the instruction stream, from executing during its designated clock cycle are known as

1. pipe stage
2. previous stage
3. hazards
4. processor cycle

MCQ: The Poisson distribution is described by the following equation (called the probability mass function)

1. probability(k) = (e)(^a*a)^k/k!
2. probability(k) = (e)(^-a*a)^k/n!
3. probability(k) = (e)(^-a*a)^{k + k!}
4. probability(k) = (e)(^-a*a)^k/k!

MCQ: Fetch-and-increment is another task of the

1. atom exchange
2. atomic exchange
3. atomic synchronization
4. none of above

MCQ: Every network that interconnects more than two devices also requires some mechanism to deliver each packet to the correct destination, the associated function is referred to as

1. transmission time
2. routing
3. link injection bandwidth
4. ip offload

MCQ: When the victim buffer is full, the cache must be

1. be full
2. be empty
3. wait
4. move next