Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Two programming problems

Two programming problems -28 - technical contributions TWO PROGRAMMING PROBLEM S Paul W . Abraham s New York Universit y The following two programming problems are interesting tes t cases for program development methods, program verifiers, an d similar applications . I have used them as homework problems i n middle-level undergraduate computer science courses . In bot h problems, the challenge lies in finding an elegant way of copin g with the large number of special cases . 1. The Radix Problem In this problem you are to convert numbers given in an arbitrar y radix notation (less than 37) to the value that they represent . Numbers will appear in the for m dkdk-1 . . . d0 (r ) where r is the radix and the d . are base r digits . A radix poin t may or may not appear ; if it does appear, It may appear in fron t of, behind, or within the sequence of digits . The letters of th e alphabet are used to represent digits greater than 9 . A plus o r minus sign may precede a number . The value is given by the formul a value = http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGPLAN Notices Association for Computing Machinery

Two programming problems

Abrahams, Paul W.
ACM SIGPLAN Notices , Volume 13 (9) – Sep 1, 1978
Download PDF
2 pages

Loading next page...
 
/lp/association-for-computing-machinery/two-programming-problems-5C0Eu8ln4Y

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1978 by ACM Inc.
ISSN
0362-1340
DOI
10.1145/987649.987651
Publisher site
See Article on Publisher Site

Abstract

-28 - technical contributions TWO PROGRAMMING PROBLEM S Paul W . Abraham s New York Universit y The following two programming problems are interesting tes t cases for program development methods, program verifiers, an d similar applications . I have used them as homework problems i n middle-level undergraduate computer science courses . In bot h problems, the challenge lies in finding an elegant way of copin g with the large number of special cases . 1. The Radix Problem In this problem you are to convert numbers given in an arbitrar y radix notation (less than 37) to the value that they represent . Numbers will appear in the for m dkdk-1 . . . d0 (r ) where r is the radix and the d . are base r digits . A radix poin t may or may not appear ; if it does appear, It may appear in fron t of, behind, or within the sequence of digits . The letters of th e alphabet are used to represent digits greater than 9 . A plus o r minus sign may precede a number . The value is given by the formul a value =

Journal

ACM SIGPLAN Notices – Association for Computing Machinery

Published: Sep 1, 1978

There are no references for this article.