Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^2: J.L. Ford's "Challenges"

by irvson (Sexton)
on Dec 22, 2009 at 01:02 UTC ( [id://813780]=note: print w/replies, xml ) Need Help??


in reply to Re: J.L. Ford's "Challenges"
in thread J.L. Ford's "Challenges"

Before I posed the question here, I did the Google thing and, of course, got the same results you did. And I agree that challenges can be an important part of the learning process. What has always given me the greatest satisfaction in programming has been solving problems. But some of Ford's challenges appear to be unreasonable. One example: One script calls for input that should be a number. The challenge is to evaluate input to make sure that it is a number. My Net searches turned up a code block that does the job, but the code is a regular expression -- something that the book doesn't cover for a couple of chapters further on. (If there is a different way to check input for numerical data, I'd be happy to try it.)

Replies are listed 'Best First'.
Re^3: J.L. Ford's "Challenges"
by Anonymous Monk on Dec 22, 2009 at 07:07 UTC

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://813780]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others chanting in the Monastery: (4)
As of 2024-04-23 11:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found