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
Server Side Programming Articles
Page 1638 of 2109
Atomic Variable in Golang
Atomic Variable in Golang offer an alternative to use locks or other synchronisation primitives to execute atomic operations on shared variables. When programming concurrently, synchronisation and mutual exclusion are essential to ensuring that threads or processes can access shared resources without interfering with one another. The fast and scalable synchronisation and coordination of concurrent access to shared variables is made possible by the use of atomic variables. What is an Atomic Variable? An atomic variable is a shared variable that may be read from and written to simultaneously by several goroutines while still ensuring that all actions are atomic. The ...
Read MoreAnonymous Structure and Field in Golang
Anonymous structures and fields in Golang are a powerful feature that can be used to simplify and improve the readability of your code. These constructs allow you to define new data types on the fly without having to create a new named struct. Let's examine anonymous fields and structures in Go in more detail. What is an Anonymous Structure? In Go, a structure is a collection of fields that can be used to define a new data type. Normally, you would define a named structure like this − type Person struct { Name string ...
Read MoreHaskell Program to convert Hexadecimal to Decimal
This tutorial will help us to creat a haskell program that can covert a given hexadecimal number to a decimal number using revers, map and fold1 functions Hexadecimal to decimal conversion is the process of converting a number from the hexadecimal number system to the decimal number system. The hexadecimal number system uses a base of 16, which means that there are 16 unique symbols used to represent numbers in this system (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F). The decimal number system, on the other hand, uses a base of ...
Read MoreHaskell Program to convert Decimal to Octal
We can convert the Decimal number to an Octal using the recursion and unfoldr function of Haskell. Decimal to octal conversion is a process of converting a decimal (base-10) number to its equivalent representation in octal (base-8) numbering system. In decimal numbering system, we use 10 digits (0 to 9) to represent a number. In octal numbering system, we use 8 digits (0 to 7) to represent a number. To convert a decimal number to its equivalent octal representation, we divide the decimal number by 8 repeatedly until the quotient becomes 0, and keep track of the remainders. The remainders, ...
Read MoreHaskell Program to Print Hollow Right Triangle Star Pattern
In Haskell we can use the replicate function and recursive function to create a hollow right triangle star pattern. A hollow right triangle star pattern is a pattern made up of asterisks (*) that forms a right triangle shape with empty spaces in the middle as shown below. ** * * * * * * * * * * * * ******** The shape is created by printing asterisks in a specific order, with the number of asterisks in each row increasing as the ...
Read MoreHaskell Program to Print 8-Star Pattern
In this tutorial, we are going to learn how to develop a Haskell program to print 8 start patterns using the internal replicate and concat function. An '8' star pattern is an ASCII art representation of the number 8 using asterisks. as shown below − ******** * * * * ******** * * * * ******** The asterisks are arranged in such a way that they form the shape of the number 8. Algorithm Step 1 − ...
Read MoreHaskell Program to Create Pyramid ‘and’ Pattern
In this tutorial, we are going to understand how to develop a Haskell program that will create a pyramid pattern of ‘&’ using mapM, forM, and recursive function. A pyramid ‘&’ pattern is a design or arrangement of ‘&’ or other symbols in the shape of a pyramid as shown below. & &&& &&&&& &&&&&&& &&&&&&&&& It is created by printing ‘&’ or symbols in multiple rows, starting from the top and moving downwards. Each row contains one more symbol than the previous row, creating the illusion of ...
Read MoreHaskell Program to Print Star Pascal’s Triangle
In Haskell we can use mapM function and forM function to print a star Pascal’s Triangle. A star Pascal's triangle is a variation of the traditional Pascal's triangle that uses asterisks (or stars) instead of numbers to form a triangular pattern as shown below. * * * * * * * * * Pascal's triangle is a triangular array of numbers, where each number in the triangle is the sum of the two numbers above it. In ...
Read MoreHaskell Program to Print Upper Star Triangle Pattern
This tutorial will help us in printing the upper star triangle pattern using mapM function, forM function, and unliness functions in Haskell. An upper star triangle pattern is a graphical representation of a triangle made up of asterisks or stars as shown below. * ** *** **** ***** It's called an "upper" star triangle because the triangle starts at the top and the number of stars in each row decreases as we move down the triangle. Algorithm Step 1 − We will start with defining a user-defined function as printStars function. Step 2 − Program execution will be ...
Read MoreApplications, Advantages and Disadvantages of Deque
Deque or double ended queue is a sequential linear collection data queue that provides the function like a double-ended queue. In this data structure the method does not follow the First In First Out (FIFO) rule for data treatment. This data structure is also known as double-ended queue because the elements are inserted to the end of the queue and removed from the front. For a deque we can add and remove data only from both ends. The time complexity of the deque operation is O(1). There are two types of deque − Input Restricted Restriction at a ...
Read More