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
Articles by Sai Subramanyam
Page 2 of 7
C# int.Parse Method
Convert a string representation of number to an integer, using the int.Parse method in C#. If the string cannot be converted, then the int.Parse method returns an exceptionLet’s say you have a string representation of a number.string myStr = "200";Now to convert it to an integer, use the int.Parse(). It will get converted.int.Parse(myStr);Exampleusing System.IO; using System; class Program { static void Main() { int res; string myStr = "200"; res = int.Parse(myStr); Console.WriteLine("String is a numeric representation: "+res); } }OutputString is a numeric representation: 200
Read MoreHow to use week input type in HTML?
The week input type is used in HTML using the . Using this, allow users to select a week and year. A date picker popup is visible whenever you will give a user input to the week input type. Note − The input type week is not supported in Firefox and Internet Explorer. It works on Google Chrome. You can try to run the following code to learn how to use week input type in HTML. It will show both week and year. Example HTML input week Details: Student Name Training week
Read MoreThe Modulation and Multiplexing
ModulationModulation is the process of transforming a carrier signal so that it can carry the information of a message signal. It superimposes the contents of the message signal over a high-frequency carrier signal, which is then transmitted over communication channels.Modulation can be of two types −Analog ModulationDigital ModulationAnalog ModulationHere, the analog information signal is transformed to the analog carrier signal so that it can travel large distances without substantial loss.Analog modulation can be of three types −Amplitude ModulationFrequency ModulationPhase ModulationDigital ModulationDigital modulation is the process of converting a digital bit stream into an analog carrier wave for transmission via a ...
Read MoreHow BEFORE UPDATE triggers can be used to emulate CHECK CONSTRAINT\\nfor updating values in the table?
As we know that MySQL supports foreign key for referential integrity but it does not support CHECK constraint. But we can emulate them by using triggers. It can be illustrated with the help of an example given below −ExampleSuppose we have a table named ‘car’ which can have the fix syntax registration number like two letters, a dash, three digits, a dash, two letters as follows −mysql> Create table car (number char(9)); Query OK, 0 rows affected (0.32 sec)Creating BEFORE UPDATE trigger to emulate CHECK CONSTRAINT for updating the values −Now, suppose if we will try to update the table ...
Read MoreDepth-first search traversal in Javascript
DFS visits the child vertices before visiting the sibling vertices; that is, it traverses the depth of any particular path before exploring its breadth. A stack (often the program's call stack via recursion) is generally used when implementing the algorithm.Following is how a DFS works −Visit the adjacent unvisited vertex. Mark it as visited. Display it. Push it in a stack.If no adjacent vertex is found, pop up a vertex from the stack. (It will pop up all the vertices from the stack, which do not have adjacent vertices.)Repeat Rule 1 and Rule 2 until the stack is empty.Let us ...
Read MoreAVL Rotations in Javascript
To balance itself, an AVL tree may perform the following four kinds of rotations −Left rotationRight rotationLeft-Right rotationRight-Left rotationThe first two rotations are single rotations and the next two rotations are double rotations. To have an unbalanced tree, we at least need a tree of height 2. With this simple tree, let's understand them one by one.Left RotationIf a tree becomes unbalanced, when a node is inserted into the right subtree of the right subtree, then we perform a single left rotation −In our example, node A has become unbalanced as a node is inserted in the right subtree of ...
Read MoreAVL Tree class in Javascript
Here is the complete implementation of the AVL Tree Class −Exampleclass AVLTree { constructor() { // Initialize a root element to null. this.root = null; } getBalanceFactor(root) { return this.getHeight(root.left) - this.getHeight(root.right); } getHeight(root) { let height = 0; if (root === null || typeof root == "undefined") { height = -1; } else { height = Math.max(this.getHeight(root.left), this.getHeight(root.right)) + 1; } ...
Read MoreGraph Traversals in Javascript
Graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph. Such traversals are classified by the order in which the vertices are visited.
Read MoreNode in Javascript
Each element in a tree is a node. We need to define a node before we proceed to define a binary tree as a tree consists of nodes. We'll create a very simple node definition that has 3 properties, namely: left, right and data.left − This holds the reference to the left child of this node.right − This holds the reference to the right child of this node.data − This holds the reference to the data we want to store in this node.Let us see the code representation of such a structure.Examleclass Node { constructor(data, left = null, right ...
Read MoreInserting a key into a tree in Javascript
The first insertion in a newly created binary tree creates a node at the root. Further insertions will be inserted according to the binary search tree property of left children being smaller than parent and right ones being greater than parents.Let us look at how we can implement this algorithm in code −ExampleinsertIter(data) { let node = new this.Node(data); // Check if the tree is empty if (this.root === null) { // Insert as the first element this.root = node; return; } let currNode = this.root; ...
Read More