Hacks and Tweaks


October 18, 2009

How To Use A Trial Software Legally Forever Without Expiring

More articles by »
Written by: arunenigma
How To Use A Trial Software Legally Forever Without Expiring

It can be achieved by using a simple and small software named Time Stopper.

Download Link:

How to Use Time Stopper ?

1. Download and Install Time Stopper.

2. Click Desktop Icon (1) to open the Time stopper, Then click Browse button (2) to select software.

Now you will get a window as shown below:

3. Now select main exe of tryout version & open it.

4. Normally all softwares are installed in the program files folder.

To open it click my computer, click C drive, click program files folder and finally click software folder (total video converter).

Select main exe (tvc).

Normally main exe creates a desktop icon and a start menu icon.

5. Click “choose the new date” comb box and set date as your wish.

Assume total video converter install 2009 May 1st. Today is 2009 May 3rd. Trial period of total video converter is 15 days.

Then you should set day between 2009 May 4th to 2009 May14th as the date.

6. Finally, You should create a desktop icon. Type a name for your trial version software (3) and click button (4) to create desktop shortcut.

Note: If the Software has desktop or startup folder shortcuts delete them and never use start menu link to open software.

(Because after trial period accidentally click old desktop icon or start menu icon trial period of some software will be permanently over.)

About the Author

Computer Science Graduate Student @ Case Western Reserve University, Cleveland, USA



Python Factory Design Patterns using Switch Case

I googled for Factory Method Design Pattern in Python but couldn’t find a good resource. So, I  am sharing an example program to demonstrate this design pattern in Python which I frequently use. The factory method pattern is...
by arunenigma


Conway’s Game of Life Implemetation in Python with cool patterns

he Game of Life (or simply Life) is not a game in the conventional sense. There are no players, and no winning or losing. Once the “pieces” are placed in the starting position, the rules determine everything that ha...
by arunenigma


Python AVL Tree Implementation with ASCII visualization

n computer science, an AVL tree is a self-balancing binary search tree. It was the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any tim...
by arunenigma



Binary Search Tree in Python with ASCII art visualization

Binary search tree implementation in Python with: in, post and pre-order traversals. Also includes methods for insertion, deletion and search of nodes. Deletion is fairly complex and is made possible by keeping track of parents...
by arunenigma


Python, Memoization, Dynamic Programming, Fibonacci Series and some Fun!

ython can implement the recursive formulation directly, caching return values. Memoization is a method where if a call is made more than once with the same arguments, and the result is returned directly from the cache. For exam...
by arunenigma


One Comment

  1. Tried it fren!!

You must be logged in to post a comment.