arungeek
Hacks and Tweaks



Uncategorized

October 16, 2009

Windows XP Amazing Trick to Try !

More articles by »
Written by: arunenigma
Hacking Windows XP !


In case of a User’s Password loss.

* Boot the PC in Safe Mode by pressing the F8 key when starting your computer.

* Select the Safe Mode option. You can now Login as an Administrator and XP won’t prompt for the Password.

* Try rebooting the PC in DOS.

* Now, Access to C:\Windows\system32\config\SAM.

* Rename SAM as SAM.mj

* Now XP won’t ask for Password next time you Login.

* Now, again go to Start menu –> Run.

* Type cmd in Run

* Type net user

* It will list all the users.

* Again type net user “administrator” or the name of the administrator “name” *.

* It will ask for the Password. Type the Password and there you are done.

* Hold the Ctrl+Alt key and press Del twice. This will bring up the normal login and you can log on as Administrator.

To unhide the Administrator Account:

* Again go to Start –> Run –> regedit.

* Go to HKEY_LOCAL_MACHINE –> SOFTWARE –> Microsoft –> Windows NT –> CurrentVersion –> Winlogon –> SpecialAccounts –> UserList.

* Unhide the Administrator key by giving it a value of 1.



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.