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 1940 of 2547
Haskell Program to read coordinate points and determine its quadrant
This tutorial will help us in reading the x and y coordinates and determine its quadrant. If both the coordinates are positive, the point lies in first quadrant; if x coordinate is positive and y coordinate is negative, the point lies in fourth quadrant ; if x coordinate is negative and y coordinate is positive, the point lies in second quadrant and if both the coordinates are negative, then point lies in third quadrant. Algorithm Step 1 − The quadrant function is defined using certain conditions on x and y coordinates. Step 2 − Program execution will be ...
Read MoreHaskell Program to calculate the volume and area of Sphere
This tutorial will help us in calculating the volume and area of Sphere. The volume of a sphere is a measure of the amount of space inside the sphere. And area involves the surface area of the sphere. Method 1: Using the User-defined Function In this method, we will see two examples where we have used user-defined function with different techniques. Algorithm Step 1 − The Text.Printf module is imported. Step 2 − The volume and area functions are defined on the basis of simple mathematical formula as volume r = (4.0 / 3.0) * pi * (r ^ ...
Read MoreHaskell Program to calculate the volume and area of Cone
This tutorial will help us in calculating the volume and area of the Cone. The volume of a cone is a measure of the amount of space inside the cone. And area involves the surface area of the cone that is obtained from the lateral area of a cone. The formula for the volume of a cone is V = (1/3) * π * r^2 * h, where r is the radius of the base of the cone, h is the height of the cone, and π is approximately equal to 3.14. And the formula for the surface area of ...
Read MoreHaskell Program to calculate the volume, diagonal, and area of Cuboids
This tutorial will help us in calculating the volume, diagonal, and area of the Cuboids. The volume of a cuboid is a measure of the amount of space inside the cuboid. And area involves the surface area of the cuboid. The diagonal of a cuboid is a line segment connecting two opposite vertices of the cuboid. It is also known as the "space diagonal" or "body diagonal" of the cuboid. Algorithm Step 1 − The volume, diagonal and area functions are defined on the basis of simple mathematical formula as volume l w h = l * w ...
Read MoreHaskell Program to calculate the volume and area of the Cylinder
This tutorial will help us in calculating the volume and area of the Cylinder. The volume of a cylinder is a measure of the amount of space inside the cylinder. The area involves the surface area of the cylinder. The formula for the volume of a cylinder is the product of the base area of the cylinder, which is given by πr^2 and the height h. The formula for the surface area of a cylinder is the sum of the areas of the two circular faces and the area of the rectangular lateral surface. Algorithm Step 1 − The ...
Read MoreHow does tuple destructuring work in TypeScript?
In TypeScript, a tuple is an object which contains the values of different data types. The length of a tuple is always pre-defined. It is similar to an array, but the array contains the values of only one data type, and the tuple contains values of multiple data types. Destructuring the tuple means getting the values from the tuple in separate variables. For example, we need to use tuple values multiple times in the code block. We can get all values in separate variables and use variables whenever we require tuple values, rather than every time accessing values from tuple ...
Read MoreHow to make object properties immutable in TypeScript?
The simple definition of the immutable object property is the properties we can’t modify once we define and initialize the object property. We can use the const keyword, but we have to initialize the property while creating the property. So, we have to use the readonly keyword to make the property immutable, allowing it to be read-only. So, once we initialize the property, we can’t modify the value of the property. Syntax Users can follow the syntax below to use the readonly keyword to make object properties immutable. interface test { readonly property1: boolean; } var object: ...
Read MoreHow to create a stack in TypeScript using an array?
The stack is a data structure based on the LIFO, which means last in, first out. In brief, it says that whatever element you add at last in the stack comes out first from the stack. There are some basic operations that users can perform on the stack. For example, we can push an element to the stack, pop an element from the stack, or peek an element from the stack. Here, users can see the basic methods of the stack, which we will also implement while creating the stack in this tutorial. Stack Methods Push() − It allows ...
Read MoreHow to create a queue in TypeScript using an array?
We will learn to create a queue from scratch using the array in TypeScript in this tutorial. The Queue is a data structure allowing users to add elements from the end and remove them from the start. It means it works based on the FIFO concept, meaning first in, first out. Also, we can’t remove the element randomly from the queue like an array. We can only remove elements from the first index and add them to the last empty index. Here, we will use some concepts of object-oriented programming language to create a queue using an array. Methods of ...
Read MoreTackling recursion (not just) in Typescript
Recursion is a fundamental programming concept that refers to a function calling itself. It can be a powerful tool for solving problems, but it can also be a source of confusion and frustration, especially for beginners. In this tutorial, we'll explore how to use recursion effectively in TypeScript, a popular superset of JavaScript that adds optional static typing and other features. One important thing to keep in mind when working with recursion is to define a base case, which is a condition that stops the function from calling itself again. Without a base case, the function will keep calling itself ...
Read More