Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Circuit SwitchingCircuit Switching is a connection-oriented service. It provides a dedicated path from the sender to the receiver. In-circuit switching, a connection setup is required to send and receive data. It has very little chance of data loss and error due to the dedicated circuit, but a lot of bandwidth is wasted because the same path cannot be used by other senders during a congestion. Circuit switching is completely transparent; the sender and receiver can use any bit rate format or framing method.Advantages of Circuit SwitchingIt uses a fixed bandwidth.A dedicated communication channel increases the quality of communication.Data is transmitted ... Read More
An event is defined as a change in an object's state. There are a number of events in HTML that show when a user or browser performs a certain action. JavaScript responds to these events when JavaScript code is embedded in HTML and allows execution. The process of responding to events is known as event handling. As a result, JavaScript uses event handlers to handle HTML events. In this article, we are going to discuss how to remove event handlers in JavaScript. Here, we use the removeEventListener() method to remove an event handler from an element in JavaScript. Using the ... Read More
Rounding toward negative infinity is a method of rounding a number "N" down to the nearest integer less than or equal to the number "N". This method is also called "flooring". In simple words, rounding a number toward negative infinity is a method of finding the largest integer number which is less than or equal to the given number. For example, consider a number 4.8, when this number is round to negative infinity. Then, it will become 4. This is because, 4 is the largest integer number less than or equal to 4.8. Similarly, if we have a negative ... Read More
Sometimes you might have noticed that the default search engine of your Chrome browser is automatically changed to Bing. If this is happening without any user intervention, it might be because of malware known as Browser Hijacker. Browser Hijacker takes control of your browser and modifies its settings for conducting malicious activities, including changing the default search engine, homepage, and others. In this post, we would discuss how Bing become your Chrome browser's default search engine and how to remove it from Chrome. What is Bing? Bing is one of the most popular search engines on the internet world. In ... Read More
Problems involving grids and matrices are mostly solved using either BFS or DFS traversal algorithms. Taking a look into the first one, Breadth First Traversal − BFS or Breadth First Traversal is an algorithm for searching a tree or a graph data structure. It starts at the root node and explores all the nodes at the present level before moving on to the next level. Algorithm procedure BFS(G, root) is let Q be a queue label root as explored Q.enqueue(root) while Q is not empty do ... Read More
Reducing an array to a single element by repeatedly removing element is done by the following criteria − Select indices i and j such that i < j and arr[i] < arr[j] and convert one of the two elements to 0. Problem Statement Given an array arr[] containing positive integers. Find if the array can be reduced to a single element by repeatedly removing an element from any increasing pair. If possible return true along with the indices chosen and the index of the element that is removed. Sample Example 1 Input arr[] = {5, 7, 10, 2, 4, ... Read More
Recurrence Relation − In mathematics, recurrence relation refers to an equation where the nth term of the sequence is equal to some combination of the previous terms. For a recurrence relation where each term equals the product of previous K terms, let’s define N and K along with an array arr[] containing the first K terms of the relation. Thus, the nth term is given by − $$\mathrm{F_N= F_{N−1} ∗ F_{N−2} ∗ F_{N−3} ∗ . . .∗ F_{N−K}}$$ Problem Statement Given two positive integers N and K and an array of integers containing K positive integers. Find the Nth term ... Read More
A subarray is a contiguous part of an array i.e. it can be considered as an array inside another array. For example, take the following array, array[] = {1, 2, 3, 4, 5, 6} For the above array, one possible subarray is subarry[] = {2, 3, 4} Problem Statement Given an array arr[] having N positive integers and a positive integer K representing the maximum number that can be added to the elements of the array. The task is to increment the elements of the array by most K increment operations and return the maximum possible ... Read More
The N-ary tree is a tree data structure where each node can have a maximum of N children where N is a positive integer (N >= 0). N-ary trees are used in many applications like file systems, organisational charts and syntax trees in programming languages. Example of N-ary tree with N = 4. A / / \ \ B C D E / | \ ... Read More
The Shortest Path Faster Algorithm is an improved or more optimized version of the Bellman-Ford Algorithm. It calculates the single source's shortest path in a weighted directed graph. This algorithm is especially suitable for graphs with negatively weighted edges. Algorithm Given a weighted directed graph and a source vertex , the algorithm finds the shortest path from , to each vertex , in the graph. The length of thh shortest path from to is stored in for each vertex . procedure Shortest-Path-Faster-Algorithm(G, s) for each vertex v ≠ s in V(G) ... Read More