MICROSOFT PLACEMENT PAPER (TECHNICAL) 1. In a X’s and 0′s game (i.e. TIC TAC TOE) if you write a program for this give a fast way to generate the moves by the computer. I mean this should be the fastest way possible. ANS:- The answer is that you need to store all possible configurations of [...]
MICROSOFT PLACEMENT PAPER (TECHNICAL) 1. In a X’s and 0′s game (i.e. TIC TAC TOE) if you write a program for this give a fast way to generate the moves by the computer. I mean this should be the fastest way possible. ANS:- The answer is that you need to store all possible configurations of [...]
MICROSOFT PLACEMENT PAPER (TECHNICAL-C, OS) 1. An array of size k contains integers between 1 and n. You are given an additional scratch array of size n. Compress the original array by removing duplicates in it. What if k << n? ANS. Can be done in O(k) time i.e. without initializing the auxiliary array! 2. [...]
