The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Properties of Programs and the First-Order Predicate Calculus
Journal of the ACM (JACM)
An Assessment of Techniques for Proving Program Correctness
ACM Computing Surveys (CSUR)
Communications of the ACM
Certification of algorithm 245 [M1]:treesort 3:proof of algorithms—a new kind of certification
Communications of the ACM
Program development by stepwise refinement
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
The current state of proving programs correct
ACM '72 Proceedings of the ACM annual conference - Volume 1
The calculation of multivariate polynomial resultants
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Inductive methods for proving properties of programs
Proceedings of ACM conference on Proving assertions about programs
The correctness of numerical algorithms
Proceedings of ACM conference on Proving assertions about programs
The definition and validation of the radix sorting technique
Proceedings of ACM conference on Proving assertions about programs
A survey of the literature in computer science education since curriculum '68
Communications of the ACM
Another look at the discrete structures course
SIGCSE '76 Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education
The why and how of discrete structures
SIGCSE '76 Proceedings of the sixth SIGCSE technical symposium on Computer science education
A discrete structures course for a small college
SIGCSE '75 Proceedings of the fifth SIGCSE technical symposium on Computer science education
| Hi-index | 0.02 |
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.