Browse wiki

From IOI Wiki
Jump to: navigation, search
The overlooked don't-care notion in algorithmic problem solving
Abstract The notion of "don't care", that encapsula
The notion of "don't care", that encapsulates the unimportance of which of several scenarios will occur, is a fundamental notion in computer science. It is the core of non-determinism; it is essential in various computational models; it is central in distributed and concurrent algorithms; and it also is relevant in sequential, deterministic algorithms. It is a valuable tool in algorithmic problem solving. Yet, in the teaching of (deterministic) algorithms it is not made explicit, and left unexplored. Its implicit exposition yields limited student invocations and limited student comprehension upon its utilization. These phenomena are also due to its rather unintuitive "black-box" characteristic. In this paper, we illuminate and elaborate on this notion with six algorithmic illustrations, and describe our experience with novice difficulties with respect to this notion.
difficulties with respect to this notion.  +
Free 1 +
Has author David Ginat +
Journal Informatics in Education +
Pages 217-226 +
Title The overlooked don't-care notion in algorithmic problem solving +
Type Article +
Volume 8 +
Year 2009 +
Categories Publications about training
Modification date
This property is a special property in this wiki.
27 July 2010 20:00:14  +
Number
This property is a special property in this wiki.
2  +
URL
This property is a special property in this wiki.
http://www.mii.lt/informatics_in_education/htm/INFE157.htm  +
hide properties that link here 
The overlooked don't-care notion in algorithmic problem solving + Title
The Overlooked Don't-Care Notion in Algorithmic Problem Solving + redirect page
 

 

Enter the name of the page to start browsing from.