Deterministic Finite Automata
Deterministic Finite Automata A Deterministic Finite Automata (DFA) is a key concept in theory of automata and theoretical computer science. It is a type of finite state machine that is used to recognize regular languages. Every DFA is designed to accept a regular language, which can be either finite (a finite set of strings) or infinite […]
Finite Automata In TOC
Finite Automata In TOC Finite Automata (FA) is an abstract machine in TOC that accepts all the regular languages. It operates with: A finite set of states A finite input alphabet (Σ) Transition rules are used to determine movement from one state to another based on input symbols. If, after consuming the entire input, the machine […]
Kleene Closure (*) in TOC
Kleene Closure (*) In TOC Kleene Closure, also known as the Kleene Star and denoted by the symbol”*”, is a fundamental concept in the Theory of Computation (TOC). The Kleene Closure of Σ, denoted by Σ*, represents the set of all possible strings (including the empty string) formed using symbols from an alphabet Σ. Important: […]
Power Of Sigma (Σ) in TOC
Power Of Sigma (Σ) in TOC Sigma is a set of symbols that are always finite. It is denoted with “Σ”. An example of Sigma with four values is given below. Σ = {a,0,b,k} Where a, 0, b, and k are sigma values. Powers of ‘ Σ ‘ Formula The following is the formula […]
Transition in Automata
Transition In Automata Moving From one state to another or in the same state with the help of an arrow, by using an input alphabet, is called transition in Automata. Transition happens with the help of the transition function. Notation of Transition The notation of a transition typically involves representing the states, input symbols, and […]
Production Rules in TOC
Production Rules in TOC In Theory of Computation (TOC), production rules are fundamental components of formal grammars used to define languages. These rules describe how non-terminal symbols can be replaced with combinations of terminal and non-terminal symbols, enabling the generation of strings in a language. As we know, every grammar generates a specific language. Each […]
Grammar in TOC
Grammar in TOC Grammar in TOC is a standard way of representing the language. The grammar contains a set of production rules that make up the language strings. The set of all possible strings that can be derived from a grammar is known as the language of that grammar. The symbol “G” mostly denotes grammar […]
Theory of Automata
Theory of Automata The theory of automata is the study of abstract machines and computational problems. The computation problems can be solved using these abstract machines. The abstract machine is called the automata or automaton. Different names of Automata Theory are Theory of computation (TOC) Automata Theory Theory of Formal Languages and Computation Formal languages, […]
Simplify Boolean Expressions Using K-MAP
Simplify Boolean Expressions Using K-MAP The K-Map method is a simple and efficient method for simplifying Boolean Expressions. In this lecture, we will learn to solve two and three variables Boolean functions using K-MAP. This method is also known as the Karnaugh Map. K-MAP is represented in the form of a Truth Table. In a […]
Simplify Boolean Expressions Using Laws
Simplify Boolean Expressions Using Laws Boolean expressions can be easily Simplified by using the laws of Boolean algebra. Let’s explain some examples to Simplify Boolean Expressions. Example 01 F(X, Y, Z) = X.Z+X’.Z.Y F(X, Y, Z) = X.Z+X’.Y.Z {By Commutative and commutative law} F(X, Y) = (X+X’.Y).Z {By Distributive law} F(X, Y) = (1.Y).Z {by […]
Simplification Of Boolean Expressions
Simplification Of Boolean Expressions The method to simplify the Boolean expressions into their simplified form is called the simplification of Boolean expressions. Simplification is important because it reduces the complexity and cost of circuit design. Symbolically Representation of Boolean Functions Symbolic representation of Boolean functions, achieved through various symbols of logic gates. Methods for Simplification […]
Timestamp Ordering With Examples
Timestamp Ordering With Examples Timestamp Ordering with examples is a key concurrency control technique in DBMS that ensures transactions execute in a correct time-based order without conflicts. It helps students easily understand how read and write rules work using practical step-by-step examples. What is Timestamp Ordering in DBMS? Timestamp Ordering is a method where each […]
Conflicts in Timestamp Protocol
Conflicts In Timestamp Protocol Sometimes, there may be Read-Write conflicts in the timestamp ordering protocol. Let’s explain; suppose T1 is older and T2 is a younger transaction. Case 01: If an older transaction (T1) wants to perform a read or write operation before the read or write operation of an older transaction (T2) on the […]
Timestamp Ordering Protocol in DBMS
Timestamp Ordering Protocol in DBMS The Timestamp Ordering Protocol arranges the transactions based on their respective timestamps. A timestamp is a numeric value assigned to a transaction when it arrives in a schedule. Usually, this timestamp value is assigned in ascending order. Example: Suppose three transactions, T1, T2, and T3, execute in parallel on the […]
Categories of Two Phase Locking
Categories of Two Phase Locking As we know, Basic 2-PL achieves serializability, but if we want to achieve cascades, recoverability, and deadlock removal from the schedule, then we have to use categories of two-phase locking. Categories of 2-PL There are three basic categories of 2-PL 1. Strict 2-PL A schedule will be in Strict 2PL […]
Two Phase Locking Protocol
Two Phase Locking (2PL) Protocol 2-PL is an extension of Shared/Exclusive locking. It is used to reduce the problems of Shared/Exclusive locking Any schedule that follows 2PL will always be serializable, which was not in Shared/Exclusive locking Phases of 2PL There are two basic phases of two-phase locking, which are explained below I. Growing Phase: […]
Lock Based Protocol in DBMS
Lock Based Protocol in DBMS A Lock-Based Protocol in DBMS is a mechanism used to control access to a database’s resources during concurrent transaction execution. When multiple users or processes access the same data simultaneously, it can lead to conflicts, such as lost updates, temporary inconsistency, or uncommitted data visibility. Lock-based protocols prevent these issues […]
Concurrent Execution of Transaction in DBMS
Concurrent Execution of Transaction in DBMS In an uncontrolled manner, when multiple transactions in DBMS run concurrently, problems such as inconsistencies, uncommitted updates, and lost data can occur. These issues, known as concurrency problems, can disrupt the accuracy and reliability of the database. Example: In a multi-user environment, multiple users can access the same database […]
Fixed Length Subnetting
Fixed Length Subnetting As we already know, classful subnetting is also called fixed-length subnetting. The Fixed-length subnetting contains the following properties. The sizes of all sub-networks are the same. Subnets of all subnetworks are the same. All the sub-networks have an equal number of hosts. Let’s understand with an example Example-01 Suppose We have a […]
Subnetting and Its Types
Subnetting and Its Types Subnetting is a process in which a single network is divided into multiple sub-networks. The sub-networks are also called subnets. Example The following figure shows the sub-networks of a large single network into 4 smaller sub-networks Subnet ID Each sub-network has its unique network ID known as its Subnet ID. The […]