Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^4: Estimating Task Complexity VS Loudmouth

by bibliophile (Parson)
on Nov 23, 2004 at 18:59 UTC ( #409962=note: print w/ replies, xml ) Need Help??


in reply to Re^3: Estimating Task Complexity VS Loudmouth
in thread Estimating Task Complexity VS Loudmouth

Ah, I see. I wholeheartedly agree - and I'll try that tactic on my next project :-)

(My biggest problem seems to be convincing the Powers-That-Be that my learning how to do something needs to be part of the timeline.... folks seem to think that because you are a "computer guy", anything computer-related must be already-internalized knowledge. Sigh.)


Comment on Re^4: Estimating Task Complexity VS Loudmouth

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (6)
As of 2015-07-03 21:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (56 votes), past polls