answersLogoWhite

0

Discuss Definiteness in algorithm

Updated: 8/11/2023
User Avatar

Wiki User

12y ago

Best Answer

eAch iNstrUctiOn mUst bE cleAr aNd aMbiguOus .

User Avatar

Wiki User

12y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

11y ago

true

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Discuss Definiteness in algorithm
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering

What are the characteristics of a good algorithm?

Every algorithm should have the following five characteristics: 1. Input 2. Output 3. Definiteness 4. Effectiveness 5. Termination


How do you explain characteristics of algorithm?

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


Characteristics 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 unambiguous. This means that the action specified by the step cannot be interpreted (explain the meaning of) in multiple ways & can be performed without any confusion. 3) Input:- an algorithm accepts zero or more inputs 4) Output:- it produces at least one output. 5) Effectiveness:- it consists of basic instructions that are realizable. This means that the instructions can be performed by using the given inputs in a finite amount of time.


What is algorithm to write algorithm to the program to access a pointer variable in structure?

Here is the algorithm of the algorithm to write an algorithm to access a pointer in a variable. Algorithmically.name_of_the_structure dot name_of_the _field,eg:mystruct.pointerfield


Which algorithm is more efficient lamport bakery algorithm or black and white bakery algorithm?

Black and White bakery algorithm is more efficient.

Related questions

Is the statement 'Definiteness is one of the properties of an algorithm' True or false?

definiteness is on of the properties of an algorithms


What are the characteristics of a good algorithm?

Every algorithm should have the following five characteristics: 1. Input 2. Output 3. Definiteness 4. Effectiveness 5. Termination


Characteristics of algorithms?

1. Finiteness 2. Definiteness 3.


How do you explain characteristics of algorithm?

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


Discuss the back propagation algorithm for neural network-based classification of data?

i don't know the answer i want this answer from your side.............


How do you definiteness in a sentence?

It is definite that I will not go to the Valentine's Day dance.


Characteristics 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 unambiguous. This means that the action specified by the step cannot be interpreted (explain the meaning of) in multiple ways & can be performed without any confusion. 3) Input:- an algorithm accepts zero or more inputs 4) Output:- it produces at least one output. 5) Effectiveness:- it consists of basic instructions that are realizable. This means that the instructions can be performed by using the given inputs in a finite amount of time.


Mum is it a pronoun or a noun?

"Mum" is a noun, specifically a common noun. It refers to a female parent. Pronouns are words that can replace nouns in a sentence (e.g., she, he, they), while nouns are the actual words that represent people, places, things, or ideas.


What has the author Zaur Kambarov written?

Zaur Kambarov has written: 'The concept of definiteness and its application to automated reference resolution' -- subject(s): Comparative and general Grammar, Computational linguistics, Definiteness (Linguistics), Determiners, Grammar, Comparative and general, Reference (Linguistics)


What is the noun for definitely?

The word 'definitely' is the adverb for of the adjective 'definite'.The noun form for the adjective definite is definiteness.


What are the characteristics of the algorithms?

1. Input 2. Output 3. definiteness 4. Effective 5. Termination


How are the expanded algorithm and the standard algorithm different?

They are different because standard algorithm is more common then the expanded algorithm