Essential features of an algorithm, Computer Engineering

Assignment Help:

Necessary features of an algorithm:

1.Input: The algorithm should take zero or more input.

2. Output: The algorithm should generate one or more outputs. 

3. Definiteness: Each and every step of algorithm should be described unambiguously. 

4. Effectiveness: A human should be able to measure the values involved in the procedure of the algorithm using paper and pencil.  

 


Related Discussions:- Essential features of an algorithm

Example of shared programming using library routines, Q. Example of shared ...

Q. Example of shared programming using library routines? Think about subsequent set of statements  Process A                                  Process B                  :

What is compound statement, What is compound statement If we wish to ha...

What is compound statement If we wish to have more than one statement following the if or the else, they should be grouped together between curly brackets. Such a grouping is c

Which technique is an encryption technique, Which technique is an encryptio...

Which technique is an encryption technique? Ans. Block cipher technique and also Steam cipher technique is an encryption technique.

Write heterogeneous functions, Write "heterogeneous" functions If a pro...

Write "heterogeneous" functions If a program uses simulated, dynamically allocated multidimensional arrays, it becomes possible to write "heterogeneous" functions which don't h

Draw the logic circuit of a 3 line to 8 line decoder, What is a decoder? Dr...

What is a decoder? Draw the logic circuit of a 3 line to 8 line decoder and explain its working. Ans. Decoder: it is a combinational logic circuit which converts Binary words

Example to show directory in doc, Q. Example to show directory in doc? ...

Q. Example to show directory in doc? Like a file name, the directory name may also have up to eight alpha-numeric characters. The directory name can also have an extension

What is a accepting computation history, What is a accepting computation hi...

What is a accepting computation history?  An accepting computation history is explained as , Let M be a Turing machine and w be a input string,  for M on w is a sequence of con

Formal analysis of visual elements, Formal Analysis: The second step o...

Formal Analysis: The second step of the art critiquing process often begins with an analysis of the artworks formal elements and how they are the organised. The formal elem

Database management system, what would be the occupancy of each leaf node o...

what would be the occupancy of each leaf node of a B+ tree

How many services are supported by internet, How many services are supporte...

How many services are supported by internet? The firewall software assists at least Internet services: HTTP, FTP, Gopher, SMTP and Telnet. DNS name resolution, preferably th

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd