Skip to main content

Posts

Showing posts from July, 2023

Close a Window Application from another application.

 This is just a demo application code to show how the WM_CLOSE message can be sent to the target process which has a titled window to close the application. To achieve this, either we can use SendMessage or PostMessage APIs to send required Windows messages to the target application. Though both the APIs are dispatching WM_XXXXX message to target application two APIs has some differences, these are as below: 1. SendMessage () call is a blocking call but PostMessage is a non-blocking call(Asynchronous) 2. SendMessage() APIs return type is LRESULT (LONG_PTR) but PostMessage() APIs return type is BOOL(typedef int). In Short, SendMessage () APIs return type depends on what message has been sent to the Windowed target process. For the other one, it's always a non-zero value, which indicates the message has been successfully placed on the target process message queue. Now let's see how can I close a target windowed application "Solitaire & Casual Games" from my custom-

An attempt to Implement Binary Search STL (associative) Containers agnostic way.

 Binary Search is a very trivial algorithm to search a target value from a sorted array. It's popular among students of computer science and also during interviews it gets asked by the interviewer. It's easy. We take an array of integers already sorted and apply binary search on that array to figure out if the target value does present in that sorted array or not.  The condition can be either present or not present. If it is present we return the array index of the element else we return -1. The algorithm is very simple, it's broken down into three parts. 1. Find and compare the middle element of the search space with the key. 2. If the key is found in the middle, just return the array index. 3. If the key is not found then choose half of the array space, based on whether the key value is smaller or greater than the mid element.       a. If the key element is smaller than the mid element, then the left side of the search space will be used otherwise, the right side of the s

A simple approach to generate Fibonacci series via multi-threading

T his is a very simple approach taken to generate the Fibonacci series through multithreading. Here instead of a function, used a function object. The code is very simple and self-explanatory.  #include <iostream> #include <mutex> #include <thread> class Fib { public:     Fib() : _num0(1), _num1(1) {}     unsigned long operator()(); private:     unsigned long _num0, _num1;     std::mutex mu; }; unsigned long Fib::operator()() {     mu.lock(); // critical section, exclusive access to the below code by locking the mutex     unsigned long  temp = _num0;     _num0 = _num1;     _num1 = temp + _num0;     mu.unlock();     return temp; } int main() {     Fib f;          int i = 0;     unsigned long res = 0, res2= 0, res3 = 0;     std::cout << "Fibonacci series: ";     while (i <= 15) {         std::thread t1([&] { res = f(); }); // Capturing result to respective variable via lambda         std::thread t2([&] { res2 = f(); });         std::thread t3(