Hacks and Tweaks


October 13, 2009

Start PC Automatically At Any Desired Time

More articles by »
Written by: arunenigma

Many of you have a night unlimited internet connection and would like to schedule the machine by night to Start up on its own, so that you don’t have to wake up by night.

You can make your system to turn ON automatically.

1. Go to bios

2. Go to power tab

3. There you see an option as below

wake up from s5—————-intel mb

wake up from irc alram——asus

4. Enable the option

5. Give ethe specified time

6. Press f10

You are done. Now just schedule your dialer by putting them on Start up by night and also if you desire to resume a torrent download put it also at Start up.

Keep the main power ON and keep the monitor OFF.

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



Be the first to comment!

You must be logged in to post a comment.