believe in yourself

ya time is powerful, my friend
its revels the truth
it uncovers the mystery
you need to go with it
else you are left alone.

May be,
its time to change your shoe
trace a new path
ya my friend,
And as always
don't just wait for your pals
you may remain waiting

Mind it,
at times you need to change
ya you need to do it my friend

And the truth is
there is no one for you
no damn interfaces
And my friend,
Everyone have a reason
damn selfish reason
for walking with you

And the another truth is
there is always a humble heart walking with you
you need to believe it
search it in yourself
ya its just you my friend

believe in yourself

Comments

Python : split any file (binary) to different pieces and join them

This python program takes an input file and then splits it into different smaller chunks. Next it can collect all the different chunks and join it to get the original file. -------------------------------------------------------- # define the function to split the file into smaller chunks def splitFile(inputFile,chunkSize): #read the contents of the file f = open(inputFile, 'rb') data = f.read() # read the entire content of the file f.close() # get the length of data, ie size of the input file in bytes bytes = len(data) #calculate the number of chunks to be created noOfChunks= bytes/chunkSize if(bytes%chunkSize): noOfChunks+=1 #create a info.txt file for writing metadata f = open('info.txt', 'w') f.write(inputFile+','+'chunk,'+str(noOfChunks)+','+str(chunkSize)) f.close() chunkNames = [] for i in range(0, bytes+1, chunkSize): fn1 = "chunk%s...

calculate hop count in a graph using python

The following program finds out the hop count of the nodes in a connected network. Hop Count means the number of point to point connections in a graph of network. For example, in the graph shown below the hop count from node a to node b is one, node b to node c is two, etc. This program assumes the graph given above. usage : getHopCount(dictNeigh, node1,node2) Where: dictNeigh : dictionary of list of neighbor of each node in the network node1 and node2 are the nodes for which hop count is calculated by the program Exception: if the nodes are not connected then it returns Zero import copy dictNeigh = dict() # dictNeigh defines the neighbors dictNeigh['a'] = ['b','c','d'] # neighbors of 'a' dictNeigh['b'] = ['a']# neighbors of 'b' dictNeigh['c'] = ['a','d'] dictNeigh['d'] = ['a','c','e'] dictNeigh['e'] = ['d','f'] dictN...

My first step to PHP-MySQL

This is a very basic php-mysql tutorial and I will be trying to make it as simple as possible, since I it to be helpful for the first timers. This is the part of program when I was starting to learn Php-mysql. I was just trying to create a html form, get some data filled and then save the data in the database. And also displaying those data back. It was a messy code but I felt glad enough since it was a tangible piece of my learning process. Since then, if anyone asked me some help regarding the startup, i used to provide this code for them to play with. And I thought it will be a good idea if I can share it. a simple html form <form name="form1" method="post" action="target.php"> <p class="style1" align="left"> <label>Enter your details:</label> </p> <table width="421" bgcolor="#cccccc"> <tbody><tr> <td width="195">Name: <input nam...

Sensing...

Search This Blog