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
Articles on Trending Technologies
Technical articles with clear explanations and examples
Haskell 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 MoreJava Program to Demonstrate How User Authentication is Done
Authentication refers to the process of verifying the identity of an individual to make sure the user is exactly who they are claiming to be before giving access to a system. It is very important to authenticate a user to ensure the security as well as integrity of the system. Over the course of time, authentication has developed into much more advanced and secure methods. The methods of authentication now range from credentials like user id, password and OTP to finger print scan, face ID scan and much more. Authentication ensures that no sensitive resources are being shared with unauthorised ...
Read MoreWhich Language Can Replace Java?
Java is a high-level object-oriented programming language that offers a class-based development approach, enabling the creation of software solutions with minimal dependencies. It is a versatile language that provides several benefits, including simplicity, platform orientation, security, and cost-effectiveness in terms of hardware resources. Additionally, Java is known for its stability and reliability. However, there are some disadvantages of using Java, such as high memory consumption, unattractive graphical user interfaces, and complex coding requirements. Pros and Cons of Java Pros of Java Memory Safety − Java eliminates the risk of null pointer exceptions, dangling pointers, and memory leaks, which are ...
Read MoreWhat Basic Understanding of Java is Required for Android Programming?
With billions of devices running on it worldwide, Android is among the most popular mobile operating systems. You'll need to have a firm grasp of the Java programming language if you're interested in creating mobile apps for Android. We'll examine the fundamental Java ideas required for Android programming in this article. Understanding the Java Language Android apps are created using Java, a high-level programming language, which is used to create a variety of applications. Being an object-oriented language, it groups data into objects with attributes like properties and methods. Java is also platform-independent, thus programmes written in it can ...
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