arungeek
Hacks and Tweaks



Uncategorized

June 20, 2010

How to setup a Portable utorrent : Cool Tutorial

More articles by »
Written by: arunenigma
Tags:

 

 

 

 

 

 

 

 

 

 

  • Download the latest standalone utorrent version, and copy it onto your data stick.
  • Create an empty data file with notepad or any other text editor, and name it settings.dat
  • Place the settings.dat file in the same folder on your portable disk as uTorrent.
  • Run uTorrent from your portable drive and configure the options and preferences.

Now you’re ready to go. You can start downloading at school, and finish at home. And the good thing is that you don’t need to install uTorrent or another BitTorrent client, just a USB-port, that’s all you need.

Right click to adjust bandwidth settings If you’re planning to use uTorrent on different computers with different bandwidth settings, make sure that you set the maximum upload speed to 90% of the available upload speed to guarantee fast download speeds.

Tip: An easy way to adjust the up- and download speeds is by right clicking the uTorrent icon in the taskbar.

 

Other useful (torrent) portable applications are:

VLC media player: A bunch of codecs are included in this great media player, so you don’t have to install the latest codec on every computer you’re working on.

7-zip: Some torrents might be archived. 7-zip extracts .zip, rar, and other archives.

 



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.