Popular in Discrete structure
Popular in Computer Information Systems
This 1 page Class Notes was uploaded by ying.fan Notetaker on Sunday October 11, 2015. The Class Notes belongs to Cs2913 at Arkansas State University taught by E.T. Hammerand in Summer 2015. Since its upload, it has received 17 views. For similar materials see Discrete structure in Computer Information Systems at Arkansas State University.
Reviews for DS-7
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 10/11/15
Algorithms An algorithm is a finite dequence of preCIse Instructions for performing a comutation or for solvmg a problem Psedocode pseudocode provides an intermediate step between an English Ian uage description of anlalgorithm and an implenmen ation of this algorithm in a programming language A computer program can be produced in any computer langua e ulsmg the pseudocode description as a s arting pomt Properties of algorithms 1lnputAn algorithm has input values from a speCI ed set 20utput From each set of input values an al orithm produces output values from a speCI ed set e output values are the solution to the problem 3De nitenessThe steps of an algorithm must be de ned preCIser 4Correctness An algorithm should be produce the correct output values for each set of input values 5FinitenessAnlal orithm should produce the desired autputtafter a ni e number of steps for any input in e se 6Effectivenesslt must he nossihle to nerform each step of an algorithm exactly and in a nite amount of ime 7GeneraityThe procedure should be ap Iicable for all problem of the deSIred form not JUSt or a particular set of input values
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'