Historical Projects in Discrete Mathematics and Computer Science
by
Janet Barnett
,
Guram Bezhanishvili
,
Hing Leung
,
Jerry Lodder
,
David Pengelley
,
Desh Ranjan
| Citations: | 1 - 1 self |
BibTeX
@MISC{Barnett_historicalprojects,
author = {Janet Barnett and Guram Bezhanishvili and Hing Leung and Jerry Lodder and David Pengelley and Desh Ranjan},
title = {Historical Projects in Discrete Mathematics and Computer Science},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A course in discrete mathematics is a relatively recent addition, within the last 30 or 40 years, to the modern American undergraduate curriculum, born out of a need to instruct computer science majors in algorithmic thought. The roots of discrete mathematics, however, are as old as mathematics itself, with the notion of counting a discrete operation, usually cited as the first mathematical development
