Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
In digital electronics, a counter is a type of sequential circuit which is made up of flip-flops and is used to count number of clock pulses or events occur over time. There are two major types of counters namely, binary counter and non-binary counter. This article is meant for explaining concept of non-binary counter, its types, design procedure, applications, etc. So let’s begin with the basic definition of non-binary counter. What is a Non-Binary Counter? The type of digital counter that uses a number system (such as base 3, base 7, base 10, etc.) except the binary number system (base ... Read More
In industries, master-slave digital clock is a digital clock system widely used for precise and coordinated time-keeping. In this article, we will discuss the construction, working, advantages, and applications of the master slave digital clock. Thus, let us start with the basic introduction of the master-slave digital clock. What is a Master-Slave Digital Clock? A type digital clock system which consists of a master-clock and one or more slave-clocks is referred to as a master slave digital clock. The master clock performs a function of sending a timing signal to the slave clocks, so that the slave clocks can ... Read More
A digital counter is a sequential logic circuit which counts the number of clock pulses or events that occur over time. Now, let us discuss the lockout condition in counter. What is Lockout Condition in Counter? In digital counters, the condition wherein the counter enters to an unused state and rather than coming out of this unused state to a valid state or initial state, it switches to another invalid or unused state and gets stuck up in the cycle of unused states only, is known as the lockout condition in the counter. Therefore, in the case of lockout condition, ... Read More
What Is List? Lists are constructed using square brackets. The list is the most powerful tool in Python because it does not have to be homogeneous. Integers, Strings, and Objects can all be found in the same list. Because lists are mutable, they can be changed even after they are formed. One of the most important aspects of Python lists is their capacity to include duplicate values. This enables us to loop through the list's entries and find the value of each one. If the value needs to be replaced, we replace it. There will be instances when you ... Read More
In haskell we can use mapM, forM as well as recursive function to create a simple right triangle star pattern. What is a Right Triangle Star Pattern? A right triangle pattern is a series of asterisks or other characters arranged in a triangular shape. In the case of a right triangle pattern, the base of the triangle is the longest side and is aligned with the horizontal axis, while the other two sides form a right angle. The number of asterisks or characters in each row of the triangle decreases as you move up the triangle, so that the top ... Read More
In haskell we can use list comprehension and brute-force method to find the perfect number. What is a Perfect Number? Perfect numbers are positive integers that are equal to the sum of their proper divisors. A divisor of a positive integer n is a positive integer that divides n exactly, leaving no remainder. A proper divisor is a divisor of n that is less than n itself. For example, the proper divisors of 6 are 1, 2, and 3, and the sum of these divisors is 1 + 2 + 3 = 6. Therefore, 6 is a perfect number.. Algorithm ... Read More
To check whether a given number is prime or not we are going to use mod function and list comprehension method in Haskell. What is a Prime Number? A prime number is a positive integer greater than 1 that is only divisible by 1 and itself. In other words, a prime number cannot be written as the product of two smaller positive integers, except for 1 and itself. For example, the first few prime numbers are: 2, 3, 5, 7, 11, 13, 17, 19, 23, and 29. Algorithm Step 1 − The isPrime function is defined. Step 2 ... Read More
In Haskell we can check if given two strings are anagram or not using sort function and freqMap. What is Anagram? An anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. For example, the word "listen" is an anagram of the word "silent". Anagrams are often used in word play, puzzles, and other forms of entertainment. Algorithm Step 1 − The Data.List module is imported to use sort function. Step 2 − The isAnagram function using sort function is defined Step 3 ... Read More
This tutorial will help us in checking if any number is palindrome number or not using user-defined function and boolean functions in haskell. A palindrome number is a number that remains the same when its digits are reversed. The following example will give you a clear idea about Palindrome number. For example, 121, 12321, and 1221 are palindrome numbers, while 123, 1234, and 1212 are not. Algorithm Step 1 − The isPalindrome function using reverse function is defined as, isPalindrome str = str == reverse str. Step 2 − Program execution will be started from main function. The ... Read More
In this article we are going to use the internal function of Haskell like Data.complex and Prelude to create a complex number from a given imaginary parts. This tutorial will help us in creating the complex number from the given imaginary part. The imaginary part of a complex number is the coefficient of the imaginary unit, typically represented by the symbol "i", in the standard form of the complex number. A complex number can be represented in standard form as a + bi, where a is the real part and b is the imaginary part. Algorithm Step 1 − ... Read More