Skip to content

Category Archives: GATE CS

The limited broadcast address is defined as which sends or broadcast packet to all hosts connected to its own or home network. In limited broadcast… Read More
Set of all those attributes which can be functionally determined from an attribute set is called closure of the attribute set and the closure of… Read More
Prerequisite – Permutation and Combination Formula’s Used : 1. P(n, r) = n! / (n-r)! 2. P(n, n) = n! Example-1 : How many 4-letter… Read More
1. Half Adder : Half Adder is a combinational logic circuit which is designed by connecting one EX-OR gate and one AND gate. The half… Read More
Shift micro-operations are those micro-operations that are used for serial transfer of information. These are also used in conjunction with arithmetic micro-operation, logic micro-operation, and… Read More
Longitudinal Redundancy Check (LRC) is also known as 2-D parity check. In this method, data which the user want to send is organised into tables… Read More
In this article, we’ll try to establish the relation between Round Robin and Preemptive Priority Scheduling Algorithm. Let’s discuss the algorithms one by one first… Read More
Why do we need Checkpoints ? Whenever transaction logs are created in a real-time environment, it eats up lots of storage space. Also keeping track… Read More
Pre-requisites : TCP/IP model, and OSI Model In the establishment of TCP connection, Maximum Segment Size (MSS) is vital. MSS refers to field in TCP… Read More
Partial Key : The set of attributes that are used to uniquely identify a weak entity set is called the Partial key. Only a bunch… Read More
In today’s world computer has become an integral part of the business sector for professional activities not only for professional activities but for personal activities… Read More
Closure of a set F of FDs is the set F+ of all FDs that can be inferred from F. It is also known as… Read More
Here we will study the concept and uses of Parse Tree in Compiler Design. First, let us check out two terms : Parse : It… Read More
Moore Machines: A Moore Machine is basically a DFA with an output associated with every state. These machines can be used for a wide variety… Read More
In this article, we will see how FCFS is a special kind of Priority Preemptive Scheduling Algorithm. Also, we will cover the relation with each… Read More

Start Your Coding Journey Now!