Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Free access

The why and how of discrete structures

Published: 01 July 1976 Publication History

Abstract

Eight years after Curriculum 68 there is still much uncertainty regarding the place of discrete mathematics in a computer science curriculum. This paper explores the purposes of discrete mathematics courses in a very broad context. It is suggested that discrete mathematics be distributed over two courses, and that the attitudes established in the courses are more important than the contents of the courses.

References

[1]
Curriculum 68 - Recommendations for academic programs in computer science. Comm. ACM 11, 3 (March 1968), 151-197.
[2]
Berztiss, A. T., Data Structures: Theory and Practice. Academic Press, New York, 1971.
[3]
Preparata, F. P., and Yeh, R. T., Introduction to Discrete Structures. Addison-Wesley, Reading, Mass., 1973.
[4]
Stone, H.S., Discrete Mathematical Structures and their Applications. Sci. Res. Associates, Chicago, 1973.
[5]
Korfhage, R. R., Discrete Computational Structures. Academic Press, New York, 1974.
[6]
Tremblay, J. P., and Manohar, R., Introduction to Discrete Mathematical Structures with Applications to Computer Science. McGraw-Hill, New York, 1975.
[7]
Berztiss, A. T., Data Structures: Theory and Practice (2nd Ed.). Academic Press, New York, 1975.
[8]
Kapps, C. A., and Bergman, S., Introduction to the Theory of Computing. Merrill, Columbus, Ohio, 1975.
[9]
Prather, R. E., Discrete Mathematical Structures for Computer Science. Houghton Mifflin, Boston, Mass., 1976.
[10]
Engel, G. L., and Jones, N. D., Discrete structures in the undergraduate computer science curriculum. SIGCSE Bulletin 5, 1 (Feb. 1973), 56-59.
[11]
Yeh, R. T., Good, D. I., and Musser, D. R., New directions in teaching the fundamentals of computer science - discrete structures and computational analysis. SIGCSE Bulletin 5, 1 (Feb. 1973), 60-65.
[12]
Tremblay, J. P., and Manohar, R., A first course in discrete structures with applications to computer science. SIGCSE Bulletin 6, 1 (Feb. 1974), 155-160.
[13]
Waxman, J., Reflections on B3, Discrete Structures. SIGCSE Bulletin 7, 2 (June 1975), 51-54.
[14]
Prather, R. E., Another look at the discrete structures course. SIGCSE Bulletin 8, 1 (Feb. 1976), 247-252.
[15]
Korfhage, R. R., The Case for B3 - A Reply to Waxman. SIGCSE Bulletin 7, 4 (Dec. 1975), 69-71.
[16]
Delobel, C., and Casey, R. G., Decomposition of a data base and the theory of Boolean switching functions. IBM J. Res. Development 17 (1973), 374-386.
[17]
Page, E. S., and Wilson, L. B., Information Representation and Manipulation in a Computer. Cambridge U. P., Cambridge, U.K., 1973.
[18]
Hall, P. A. V., Computational Structures - An Introduction to Non-numerical Computing. American Elsevier, New York, 1975.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCSE Bulletin
ACM SIGCSE Bulletin  Volume 8, Issue 3
Proceedings of the 6th SIGCSE symposium on Computer science education
July 1976
146 pages
ISSN:0097-8418
DOI:10.1145/952991
Issue’s Table of Contents
  • cover image ACM Conferences
    SIGCSE '76: Proceedings of the sixth SIGCSE technical symposium on Computer science education
    September 1976
    154 pages
    ISBN:9781450374453
    DOI:10.1145/800144
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1976
Published in SIGCSE Volume 8, Issue 3

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)63
  • Downloads (Last 6 weeks)6
Reflects downloads up to 01 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2018)Computer Science, Mathematics, and the Undergraduate Curricula in BothThe American Mathematical Monthly10.1080/00029890.1981.1199530088:7(472-485)Online publication date: 11-Apr-2018
  • (1977)“Recommended mathematical topics for computer science majors”Proceedings of the eighth SIGCSE technical symposium on Computer science education10.1145/800106.803433(51-55)Online publication date: 2-Feb-1977
  • (1977)“Recommended mathematical topics for computer science majors”ACM SIGCSE Bulletin10.1145/382175.8034339:3(51-55)Online publication date: 2-Feb-1977
  • (2011)Teaching discrete structuresProceedings of the 42nd ACM technical symposium on Computer science education10.1145/1953163.1953247(275-280)Online publication date: 9-Mar-2011
  • (2006)Connecting Discrete Mathematics and Software EngineeringProceedings. Frontiers in Education. 36th Annual Conference10.1109/FIE.2006.322656(13-18)Online publication date: Oct-2006

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media