This was an internal move.

There were two interviews.

For the first one, they said there would be algorithmic pseudocode or digital systems questions.

For the second, they promised a "thought question".

Given a binary matrix of size M*N, randomly populated with 1's and 0's, for every '1', fill its row and column with 1's. Solve in space complexity of O(1). Time complexity is not important.

Second interview question:

Given the following assembly commands:

• MOV Ri <-- Rj/immediate (put register j or immediate value into reg i)
• INC Ri (increment Ri by 1)
• DEC Ri (decrement Ri by 1)
• JNZ Ri (jump if Ri is not zero)

1. Code an assembly program that calculates x*y, where x and y are unsigned integers.
2. What values of x and y will cause the program to fail?
3. Modify the program to deal with these values.
4. What result will we get if we run the program with values from question 2 and no modification from question 3?
5. Is it possible to answer question 1 without the MOV command? Prove it!