Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Articles by Tapas Kumar Ghosh
Page 17 of 19
How to display video control in HTML5?
HTML has embed, object, and iframe tags to display the video control in HTML5. Sometimes we would like to watch a video and pause the video with the stop button but we don’t know what exactly happens to it. The boolean attribute is defined as controls and the attribute includes play, pause, volume, track, fullscreen mode, and subtitle ON/OFF. Visual Representation Syntax The following syntax is used in the examples are − The video element is used to display the video in an HTML document. The source element has src attribute that allows the user ...
Read MoreHow to disable the drop-down list in HTML5?
The drop-down list defines the list of available options selected by the users. We visit many websites in our day-to-day work and on those web pages we will find various options in the drop-down list in one or more navigation to access that particular webpage. For example- Drop-down menus on large websites can help users save time by letting them skip one or two levels to the information they are looking for. The example used in this article will explain to create an HTML5 code that will disable such types of drop down list. Visual Representation Syntax …… ...
Read MoreHow to display incorrect content using HTML5?
In HTML we have two elements i.e. s and del to display the incorrect content. There is no experimental difference between the ‘s’ and ‘del’ tags and also there is no proof that search engines take any action on these elements. For Example Let’s say there are two sentences to see the difference between an incorrect sentence vs correct sentence. The correct sentence is the same as of normal text whereas the incorrect sentence is marked by a black strike-through line. Syntax The tag represents the strike-through or line-trough text i.e. no longer correct or precise. ...
Read MorePrint all possible joints of a Trie constructed from a given list of string
In C++, the trie has an advanced data structure that is used for storing the collection of trees. The word tries came from the word retrieval and it is known as a digital tree or prefix tree. Let’s take an example of all possible joint by taking a given list of strings. We are defining the string input as {“tutor”, “true”, “tuo”} We can observe that the different string of characters is connected to the single string of the character. So here t and u are the list of characters in the string that joints all possible strings. In ...
Read MoreCount of element in an array whose set bits are in a multiple of K
The set bit is a binary representation form of 0 and 1. This digit 1 is called a set bit in reference to the computer. Let’s take an example to understand the setbit calculation − Let’s take an example to understand the setbit calculation − The set bit calculation of integer 96 is Let’s say we want to set the bit to sum of 96. So as shown in the above representation, we will set bit 1 to those array elements whose total will be 96. This way we will form 2 sets of bit. Therefore, if we take ...
Read MoreMinimum Bottleneck Spanning tree(MBST)
The Minimum Bottleneck Spanning tree is an undirected graph whose highest weight is considered as minimum as possible. Let’s take an example to understand the Minimum Bottleneck Spanning tree. In Figure I, we observe that there are three possible ways of spanning trees that have the common edge 2 and it means there is no other tree having a bottleneck value less than 2. Therefore, all these trees verify as Minimum Bottleneck Spanning trees. How we can say that the MST is MBST? There are the following points to understand the MST to be MBST − MBST ...
Read MoreArray Range Queries to find the Maximum Armstrong number with updates
The Array range queries are a new interest of data structure. In this query, we have set the random element to the array and given the general query problem to solve the data structure problem efficiently. Armstrong number is the total of its digits' cubes. For example- 0, 1, 153, 370, 371, and 407 are Armstrong numbers. Let’s take an example to understand the Armstrong number Example 1 − The given number is 371 and check whether the number is Armstrong or not. 3*3*3 + 7*7*7 + 1*1*1 = 371 Hence, this is Armstrong number. Example 2 − The given ...
Read MoreCheck if given words are present in a string
C++ has a predefined function find() which enables searching from the first element range until the last element. In this article, we are going to understand how we can use this find() function to check if a given word is present in a string or not. Let’s take an example of this. The given string is “John and mark have same color of t-shirt”; For searching the word in a string we will make a variable that is denoted as a search finder. Let’s take two variables and check if the given words are present or not. Var1 = ...
Read MoreProof that the Dominant Set of a Graph is NP-Complete
A Dominant set of a graph is NP-complete is the subset of vertices such that every vertex in the subset or adjacent vertex in the subset. The full form of NP is “Nondeterministic polynomial” which will check the problem in polynomial time and it means that we can check whether the solution is correct or not in polynomial time. The polynomial time has the best complexity to the code like the time complexity of linear search – n, Binary search – logn, Merge sort- n(log)n, etc. The NP-complete graph provides a good solution in a reasonable amount of time. This ...
Read MoreFind array sum using Bitwise OR after splitting given array in two halves after K circular shift
In C++ splitting an array mean dividing the array into more than one subarray. The Bitwise OR is used to handle the comparison and calculation between two bits or indexes in C++. In this article, we use k circular shift which means the last index position will be shifted to zero index position i.e, the first array element according to k-th times. Let’s take an example to understand the circular shift into the array. The given array is 1, 2, 3, 4, 5, 6, 7 and has a length of 6. Now we will assign the value 3 to k ...
Read More