How to improve Yamaha R15 mileage.(Also for all bikes)

Are you a person who wonders to ride your bike a higher rev range? Then this might not sound good for you.

I ensure that I have used the below methods and got around 55 km-pl mileage in R15.

By Newton's law the Energy can neither be created nor destroyed. So when you rev hard then your gas is readily converted into mechanical energy which has effect on your mileage.

If you have brought a fancy sports bike and wondering for optimum mileage then I have few things for you to get yourself on the track.

Mileage is heavily dependent on your riding style. So please do take care of it.
The first 500 km of your vehicle is more precious. Ride it in lower-mid rev range. Don't rev hard suddenly.
Don't take long drive on first 500 km also avoid lot of hick ups in your riding.
Regularly check your tyre pressure as mentioned by the manufacturer.
Use nitrogen for inflating your tyre because it has advantages.
Be sure to service in a specified interval in authorized service center.
Don't use mods like filters, mufflers which is related to engine functioning.
Fill the petrol in a trust worthy pumps only at the early morning.
Don't let your petrol go below 1/4 th of your tank capacity.
Finally the more you feel your bike the more you understand. So ride in optimal rpm to get the best mileage.

Not to mention there are lot of craps on the road waiting for you. Please make sure you wear helmet and don't use high beam within city limits. Ride safe live well.

Comments

One of the best Torrent caching service.

Hi readers, It's been a long time since I made my last post on this blog. That's due to the migration of the blog to private servers. Today I found a decent torrent caching service, which I have been looking for years. Initially, when I started, I couldn't find the services are really benefiting me. So I went with my own Virtual Private Server in Digital Ocean. I ran a five dollar per month instance for my torrent caching as well as a multipurpose server. Of course, It has its pros and cons. Pros: I was able to do anything I wanted. It served as a good multipurpose server. Relatively inexpensive. Cons: You need to be a computer geek for up and running. Even most of the things are automated, still few manual works have to be performed. It takes usual time for downloading unlike caching services(They can do it instantly). Finally, we have a hassle free torrent caching service Seedr . It is a free torrent caching servic...

2-Dimensional Array with Dynamic Rows and Columns.

In Programming many times we have to store and work with the data. But choosing the right way of storing is important. Array is one of the most simple and effective way of storing list of data.Now we have to multiple array of data. Ohh! that sounds easy we can use 2 Dimensional Array. I agree 2 Dimensional array is suitable but I have arrays of variable lengths. So simply creating 2-D Array will not be efficient because I have to specify the column size as the highest of my arrays. So there will be lot of unused space. The good solution can be Dynamic 2D Array with variable columns. Also Array of vectors can also be used. But we are not discussing about STL. Algorithm: Create a ptr to ptr to ptr with the name of your 2D Array to hold the Array of Pointers. Now create an Array of pointers depending on the no of rows and store the base address on the ptr to ptr. For every Row allocate the required memory and store the address in the array of pointers. You own the 2D...

Merge Sort Implementation in C++

For a Programmer sorting is an easy task after writing the code for couple of pages. But there are many other sorting algorithms. The question which is not being properly answered is which sorting algorithm you should choose. This is the most frustrating situation where we feel bad about us. The best sorting algorithm depends only on the scenario in which you are intended to use. Let us speak about the Merge sort. Merge sort uses the divide and conquer approach. Entirely the merge sort is an easy algorithm (Depends on the way you think). You cannot master merge sort until you think what is happening. It has a good worst case performance (0(N logN)). It uses an additional space to accomplish the goal. The implementation is mainly based on the recursion. You can get real performance benefit when comparing to bubble,selection sort. That's enough for the quick intro. If you would like you know more do a research on yourself. The algorithm goes like th...

Tech Pixler

Search This Blog