arungeek
Hacks and Tweaks



Uncategorized

January 10, 2010

Who Used Your Pc In Your Absence, What Did They Do ?

More articles by »
Written by: arunenigma


Who used my computer in my absence and what did he do? Here is a small trick which shows who operated your PC, what did he do, what is he watching now and how long has he been using your PC.

First you should goto :

start –> run –> eventvwr.msc

Events are stored in three log files: Application, Security, and System. These logs can be reviewed and archived.

For our purposes we want the System log. Click on “System” in the left-hand column for a list of events.

Look for a date and time when you weren’t home and your computer should have been off.

Double click on the eg: info and it will show you the detail.

You can also use this log to see how long someone was on the computer. Just look at the time the computer was turned on and off for that day.



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.