Thumbnail
Access Restriction
Subscribed

Author King, P. J. H. ♦ Johnson, R. G.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
Language English
Subject Keyword Optimal programs ♦ Search ♦ Flow-charting ♦ Preprocessor ♦ Decision table
Abstract In his interesting contribution to the study of the conversion of limited-entry decision tables to flowcharts or sequential testing procedures, Verhelst [1] presents two algorithms, one of which is claimed to produce the optimal flowchart with respect to run-time. Unfortunately this minimum run-time algorithm does not always produce the result claimed, as we illustrate by example below.
Description Affiliation: Birkbeck College, London, U.K. (King, P. J. H.; Johnson, R. G.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 17
Issue Number 1
Page Count 3
Starting Page 43
Ending Page 45


Open content in new tab

   Open content in new tab
Source: ACM Digital Library