Mission to Mars – A Study on Naming and Referring
Algorithms processing complex structures like graphs contain references to entities, which are part of the structure. This contribution first presents an analysis of naming techniques and discusses implications to working memory load. Then some findings of a study on naming and referring in naïve al...
        Saved in:
      
    
          | Published in | Teaching Fundamental Concepts of Informatics Vol. 5941; pp. 182 - 193 | 
|---|---|
| Main Author | |
| Format | Book Chapter | 
| Language | English | 
| Published | 
        Germany
          Springer Berlin / Heidelberg
    
        2010
     Springer Berlin Heidelberg  | 
| Series | Lecture Notes in Computer Science | 
| Subjects | |
| Online Access | Get full text | 
| ISBN | 9783642113758 3642113753  | 
| ISSN | 0302-9743 1611-3349  | 
| DOI | 10.1007/978-3-642-11376-5_17 | 
Cover
| Summary: | Algorithms processing complex structures like graphs contain references to entities, which are part of the structure. This contribution first presents an analysis of naming techniques and discusses implications to working memory load. Then some findings of a study on naming and referring in naïve algorithms (involving more than 200 high school students) are presented. The study is based on workshops, in which the students first interpreted a model algorithm and then wrote algorithms by themselves, adopting – to some extent – techniques from the model. | 
|---|---|
| ISBN: | 9783642113758 3642113753  | 
| ISSN: | 0302-9743 1611-3349  | 
| DOI: | 10.1007/978-3-642-11376-5_17 |