Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
The largest possible value a number in JavaScript can have 1.7976931348623157E+308. The Number.MAX_VALUE property belongs to the static Number object. It represents constants for the largest possible positive numbers that JavaScript can work with.ExampleYou can try to run the following code to get the maximum value represented by Number object −Live Demo Click the following to see the result:
The with keyword is used as a kind of shorthand for referencing an object's properties or methods.The object specified as an argument to with becomes the default object for the duration of the block that follows. The properties and methods for the object can be used without naming the object.SyntaxThe syntax for with object is as follows −with (object){ properties used without the object name and dot }ExampleYou can try to learn the following code to learn how to implement with keyword −Live Demo User-defined objects ... Read More
The new operatorThe new operator is used to create an instance of an object. To create an object, the new operator is followed by the constructor method.In the following example, the constructor methods are Object(), Array(), and Date(). These constructors are built-in JavaScript functions.var department = new Object(); var books = new Array("C++", "Perl", "Java"); var day = new Date(“December 1, 2017");The object() constructorA constructor is a function that creates and initializes an object. JavaScript provides a special constructor function called Object() to build the object. The return value of the Object() constructor is assigned to a variable.The variable contains ... Read More
To pop-up a print dialog box using JavaScript, use the print() method. With the dialog box, you can easily set the printing options like which printer to select for printing.This is the dialog box −ExampleYou can try to run the following code to learn how to print a page −Live Demo Click to Print function display() { window.print(); }
The Fibonacci sequence is like this, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ……In this sequence, the nth term is the sum of (n-1)'th and (n-2)'th terms.To generate we can use the recursive approach, but in dynamic programming, the procedure is simpler. It can store all Fibonacci numbers in a table, by using that table it can easily generate the next terms in this sequence.Input and OutputInput: Take the term number as an input. Say it is 10 Output: Enter number of terms: 10 10th fibinacci Terms: 55AlgorithmgenFiboSeries(n)Input: max number of terms.Output − The nth Fibonacci ... Read More
Let us consider, we will try to write the letter ‘A’, using the keyboard. Our goal is to use only four keys and try to write maximum ‘A’s on the text field. The keys are ‘A’, ‘C’, ‘V’ and ‘Ctrl’.To write the maximum number of A, we will use Ctrl + A to select All, Ctrl + C to copy and Ctrl + V to paste.Input and OutputInput: Number of keystrokes, say 7 Output: Maximum Number of A's with 7 keystrokes is: 9 Press A three times. Then Ctrl+A, Ctrl+C, Ctrl+V, Ctrl+VAlgorithmkeyNumbers(keyStrokes)Input: number of keystrokes.Output: Maximum number of letters using these ... Read More
The Independent Set is the subset of all binary tree nodes when there is no edge between any two nodes in that subset. Now from a set of elements, we will find the longest independent set. i.e. If the elements are used to form a binary tree, then all largest subset, where no elements in that subset are connected to each other.Input and OutputInput: A binary tree. Output: Size of the Largest Independent Set is: 5AlgorithmlongSetSize(root)In this algorithm Binary tree will be formed, each node of that tree will hold data and setSize.Input − Root node of the binary tree.Output − ... Read More
An array of integers is given. We have to find the sum of all elements which are contiguous, whose sum is largest, that will be sent as output.Using dynamic programming we will store the maximum sum up to current term. It will help to find the sum for contiguous elements in the array.Input and OutputInput: An array of integers. {-2, -3, 4, -1, -2, 1, 5, -3} Output: Maximum Sum of the Subarray is: 7AlgorithmmaxSum(array, n)Input − The main array, the size of the array.Output − maximum sum.Begin tempMax := array[0] currentMax = tempMax for i := ... Read More
A sequence is said to be bitonic if it is first increasing and then decreasing. In this problem, an array of all positive integers is given. We have to find a subsequence which is increasing first and then decreasing.To solve this problem, we will define two subsequences, they are the Longest Increasing Subsequence and the Longest Decreasing Subsequence. The LIS array will hold the length of increasing subsequence ending with array[i]. The LDS array will store the length of decreasing subsequence starting from array[i]. Using these two arrays, we can get the length of longest bitonic subsequence.Input and OutputInput: A ... Read More
A matrix of different characters is given. Starting from one character we have to find the longest path by traversing all characters which are greater than the current character. The characters are consecutive to each other.To find the longest path, we will use the Depth First Search algorithm. During DFS, some subproblems may arise multiple times. To avoid the computation of that, again and again, we will use a dynamic programming approach.Input and OutputInput: The matrix as shown above. And the starting point. Here the starting point is e. Output: Enter Starting Point (a-i): e Maximum consecutive path: 5AlgorithmfindLongestLen(i, j, ... Read More