A first problem for the algorithms course (poster session)

Authors:
J. Á. Velázquez-Iturbide
Affiliations:
Escuela Superior de CC. Experimentales y Tecnologia, Universidad Rey Juan Carlos
Venue:
Proceedings of the 6th annual conference on Innovation and technology in computer science education
Year:
2001

Citing 3
Cited 0

Teaching EBNF first in CS 1

SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
A gentle introduction to algorithm complexity for CS1 with nine variations on a theme by Fibonacci

ACM SIGCSE Bulletin
Ancient Babylonian algorithms

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

I present a problem to be used in the first class of the algorithms course as an introduction to the topic. Two algorithms are given, simple but rich enough to illustrate several issues.