skip to main content
article
Free Access

Computer science: a conceptual framework for curriculum planning

Published:01 June 1971Publication History
Skip Abstract Section

Abstract

Two views of computer science are considered: a global view which attempts to capture broad characteristics of the field and its relationships to other fields, and a local view which focuses on the inner structure of the field. This structure is presented in terms of the kinds of knowledge, problems, and activities that exist within the discipline, as well as the relations between them. An approach to curriculum planning in computer science is presented which is guided by the structure of the field, by the fact that change is an important feature of the situation, and by the expectation that computer science will continue to increase its working contacts with other disciplines.

References

  1. 1 Amarel, S. On the representations of problems and goal-directed procedures for computers. In the Tlleoretica{ Approaches to Non- Numerical Problem Solving. Banerji and Mesarovic (Eds.), Springer- Verlag, New York, 1970.Google ScholarGoogle Scholar
  2. 2 Blaauw, G.A., et al. The structure of System/360. IBMSyst. J. 3, 2 (1964), 119-164.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Brooks, F.P. Jr., and Iverson, K.E. Automatic Data Processing. Wiley, New York, 1963.Google ScholarGoogle Scholar
  4. 4 Chomsky, N. Formal properties of grammars. In Handbook of Mathematical Psychology Vol. 2. R.R. Bush, E.H. Galanter, R.D. Luce (Eds.), Wiley, New York, 1962.Google ScholarGoogle Scholar
  5. 5 Chu, Y. Digital Computer Design Fundamentals. McGraw-Hill, New York, 1962.Google ScholarGoogle Scholar
  6. 6 Churchman, C.W. The role of Weltanschuung in problem solving and inquiry. In Theoretical Approaches to Non-Numerical Problem Solving. Banerji and Mesarovic (Eds.), Springer-Verlag, New York, 1970.Google ScholarGoogle Scholar
  7. 7 Davis, M. Computability and Unsolvability. McGraw-Hill, New York, 1958.Google ScholarGoogle Scholar
  8. 8 Dijkstra, E.W. Notes on structures programming. TH Rep. 70-wsK-03, EWD 249, 2rid ed., Technological U. of Eidhoven, Dep. of Mathematics, Apr. 1970.Google ScholarGoogle Scholar
  9. 9 Feigenbaum, E.A., and Feldman, J. (Eds.) Computers and Thought. McGraw-Hill, New York, 1966. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Feldman, J., and Gries, D. Translator writing systems. Comm. ACM 11, 2 (Feb. 1968), 77-113. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Floyd, R. Assigning meanings to programs. Proc. Symposia in Applied Math., Vol. 19, AMS, Providence, R.I., 1967.Google ScholarGoogle ScholarCross RefCross Ref
  12. 12 Galler, B.A. The Language of Computers. McGraw-Hill, New York, 1962. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 Galler, B.A., and Perlis, A. A View of Programming Languages. Addison-Wesley, Menlo Park, Calif., 1970. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 Garvin, P.L., and Spolsky, B. Computation in Linguistics. Indiana U. Press, Bloomington, Indiana, 1966.Google ScholarGoogle Scholar
  15. 15 Glaser, E.L., Couleur, J.F., and Oliver, G.A. System design for a computer for time sharing application. Proc. AFn'S 1965 rJCC, Vol. 27, Pt. 1, Spartan Books, New York, pp. 197-202.Google ScholarGoogle Scholar
  16. 16 Gruenberger, F., and Jafray, G. Problems for Computer Solution. Wiley, New York, 1965.Google ScholarGoogle Scholar
  17. 17 Gruenberger, F. (Ed.) Computer Graphics:Utility/Production Art. Thompson Books, Washington, D.C., 1967.Google ScholarGoogle Scholar
  18. 18 Hamming, R.W. One man's view of computer science. 1968 ACM Turing Lecture; J. ACM, 16, 1, (Jan. 1969), 3-12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19 Harrison, M. Introduction to Switching and Automata Theory. McGraw-Hill, New York, 1965.Google ScholarGoogle Scholar
  20. 20 Hellerman, H. Digital Computer System Principles. McGraw- Hill, New York, 1967.Google ScholarGoogle Scholar
  21. 21 Hopcroft, J.E., and Ullman, J. Formal Languages and Their Relations to Automata. Addison-Wesley, Menlo Park, Calif., 1969. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22 Isaacson, E., and Keller, H.B. Analysis of Numerical Methods. Wiley, New York, 1966.Google ScholarGoogle Scholar
  23. 23 Kilmer, W.L., and Blum, J. Some mechanisms for a theory of the reticular formation. Final Rep., AFOSa 67-0928, AD651207, Feb. 1967.Google ScholarGoogle Scholar
  24. 24 Knuth, D.E. The Art of Computer Programming Fundamental Algorithms Vol. 1. Addison Wesley, Menlo Park, Calif., 1968. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. 25 Lavi, A., and Voge, E. (Eds.) Recent Advances in Optimization Techniques. Wiley, New York, 1966.Google ScholarGoogle Scholar
  26. 26 Lampson, B.W. Scheduling philosophy for multiprocessing systems. Comm. ACM 11, 5 (May 1968), 347-360. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 27 Lewis, P.M., and Coates, C.L. Threshold Logic. Wiley, New York, 1967.Google ScholarGoogle Scholar
  28. 28 The mathematical sciences: A report. Pub. 1681, Nat. Acad. of Sci., Washington, D.C., 1968, p. 94.Google ScholarGoogle Scholar
  29. 29 Mendel, J., and Fu, K. Adaptive Learning and Pattern Recognition Systems. Academic Press, New York, 1970.Google ScholarGoogle Scholar
  30. 30 McCarthy, J., and Hayes, P. Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence 4, Michie and Meltzer (Eds.), Edinburgh U. Press, Edinburgh, 1969.Google ScholarGoogle Scholar
  31. 31 McCarthy, J. A basis for a mathematical theory of computation. In Computer Programming and Formal Systems. Braffort and Hershberg (Eds.), North Holland Pub. Co., Amsterdam, 1963.Google ScholarGoogle Scholar
  32. 32 Minsky, M. Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs, N.J., 1967. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. 33 Minsky, M., and Papert, S. Perceptrons. MIT Press, Cambridge, Mass., 1969.Google ScholarGoogle Scholar
  34. 34 Newell, A. Heuristic programming: I11 structured problems. In Progress in Operations Research I11. J.S. Aronofsky (Ed.), Wiley, New York, 1969.Google ScholarGoogle Scholar
  35. 35 Newell, A., and Simon, H.A. Programs as theories of higher mental processes. In Computers in Biomedical Research, Vol. 2. Stacy and Waxman (Eds.), Academic Press, New York, 1965.Google ScholarGoogle Scholar
  36. 36 Nilsson, N. Problem Solving Methods in Artificial Intelligence. McGraw-Hill, New York (in press, spring 1971). Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. 37 Parnas, D.L., and Darringer, J.A., SODAS and a methodology for system design. Proc. AFIPS 1967 FJCC, Vol. 31, AFIPS Press, Montvale, N.J., pp. 449-474.Google ScholarGoogle Scholar
  38. 38 Salton, G. Automatic Information Organization and Retrieval. McGraw-Hill, New York, 1968. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. 39 Sammet, J.E. Programming Languages: History and Fundamentals. Prentice-Hall, Englewood Cliffs, N.J., 1969. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. 40 Sammet, J.E. Annotated descriptor-based bibliography on the use of computers for non-numerical mathematics. Comput. Rev. 7, 4 (July-Aug. 1966).Google ScholarGoogle Scholar
  41. 41 Simon, H. The Sciences of the Artificial. MIT Press, Cambridge, Mass., 1969. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. 42 Srinivasan, C.V. CDL1, a computer description language, Pt. 1: The nature of the description language and organization of descriptions. Proc. 3rd Ann. Princeton Conf. on Inf. and System Sci., Princeton U., Mar. 1969.Google ScholarGoogle Scholar
  43. 43 Tocher, K.D. The Art of Simulation. Van Nostrand, Princeton, N.J., 1963. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. 44 Van Wijngaarden (Ed.) Report on the algorithmic language Algol-68 Numerchische Mathematic 14, 1969. Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. 45 Wegner, P. Programming Languages, Information Structures, and Machine Organization. McGraw-Hill, New York, 1968. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. 46 Wirth, N. PL360, a programming language for the 360 computers. J. ACM 15, 1 (Jan. 1968), 37-74. Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. 47 Wood, P.E. Switching Theory. McGraw-Hill, New York, 1968.Google ScholarGoogle Scholar
  48. 48 Zurcher, F.W., and Randell, B. Iterative multilevel modeling: A methodology for computer system design. Proc. IFIP Cong. 1968, Vol. 2, North Holland Pub. Co., Amsterdam, pp. 867-871.Google ScholarGoogle Scholar

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 Communications of the ACM
    Communications of the ACM  Volume 14, Issue 6
    June 1971
    68 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/362604
    Issue’s Table of Contents

    Copyright © 1971 ACM

    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: 1 June 1971

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader