Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Affective objectives in a programming languages course
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Computer algebra systems in discrete mathematics
Journal of Computing Sciences in Colleges
Hi-index | 0.01 |
Three examples using mixed language programming in Maple and C are provided for the express purpose of highlighting, in a practical way, various issues normally discussed in a traditional programming languages class only as theoretical concepts. The three examples highlight concepts in parameter passing techniques, storage order choices, native machine types and sizes, and the handling of single and multi-dimensional arrays when dealing with legacy code.