On varying perspectives of problem decomposition

SIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education)

Volumn , Issue , 2002, Pages 331-335

  Ginat, David ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; LOGIC PROGRAMMING; PROBLEM SOLVING; TEACHING;

DATA SETS; PROBLEM DECOMPOSITION;

COMPUTER SCIENCE;

EID: 0036040728     PISSN: 00978418     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/563517.563470     Document Type: Conference Paper

References (9)

1. A fast majority vote algorithm, automated reasoning: Essays in honor of Woody Bledsoe
2. The case for case studies of programming problems
3. A sqrt(N) algorithm for mutual exclusion in decentralized systems
4. Finding repeated elements
5. Skip lists: A probabilistic alternative to balanced trees
6. Learning to think mathematically: Problem solving, metacognition, and sense making in mathematics