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
Race-around Condition in JK Flip-flop
Let's start this article with a brief introduction of JK flip-flop and its block diagram and truth table, before moving on to discuss the race-around condition. JK Flip-Flop JK flip-flops is a one-bit storage device which has two stable states. The block diagram representation of a JK flip-flops is shown in Figure-1. It has two inputs specified by "J" and "K", one clock input for synchronization of the circuit, and two outputs represented by Q and Q'. When clock signal is absent, the output of the JK flip-flop is independent of the inputs J and K. When the clock ...
Read MoreMinimization of Incompletely Specified Logic Functions
In Boolean or logic algebra, a logic function is a mathematical expression which specifies the relationship between inputs and outputs of a logic circuit. Boolean functions can be classified into two types namely, completely specified logic functions and incompletely specified logic functions. A completely specified logic function is one whose output is determined or defined for every possible combination of inputs, while a Boolean function whose output value is unspecified for at least one combination of inputs is called incompletely specified logic function. In an incompletely specified logic function, the combinations of input variables for which the output is not ...
Read MoreDecoder for Active Low and High Output
What is a Decoder? In digital electronics, a decoder is a combinational logic circuit which is capable of converting information in binary form N inputs to a maximum of 2N outputs. The block diagram of a typical decoder is shown in Figure-1. It can be seen that a decoder has N input lines to accept binary coded information, an enable input, E to turn on or off the decoder (optional), and 2N unique output lines. The digital decoders are extensively used in several applications in the field of digital electronics such as decoding of data, seven segment displays, data ...
Read MoreDecoder Driver IC and Its Application
What is a Decoder Driver IC? A type of integrated circuit (IC) which is designed to decode information specified in the binary form is known as decoder driver IC. A decoder driver IC generates output signals to drive different electronic devices like LEDs, electronic relays, electric motors, etc. Decoder driver ICs are most commonly used in electronic systems to convert digital signals specified in binary form into specific output signals that then drive an output device. Types of Decoder Driver ICs Depending on the decoding function performed, there are several types of decoder driver ICs available. Some important types are ...
Read MoreUsing Salesforce to Streamline Customer Service
Introduction In today’s digital age, customer service is one of the most critical aspects of any business. Companies strive to provide their customers with the best possible experience to ensure customer satisfaction and loyalty. However, providing excellent customer service can be challenging, especially for larger organizations. This is where customer service management (CSM) software like Salesforce comes in. Salesforce is one of the leading customer service management software solutions available in the market. It has been helping businesses of all sizes streamline their customer service operations, enabling them to provide their customers with exceptional support. In this article, we will ...
Read MoreCompletely and Incompletely Specified Logic Functions
What is a Logic Function? In digital electronics and Boolean algebra, an expression that have some operations performed on the binary inputs to produce an output in the binary form is called a logic function. Logic functions are also called Boolean functions. Depending on the specified output, there are two types of logic functions namely, Completely specified logic functions Incompletely specified logic functions Now, let us discuss the completely and incompletely specified logic functions individually in detail. Completely Specified Logic Function A logic function or Boolean function which is defined for all possible combinations of input variables is ...
Read MoreCascading of Decoders
What is a Decoder? A decoder is a combinational logic circuit that converts an N-bit binary input code into a 2N output lines such that only one output line will be active for each one of the possible combinations of inputs. The block diagram of a decoder is shown in Figure-1. Here, A, B, C, etc. are the input lines, Y0, Y1, Y2, … etc. are the output lines, and E is the enable input of the decoder. In this article, we will discuss cascading of decoders. Cascading of Decoders means the process of realizing a higher order decoder ...
Read MoreSalesforce Marketing Cloud: The Ultimate Guide to Creating Effective Campaigns
Introduction In today's digital world, businesses need to be able to create effective campaigns that connect with their target audience, generate leads, and drive sales. However, creating an effective campaign can be a complex and time-consuming process. That's where Salesforce Marketing Cloud comes in. This powerful marketing automation platform provides businesses with the tools they need to create effective campaigns that deliver real results. In this ultimate guide to creating effective campaigns with Salesforce Marketing Cloud, we'll take a closer look at what makes a campaign effective and how you can use Marketing Cloud to create campaigns that drive real ...
Read MoreHaskell Program to Check Armstrong Number
In Haskell we can check whether a given number is Armstrong or not using list comprehension and sum function. Armstrong numbers, also known as narcissistic numbers, are numbers such that the sum of the cubes of their digits is equal to the number itself. For example, the number 153 is an Armstrong number because 1^3 + 5^3 + 3^3 = 153. Algorithm Step 1 − The armstrong function calculates the sum of the cubes of the digits of n using list comprehension and the sum function, and define Step 2 − Program execution will be started from main function. ...
Read MoreHaskell Program to Check Leap Year
In Haskell, we can check whether a given year is a leap year is not using simple boolean expression. A leap year is a year that has an extra day (February 29th) compared to a normal year. For example, 2004 is a leap year. To determine if a year is a leap year or not, there are a few rules that must be followed. Algorithm Step 1 − The isLeapYear function is defined Step 2 − Program execution will be started from main function. The main() function has whole control of the program. It is written as main ...
Read More