arungeek
Hacks and Tweaks



Uncategorized

October 16, 2009

Change Windows Xp Home To Windows Xp Pro

More articles by »
Written by: arunenigma


1. Copy the root directory and the i386 directory of the WindowsXP CD to your harddisk.

2. Extract the Bootsector of your WindowsXP CD.

a) Important: At this point, you MUST install any service packs
by slip streaming them in as it will be in impossible to install
them later.

3. Change 2 Bytes in i386\Setupreg.hiv:

a) Open Regedit
b) Highlight HKEY_LOCAL_MACHINE
c) Menu: File -> Load Structure -> i386\Setupreg.hiv
d) Assign an arbitrary name to the imported structure e.g. “Homekey”
e) Goto HKEY_LOCAL_MACHINE\Homekey\ControlSet001\Services\ setupdd
f) Edit the binary key “default” and change “01” to “00” and “02” to “00”
g) Highlight “Homekey” and select menu: File -> unload structure

4. Burn your new XP Pro CD

5. Install WindowsXP as usual. Your XP Home Key will work.



About the Author

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




 
 

 
Factory_1

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
 

 
 
Gospers_glider_gun

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
 

 
 
bin-tree

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
 

 

 
bst

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
 

 
 
fibonacci

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
 

 




0 Comments


Be the first to comment!


You must be logged in to post a comment.