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 1838 of 2547
Golang Program to Create Two Goroutines
When working with go language there may be instances where you need to create two goroutines for parallel processing, asynchronous operations and more. In this go language article we will explore how to create two goroutines using anonymous functions, named functions as well as using function calls.In golanguage a goroutine is an independent concurrent function, it enables concurrent programming by allowing the functions to run concurrently. Syntax time.Sleep(duration) It is a built-in go language function used to pause the execution of a program. It ...
Read MoreGolang Program to Creates a Unidirectional Sending Channel and Passes it to a Function that Returns a Unidirectional Receiving Channel
A unidirectional sending channel is used to send the values to the channel, while the unidirectional receiving channel is used to receive the data from the channel. These channels are used in concurrent data processing, data sharing and more. In this golang article we are going to create a program to create a unidirectional sending and pass it to a function that returns a unidirectional receiving channel using function parameters, type conversion as well as channel composition. Algorithm Define the sender Function that accepts a send-only channel named “ch” of type integer. ...
Read MoreGolang Program to Find Average Paid Employee
It is very important to know about the average salary paid to an employee in an organization for analysis, research and rewards. In this article we are going to find out the average employee salary in go language using iteration, reduce function as well as goroutines and channels. Algorithm CalculateAverage is a function that accepts a slice of float64 values salaries as input and returns a float64 value. Set the total to 0 and count the length of the salary slice. Using a ...
Read MoreCheck if Alternate Paths Exists from U toV with Smaller Individual Weight in a given Graph
In graph analysis, one common job is determining whether or not there is a path from node U to node V that has a lower total weight than the one currently being used. Checking for other paths between nodes that have a lower total weight than the current path is what this entails. The Floyd−Warshall and Bellman−Ford algorithms are two methods that are often utilised. The Floyd−Warshall technique calculates the cost of traversing any pair of nodes in order to compare various routes through a graph. However, by determining the shortest routes from a single source node to all other ...
Read MoreCheck if a Cycle of Length 3 Exists or Not in a Graph that Satisfy a given Condition
To check in the event that a cycle of length 3 exists in a chart fulfilling a given condition, ready to repeat through each vertex and look at its neighbouring vertices. On the off chance that a vertex has two neighbours that are too associated, a cycle of length 3 exists. This condition guarantees that there's an edge between the two neighbours, creating a triangle. By filtering all vertices and their adjoining vertices, we will recognise whether such a cycle exists or not. In the event that we discover a vertex with two associated neighbours, we are able to conclude ...
Read MoreAdd and Remove Vertex in Adjacency Matrix Representation of Graph
Including a vertex within the contagiousness network representation of a chart means expanding the measure of the network by one push and one column. The unused push and column speak to the associations of the recently included vertex with the existing vertices. Additionally, expelling a vertex requires evacuating its comparing push and column from the contagiousness lattice, subsequently altering the measure of the network in like manner. Including a vertex includes adding a push and column with beginning values of 0, whereas evacuating a vertex includes erasing the comparing push and column, viably decreasing the measure of the lattice. Methods ...
Read MoreAdd and Remove Edge in Adjacency List Representation of Graph
Adjacency lists effectively store graph relationships. Graph algorithms and operations use it. Adding and deleting edges can dynamically change the connections between vertices. Graph modification, connection analysis, and evolution need this procedure.Adding and deleting edges link and detach vertices, respectively. The adjacency list representation commonly performs these actions by altering the vertices' adjacency lists. Using a vector of vectors, sets, or maps of sets may change the implementation.New edges create pathways and linkages in the graph. However, removing edges breaks connections, changing graph structure and dynamics. These procedures are essential for graph adjacency list integrity and evolution. Methods Used ...
Read MoreEncapsulation of Operations and Persistence of Objects
Encapsulation of Operations Encapsulation of operations refers to the behavior of objects in object−oriented database systems(ODBS)through the responsibilities that can be carried out. Objects can be created, changed, retrieved, or deleted by the use of encapsulation of operations. Customers simply receive knowledge of the operations like interface or signature and aren't made privy to how those operations are honestly achieved. The implementation includes the specification of any hidden internal information systems in addition to the common sense that determines the operations, while the interface presents the call and parameters of each action. ODBs offer a sure stage of abstraction ...
Read MoreImplementation of a CNN based Image Classifier using PyTorch.
Introduction Due to its capacity to recognise spatial characteristics in images, convolutional neural networks (CNNs) have been extensively used in image classification applications. A well-liked open-source machine learning package called PyTorch offers assistance in creating and honing neural networks, including CNNs. In this article, we'll go over how to use PyTorch to create a CNN-based image classifier. Dataset Let's first talk about the dataset before getting into the specifics of the implementation. The CIFAR-10 dataset, which has 60, 000 32x32 color images divided into 10 classes with 6, 000 images each, will be the one we use for this course. ...
Read MoreBuild a Calculate Expression Game in Java
The task is to build an application which displays an expression and prompts for the answer. Once you enter the solution a new expression is displayed and these expressions keep on changing. After a certain amout of time the solution given for the respective application were evaluated and the total number of accurate answers were displayed. Methods (User defined) in the Game The section will walk you through the methods (and constructor) that are part of the implementation and their roles in the “Calculate Expression Game”. CalculateExpressionGame() This is the constructor of the calculateExpressionGame class. It sets up the ...
Read More