[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/800010.808080acmconferencesArticle/Chapter ViewAbstractPublication PagessigcseConference Proceedingsconference-collections
Article

New directions in teaching the fundamentals of computer science — discrete structures and computational analysis

Published: 01 January 1973 Publication History

Abstract

Since the publication of the Curriculum 68 report of the ACM Committee [CUR 68], undergraduate computer science programs have undergone substantial changes. Notably, many courses previously taught at the graduate level have shifted down to the undergraduate level; new areas have developed and consolidated but were not covered by the ACM report. These facts make it necessary to revise and update the Curriculum 68 report. An important factor which could help the revision is the actual experience gained through the development of many new undergraduate computer science programs since the publication of Curriculum 68 report five years ago. More specifically, most recommendations of the ACM report contain just the subject areas to be taught. The actual teaching experiences of these courses have formulated certain basic philosophies and formats of presentation. It is helpful, in our opinion, to compare the merits of these philosophies and formats of presentation.
In this paper, we shall discuss the basic philosophies and formats of presentation of two undergraduate computer science courses—Introduction to Discrete Structures, and Computational Analysis. The former coincides with the B3 course of the Curriculum 68 report; the latter is a new course not covered by the ACM report.

References

[1]
Structural Programming and Top Down Design
[2]
Baker, F. T. Chief Programmer Team Management of Production Programming, IBM Systems Journal, ii, i (1972).
[3]
Dijkstra, E. W., Notes on Structural Programming TH-Report 70-WSK-03, Dept. of Mathematics, Technological University Eindhoven The Netherlands, April 1970.
[4]
Henderson, P. and Snowdon, R. An Experiment in Structured Programming, BIT 12 (1972).
[5]
Mills, H.D. Mathematical Foundations for Structured Programming, IBM Report FSC 72- 6012, May, 1972.
[6]
Mills, H.D. Top Down Programming in Large Systems, In Debugging Techniques in Large Systems, R. Rustin (Ed.), 1971.
[7]
Wirth, N. Program Development by Stepwise Refinement, Comm. ACM 14, 4(April 1971).
[8]
Computational Correctness
[9]
Burstall, R.M. Proving Properties of Programs by Structural Induction, Computer Journal 12, (Feb, 1969).
[10]
Elspas, B.; Levitt, K.; Waldinger, R.; Waksam, A., An Assessment of Techniques for Proving Program Correctness, Computing Surveys 4, 2 (June 1972).
[11]
Good, D. I., Developing Correct Software, In Proc. of First Texas Symposium on Computer Systems (June 1972).
[12]
Hoare, C. A. R. An Axiomatic Basis for Computer Programming. Comm. ACM 12, 10 (Oct. 1969).
[13]
Hoare, C.A.R. Procedures and Parameters: An Axiomatic Approach, Symposium on Semantics of Algorithmic Languages, E. Engeler (Ed.) Springer-Verlag (1970).
[14]
Hoare, C.A.R. Proof of a Program: FIND. CACM 14, (Jan. 1971).
[15]
Hull, T.E. Enright, W. H., Sedgwick, A. E., The Correctness of Numerical Algorithms, Proc. of Conference on Proving Assertions about Programs, ACM (Jan. 1972).
[16]
King, J.C. Proving Programs to be Correct, IEEE Transactions on Computers, (Nov. 1971).
[17]
Lee, J.A.N. The Definition and Validation of the Radix Sorting Technique, Proc. of Conf. on Proving Assertions about Programs., ACM (Jan. 1972).
[18]
London, R.L. Bibliography on Proving the Correctness of Computer Programs" In Machine Intelligence 5, B. Meltzer & D. Michie (Eds) Amer. Elsevier Publ. Co., New York, 1970.
[19]
London, R.L. Proofs of Algorithms: a new kind of certification (certification of algorithm 245, Treesort 3). Comm. ACM 13 6 (June, 1970).
[20]
London, R.L. The Current State of Proving Programs Correct, In Proc. of ACM Annual Conf. ACM (Aug. 1972).
[21]
Manna, Z., Properties of Programs & the First-Order Predicate Calculus, JACM 16, 2(Apr. 1969).
[22]
Manna, Z.; Ness, S.; Vuillen, J.: Inductive Methods for Proving Properties of Programs. In Proc. of Conf. on Proving Assertions about Programs, ACM (Jan. 1972).
[23]
Maurer, W.D., State Vectors: A Preliminary Survey, Memo No. ERL-M347, Univ of Calif. Berkeley, (Aug., 1972).
[24]
Naur, P. Proof of Algorithms by General Snapshots BIT 6, 1966.
[25]
Computing Time Analysis
[26]
Knuth, D.E., The Art of Computer Programming, Addison-Wesley, Vol. 1, 1968; Vol. 2, 1969; Vol. 3, 1972.
[27]
Knuth, D.E. Mathematical Analysis of Algorithms, IFIP Congress Proc. I, 135-143, 1972.
[28]
Russell, E.C. Automatic Program Analysis, UCLA Report 69-12, A.D. (March 1969).
[29]
Collins, G.E. The Calculation of Multivariate Polynomial Resultants, Proc. of the 2nd Symp. on Symbolic & Algebraic Manipulation, Los Angeles, March, 1971.
[30]
Curriculum 68 Report of ACM Committee, Comm. of ACM, Vol. 11, No. 3, March, 1968.
[31]
Heindel, L.E., Computation of Powers of Multivariate Polynomials over the Integers, JCSS 6, 1-8 (1972).
[32]
Knuth, D.E. The Art of Computer Programming, Vol. I: Fundamental Algorithms, Addison-Wesley Publ. Co., Reading, Mass., 1968.
[33]
Liu, C.L., Introduction to Combinational Mathematics, McGraw-Hill, 1968.

Cited By

View all

Index Terms

  1. New directions in teaching the fundamentals of computer science — discrete structures and computational analysis

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SIGCSE '73: Proceedings of the third SIGCSE technical symposium on Computer science education
      January 1973
      185 pages
      ISBN:9781450373753
      DOI:10.1145/800010
      • cover image ACM SIGCSE Bulletin
        ACM SIGCSE Bulletin  Volume 5, Issue 1
        Proceedings of the 3rd SIGCSE symposium on Computer science education
        February 1973
        171 pages
        ISSN:0097-8418
        DOI:10.1145/953053
        Issue’s Table of Contents
      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 January 1973

      Permissions

      Request permissions for this article.

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate 1,595 of 4,542 submissions, 35%

      Upcoming Conference

      SIGCSE TS 2025
      The 56th ACM Technical Symposium on Computer Science Education
      February 26 - March 1, 2025
      Pittsburgh , PA , USA

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 18 Dec 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (1977)A survey of the literature in computer science education since curriculum '68Communications of the ACM10.1145/359367.35941720:1(13-21)Online publication date: 1-Jan-1977
      • (1976)Another look at the discrete structures courseACM SIGCUE Outlook10.1145/953026.80347810:SI(247-252)Online publication date: 1-Feb-1976
      • (1976)The why and how of discrete structuresACM SIGCSE Bulletin10.1145/952991.8047498:3(22-25)Online publication date: 1-Jul-1976
      • (1976)Another look at the discrete structures courseACM SIGCSE Bulletin10.1145/952989.8034788:1(247-252)Online publication date: 1-Feb-1976
      • (1976)The why and how of discrete structuresProceedings of the sixth SIGCSE technical symposium on Computer science education10.1145/800144.804749(22-25)Online publication date: 1-Sep-1976
      • (1976)Another look at the discrete structures courseProceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education10.1145/800107.803478(247-252)Online publication date: 1-Feb-1976
      • (1975)A discrete structures course for a small collegeACM SIGCSE Bulletin10.1145/953064.8111327:1(61-64)Online publication date: 1-Jan-1975
      • (1975)A discrete structures course for a small collegeProceedings of the fifth SIGCSE technical symposium on Computer science education10.1145/800284.811132(61-64)Online publication date: 1-Jan-1975

      View Options

      View options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media