0
What else can I help you with?
What are the two characteristics of the controlled media access method?
It is known as a deterministic access method.
What is deterministic access?
When using the controlled access method, network devices take turns, in sequence, to access the medium.
Which protocol uses deterministic media access?
Token Ring
Which options are properties of contention-based media access for a shared media?
- non-deterministic - less overhead - collisions exist
Compare and contast controlled media access and contention-based media access control?
Controlled-based media access control is based upon having a system in place for allowing one host to transmit at a time. It is also known as deterministic method since there is a process to determine which host transmits at a certain time. No collisions exist with this type of media access control. An example would be token ring where a token is passed from host to host and when it has the token it can transmit and others do not transmit at that time. Contention-based media access control is known as non-deterministic because hosts can transmit whenever they want. CSMA/CD is an example of this. Collisions do exist.
It is being said that in token passing access control the main advantage of such networks is that are deterministic. Disscuss the truth of the said statement?
yes
How can a deterministic finite automaton (DFA) be constructed using the cross product construction method?
The cross product construction method is a way to create a deterministic finite automaton (DFA) by combining two DFAs. This method involves creating a new DFA whose states are pairs of states from the original DFAs, and transitions are determined by the transitions of the individual DFAs. By combining the states and transitions of the original DFAs, a new DFA can be constructed using the cross product construction method.
Difference between deterministic and nondeterministic loop?
Deterministic and non-deterministic loops A deterministic loop is predictable. The number of iterations of such a loop are known in advance, even before the loop has started. Most counting loops are deterministic. Before they start, we can say how many times they will execute. A non-deterministic loop is not easily predicted. A loop that is driven by the response of a user is not deterministic, because we cannot predict the response of the user. Non-deterministic loops usually are controlled by a boolean and the number of iterations is not known in advance.
What is a deterministic algorithm and how does it differ from non-deterministic algorithms?
A deterministic algorithm is a step-by-step procedure that always produces the same output for a given input. It follows a predictable sequence of steps to solve a problem. On the other hand, a non-deterministic algorithm may produce different outputs for the same input due to randomness or non-deterministic choices made during its execution. This makes non-deterministic algorithms harder to predict and analyze compared to deterministic algorithms.
What is non-deterministic finalization?
non-deterministic means not predicable, hence non-deterministic finalization means the finalization (removing objects from memory) cannot be determined when that will happen
Full form for HSAM?
Hierarchical Sequential Access Method-is a method to use sequential access of database.
What is deterministic systems?
Deterministic systems in which the output can be predicted with 100 percent certainty
