Abstract
Since the publication of the
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
- 1 Structural Programming and Top Down DesignGoogle Scholar
- 1.1 Baker, F. T. Chief Programmer Team Management of Production Programming, IBM Systems Journal, ii, i (1972).Google Scholar
- 1.2 Dijkstra, E. W., Notes on Structural Programming TH-Report 70-WSK-03, Dept. of Mathematics, Technological University Eindhoven The Netherlands, April 1970.Google Scholar
- 1.3 Henderson, P. and Snowdon, R. An Experiment in Structured Programming, BIT 12 (1972).Google Scholar
- 1.4 Mills, H.D. Mathematical Foundations for Structured Programming, IBM Report FSC 72- 6012, May, 1972.Google Scholar
- 1.5 Mills, H.D. Top Down Programming in Large Systems, In Debugging Techniques in Large Systems, R. Rustin (Ed.), 1971.Google Scholar
- 1.6 Wirth, N. Program Development by Stepwise Refinement, Comm. ACM 14, 4(April 1971). Google Scholar
Digital Library
- 2 Computational CorrectnessGoogle Scholar
- 2.1 Burstall, R.M. Proving Properties of Programs by Structural Induction, Computer Journal 12, (Feb, 1969).Google Scholar
- 2.2 Elspas, B.; Levitt, K.; Waldinger, R.; Waksam, A., An Assessment of Techniques for Proving Program Correctness, Computing Surveys 4, 2 (June 1972). Google Scholar
Digital Library
- 2.3 Good, D. I., Developing Correct Software, In Proc. of First Texas Symposium on Computer Systems (June 1972).Google Scholar
- 2.4 Hoare, C. A. R. An Axiomatic Basis for Computer Programming. Comm. ACM 12, 10 (Oct. 1969). Google Scholar
Digital Library
- 2.5 Hoare, C.A.R. Procedures and Parameters: An Axiomatic Approach, Symposium on Semantics of Algorithmic Languages, E. Engeler (Ed.) Springer-Verlag (1970).Google Scholar
- 2.6 Hoare, C.A.R. Proof of a Program: FIND. CACM 14, (Jan. 1971). Google Scholar
Digital Library
- 2.7 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). Google Scholar
Digital Library
- 2.8 King, J.C. Proving Programs to be Correct, IEEE Transactions on Computers, (Nov. 1971).Google Scholar
Digital Library
- 2.9 Lee, J.A.N. The Definition and Validation of the Radix Sorting Technique, Proc. of Conf. on Proving Assertions about Programs., ACM (Jan. 1972). Google Scholar
Digital Library
- 2.10 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.Google Scholar
- 2.11 London, R.L. Proofs of Algorithms: a new kind of certification (certification of algorithm 245, Treesort 3). Comm. ACM 13 6 (June, 1970). Google Scholar
Digital Library
- 2.12 London, R.L. The Current State of Proving Programs Correct, In Proc. of ACM Annual Conf. ACM (Aug. 1972). Google Scholar
Digital Library
- 2.13 Manna, Z., Properties of Programs & the First-Order Predicate Calculus, JACM 16, 2(Apr. 1969). Google Scholar
Digital Library
- 2.14 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). Google Scholar
Digital Library
- 2.15 Maurer, W.D., State Vectors: A Preliminary Survey, Memo No. ERL-M347, Univ of Calif. Berkeley, (Aug., 1972).Google Scholar
- 2.16 Naur, P. Proof of Algorithms by General Snapshots BIT 6, 1966.Google Scholar
- 3 Computing Time AnalysisGoogle Scholar
- 3.1 Knuth, D.E., The Art of Computer Programming, Addison-Wesley, Vol. 1, 1968; Vol. 2, 1969; Vol. 3, 1972. Google Scholar
Digital Library
- 3.2 Knuth, D.E. Mathematical Analysis of Algorithms, IFIP Congress Proc. I, 135-143, 1972.Google Scholar
- 3.3 Russell, E.C. Automatic Program Analysis, UCLA Report 69-12, A.D. (March 1969).Google Scholar
- 4 Collins, G.E. The Calculation of Multivariate Polynomial Resultants, Proc. of the 2nd Symp. on Symbolic & Algebraic Manipulation, Los Angeles, March, 1971. Google Scholar
Digital Library
- 5 Curriculum 68 Report of ACM Committee, Comm. of ACM, Vol. 11, No. 3, March, 1968.Google Scholar
- 6 Heindel, L.E., Computation of Powers of Multivariate Polynomials over the Integers, JCSS 6, 1-8 (1972).Google Scholar
Digital Library
- 7 Knuth, D.E. The Art of Computer Programming, Vol. I: Fundamental Algorithms, Addison-Wesley Publ. Co., Reading, Mass., 1968. Google Scholar
Digital Library
- 8 Liu, C.L., Introduction to Combinational Mathematics, McGraw-Hill, 1968.Google Scholar
Index Terms
New directions in teaching the fundamentals of computer science — discrete structures and computational analysis
Recommendations
Teaching how to teach computational thinking
ITiCSE 2018: Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science EducationComputational Thinking is argued to be an essential skill for the workforce of the 21st century. As a skill, Computational Thinking should be taught in all schools, employing computational ideas integrated into other disciplines. Up until now, questions ...
Computer Science Teaching Knowledge: A Framework and Assessment (Abstract Only)
SIGCSE '17: Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science EducationEducators, researchers, politicians, tech companies, and others continue to advocate for the importance of K-12 students learning computer science in our increasingly tech-driven society. One way school districts in the United States address this ...
New directions in teaching the fundamentals of computer science — discrete structures and computational analysis
SIGCSE '73: Proceedings of the third SIGCSE technical symposium on Computer science educationSince 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 ...






Comments