Prerequisite – Introduction of Finite Automata Non-Deterministic Finite Automata and ∈-Non-Deterministic Finite Automata are almost the same except for their transition function and there are… Read More

# Category Archives: GATE CS

State Elimination Method : Rules to convert a DFA/NFA//Ɛ-NFA into corresponding Regular Expression. Arden’s Method is not capable of converting Ɛ-NFA. By state elimination method… Read More

One of the method to ensure isolation property in transaction is to require data items be accessed in a mutually exclusive manner. That means, while… Read More

Transactions in DBMS : Transactions are a set of operations used to perform a logical set of work. A transaction usually means that the data in… Read More

Bus Topology : Alternatively mentioned as line topology, bus topology could even be a specific quite topology during which each computer and network device is… Read More

Prerequisite – Types of Network Topology Hybrid Topology : Firstly before going to topic, we saw that a topology may be a connection of varied… Read More

1. Unicast : Unicast is a type of information transfer and it is used when there is a participation of single sender and single recipient.… Read More