# Category Archives: GATE CS

## Arden’s Theorem in Theory of Computation

Arden’s theorem state that: “If P and Q are two regular expressions over , and if P does not contain , then the following equation… Read More »

A thread is a path which is followed during a program’s execution. Majority of programs written now a days run as a single thread.Lets say,… Read More »

## Bit Stuffing in Computer Network

Data link layer is responsible for something called Framing, which is the division of stream of bits from network layer into manageable units (called frames).… Read More »

## Difference between layer-2 and layer-3 switches

Prerequisite – Network Devices A switch is a device which sends a data packet in a local network. What is advantage over hub? A hub… Read More »

## Turing machine for copying data

Prerequisite – Turing Machine Problem – Draw a Turing machine which copy data.  Example –    Steps:   Step-1. First convert all 0’s, 1’s into 0’s, 1’s… Read More »

## Difference between Mealy machine and Moore machine

Prerequisite – Mealy and Moore Machines Mealy Machine – A mealy machine is defined as a machine in theory of computation whose output values are… Read More »

## Difference between combinational and sequential circuit

Prerequisite – Combinational circuits using Decoder, Introduction of Sequential Circuits Combinational circuits are defined as the time independent circuits which do not depends upon previous… Read More »

## Turing machine for subtraction | Set 1

Prerequisite – Turing Machine Problem-1: Draw a Turing machine which subtract two numbers. Example: Steps: Step-1. If 0 found convert 0 into X and go… Read More »

## Turing machine for multiplication

Prerequisite – Turing Machine Problem: Draw a turing machine which multiply two numbers. Example: Steps: Step-1. First ignore 0’s, C and go to right &… Read More »

## Computer Organization | Amdahl’s law and its proof

It is named after computer scientist Gene Amdahl( a computer architect from IBM and Amdahl corporation), and was presented at the AFIPS Spring Joint Computer… Read More »

## Discrete Mathematics | Types of Recurrence Relations – Set 2

Prerequisite – Solving Recurrences, Different types of recurrence relations and their solutions, Practice Set for Recurrence Relations The sequence which is defined by indicating a… Read More »

## GATE CS 2019 important dates and links

Sudo GATE IIT Madras will organize Graduate Aptitude Test in Engineering (GATE) 2019 Examination. There are total 23 branches in GATE exam. These are official… Read More »

## Algorithm for Dynamic Time out timer Calculation

Prerequisite – Computer Network | TCP Timers Calculating Time out timer (TOT) at transport layer is tricky as propagation delay is not constant i.e. path… Read More »

## Memory mapped I/O and Isolated I/O

As a CPU needs to communicate with the various memory and input-output devices (I/O) as we know data between the processor and these devices flow… Read More »

## Introduction of 4th and 5th Normal form in DBMS

Prerequisite – Functional Dependency, Database Normalization, Normal Forms If two or more independent relation are kept in a single relation or we can say multivalue… Read More »