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
How to Become an Agile Practioner?
Agile development is an approach for creating software that puts a focus on adaptability, teamwork, and quick iterations. It is a relatively new method that has recently experienced a surge in popularity and has significantly altered how software is made. Agile development, which emphasises flexibility, adaptability, and cooperation, is also referred to as the art of adjusting to change and innovation. Agile Practitioner An Agile practitioner is a skilled professional with a mindset that embraces new opportunities and adapts easily to change, following the values and principles outlined in the Agile Manifesto. They possess comprehensive knowledge of Agile techniques, including ...
Read MoreHow is Agile Engineering Different from Agile Software Development?
Agile methodology focuses on customer satisfaction. Its flexibility & rapid feedback cycles are the main reason for its high-quality production. These are two sides of the Agile method & they are Agile Engineering and Agile Software Development. Here we will examine the differences between these two terms of Agile Engineering. Also, highlight their characteristics. Agile Software Development: A Brief Overview Agile Software Development is a set of techniques. All these methods concentrate on delivering high-quality software. Also, produce them in a timely & cost-effective manner. It highlights collaboration, frequent iterations, and a customer-centric approach. The goal is to develop the ...
Read MoreHaskell Program to Find the Product of Two Numbers Using Recursion
In Haskell, we can find the Product of Two Numbers by using recursion along with recursive repeated addition. In the first example we are going to use (product' x y | y == 0 = 0 | y == 1 = x | otherwise = x + product' x (y-1)) function. And in the second example, we are going to use recursive repeated addition. Algorithm Step 1 − The recursive product’ function is defined as, For example 1 and 2 − product' x y | y == 0 = 0 ...
Read MoreHaskell Program to Find Sum of Digits of a Number using Recursion
In Haskell, we can find Sum of Digits of a Number by using recursion along with mod, div and other helper functions. getCurrentTime and NominalDiffTime function. In the first example we are going to use (sumOfDigits n | n < 10 = n | otherwise = (n `mod` 10) + sumOfDigits (n `div` 10)) function. And in the second example, we are going to use helper function. Algorithm Step 1 − The recursive sumOfDigits function is defined as, For example 1 − sumOfDigits n | n < 10 = n ...
Read MoreHaskell Program to Calculate the Execution Time of Methods
In Haskell, we can use getCurrentTime and NominalDiffTime functions to calculate the Execution Time of Methods. In the first example we are going to use (startTime
Read MoreHaskell Program to Reverse a Sentence Using Recursion
In Haskell, we can reverse a Sentence by using recursion along with concatenation and also by using list comprehension. In the first example we are going to use recursion along with base and recursive case and in the second example, we are going to use concatenation as ((last sentence) : reverseSentence (init sentence)) and in third example, we are going to use list comprehension as, reverseSentence s = [s !! i | i String reverseSentence [] = [] reverseSentence sentence = (last sentence) : reverseSentence (init sentence) main :: IO () main = do let ...
Read MoreHaskell Program to Find G.C.D Using Recursion
In Haskell, we can find G.C.D by using recursion and also by using recursive case statements. In the first example we are going to use recursion along with base and recursive case and in the second example, we are going to use (case (x, y) of) statement. Algorithm Step 1 − The user defined recursive gcd’ function is defined as, For example 1 − gcd' x y | y == 0 = x | otherwise = gcd' y (x `mod` y). For example 2 − ...
Read MoreHaskell Program to Find Factorial of a Number Using Recursion
In Haskell, we Find Factorial of a Number Using Recursion by using recursion along with foldl and product function. In the first example we are going to use recursion along with base and recursive case and in the second example, we are going to use factorial n = foldl (*) 1 [1..n] function and third example, we are going to use factorial n = product [1..n] function. Algorithm Step 1 − The user defined recursive factorial function is defined as, For example 1 & 2 − factorial 0 = 1 factorial n = n * factorial ...
Read MoreHaskell Program to Check Whether a Number can be Expressed as Sum of Two Prime Numbers
In Haskell, we will Check Whether a Number can be Expressed as Sum of Two Prime Numbers by using user-defined functions. In the first example we are going to use (isPrime) function along with primeSum function and in the second and third example, we are going to use (isPrime) function along with isSumOfTwoPrimes function. In the following examples, the function isPrime checks whether a given number is prime or not. It first checks if the number is less than or equal to 1, in which case it returns False. It then checks if the number is 2, in which case ...
Read MoreHaskell Program to Check if An Array Contains a Given Value
In Haskell, we will Check if An Array Contains a Given Value by using recursion and foldr & elem functions. In the first example, we are going to use base and recursive cases and in the second example, we are going to use (containsValue x = foldr (\y acc -> acc || x == y) False) function. And in the third example, we are going to use (containsValue val arr = elem val arr) function. Algorithm Step 1 − The recursive containsValue function is defined as, For example 1 − containsValue _ [] = False containsValue ...
Read More