Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.javascript > #31314
| From | Scott Sauyet <scott@sauyet.com> |
|---|---|
| Newsgroups | comp.lang.javascript |
| Subject | Re: How would you prepare for javascripting interview? |
| Date | 2016-09-11 02:45 +0000 |
| Organization | A noiseless patient Spider |
| Message-ID | <nr2gg3$esh$2@dont-email.me> (permalink) |
| References | (10 earlier) <nqmpag$kit$1@dont-email.me> <nqo0jf$a4v$2@dont-email.me> <nqpr7i$l7t$1@dont-email.me> <nqvqac$64e$1@dont-email.me> <nr1k0b$d4t$1@dont-email.me> |
Doc O'Leary wrote:
> Scott Sauyet wrote:
>> So if we're going to write functions to be used in a mathematical
>> context, we should write functions that are mathematically lucid.
>
> Except computers *aren’t* only used in a mathematical context. Even
> things in Math are called to do work with *meaning*, not demonstrate
> some abstract mathematical laws.
These abstract mathematical laws you're talking about are what *define*
the meaning in mathematics. What would you think of a version of
`Sting.prototype.toUpperCase` which upper-cased all the characters,
except that it skipped every 37th one? It would be well-defined by
these rules, but it's totally non-sensical in a general-purpose utility.
That's because the most obvious rule for `toUpperCase` is that it
returns a String with characters all in upper-case. The sorts of laws
I'm talking about are what define mathematical operations.
> That’s why it does indeed qualify
> as a trick question to compare the results of min/max without
> arguments.
Again, I introduce this with the words "trick question", mostly to put
candidates in the right frame of mind. But I do think it is a very
useful part of a discussion with certain interviewees; Those who can
figure out why this happens with little or no guidance have notably
different skills than those who never really figure any of it out on
their own.
>> Mathematical laws like the one above make it *easier* to write useful
>> code. Imagine you have a list of temperatures with timestamps and
have
>> to display the highs for each month and for the year. You partition
the
>> readings by month, pluck the temperatures for each, find the maxima,
and
>> then you can simply take the maximum of that list to to find the
annual
>> high. It's more efficient, and it's even possible that the part of
the
>> system that takes the annual maximum only knows these monthly maxima,
not
>> the raw data.
>
> The mistake you make is in thinking everything is just about that one
> calculation, and that there are no possible errors in the process.
> What if instead your wonderful system had a sensor that broke down
> one day? Now you have empty set that returns -Infinity as the
> maximum temperature! And what if the calculation of interest in
> aggregate is instead the *average* maximum temperature for the time
> period that now contains that fabricated -Infinity?
Funny, I was pointing out how beneficial it was that we had such a
useful -Infinity.
If you're worried about the average, then you'd better do some other
error checking regardless: I don't think there's really too much to
choose from between `-Infinity / 0` and `null / 0`.
>> What makes this possible? The law above.
>
> And a lot of incompetent programming.
In one school of programming, there are a million ways things can go
wrong, because all of your functions have weird edge cases that you have
to handle. To work in such an environment, one needs to add error-
checking everywhere. In this world it's considered competence to
thoroughly cover these cases.
In another one, one writes functions that have consistent behavior,
where they take specific types of input and return a given type of
output. They avoid such things as null returns. To work in such an
environment, one needs to ensure that one's functions are clear and
consistent. In this world, it's considered competence to create
simple and elegant code.
The former seems to be the world you're describing. I worked in Java
for enough years that I remember that world. But as I moved into
functional languages, I also moved more into a world where that sort
of error-checking became unnecessary. I certainly don't miss it.
>> If instead, you were to return `null` on an empty list, what happens
when
>> it turns out that the sensor was down for all of April and no data was
>> recorded?
>
> This depends entirely on how you intend to handle a data set that has
> missing values. Just as it is possible to have max() return NaN for
> non-numeric input, it’s also possible to program it to *ignore*
> non-numeric input. I mean, really, what does your wonderful
> mathematical law say about any of that?
Right, but the question was not about non-numeric input but about an
empty list of input, where you seemed to be claiming that any numeric
value is illegitimate, leaving only something such as `null`/`undefined`
or an exception. Or do you have a different solution?
>> April's value is now `null`, and the annual value is `null` or
>> `NaN` or whatever you choose to return in this case. If you choose to
>> throw, it's even worse. You're trying to get an annual value, from
data
>> which is perfectly legitimate, but you're implementation is causing
you
>> to throw an exception.
>
> You haven’t even begun to define what is “legitimate” for mathematical
> functions that aren’t operating on mathematical elements. Depending
> on the program, it may very well be the correct thing to raise an
> exception on the whole thing, or it might be fine to just discard any
> values that are out of an acceptable range.
I object to raising an exception, as I don't think it's exceptional that
a list might be empty. But of course one might discard unacceptable
values. I would expect that to happen first and not affect the rest of
the problem at all.
> I mean, after all, it’s quite possible for a sensor to return not
> only an empty value, but wildly high and low values as well. I
> certainly know *I* have dealt with things like real-time GPS data
> that falsely indicated I was momentarily *thousands* of miles away
> from my actual position. Your desire for mathematical purity is out
> the window the instant you have to put error bars on your data.
No, it's just part of the process: simply filter the data appropriately.
This has nothing to do with the question, though.
>>> It is *wrong* to return a result *as if*
>>> useful work was done when it is highly likely such a result is not
only
>>> in error, but will likely propagate that error.
>>
>> How would you define the maximum function? I would choose this: "max
>> returns the smallest value that is no smaller than any element in the
>> list." That seems succinct, clear and covers all cases (for Numbers,
at
>> least.) ISTM that this works for lists of any size, including empty
ones.
>
> No, that *doesn’t* cover the empty set. You can’t talk about something
> like relative smallness when there are no comparisons to be made!
There have been several references already in this thread to the Wikipedia
article on Vacuous Truths [1]. *Please* try to read and understand it
before writing nonsense like this again!
> It only makes sense for numbers (for now, so as long as you neglect
that
> there are different sizes of infinity) because you have a pre-defined
> range.
Yes, it only makes sense for numbers. I've been at pains to make that
obvious. But the comment on multiple sizes of Infinity is a non sequitur.
Yes, there are multiple sizes of infinity, thank you Mr. Cantor, but
Javascript's floating point numbers implement the IEEE 754 specification
which have special values of a positive and a negative infinity, and no
other infinite options. (`NaN` is a more complex story.) When speaking
in
Javascript, -Infinity is a very specific value, which happens to compare
as less than any other numeric value (except `NaN`.)
> For other data types, that’s not always the case. And the root
> of my argument is *still* that it is wrong to return a value in the
> range of valid input values if that value was not *actually* one of the
> input values.
Again, can you define (or, even better, implement) the function you
think is appropriate?
You see, I disagre with your contention here. I think of `max` in the
same way I think of `sum`, `all`, etc., as a way to *combine* values,
and not as a way to *select* a value. And again, my definition works
with this notion. And there are many obvious ways to implement it.
Thomas Lahn and others have already done so in this thread, and it's
trivial to do so with a fold.
Is there some clear way to express your suggestion in code?
> [ ... ]
>>> Internally, yes, they are useful in the way that many other hacks are
>>> useful. But it is not the sign of a competent developer to architect
a
>>> library that *always* returns valid results like that.
>>
>> Sure, let's all sporadically returns some invalid results. We like to
>> keep our users on their toes, right? WTF?
>
> I’m arguing exactly the opposite, and I think you know that. Being
> intellectually dishonest is not the way to make your case.
Perhaps you miswrote, or perhaps I'm misreading. But looking it over
again, you still seem to me to be saying that a competent developer
would not architect a library to always return valid results. Did you
mean something different? Do you see from the paragraph above why I
interpret it that way?
>> In other words, I've been around. And yet, you seem to feel that you
>> know my skill level based on a disagreement about one function, one
which
>> a number of other smart people on this thread are suggesting similar
>> things as me. That makes me wonder if you're just trolling, or if you
>> simply don't understand software design very well.
>
> The more you keep trying to make an appeal to authority, the more you
> undermine any authority you attempt to claim.
Ok, some basic logical reasoning here. First of all, there is no appeal
to authority (_argumentum ab auctoritate_). Even a case for _argumentum
ad
populum_ would be extremely weak. I did not try to claim that the support
of those other people made my claim true; instead I noted how strange it
was for you to try to judge my skills based on your disagreement with me
on one topic that you disagree with all these other people on as well.
Second of all, "the more you keep trying to"? On what basis do you use
this phrase? Where else in our discussion have I cited the opinions of
others in this thread?
> Same goes for calling people “smart” just because they agree with you.
I've been involved in comp.lang.javascript for about seven years. Among
the people who've posted in this part of the discussion are Stefan Ram,
Thomas Lahn, John Harris, Andreas Bergmaier, Ben Bacarisse, and Michael
Haufe, all of whom have been around that whole time, and Ken Tilton and
Gene Wirchenko who are somewhat newer. All of these people have shown
themselves over the years to be competent and intellegent in
conversation. (That doesn't mean I like them all, BTW!) I have no clue
about you. I'm not calling them smart because they agree with me.
Thomas Lahn and I rarely ever agree. But I don't doubt his intelligence.
> You’re all wrong from a CS perspective,
You see, I find you all wrong, also from a CS perspective. Do you happen
to work mostly in languages like Java or C#, by any chance? Perhaps
you've simply not had a chance to work in an environment/language that
affords you the opportunity to write really nice code without reams of
boilerplate error-checking.
> and it just makes me think any code you’ve written is a nightmare to
> actually use.
If you have a little time, do look into Ramda, and tell me if it lives
down to these expectations of yours? Most of the complaints are that
it's too strict, not that it's too loose, so I'm curious as to how
you see it.
> You’d do yourself and everyone
> else a big favor if you could just admit to architectural mistakes like
> this, and work to *fix* the problems rather than puffing your chest
> out in interviews by way of silly trick questions.
What problem are you suggesting I fix? Do you want me to fix the
specification for `Math.max`/`Math.min`? While every now and then I
participate in es-discuss, I'm not part of TC39, nor do I have any
interest in becoming part of it.
And where in the world do you get the idea that I'm puffing out my
chest with this question? This is nothing like a "gotcha" question.
It is a guided (as much as necessary) through a somewhat surprising
result to see how the candidate thinks her way to an understanding
of the function.
But I'll tell you what. If you can offer me a question or series of
questions that will give me the same sort of insight into the
candidates, I will replace this one from my routine. Remember
that what I want to know is *how* and *how well* she reasons about
such behavior,
>>> It seems I do know better, though. And, worse, I happen to know from
>>> *experience* that your approach of just letting everyone do what they
>>> want willy-nilly results in exactly what I said: an utter mess.
>>
>> Are you going to even let them determine how to order their elements?
Or
>> do you think you know better than them about that too?
>
> Maybe I do. It depends on the system I’m architecting. For example,
> I have some concurrent code that implicitly orders operations to
> insure an object’s consistency. The last thing I want is someone
> thinking they can get the length of an array *before* all the objects
> have been added to it!
I said "order", not "sort". "order"ing generally is used to represent an
operation on two elements on your type that reports if one of them is less
than the other. There are many ways to do this. Haskell [2] extends the
`Eq` type (which has just a boolean `eq` function) with a `<=` operator
(or equivalently a `compare` function) that returns true in the case that
the first operand is less than or equal to the second.
My question was rhetorical. I was poking at you. Of course you have
to let those defining a type determine how to order their elements, or
even decide if they can be ordered.
>> You seem to be saying that this is perfectly reasonable:
>>
>> Ord a :: {
>> lt :: (a, a) -> Bool,
>> eq :: (a, a) -> Bool
>> }
>>
>> But one that offers additional optional elements of `bottom :: a` and
>> `top :: a` is ridiculous. I simply don't see why.
>
> You haven’t defined what any of those operations *actually* mean, so
> I can’t comment on any of it, and it is presumptuous of you claim I
> would say anything about it. Ask a question of me if you have one;
> don’t just create straw men.
This is simply a translation of the discussion so far into pseudo-code.
You were the one who called me out for the suggestion that generic max/
min
functions might offer the user the ability to decide whether to return a
default smallest or largest value in response to an empty list. The
plain `Ord` above would give you the ability to create an ordering in a
manner somewhat similar to the Haskell description. By adding `bottom`
and `top` values, you create defaults for empty lists. Without them
presumably such generic functions would throw, return semaphores.
Here would be a reasonable version for Number:
ordered(Number, {
lt: (a, b) => a < b,
eq: (a, b) => a == b,
bottom: -Infinity,
top: Infinity
});
>> [ ... ]
>> -Infinity is a number.
>
> Exactly the point I’m making. It’s a number that didn’t exist in
> the input set, but it is being returned in the output set. As a
> result, it makes any operations that follow it which *do not* have
> -Infinity as the identity element *completely unreliable*.
What part of "This is a function for `Math.max`" don't you understand?
> [ ... psychology elided ...]
> So, no, I’m not really sure *what* you’re really trying to get at when
> you present a trick question. Do you just want me to agree that it is
> the correct result? Do you want me to agree that code *you* write
> should also be given a pass when it fails to give expected results for
> a < operation? Do you want me to come up with an implementation that
> gives a better result? Do you expect me to not see the bear that is
> walking through the room?
No, I'd really like you to try to answer the question.
>> Because, believe
>> me, while I might find that discussion interesting, I would also
notice
>> that you don't seem able to work on the problem assigned.
>
> So stop with the pretense you’re looking for skilled developers. You
> really want people who agree with you, don’t think too much, keep
> their heads down, and just code what you tell them to code. No doubt
> that has allowed you to surround yourself by people who make you feel
> good about yourself, but you do both yourself and the company you
> work for a *huge* disservice by not willing to be challenged when
> you’re wrong.
And you accuse me of straw men?!!
Where do you get this bullshit? I do not ask candidates to justify (or
to denigrate) the design of these functions. I just ask if they can try
to imagine why it works as it does. And I guide them as much as they
need so that they never walk away from this discussion without an
answer.
>> It's come up on this thread, and I work with a number of functional
>> programmers for whom this is totally natural... for numbers. You're
>> trying to abstract in a way that I find interesting, but not relevant
to
>> a discussion of the function `Math.max`.
>
> I argue it *is* relevant because the identity element is only
> meaningful on a per-function basis. Even if you stick to
> mathematical functions, it is wrong to treat it as a useful value
> in future calculations.
Once again, you're full of _non sequiturs_. Why in the world would you
think otherwise? Would you expect the same identity value for `all` as
for `product` as for `max` as for `sum`? That's absurd! But why does
the fact that they're different make them less useful? You said earlier
that your math is fine, but I'm really starting to doubt it.
>>> That’s just it: for an empty list, abstractly, there is no “type” of
the
>>> nothing it contains. The behavior you choose has to be consistent
with
>>> all kinds of objects. So, sure, it might make the most sense to raise
>>> an exception, even for functions like sum() that might otherwise
>>> commonly return a 0 value for numbers.
>>
>> That is only a concern if you are writing a generic `max` function.
I'd
>> actually be curious to see one you wrote. The more I think about it,
the
>> less trivial it seems.
>
> Welcome to computer science. It’s a shame you’ve done so much work
> in the field before realizing that not everything is simple numbers,
> and that complex things are not easy to do.
Again, I urge you to look at Ramda: Many functions on lists, on
objects, on functions. Fewer on strings and still fewer on numbers, but
then others that work on generic Functors, Monoids, Applicatives,
Monads, etc. But the goal is to keep the API simple, even when our
underlying implementation is not.
Most of my day job involves working with custom objects. Working with
math is mostly hobby-time coding. So no, I don't think everything should
look like math.
But that doesn't mean that I think everything should work immediately
with the first abstaction that leaps to mind.
>> It sounds like a big job. Do you already have an implementation at
>> hand? If not, do you think this is a simple task?
>
> Yeah, I do. But so do *many* existing programming languages. It all
> starts with getting your head out of the mathematical clouds. Until
> you’re willing to do that, and actually talk about the useful work
> that these functions are intended to do, the details don’t matter.
I've been asking what your generic solution is. I'm interested in seeing
if it seems reasonable for the sorts of situations I find myself in, if
it seems robust, it it does what you're claiming it does.
I can implement this in just a few lines of Haskell, but to do it
reasonably in Javascript you're going to have to create a type system.
That's a substantial job, and seems quite the overkill just to abstract
`max` and `min` functions. So I'm curious to see if you have found some
short-cuts to avoid all the problems inherent in developing a type
system for a dynamic language.
Is your solution something your able and willing to share?
>> If you cannot discover how something works, I don't want you on my
team.
>> Even if you could design something better from scratch, you're no good
to
>> me if you can't go in and understand what others have done in the
system.
>
> As I have said, understanding bad code is trivial.
Can you say that again?
With a straight face?
Have you ever worked on a complex system that includes bad code? Was it
all trivial to understand? (If the answer to the second question was
"yes", please reread the first one again!)
> You’re not doing a very good job of filtering candidates if you
> simply are looking for them to determine *how* something got done
> badly.
Did I ever say that this was *all* I looked for from candidates?
Did I ever imply it?
Did I ever make the suggestion that this was anything more than four
to six minutes of a 60 - 90 minute interview?
Did I not note that this was only used for candidates who's already
impressed me a bit, as a way to learn more about the better ones?
> The biggest flaw
> you have is that it does seems that that *is* all you really want
> though, and you count it against a person if they actually want to
> write better software.
Wow -- Are you going to hang your shingle out with Lucy Van Pelt?
> I mean, I certainly *could* “discover” how
> to do all sorts of *awful* things in this world, but if that’s the
> kind of team you’re really looking to put together, then I don’t
> want to be on it.
Well, remember that I happen to believe this is the absolutely correct
behavior for `Math.max`, So I don't share your sentiment at all. But
none of that is really all that important in a discussion about how to
interpret the actions of an existing function.
>> That doesn't mean that I don't want to know about how much better you
can
>> do. But if you can't understand existing code, I probably won't trust
>> your designs anyway, because I have no idea if you really understand
the
>> requirements and the constraints.
>
> But I have no idea whether or not *you* understand them. I’ve seen
> a lot of effort wasted because clients keep insisting on getting what
> they *want* rather than taking a step back and thinking about what
> they really *need*. The more you try to make it about “existing
> code”, the less I think you’re interested in actually solving the
> problem the code was written for in the first place.
Have you ever performed interviews?
[1]: <https://en.wikipedia.org/wiki/Vacuous_truth>
[2]: <https://hackage.haskell.org/package/base-4.9.0.0/docs/Data-
Ord.html>
-- Scott
Back to comp.lang.javascript | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
How would you prepare for javascripting interview? justaguy <lichunshen84@gmail.com> - 2016-07-18 09:10 -0700
Re: How would you prepare for javascripting interview? Hans-Georg Michna <hans-georgNoEmailPlease@michna.com> - 2016-07-18 18:37 +0200
Re: How would you prepare for javascripting interview? justaguy <lichunshen84@gmail.com> - 2016-07-18 11:09 -0700
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-07-21 01:04 +0000
Re: How would you prepare for javascripting interview? John Harris <niam@jghnorth.org.uk.invalid> - 2016-07-21 14:24 +0100
Re: How would you prepare for javascripting interview? Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2016-07-23 16:25 +0200
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-07-23 15:56 +0000
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-03 19:39 +0000
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-04 15:56 +0000
Re: How would you prepare for javascripting interview? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-09-05 00:06 +0100
Re: How would you prepare for javascripting interview? John Harris <niam@jghnorth.org.uk.invalid> - 2016-09-05 14:49 +0100
Re: How would you prepare for javascripting interview? $Bill <news@todbe.com> - 2016-09-05 10:01 -0700
Re: How would you prepare for javascripting interview? Gene Wirchenko <genew@telus.net> - 2016-09-06 09:36 -0700
Re: How would you prepare for javascripting interview? John Harris <niam@jghnorth.org.uk.invalid> - 2016-09-05 15:05 +0100
Re: How would you prepare for javascripting interview? Andreas Bergmaier <andber93@web.de> - 2016-09-05 20:31 +0200
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-06 15:15 +0000
Re: How would you prepare for javascripting interview? Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2016-09-06 19:40 +0200
Re: How would you prepare for javascripting interview? John Harris <niam@jghnorth.org.uk.invalid> - 2016-09-06 19:25 +0100
Re: How would you prepare for javascripting interview? Andreas Bergmaier <andber93@web.de> - 2016-09-06 22:16 +0200
Re: How would you prepare for javascripting interview? John Harris <niam@jghnorth.org.uk.invalid> - 2016-09-07 17:17 +0100
Re: How would you prepare for javascripting interview? Andreas Bergmaier <andber93@web.de> - 2016-09-07 20:07 +0200
Re: How would you prepare for javascripting interview? John Harris <niam@jghnorth.org.uk.invalid> - 2016-09-08 14:36 +0100
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-05 18:46 +0000
Re: How would you prepare for javascripting interview? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-09-05 20:32 +0100
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-05 17:27 +0000
Re: How would you prepare for javascripting interview? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-09-05 20:12 +0100
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-06 16:48 +0000
Re: How would you prepare for javascripting interview? Andreas Bergmaier <andber93@web.de> - 2016-09-06 19:56 +0200
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-07 20:16 +0000
Re: How would you prepare for javascripting interview? Gene Wirchenko <genew@telus.net> - 2016-09-07 10:01 -0700
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-07 20:21 +0000
Re: How would you prepare for javascripting interview? Gene Wirchenko <genew@telus.net> - 2016-09-09 11:41 -0700
Re: How would you prepare for javascripting interview? "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2016-09-09 15:35 -0700
Re: How would you prepare for javascripting interview? "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2016-09-09 20:40 -0700
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-10 15:12 +0000
Re: How would you prepare for javascripting interview? Gene Wirchenko <genew@telus.net> - 2016-09-12 11:14 -0700
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-13 21:07 +0000
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-06 16:20 +0000
Re: How would you prepare for javascripting interview? Ken Tilton <kentilton@gmail.com> - 2016-09-05 11:37 -0700
Re: How would you prepare for javascripting interview? Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2016-09-06 19:26 +0200
Re: How would you prepare for javascripting interview? "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2016-09-08 12:41 -0700
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-05 20:37 +0000
Re: How would you prepare for javascripting interview? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-09-05 22:13 +0100
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-06 02:33 +0000
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-06 16:02 +0000
Re: How would you prepare for javascripting interview? Gene Wirchenko <genew@telus.net> - 2016-09-06 09:50 -0700
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-07 01:36 +0000
Re: How would you prepare for javascripting interview? Gene Wirchenko <genew@telus.net> - 2016-09-07 10:07 -0700
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-10 00:03 +0000
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-10 00:12 +0000
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-10 15:34 +0000
Re: How would you prepare for javascripting interview? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-09-11 01:32 +0100
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-12 19:26 +0000
Re: How would you prepare for javascripting interview? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-09-13 01:02 +0100
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-13 21:38 +0000
Re: How would you prepare for javascripting interview? "Christoph M. Becker" <cmbecker69@arcor.de> - 2016-09-14 00:56 +0200
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-15 15:09 +0000
Re: How would you prepare for javascripting interview? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-09-14 00:47 +0100
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-15 15:34 +0000
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-11 02:45 +0000
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-12 19:10 +0000
Re: How would you prepare for javascripting interview? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-09-12 21:06 +0100
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-07 03:12 +0000
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-07 19:53 +0000
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-10 02:14 +0000
Re: How would you prepare for javascripting interview? John Harris <niam@jghnorth.org.uk.invalid> - 2016-09-10 11:25 +0100
Re: How would you prepare for javascripting interview? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-09-10 15:49 +0100
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-10 18:39 +0000
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-11 02:45 +0000
Re: How would you prepare for javascripting interview? John Harris <niam@jghnorth.org.uk.invalid> - 2016-09-11 16:23 +0100
Re: How would you prepare for javascripting interview? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-09-12 20:32 +0100
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-12 18:49 +0000
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-13 00:27 +0000
Re: How would you prepare for javascripting interview? Tim Streater <timstreater@greenbee.net> - 2016-09-13 08:51 +0100
Re: How would you prepare for javascripting interview? Jon Ribbens <jon+usenet@unequivocal.eu> - 2016-09-13 12:33 +0000
Re: How would you prepare for javascripting interview? Scott Sauyet <scott@sauyet.com> - 2016-09-14 01:17 +0000
Re: How would you prepare for javascripting interview? Tim Streater <timstreater@greenbee.net> - 2016-09-14 11:15 +0100
Re: How would you prepare for javascripting interview? Doc O'Leary <droleary@2015usenet1.subsume.com> - 2016-09-15 15:02 +0000
Re: How would you prepare for javascripting interview? John Harris <niam@jghnorth.org.uk.invalid> - 2016-09-13 10:06 +0100
Re: How would you prepare for javascripting interview? John Harris <niam@jghnorth.org.uk.invalid> - 2016-09-06 19:53 +0100
Re: How would you prepare for javascripting interview? Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2016-07-18 22:30 +0200
Re: How would you prepare for javascripting interview? justaguy <lichunshen84@gmail.com> - 2016-07-18 14:56 -0700
Re: How would you prepare for javascripting interview? Joao Rodrigues <groups_jr-1@yahoo.com.br> - 2016-07-19 16:01 -0300
Re: How would you prepare for javascripting interview? Joao Rodrigues <groups_jr-1@yahoo.com.br> - 2016-07-19 16:16 -0300
csiph-web