A strong number is a number, where the sum of the factorial of the digits is equal to the number itself.Example123!= 1!+2!+3!                   =1+2+6 =9Here, 123 is not a strong number because, the sum of factorial of digits is not equal to the ... Read More

The logic that we implement to convert Fahrenheit to Celsius is as follows −celsius = (fahrenheit - 32)*5/9;AlgorithmRefer to the algorithm given below to convert Fahrenheit to Celsius.Step 1: Declare two variables farh, cels Step 2: Enter Fahrenheit value at run time Step 3: Apply formula to convert     ... Read More

Turing machines (TM) can also be deterministic or non-deterministic, but this does not make them any more or less powerful.However, if the tape is restricted so that you can only see use of the part of the tape with the input, the TM becomes less powerful (linear bounded automata) and ... Read More

Automaton is nothing but a machine which accepts the strings of a language L over an input alphabet Σ. There are four different types of Automata that are mostly used in the theory of computation (TOC). These are as follows − Finite-state machine (FSM). Pushdown ... Read More

Attributes are the properties which describe an entity. Example The attributes of student entity are as follows − Roll number Name Branch ... Read More

An operating system is the interface between the user and the machine which controls and coordinates the use of the hardware among the various application programs for the various users. Operating System as Extended Machine Let us understand how the operating system works as an ... Read More

In an automata theory, there are different closure properties for regular languages. They are as follows −UnionIntersectionconcatenationKleene closureComplementLet see one by one with an exampleUnionIf L1 and If L2 are two regular languages, their union L1 U L2 will also be regular.ExampleL1 = {an | n > O} and L2 ... Read More

Grammar in theory of computation is a finite set of formal rules that are generating syntactically correct sentences.The formal definition of grammar is that it is defined as four tuples −G=(V, T, P, S)G is a grammar, which consists of a set of production rules. It is used to generate ... Read More

In hierarchical routing, the routers are divided into regions. Each router has complete details about how to route packets to destinations within its own region. But it does not have any idea about the internal structure of other regions.As we know, in both LS and DV algorithms, every router needs ... Read More

Selective-repeat Automatic Repeat Request (ARQ) is one of the techniques where a data link layer may deploy to control errors.Techniques to control ARQGenerally, there are three types of techniques which control the errors by Automatic Repeat Request (ARQ) they are −Stop-and-wait ARQGo-Back-N ARQSelective Repeat ARQRequirements for Error ControlThere are some ... Read More