Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
NCSA’s Mosaic was the first popular browser, which released in 1993. After a year, in 1994, Netscape was founded, which came with the web browser Netscape Navigator It gained a lot of popularity in the 1990s. Many Mosaic authors worked for Navigator.Considering the need for users and market trend, Netscape realized that the Web should be more dynamic. Netscape hired Brendan Eich in 1995In 1995, Netscape hired Brendan Eich to implement Scheme in the browser. But, Netscape collaborated with Sun to include Java, in Navigator. Netscape wanted to have a scripting language with a syntax similar to Java. Brendan Eich ... Read More
JavaScript conforms to ECMAScript standard. JavaScript was first known as LiveScript, but Netscape changed its name to JavaScript, possibly because of the excitement being generated by Java. JavaScript made its first appearance in Netscape 2.0 in 1995 with the name LiveScript. The general-purpose core of the language embedded in Netscape, Internet Explorer, and other web browsers.The ECMAScript Edition 5 standard was the first update to be released in over four years. JavaScript 2.0 conforms to Edition 5 of the ECMAScript standard, and the difference between the two is extremely minor.The 8th edition, known as ECMAScript 2017, came in June 2017.The ... Read More
JavaScript launched in May 1995 by Brendan Eich, who used to work at Netscape. Initially, it wasn’t called JavaScript; it was given the name Mocha.The name Mocha was chosen by Marc Andreessen, a Netscape founder. The name was changed to LiveScript in September 1995. In the same year, December, it received a trademark license from Sun and the name JavaScript came into the picture.The general-purpose core of the language has been embedded in Netscape, Internet Explorer, and other web browsers.The ECMA-262 Specification defined a standard version of the core JavaScript language.JavaScript is a lightweight, interpreted programming language.Designed for creating network-centric ... Read More
In an interval heap, the smallest element is the element on the left hand side of the root node. This element is eliminated and returned.For filling the vacancy created on the left hand side of the root node, an element from the last node is eliminated and again inserted into the root node.This element is next compared successively with all the left hand elements of the descending nodes and the process terminates when all the conditions for an interval heap are met.In case if the left hand side element in the node becomes higher than the right side element at ... Read More
Depending on the number of elements which are present in the interval heap, following cases are possible -Odd number of elements: If the number of elements in the interval heap be odd, the new element is inserted in the last node at first. Then, it is compared with the previous node elements successively and tested to meet the criteria essential for an interval heap. In case if the element does not meet any of the criteria, it is transferred from the last node to the root until all the conditions are met.Even number of elements: If the number of elements ... Read More
A double-ended priority queue (DEPQ) or double-ended heap is defined as a data structure like a priority queue or heap, but permits for efficient removal of both the maximum and minimum, according to some ordering on the keys or items stored in the structure. Every element in a DEPQ associated with a priority or value. In a DEPQ, it is possible to eliminate or remove the elements in both ascending and descending order.OperationsA double-ended priority queue consists of the following operationsisEmpty()This function is responsible to check if DEPQ is empty and returns true if empty.size()This function is responsible to return the total ... Read More
A soft heap is defined as a variation on the simple heap data structure that consists of constant amortized time for 5 types of operations. This is obtained by carefully "corrupting" (increasing) the keys of maximum a certain number of values in the heap. The constant time operations are −create(s) − Create a new soft heap sinsert(s, y) − Insert an element y into a soft heap smeld(s, s' )of two soft heaps s and s′ into one, destroying bothdelete(s, y) − Delete an element y from a soft heap sfindmin(s) − Get the element with least key in the soft ... Read More
Pairing heaps are implemented for a perfect use of a priority queue. A priority queue maintains track of the minimum of a set of objects, so every time we take something eliminate from the queue it is always the minimum value. Priority queues are mostly implemented when using Dijkstra’s Algorithm to calculate the shortest path in a graph.Pairing heaps are perfect because they are easy to use and operate well in real applications. Specifically, they operate excellent in amortized time . Meaning that while an individual operation consumes a longer time, the sum of all the operations over the whole ... Read More
In this tutorial, we are going to write code to find the sum of the series n + nn + nnn + ... + n (m times). We can do it very easily in Python. Let's see some examples.Input: n = 1 m = 5 Series: 1 + 11 + 111 + 1111 + 11111 Output: 12345AlgorithmFollow the below steps to solve the problem.1. Initialise the n and m. 2. Initialise total to 0. 3. Make the copy of n to generate next number in the series. 4. Iterate the loop m times. 4.1. Add n to the total. ... Read More
Calculating the amortized cost of meld operation is a difficult task. The major difficulty is in accumulating for the wide variations in the costs of an operation performed at different points in a random sequence of operations. Although our design goal is affected by the costs of sequence of operations, defining the notion of amortized cost of an operation in terms of the costs of sequences of operations leads nothing. Implementing a potential function to off set the variations in the actual costs is a perfect way of handling the situation.In the next topic we discuss the notion of amortized ... Read More