Thumbnail
Access Restriction
Subscribed

Author Rubio-Sánchez, Manuel
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword Problem equivalence ♦ Combinatorics ♦ Recursion ♦ Np-completeness ♦ Fibonacci numbers ♦ Counting problems
Abstract This paper proposes the use of several classes of simple combinatorial problems that share the same solution for teaching problem equivalence and recursion. Our focus is on counting problems that involve Fibonacci numbers. While these problems have simple recursive solutions, we propose that - for teaching purposes - they can also be solved by finding other isomorphic problems for which the solution is known.
Description Affiliation: Universidad Rey Juan Carlos, Madrid, Spain (Rubio-Sánchez, Manuel)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1978-02-01
Publisher Place New York
Journal ACM SIGCSE Bulletin (SGCS)
Volume Number 40
Issue Number 3
Page Count 1
Starting Page 313
Ending Page 313


Open content in new tab

   Open content in new tab
Source: ACM Digital Library