skip to main content
article

A discrete structures course for a small college

Published:01 January 1975Publication History
Skip Abstract Section

Abstract

It is generally accepted that a course in discrete structures such as Course B3 in Curriculum 68 recommendations [1] is an important part of a Computer Science program. In many institutions a Discrete Structures course is offered in the Computer Science Department although it overlaps courses in the Mathematics Department [2,3,4]. In smaller schools the size of the student body and staff limitations make such a solution impractical. At Augusta College we have met the objective of early exposure to discrete mathematics with applications in computer science by offering a two-hour computer science course as a co-requisite to a three-hour mathematics course. While this approach is a compromise it does appear to have some merit.

References

  1. 1 "Curriculum '68" ACM Curriculum Committee on Computer Science. Communications of the ACM, Vol.II, No.3, March, 1968, pp 151-197.Google ScholarGoogle Scholar
  2. 2 Engel, Gerald and Jones, Neil. "Discrete Structures in the Under-graduate Computer Science Curriculum", SIGCSE Bulletin, Vol.5, No.1, February, 1973, pp 56-59. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Yeh, Raymond T., Good, Donald I. and Musser, David R. "New Directions in Teaching the Fundamentals of Computer Science—Discrete Structures and Computational Analysis", SIGCSE Bulletin, Vol.5, No.1, February, 1973, pp 60-69. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Tremblay, J.P. and Manohar, R. "A First Course in Discrete Structures with Applications to Computer Science", SIGCSE Bulletin, Vol.6, No.1, February, 1974, pp 155-160. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Abrams, Marshall D. and Stein, Philip G. Computer Hardware and Software: An Interdisciplinary Introduction, Addison-Wesley, 1973.Google ScholarGoogle Scholar
  6. 6 Baron, Robert C. and Piccirilli, Albert T. Digital Logic and Computer Operations, McGraw-Hill, 1967.Google ScholarGoogle Scholar
  7. 7 Bartee, Thomas C. Digital Computer Fundamentals, McGraw-Hill, 1972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Berztiss, A.T. Data Structures: Theory and Practice, Academic Press, 1971. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Birkhoff, Garrett and Bartee, Thomas C. Modern Applied Algebra, McGraw-Hill, 1970.Google ScholarGoogle Scholar
  10. 10 Bobrow, Leonard S. and Arbib, Michael A. Discrete Mathematics: Applied Algebra for Computer and Information Science, W.B.Saunders, 1974.Google ScholarGoogle Scholar
  11. 11 Computers and Computation: Readings from Scientific American, W.H.Freeman, 1971.Google ScholarGoogle Scholar
  12. 12 Dinkines, Flora. Introduction to Mathematical Logic, Appleton-Century - Crofts, 1964.Google ScholarGoogle Scholar
  13. 13 Feigenbaum, Edward A. and Feldman, Julian, Eds. Computers and Thought, McGraw-Hill, 1963. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 Korfhage, Robert S. Discrete Computational Structures, Academic Press, 1974. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 Lewin, Douglas. Theory and Design of Digital Computers, John Wiley, 1972.Google ScholarGoogle Scholar
  16. 16 Preparata, Franco P. and Yeh, Raymond T. Introduction to Discrete Structures, Addison-Wesley, 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17 Stoll, Robert R. Set Theory and Logic, W.H.Freeman, 1963.Google ScholarGoogle Scholar
  18. 18 Stone, Harold S. Discrete Mathematical Structures and Their Applications, Science Research Associates, Inc., 1973.Google ScholarGoogle Scholar
  19. 19 Suppes, Patrick. Introduction to Logic, D. Van Nostrand, 1957.Google ScholarGoogle Scholar
  20. 20 Tremblay, Jean-Paul and Manohar, Ram P. Discrete Mathematical Structures with Applications in Computer Science, McGraw-Hill, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21 Zehna, Peter W. and Johnson, Robert L. Elements of Set Theory, Allyn and Bacon, 1972.Google ScholarGoogle Scholar

Index Terms

  1. A discrete structures course for a small college

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGCSE Bulletin
        ACM SIGCSE Bulletin  Volume 7, Issue 1
        Proceedings of the 5th SIGCSE symposium on Computer science education
        February 1975
        209 pages
        ISSN:0097-8418
        DOI:10.1145/953064
        Issue’s Table of Contents
        • cover image ACM Conferences
          SIGCSE '75: Proceedings of the fifth SIGCSE technical symposium on Computer science education
          January 1975
          221 pages
          ISBN:9781450373982
          DOI:10.1145/800284

        Copyright © 1975 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 January 1975

        Check for updates

        Qualifiers

        • article
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!