4 ms·

C exam aside, I don't think he would pass a regular Big G interview, unless he'd allocate some 6 months for preps which I doubt he did.

by zerr 8y ago

johannes1234321 8y ago
Considering that he is not one of the young hackers starting with JavaScript, but in a time were looking at raw memory dumps was normal operation and memory was sparsely available and CPUs were slow I assume he well knows about algorithms and data structures by heart. Most likely he implemented more binary trees in his live than I thought about and I assume he would consider a question about inverting a binary tree more of a joke than a serious question.
- acqq 8y ago
  > I assume he would consider a question about inverting a binary tree more of a joke If you refer to this: https://www.quora.com/When-do-you-need-to-invert-a-binary-tree https://www.quora.com/When-do-you-need-to-invert-a-binary-tr... I also don't know why would anybody ever need to implement "inverting" a binary tree except for the Google exam. > Most likely he implemented more binary trees in his live "Most likely"? Actually he "just" invented (not a complete list): - Unix (with Ritchie) (in assembly first) - the language B, based on which Ritchie developed C. - the notation for the regular expressions everybody uses today - the algorithm for fast regular expression handling - the chess computer that won the 3rd World Computer Chess Championship 1980
  - johannes1234321 8y ago
    > > Most likely he implemented more binary trees in his live > "Most likely"? Actually he "just" invented (not a complete list): Please mind the full quote of me "... than I thought of" -- I thought (and implemented) about trees quite a bit myself and grant him a few factors on top of that.
  - pjmlp 8y ago
    Agree with everything except for B. He implemented a BCPL dialect, which he called B, in fact if you compare B and BCPL programming manuals they are quite similar. https://www.bell-labs.com/usr/dmr/www/bcpl.html https://www.bell-labs.com/usr/dmr/www/bcpl.html https://www.talisman.org/b-manual.html https://www.talisman.org/b-manual.html
    - acqq 8y ago
      I don’t understand with which detail of my statements you don’t agree.
      - pjmlp 8y ago
        His B "invention" in reality was closer to copying and dropping a few features from BCPL than actually inventing something new.
        acqq 8y ago
        Well, it can be argued that most of the “structured” languages were “dropping something” from Algol. Or later from Ada... yes, nothing fundamentally original happens often. But people give the names to the languages they make... even “dropping” is something “creative” often worth naming. Apparently Unix kept only minimum of Multics. Sometimes exactly the “bigger” variants aren’t fit to survive.
jonex 8y ago
Someone who knows how to program and is at least superficially aware of different data structures and algorithms would not need six months of preparation to pass the interview. That's very exaggerated and it might discourage people who would enjoy working at Google from applying. I know I thought it would be a lot harder than it was. I spent some hours checking example interview questions, and it was definitely enough. If anything, I might have been too focused on thinking in terms of established algorithms, and too little focused on reasoning on my own.
- acqq 8y ago
  > That's very exaggerated and it might discourage people who would enjoy working at Google from applying. But it's irrelevant to what I wanted to point to: that somebody already accepted Ken Thompson to Google. Then some absurd bureaucracy decided that Ken Thompson has to pass the exams given to the young beginners. Probably reasoning something like somebody here "explained" "so that developers can be moved around." Whoever is not aware of these "details", please see my another post for what Ken Thompson invented before coming to Google. Such "minor things" like the Unix OS, the language that preceded and inspired C and the currently used kind of regular expressions.
DmitryOlshansky 8y ago
I came mostly unprepared, and passed just fine. In fact they extended it with 2 hours more “followup”. And I’m no superhuman. It may depend on the part of Google you apply to + it was compiler team and I love compilers ;)
- zerr 8y ago
  How one would apply to such a specific part of Google? e.g. Compilers team?

C exam aside, I don't think he would pass a regular Big G interview, unless he'd allocate some 6 months for preps which I doubt he did.

by zerr 8y ago

C exam aside, I don't think he would pass a regular Big G interview, unless he'd allocate some 6 months for preps which I doubt he did.

johannes1234321 8y ago

Considering that he is not one of the young hackers starting with JavaScript, but in a time were looking at raw memory dumps was normal operation and memory was sparsely available and CPUs were slow I assume he well knows about algorithms and data structures by heart. Most likely he implemented more binary trees in his live than I thought about and I assume he would consider a question about inverting a binary tree more of a joke than a serious question.

acqq 8y ago
> I assume he would consider a question about inverting a binary tree more of a joke If you refer to this: https://www.quora.com/When-do-you-need-to-invert-a-binary-tree https://www.quora.com/When-do-you-need-to-invert-a-binary-tr... I also don't know why would anybody ever need to implement "inverting" a binary tree except for the Google exam. > Most likely he implemented more binary trees in his live "Most likely"? Actually he "just" invented (not a complete list): - Unix (with Ritchie) (in assembly first) - the language B, based on which Ritchie developed C. - the notation for the regular expressions everybody uses today - the algorithm for fast regular expression handling - the chess computer that won the 3rd World Computer Chess Championship 1980
- johannes1234321 8y ago
  > > Most likely he implemented more binary trees in his live > "Most likely"? Actually he "just" invented (not a complete list): Please mind the full quote of me "... than I thought of" -- I thought (and implemented) about trees quite a bit myself and grant him a few factors on top of that.
- pjmlp 8y ago
  Agree with everything except for B. He implemented a BCPL dialect, which he called B, in fact if you compare B and BCPL programming manuals they are quite similar. https://www.bell-labs.com/usr/dmr/www/bcpl.html https://www.bell-labs.com/usr/dmr/www/bcpl.html https://www.talisman.org/b-manual.html https://www.talisman.org/b-manual.html
  - acqq 8y ago
    I don’t understand with which detail of my statements you don’t agree.
    - pjmlp 8y ago
      His B "invention" in reality was closer to copying and dropping a few features from BCPL than actually inventing something new.
      - acqq 8y ago
        Well, it can be argued that most of the “structured” languages were “dropping something” from Algol. Or later from Ada... yes, nothing fundamentally original happens often. But people give the names to the languages they make... even “dropping” is something “creative” often worth naming. Apparently Unix kept only minimum of Multics. Sometimes exactly the “bigger” variants aren’t fit to survive.

jonex 8y ago

Someone who knows how to program and is at least superficially aware of different data structures and algorithms would not need six months of preparation to pass the interview. That's very exaggerated and it might discourage people who would enjoy working at Google from applying. I know I thought it would be a lot harder than it was. I spent some hours checking example interview questions, and it was definitely enough. If anything, I might have been too focused on thinking in terms of established algorithms, and too little focused on reasoning on my own.

acqq 8y ago
> That's very exaggerated and it might discourage people who would enjoy working at Google from applying. But it's irrelevant to what I wanted to point to: that somebody already accepted Ken Thompson to Google. Then some absurd bureaucracy decided that Ken Thompson has to pass the exams given to the young beginners. Probably reasoning something like somebody here "explained" "so that developers can be moved around." Whoever is not aware of these "details", please see my another post for what Ken Thompson invented before coming to Google. Such "minor things" like the Unix OS, the language that preceded and inspired C and the currently used kind of regular expressions.

DmitryOlshansky 8y ago

I came mostly unprepared, and passed just fine. In fact they extended it with 2 hours more “followup”. And I’m no superhuman. It may depend on the part of Google you apply to + it was compiler team and I love compilers ;)

zerr 8y ago
How one would apply to such a specific part of Google? e.g. Compilers team?