Skip to content

Category Archives: GATE CS

Spanning tree: A spanning tree (T) of an undirected graph(G) is a subgraph which is a tree that includes all the vertices of a graph… Read More
An Automaton is a machine that has a finite number of states. Any Two Automaton is said to be equivalent if both accept exactly the… Read More
A deadlock occurs when a set of processes requests resources that are already occupied by other processes in the group. Because each process possesses a… Read More
Prerequisites : Chomsky hierarchy Type-3 grammar/regular grammar :Regular grammar generates regular language. They have a single non-terminal on the left-hand side and a right-hand side… Read More
The Below Table shows the Closure Properties of Formal Languages : REG = Regular LanguageDCFL = deterministic context-free languages, CFL = context-free languages,CSL = context-sensitive languages,RC… Read More
Prerequisite : OSI Model Introduction :The Application Layer is topmost layer in the Open System Interconnection (OSI) model. This layer provides several ways for manipulating… Read More
Graduate Aptitude Test in Engineering (GATE) is one of the most competitive and toughest exams across the country which is conducted jointly by the Indian… Read More
Transducers in Finite Automata(FA) means FA with Output.There are two types of Machines for FA with Output. 1. Mealy Machine : It is FA in which… Read More
In this article, we are going to explain Access Links and Control Links. Well, both are in the field of Activation Records. Activation Record : An… Read More
Regular expressions : It is a way of representing regular languages. The algebraic description for regular languages is done using regular expressions. They can define… Read More
Prerequisite : Semaphores in Process SynchronizationOverview A semaphore is an integer variable that is useful for solving a variety of synchronization problems. It imposes deliberate… Read More
Prerequisite: Introduction to ER Model Introduction :Whenever an attribute of one entity type refers to another entity type, then some relationship exists between them. Attention reader!… Read More
1. Abstract data type (ADT) :An Abstract data type (ADT) is a mathematical model for data types. We can think of Abstract Data Type as… Read More
Overview :The purpose of this article is to tell you about an iterative algorithm for forward data-flow problem. Before starting, you should know some terminology… Read More
Overview :According to the theoretical aspects of Automata, a quotient operation can be defined as the technique that recognizes a superset of the given automation… Read More

Start Your Coding Journey Now!