Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
MS Excel is one the important tool of the MS Office suite. MS Excel is the best tool to interpret and analyze the large voluminous of data. In this article, the user will learn how to look up a value and return the cell address in Excel. This article demonstrates a simple example, by providing a data value, and looking at it from the provided table range, and finally printing the cell reference to the cell. The user define formula is used in the example to achieve the required result Example 1: To look up a value and ... Read More
In this article, the user will learn how to make a cumulative average chart in Excel. The different types of charts are presented in MS Excel to visualize the data and interpret the result. This article contains an example to calculate the cumulative average chart, as required in the provided task. The cumulative average chart denotes the average of all previous values up to that certain point. If the new data points would be added then the cumulative average would be recalculated. Example 1: To calculate the average of cumulative sum chart in excel Step 1 Assume the provided ... Read More
In Excel, sometimes the user needs to search for a specific value that only partially matches the data in a range. This can be done using the powerful combination of the INDEX and MATCH functions. By leveraging these functions, the user can easily perform partial string matching to retrieve desired information from our Excel spreadsheets. Here, will be using a simple example to demonstrate the process of looking at partial string matching in Excel. Example 1: To look up the partial string match in Excel by using the user-defined formula. Step 1 In this example, the user will learn ... Read More
Count hubs having Bitwise XOR of all edges in their way from the root equivalent to K We attempt to decide the quantity of hubs in a given tree where the bitwise XOR of all edges along the way from the root to that hub rises to a given worth K. This is known as the issue of counting hubs having the bitwise XOR of all edges in their way from the root equivalent to K. This thrilling point involves productively registering the XOR values along every way from the root to the hubs while crossing the tree. In this ... Read More
We are investigating the creation of N-length permutations utilising vowels in the context of this issue. The orderly arrangement of elements is referred to as a permutation. The letters A, E, I, O, and U are the vowels on which this article focuses. Finding every combination of these vowels that has a length of N is the goal. Vowels must occupy N locations in each permutation, and repetitions are permitted. Consider the permutations AAA, AAE, AIA, AOU, etc. if N is 3, for example. Calculating and compiling each of these singular permutations for a specified N are required for the ... Read More
Finding out if it is possible to extract two equal sum components from a graph by eliminating edges from a cycle is the main question in graph theory. To determine which edges should be removed from the graph, it is essential to locate the cycle inside the graph. The main goals are to analyse the graph's structure, show that this transformation is possible, and explain how the graph's cycles, edges, and component sums interact. We may assess whether the graph has the capacity to produce two unique components with equal sums through edge removal from a cycle by carefully evaluating ... Read More
N-ary trees are fundamental hierarchical structures with numerous offspring in data structures and algorithms (DSA). It is an interesting task to build a N-ary tree with the restriction that no two adjacent nodes have the same weight. This article investigates a methodical method to build such a tree from a set of weights. We will go into the fundamental data structures and algorithms needed for this task, offering a thorough manual to put the answer into practice. This distinctive tree form is a key idea in DSA because of its numerous applications in fields including scheduling, decision-making, and optimization. ... Read More
The constructed graph may be a non-repetitive hub course of action where no two adjoining hubs share the same esteem. Each hub speaks to a special value, and interfacing edges connect hubs without rehashing values. This chart embodies a design where differing qualities and uniqueness are prioritized, guaranteeing that neighboring hubs are continuously diverse from each other. By following this run of the show, the chart cultivates a locked-in and outwardly unmistakable representation, which can be pertinent in different areas like organizational planning, information visualization, or asset allotment. Its structure dodges dull groupings and advances a dynamic and shifted association ... Read More
We’ve all wanted to add additional effects to our presentation or to a video. These effects help us in better present our product or helps increase user experience. And in this tutorial, you will learn how to implement the snow effect using the arcade module. You can use this in your games to create a snow drizzle or a rain drop effect. You can even go ahead and set it up as a screen timeout effect. That being said, let us get started! Getting Started Throughout this tutorial, we will be using the arcade module that helps users create game ... Read More
Every triplet of vertices in a graph is checked to see if two of them are directly connected to the third. This property is important because it shows that the vertices are strongly interconnected, promoting a network with many connections. Applications requiring effective and direct connections between entities, such as social networks, transportation networks, and communication networks, all depend on this connectivity. The overall structure of the graph can be evaluated for its connectivity and potential impact on the system it represents by confirming this condition for each vertex triplet. This helps to analyse and optimise the network's performance and ... Read More