The Complete Codes

NFA with Epsilon( ε) Transition (ε-NFA): The NFA with epsilon-transition is a finite state machine in which the transition from one state to another state is allowed without any input symbol i.e. empty string ε. Adding the transition for the  empty string doesn’t increase the computing power of the finite automata but adds some flexibility to construct then DFA and NFA. This are very helpful when we study regular expression (RE) and prove the equivalence between class of language accepted by RE and finite automata.

Computer Network According to Tanenbaum , computer network is a collection of ―autonomous‖ computers interconnected by a single technology. It is a collection of computers and other devices interconnected by communication channels that allow sharing of resources and information. The connection can be done as peer-to-peer or client/server.

Non Deterministic Finite Automata (NFA): Like the DFA, a NFA has a finite set of states, a finite set of input symbols, one start state, a set of accepting states and transition function (𝛿). The difference between the DFA and the NFA is in the type of 𝛿. For the NFA, 𝛿 is a function that takes a state and input symbol as arguments as like the DFA’s transition function, but returns a set of zero, one or more state (DFA returns exactly one state).

Automata Theory Automata (singular: automation) are abstract models of machines that perform computations on input by moving through a series of states. At each state of the computation, a transition function determines the next configuration on the basis of a finite portion of the present state. As a result, once the computation reaches an accepting state, it accepts that input. The most general and powerful automata are the Turing machine.

C-LOOK Disk Scheduling Algorithm- Circular-LOOK Algorithm is an improved version of the LOOK Algorithm. Head starts from the first request at one end of the disk and moves towards the last request at  the other end servicing all the requests in between. After reaching the last request at the other end, head reverses its direction. It then returns to the first request at the starting end without servicing any request in between. The same process repeats.

Look Disk Scheduling Algorithm LOOK Algorithm is an improved version of the SCAN Algorithm. Head starts from the first request at one end of the disk and moves towards the last request at the other end servicing all the requests in between. After reaching the last request at the other end, the head reverses its direction. It then returns to the first request at the starting end servicing all the requests in between. The same process repeats.

Introduction to SSTF disk scheduling : SSTF stands for Shortest Time First which very uses full of learning about how the disk drive manages the data having the shortest seek time.