# Write a program in c language that inputs 2 number and solve using euclidean algorithm?

how to write a programm to add number like123 in c language

### What is meaning of Test Benches in VHDL?

After compiling a hardware description language like VHDL, it is required to apply inputs to the program in order to obtain out puts. Applying the inputs involves initial conditions. As the systems designed using VHDL are electronic, the initial conditions plays a vital role. Hence, all these conditions along with the information as to where the input is expected to change from 1 to 0 or 0 to 1 is provided to the VHDL program…

### What are the properties of an algorithm?

An algorithm is written in simple English and is not a formal document. An algorithm must: - be lucid, precise and unambiguous - give the correct solution in all cases - eventually end Also note it is important to use indentation when writing solution algorithm because it helps to differentiate between the different control structures. 1) Finiteness: - an algorithm terminates after a finite numbers of steps. 2) Definiteness: - each step in algorithm is…

### What type of error in an algorithm will produce unexpected results depending on the number that the user inputs?

Algorithms do not accept user input; they are not computer programs. All input to an algorithm is specified at the start of the algorithm along with any required preconditions and postconditions. If a required precondition is not specified or is specified incorrectly, then this could result in unexpected results (or undefined behaviour in programming terminology). The type of error in the algorithm is simply that the precondition was not specified.

### What are the main characteristics of algorithm explain with suitable example?

1. Finiteness : An algorithm must terminate after a finite number of steps and further each steps must be executable in finite amount of time. 2. Each step of an algorithm must be precisely defined; the action to be carried out must be rigorously and unambiguously specified for each case. 3. Input: An algorithm has zero or more, but only finite number of inputs. zero input example: ASCII chart of 0-255 4. Output: An algorithm…

### How do you calculate space complexity?

Calculate the amount of additional memory used by the algorithm relative to the number of its inputs. Typically the number of inputs is defined by a container object or data sequence of some type, such as an array. If the amount of memory consumed remains the same regardless of the number of inputs, then the space complexity is constant, denoted O(1) in Big-Omega notation (Big-O). If the amount of memory consumed increases linearly as n…

### Where does PHP differ from other computer programs?

First, let's make this clear: PHP isn't a computer program; it's a programming language that has a JIT compiler (the program named php.exe), but when taking about php you usually refer to the language and not the compiler exe from the language. It differs from other "normal programs" (for example: firefox, audacity, your games, etc...) because it's a compiler: it inputs data (usually a text file) and output a exe, the program, that does what…

### What has the author Joseph Stewart Ralph written?

Joseph Stewart Ralph has written: 'Socioeconomic inputs versus school inputs related to grade six written language achievement in a rural area of Newfoundland' -- subject(s): Students, Study and teaching, Economic conditions, Composition and exercises, Academic achievement, Social conditions, English language

### Define algorithm and what are its properties and what are its advantages?

Algoritham 1, a step-by-step method of solving a problem or making decisions, as in making a diagnosis. 2. an established mechanical procedure for solving certain mathematical problems. Properities of the algorithm ) Finiteness: - an algorithm terminates after a finite numbers of steps. 2) Definiteness: - each step in algorithm is unambiguous. This means that the action specified by the step cannot be interpreted (explain the meaning of) in multiple ways & can be performed…

### How do you explain characteristics of algorithm?

Characteristics of Algorithm n Finiteness: F terminates after a finite number of steps n Definiteness: F rigorously and unambiguously specified n Input: F valid inputs are clearly specified n Output: F can be proved to produce the correct output given a valid input n Effectiveness: F steps are sufficiently simple and basic.

### What are boundary conditions in computer science?

The term "boundary conditions" is often used when dealing with the designing, testing and proving of algorithms (and implementations of algorithms). Many solutions to problems have a set of ranges of inputs that they can accept. When designing or testing an algorithm, you need to pay attention to the "boundaries" of the input. It's generally impossible to test every possible set of inputs to your algorithm, but you should be able to prove that it…

### Why time complexity is better than actual running time?

Finding a time complexity for an algorithm is better than measuring the actual running time for a few reasons: # Time complexity is unaffected by outside factors; running time is determined as much by other running processes as by algorithm efficiency. # Time complexity describes how an algorithm will scale; running time can only describe how one particular set of inputs will cause the algorithm to perform. Note that there are downsides to time complexity…

### How you can use pseudo code and flow chart?

A flow chart is used to define the "flow" of the algorithm to a problem - inputs, steps in execution, decision points where depending on a certain check, the flow could branch off in different directions etc. Pseudo code is like actual code, but need not follow the strict syntax of any particular language. You can translate the flow chart into pseudo code - which makes it look like almost like a real program, and…

### Differentiate between polynomial algorithm and exponential algorithm?

Do you mean, "the difference between an algorithm that runs in polynomial time, and one that runs in exponential time". First a real quick review. A polynomial is any equation of the form y = cmxm + ... + c2x2 + c1x + c0 , where ci are constants An exponential function is something of the form y = cx These functions grow much faster than any polynomial function. So, if T(n) describes the runtime…

### What is the different between computer technology programming and computer science?

Computer technology is hardware, software etc as a WHOLE. Programming is usually a "language" in which a certain program or piece of hardware is given instructions on how to respond or run to certain inputs. Computer science is similar to that of computer technology in that it covers a wide range of technology, It refers to the computer as a whole.

### Introduction multiplexer demultiplexer?

A multiplexer, commonly referred as an input selector, is a circuit with many inputs but only one output: it has some data inputs, control inputs and one output, depending on the control inputs, one input from the data inputs is sent to the output .A demultiplexer is a circuit with one data input, few control inputs and many outputs, it is also known as output selector.

### Classification of inputs in economics?

-these are inputs that do not change with the volume of production.This means, wheter you produce or not, these factors of production are unchanged. -these inputs change in accordance with the volume of production. NO production means NO variable inputs, while more production means more variable inputs. -sage- :P e-add: sage.ronquillo@yahoo.com

### What is a fuzzy algorithm?

It would probably be an algorithm using fuzzy logic. Traditional logic has only two possible outcomes, true or false. Fuzzy logic instead uses a graded scale with many intermediate values, like a number between 0.0 and 1.0. (Similar to what probability theory does.) A fuzzy algorithm would then use fuzzy logic to operate on inputs and give a result. Applications include control logic (controlling engine speed, for instance, where it can be handy to have…

### What are the characteristics of an algorithm describe with an example?

Characteristics of Algorithm n Finiteness: F terminates after a finite number of steps n Definiteness: F rigorously and unambiguously specified n Input: F valid inputs are clearly specified n Output: F can be proved to produce the correct output given a valid input n Effectiveness: F steps are sufficiently simple and basic. Read more: http://wiki.answers.com/Q/Explain_characteristics_of_algorithm#ixzz1Z9XmNnaz