Hacks and Tweaks


October 18, 2009

How To Create An Undeletable File

More articles by »
Written by: arunenigma

With this trick you can create a file that is undeletable in Windows..!

Folder Creation

1) Open up Command Prompt by typing CMD in RUN.

2) In Command Prompt, type the following:

copy con \\.\””

Important :

The file name should begin with either “LPT3.” or “AUX.”
For Eg: LPT3.hello.txt or etc.

3) Press Ctrl+Z and it shows “1 file(s) copied.”

4) And you are done. Close CMD by typing EXIT.

5) Now try to delete it from windows. It would show “ERROR DELETING FILE OR FOLDER”.

Procedure To Remove the Undeletable File:

1) Open up Command Prompt by typing CMD in RUN window.

2) In CMD Prompt type the following:

del \\.\”<>”

and press ENTER.

Eg 1: del \\.\”E:\LPT3.hello.txt”
Eg 1: del \\.\”E:\AUX.see.bmp” etc.

3) And you are done. The file can be deleted now.

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.