Recent content by Monte_Carlo

  1. M

    Random sequence - full alphabet run length

    Let me know if I am in the wrong place Just want to make sure this forum is appropriate for the question above - I've seen some people have looked at the problem but so far I garnered zero responses. This is not a homework problem. Again, basically, given finite alphabet and a finite...
  2. M

    Random sequence - full alphabet run length

    Hi, Suppose we're looking at a random sequence of digits from 0 to 9. We start off reading the digits until every digit from 0 to 9 has been seen at least once and we mark the count of digits read up to that point (run length). We then reset the run length and continue until the whole random...
  3. M

    Hard Interview Problems

    Specific Examples Bill, just want to make sure we're on the same page here. I've read two books by Poundstone - one on Microsoft interviews and the other one about Google + some others. Those described some very specific questions which had right answers to them and presumably were asked on...
  4. M

    Hard Interview Problems

    Specific Questions Bhobba, Could you provide specific examples? I love to hear actual programming interview questions which make you think intensely. If you could recall a few, that would be nice. Also, if you could recall how much time was given to a candidate, that would be awesome...
  5. M

    Hard Interview Problems

    Concrete Interview Questions Wolfmax, looks good, what are the answers to 2 and 3? I would appreciate more visitors posting similar questions - I know I should ideally consult literature but it's of no use, I better hear it straight from the source.
  6. M

    Hard Interview Problems

    Questions/Problems Can you mention some specific questions/problems/puzzles to get a feel for difficulty levels? Anything concrete would do.
  7. M

    Hard Interview Problems

    Over the years I've heard gruesome stories about engineering/science/tech interviews - questions that they expect you to get on the spot (or nearly so) but which would require me to spend a good day thinking. I've already read Poundstone's books but I have to say there are very few good ones...
  8. M

    Random Sampling: Set Inclusion

    Could you check your logic with the actual computation? I know the answer is correct, but I'm not quite sure it follows from your calculation.
  9. M

    TAOCP Exercise 5.1.1-6

    Hi, Knuth's TAOCP exercise 5.1.1-6 asks to construct an n-log-n algorithm which would generate an inversion table corresponding to a particular permutation. My algorithm constructs inversion table for a random permutation of 1..N numbers (Knuth, Volume 3, exercise 5.1.1-6) using binary...
  10. M

    Boring IT job is there something more? Am I in the wrong place?

    You seem to be so determined with engineering. What about outsourcing and offshoring? This happens a lot lately and I wonder how do you feel about that? How many of your colleagues at the place of internship actually speak about their jobs going overseas? What about the professors at your...
  11. M

    Memory Investigation

    Hi guys, I've been given the code below and asked to explain the data shown in the attached chart. Any ideas? The data shows periodicity, what could explain it? I know it has to do with memory. ------------------------------------------------------- #include <iostream> #include...
  12. M

    Sorting Algorithm Performance - Interview-Based Problem

    rcgldr great work! I'm learning a lot from you - the high performance timer I've never heard of! Looks very advanced. And yes, the comparison routine does look broken, I'll ask professor next time if he has tempered with it. I just looked at s0.cpp and it seems like you've changed the...
  13. M

    Sorting Algorithm Performance - Interview-Based Problem

    Yes, I understand your analysis and that's what the instructor was talking about as well - for you to gain confidence in the nature of the underlying algorithm, you have to look at the data. The data in the beginning (points 1 to 82) clearly suggest a quadratic shape, which (if I understand this...
  14. M

    Sorting Algorithm Performance - Interview-Based Problem

    This is great, but I guess the interviewer wouldn't have been impressed. If I got this right, there is something in the data that's supposed to reveal this dependency. Maybe try to fit parabola with n = 3? That one has nice pearson to it, and may be does suggest an additional quadratic...
Top