- The bind() method creates a new function that, when called, has its this keyword set to the provided value, with a given sequence of
arguments preceding any provided when the new function is called. Function.prototype.bind()
var module = { x: 42, getX: function() { return this.x; } }
To Fill up the timesheet
$("select option[value='357815']").attr("selected", "selected");
$( "#content-ts tr td select" ).trigger( "change" );
$("select option[value='159087']").attr("selected", "selected");
$("#content-ts tr td:nth-child(12) input").attr("value","09");
Note : Here 357815 is project id which is 'struts upgrade' and 159087 is task id which is 'developement'
A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms such as search and merge algorithms, which require input data to be in sorted lists; it is also often useful for canonicalizing data and for producing human-readable output.
Java Sorting Algorithms Examples
- bubble sort in java
- selection sort in java
- insertion sort in java
- quick sort in java
-
To check the avilable memory
df -h
-h is human readable
-
current directory
pwd
Have you ever watched a movie with a group of friends, laughing, shouting, and sharing popcorn, nachos, or fries—all at the same time? If yes, you’ve already practiced multithreading and concurrency.
“Every problem has a solution, and every solution has a problem”—this statement holds true for threads. Threads were created so that they could make the best use of a processor’s time. An application can create multiple threads. When threads share objects among themselves, it can result in interleaving operations (thread interference)