Skip to main content

A programming puzzle

I'd like to share a programming puzzle that I've encountered recently. The requirement was interesting and I was thinking over it. Finally, I got a way to deal with these non-conventional requirements.
The requirement is something like below:

1. I need a program, which will launch another program from the command line (I mean Windows command line). I know this is not a big deal. But this requirement has two parts, which forced me to think:

1a. Once the user double clicks on the software, then a command prompt will launch and execute another program say notepad, and the command prompt will not return until the program launched (notepad) is closed by the user.

1b. If the user launches the program from an already open command prompt, then the prompt will not open another command prompt but launch another program (in this case notepad) and will not return until the launched program/process is closed.


This is a relationship of parent-child. The parent is looking after the child until the child's process has finished its execution.

This puzzle has a second part:
2. I also need the same program which launches Notepad through the command prompt will launch Notepad without launching the command prompt.
This is the whole story of the puzzle. The target platform is Windows.

The solution:

1. If you need a sample program, just write to me at "mufti.md@gmail.com".
2. Else, follow the following step, to solve problem 1(both 1a and 1b):
   a. Create a win32 program
   b. Which should have a main and WinMain
   c. main () should have the logic to spawn a new process (in this case notepad). 
   d. Wait until the spawned process is in signaled state. 
   e. Compile the program with "Subsystem:Console".
3. To solve problem 2, call main from WinMain and compile the program in "Subsystem: Windows".

Image of the software follows:

1. Launch through the command prompt:



2. Launch by double-click, (Command launcher mode is on):



Happy programming...

Comments

Post a Comment

Popular posts from this blog

XOR (Exclusive OR) for branchless coding

The following example shows the array reversing using the  XOR operator . No need to take any additional variable to reverse the array.   int main(int argc, _TCHAR* argv[]) { char str[] = "I AM STUDENT"; int length = strlen(str); for(int i = 0; i < ((length/2)); i++) { str[i] ^= str[length - (1+i)]; str[length - (1+i)] ^= str[i]; str[i] ^= str[length - (1+i)]; } cout << str << endl; return 0; } The above example is one of the uses of XOR but XOR comes in handy when we can do branchless coding  methods like butterfly switch etc. Sometimes this is very effective in speeding up the execution.  Let's see one of the uses of XOR in branchless coding. I am taking a simple example of Y = | X |.  Yes, I am generating abs of a supplied number. So, my function signature/definition in C++ looks like below: int absoluteBranch( int x) {     if (x < 0 ) {         return ...
1 comment
Read more

Reversing char array without splitting the array to tokens

 I was reading about strdup, a C++ function and suddenly an idea came to my mind if this can be leveraged to aid in reversing a character array without splitting the array into words and reconstructing it again by placing spaces and removing trailing spaces. Again, I wanted an array to be passed as a function argument and an array size to be passed implicitly with the array to the function. Assumed, a well-formed char array has been passed into the function. No malformed array checking is done inside the function. So, the function signature and definition are like below: Below is the call from the client code to reverse the array without splitting tokens and reconstructing it. Finally, copy the reversed array to the destination.  For GNU C++, we should use strdup instead _strdup . On run, we get the following output: Demo code
Post a Comment
Read more

Power of Two

  I n this post will be discussing how to calculate if a number is a power of two or not. As an example, 8 is a power of two but the number 10 is not. There are many ways we can solve this. First , we will take an approach which is simple and iterative. In this case, we will calculate the power of two one by one and check with the supplied number. The below code illustrates it. bool isPowerofTwo(unsigned num) { auto y = 1; while (0 != y) { if (num == y) return true; if (num < y) return false; y <<= 1; } return false; } Second , assuming, the number is a 32-bit number, this is also an iterative solution. In this scenario, iterating all bits and counting the set bits. Any number which is a power of 2 will have only one bit set and the rest will be zeros. As an example, 8 in binary representation is 1000. Using this observation, we can implement an iterative solution. bool isPowerofTwo(unsigned num) { auto one_count = 0; for (auto index = 0; index < ...
Post a Comment
Read more