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
Programming Articles
Page 1834 of 2547
Check if a Character is Only Occurring as One Single Contiguous Substring or Not
In this problem, we will check whether all characters are present continuously in the given string. We will use the map data structure to solve the problem. The map will keep track of the last index of the particular character, and based on the last index of the current character, we will decide whether the string contains contiguous characters. Problem statement – We have given a string alpha of length N containing the lowercase and uppercase alphabetical characters. We need to check whether the given string is contiguous. The string is contiguous only if it contains all characters as a ...
Read MoreShortest path in a graph from a source S to destination D with exactly K edges for multiple Queries
Finding the shortest route between a source vertex and a target vertex in a graph with precisely K edges is one of the most typical graph traversal issues. The objective is to find the shortest path with minimum weight and exactly K edges. This issue can manifest in a number of practical contexts, including transportation networks, routing protocols, and resource allocation. Dynamic Programming (DP), and Dijkstra's Algorithm are just some of the strategies that may be used to attack this issue. The shortest path under the given constraints can be found using one of many methods. Dijkstra's Algorithm takes into ...
Read MoreBreadth First Search without using Queue
Breadth To begin with, Look (BFS) may be a chart traversal calculation utilised to investigate hubs in a chart in a breadthward movement. The normal usage of BFS utilises a line information structure to keep track of hubs to come. In any case, it is conceivable to execute BFS without utilising an unequivocal line by utilising other information structures. One elective approach to actualizing BFS without a line is to utilise two clusters or records: one for the current level of hubs being investigated and another for the next level of hubs to be investigated. At first, the current level ...
Read MoreHaskell Program to Check if a String is Numeric
In Haskell we can use read functions and Data.char library to find if a given string is numeric or not. The following example will give you a clear idea about the valid numeric values. For example, 121, 12321, and 1221 if entered as string are valid numeric values. Algorithm Step 1 − The isNumeric function using reads function is defined Step 2 − Program execution will be started from main function. The main() function has whole control of the program. It is written as main = do. In the main function, the string is passed to the isNumeric function. ...
Read MoreMultistep Processing of a User Program
The computer system must convert a user's high-level programming language program into machine code so that the computer's processor can run it. Multistep processing is the term used to describe the several processes involved in converting a user program into executable code. A user program will often go through a number of various phases during its multistep processing, including lexical analysis, syntactic analysis, semantic analysis, code creation, optimization, and linking. In order to convert the user program from its high-level form to machine code that can be run on a computer system, each of these stages is essential. User ...
Read MoreObject Compression in Java with Examples
Object Compression in Java Java objects can be stored and transmitted more easily by using a method called Java Object Compression to shrink their size. The object will be compressed using a variety of classes and methods during this process, which can greatly decrease the size of the data. The complete amount of information can be retrieved by the recipient by decompressing the compressed object after it has been sent. When dealing with scarce resources, such as network bandwidth or disc space, this method can be helpful. In this article, we will learn more about Java object compression. What ...
Read MoreGolang program to create filter for the Employees
Go Language allows you to apply a filter on particular data for analyzing specified data, work on a particular property of data, data integration and more.In this article we are going to write a program to create a filter for the employees, using iterative filtering, functional filtering, as well as using go language built in filtering function. Syntax filtered := funk.Filter(collection, func(item Type) bool {…}) collection = It is the original collection to filter. This function takes two arguments, a collection and a filtering function. Algorithm Make ...
Read MoreData Distribution in Cassandra
Data distribution is done through consistent hashing to make the data evenly distributed across the nodes in a cluster. Instead of getting rows of table on a single node, rows gets distributed across the clusters which make the load of table data get evenly divided. The partition key is used to distribute data among nodes and determine data locality. In Cassandra, data distribution and replication work together. Mainly depends on three things i. e. partition key, key value, and token range. Cassandra Table This table consists of two rows in which one row has four columns followed by ...
Read MoreDouble Buffering
Double buffering is essential for improving user experience and performance. This method is extensively used to reduce delays, increase performance, and enable smooth multitasking in database management systems, streaming media applications, and graphics rendering. In order to optimise data transit and processing, double buffering is used which is a programming approach that uses two buffers or temporary storage spaces. It enables the execution of input and output processes simultaneously, thereby minimising delays and enhancing system performance as a whole. Double buffering allows for efficient multitasking and effective resource management by using one buffer for data storage while the other ...
Read MoreMinimum Cost to Reverse Edges such that there is Path Between Every Pair of Nodes
The minimum cost to invert edges in order to have a way between each match of hubs alludes to finding the slightest costly way to alter the course of edges in a chart. The objective is to guarantee that there's a way to interconnect any two hubs within the chart. This may involve changing the course of a few edges to set up the network. The least taken toll speaks to the smallest cumulative weight related to reversing the edges. By minimising the fetch, we are able to accomplish the specified result of having a way between all sets of ...
Read More