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 1822 of 2547
Golang Program to Create an Interface Named Animal That Defines a Speak Method
The speak method in golang is obtained by the customized functions that you can define to achieve a specific functionality. Speak is a user-defined function that performs the task for which it is created. In this article, we are going to create an animal interface that defines the speak method. This interface serves as a blueprint for any type that wants to be considered an animal and provides a contract for implementing the Speak behavior. Here we are going to use three different methods: direct interface implementation, struct embedding as well as interface assertion along with examples to elaborate the ...
Read MoreGolang Program That Creates a Channel of Type String And a Goroutine That Sends a Message to The Channel Every 2 Seconds
In Go, channels are a capable highlight for concurrent programming, empowering communication and synchronization between goroutines. In this article, we are going to investigate how to form a channel of sort string in Go and utilize a goroutine to send messages to the channel at normal intervals of 2 seconds. We are going to give a step-by-step exhibit of the program, displaying the utilization of channels and goroutines. Syntax time.NewTicker(time.Second) The Syntax time.NewTicker(time.Second) is used to create a new Ticker value from the time package in Go. time.Sleep(duration) The Syntax time.Sleep(duration) is used to pause the execution of a ...
Read MoreGolang Program to Check if a Binary Tree is a Binary Search Tree
A binary tree is a tree having at most two children whereas a binary search tree is the tree in which the elements in the left side of the tree are less than the elements in the right side of the tree. In this article, we will write Go language programs to check if a binary tree is a binary search tree. Here we will use different examples to provide a better understanding of the concept. Algorithm Step 1 − Create a Node struct with three fields the data of the node of type int, Left and right subtree ...
Read MoreGolang Program to Print The Height of a Binary Tree
A binary tree is a tree which has at most two children and height refers to the no. of levels in the tree. In this article, we will use two examples to find the height of a binary tree. In this Golang article we will write programs to print the height of a binary tree. Syntax func append(slice, element_1, element_2…, element_N) []T The append function is used to add values to an array slice. It takes number of arguments. The first argument is the array to which we wish to add the values followed by the values to add. ...
Read MoreGolang Program to Merge Two Sorted Linked Lists
In this article, we will write Go language programs to merge two sorted linked lists. A linked list is a set of two fields with the value that is the data and the next pointer which points to the next node in the list. A linked list is a dynamic data structure with two pointers head and tail, where head points to the first value and tail points to the last value. Here, we will use two examples to merge the sorted linked list. Demonstration This demonstration represents two sorted linked lists “LIST1” and “LIST2”. we need to merge these ...
Read MoreGolang Program To Print Descending Order Pattern
In this Go language article, we will write programs to print descending order patterns using a nested for loop as well as using the two nested loops inside the outer loop. Descending order pattern means the higher order elements are placed first and in pattern the rows with highest no. of rows is placed first. Demonstration This demonstrates a descending order pattern where every row starts from 1 and decreases by 1 at each column until the end of row. In the top row it has 1-6 numbers and in second row it has 1-5 and it goes on till ...
Read MoreGolang Program to Print Right Pascals Triangle
A pascals triangle is a form of triangle in which binomial coefficients are arranged in triangular form. Here, the triangle starts with 1 and in every row the beginning and ending digit is 1. In this article, we will write Golang programs to print right pascals triangle. Demonstration This demonstration explains a right pascal triangle, in which every row shows the coefficient of binomial expansion for the power of (a+b)^n, where a and b =1. The first row has single 1, second row has 1 and 1 , the third row has 1, 2 and 1 and so on. 1 ...
Read MoreGolang Program to Build Right Triangle Using Numbers
In this article, we will write Golang programs to build a right triangle using numbers. The numbers imply that the triangle is composed of numbers. There are many ways to perform this operations, here we have used different examples to provide a better understanding of the concept. Demonstration This demonstration explains a right angled triangle representation using numbers. Each row of this triangle is consist of number starting from 1 to the row number. From top the first row has 1, second row has 1, 2 and it goes on. 1 1 2 1 2 3 1 ...
Read MoreGolang Program to Count no. of Numerical Digits in a String
A Golang string is a sequence of characters created using quotes. Strings are immutable here, which means once created cannot be modified. Here we will work on strings to find numerical digits present in them.In this article, we will write a Go language program to count no. of numerical digits in a string. Demonstration This demonstration explains that “helloalexa234567playthesong” is an input string and it contains six numeric digits, the role of the program is to tally all the numeric digits available in the provided string. Input string − helloalexa234567playthesong Number of Numeric Digit − 6 Syntax unicode.IsDigit() ...
Read MoreGolang Program to Create Slice of Slices
A slice in go language is a variable length array which means that values can be added and deleted from it as per convenience. In this article, we will create a slice of slices using two examples, slice of slices means that many slices are contained in a slice. In the first example, we will demonstrate the creation of slice of slices in two ways, firstly we will initiate the slice of slices with some values and in the second way an empty slice of slices will be created in which values will be appended later on. In the second ...
Read More