Skip to main content

Finding Your Windows Product Key


If you are looking for how to find your product key?. Then this is the perfect guide for you.
  First your windows product key is not visible in PC Info. So to reveal that you have few methods.
I will tell you how to find it without any ease.

  • Open command prompt by pressing WIN + R and typing cmd.
  • This will open the command prompt.
  • Now type wmic path softwarelicensingservice get OA3xOriginalProductKey  or you can copy it and paste by right clicking on command prompt.
  • Now press enter. You got your key

   

Comments

  1. I'll admit, I've been running Windows 7 for six months now: Windows 7 is quite simply faster, more stable, boots faster, goes to sleep faster Even the preproduction version of Windows 7 was better than my Vista with SP2

    Apple iPad, Tablet, or Notebook?

    ReplyDelete
    Replies
    1. That's the reason why the software giant Microsoft released a new version of windows named Windows 7 also started to use integer to specify versions on their product Lol :-)

      Delete

Post a Comment

Popular posts from this blog

One of the best Torrent caching service.

Hi readers, It's been a long time since I made my last post on this blog. That's due to the migration of the blog to private servers.  Today I found a decent torrent caching service, which I have been looking for years. Initially, when I started, I couldn't find the services are really benefiting me. So I went with my own Virtual Private Server in Digital Ocean. I ran a five dollar per month instance for my torrent caching as well as a multipurpose server.  Of course, It has its pros and cons.  Pros: I was able to do anything I wanted. It served as a good multipurpose server. Relatively inexpensive. Cons: You need to be a computer geek for up and running. Even most of the things are automated, still few manual works have to be performed. It takes usual time for downloading unlike caching services(They can do it instantly). Finally, we have a hassle free torrent caching service  Seedr .  It is a free torrent caching servic...

2-Dimensional Array with Dynamic Rows and Columns.

In Programming many times we have to store and work  with the data. But choosing the right way of storing is important. Array is one of the most simple and effective way of storing list of data.Now we have to multiple array of data. Ohh! that sounds easy we can use 2 Dimensional Array. I agree 2 Dimensional array is suitable but I have arrays of variable lengths. So simply creating 2-D Array will not be efficient because I have to specify the column size as the highest of my arrays. So there will be lot of unused space. The good solution can be Dynamic 2D Array with variable columns. Also Array of vectors can also be used. But we are not discussing about STL. Algorithm: Create a ptr to ptr to ptr with the name of your 2D Array to hold the Array of Pointers. Now create an Array of pointers depending on the no of rows and store the base address on the ptr to ptr. For every Row allocate the required memory and store the address in the array of pointers. You own the 2D...

Merge Sort Implementation in C++

For a Programmer sorting is an easy task after writing the code for couple of pages. But there are many other sorting algorithms.  The question which is not being properly answered is which sorting algorithm you should choose.  This is the most frustrating situation where we feel bad about us. The best sorting algorithm depends only on the scenario in which you are intended to use.  Let us speak about the Merge sort. Merge sort uses the divide and conquer approach. Entirely the merge sort is an easy algorithm (Depends on the way you think). You cannot master merge sort until you think what is happening. It has a good worst case performance (0(N logN)). It uses an additional space to accomplish the goal. The implementation is mainly based on the recursion.  You can get real performance benefit when comparing to bubble,selection sort. That's enough for the quick intro. If you would like you know more do a research on yourself. The algorithm goes like th...