Skip to content

Category Archives: GATE CS

Quotient Remainder Theorem states that for any pair of integers a and b (b is positive), there exists two unique integers q and r such… Read More
1. Associative Memory : The time required to find an object stored in memory can be significantly reduced if the stored data can be identified… Read More
Data Hazards occur when an instruction depends on the result of previous instruction and that result of instruction has not yet been computed. whenever two… Read More
1. Shortest Job First (SJF) : The Shortest Job First (SJF) is a scheduling policy that selects the waiting process with the smallest execution time to… Read More
1. Router : A router is basically a device or a hardware which is responsible for receiving, analyzing and forwarding the data packets to other networks.… Read More
Below are some interesting properties of Modular Addition:   (a + b) mod m = ((a mod m) + (b mod m)) mod m (a + b… Read More
Process: A process is an activity of executing a program. Basically, it is a program under execution. Every process needs certain resources to complete its… Read More
Below are some interesting properties of Modular Multiplication (a x b) mod m = ((a mod m) x (b mod m)) mod mAttention reader! Don’t… Read More
Prerequisite – Join (Inner, Left, Right and Full Joins) 1. Natural Join : Natural Join joins two tables based on same attribute name and datatypes. The resulting… Read More
1. Native Compiler : Native compiler are compilers that generates code for the same Platform on which it runs. It converts high language into computer’s… Read More
1. FROM Clause: It is used to select the dataset which will be manipulated using Select, Update or Delete command.It is used in conjunction with… Read More
1. Static Hazard : Static hazard occur in combinational circuits and can be eliminated by using redundant gates. Static hazard is further classified as: 1.… Read More
Prerequisite – Addressing Modes 1. Register Mode : In register addressing mode, the operand is placed in one of 8 bit or 16 bit general… Read More
1. First Come First Served (FCFS) : First Come First Served (FCFS) is the simplest type of algorithm. It is a non-preemptive algorithm i.e. the… Read More
A task is accomplished on the execution of a program, which results in a process. Every task incorporates one or many sub tasks, whereas these… Read More

Start Your Coding Journey Now!