Open In App

Digital Electronics and Logic Design Tutorials

Last Updated : 12 Jun, 2024
Like Article

Number System and Representation :

  1. Binary representations
  2. Number System and Base Conversions
  3. Floating Point Representation

Programs :

  1. Program for Binary To Decimal Conversion
  2. Program for Decimal to Binary Conversion
  3. Program for decimal to octal conversion
  4. Program for octal to decimal conversion
  5. Program for hexadecimal to decimal

Boolean Algebra and Logic Gates :

  1. Properties of Boolean algebra
  2. Representation of Boolean Functions
  3. Canonical and Standard Form
  4. Functional Completeness
  5. Logic Gates

Gate Level Minimization :

  1. K-Map(Karnaugh Map)
  2. Implicants in K-Map
  3. 5 variable K-Map
  4. Variable entrant map (VEM)
  5. Minimization of Boolean Functions
  6. Consensus theorem

Combinational Logic Circuits :

  1. Half-Adder
  2. Half-Subtractor
  3. Half-Adder and Half-Subtractor using NAND NOR Gates
  4. Full-Adder
  5. Full Subtractor
  6. Code Converters – BCD(8421) to/from Excess-3
  7. Code Converters – Binary to/from Gray Code
  8. Code Converters – BCD to 7 Segment Decoder
  9. Parallel Adder & Parallel Subtractor
  10. Carry Look-Ahead Adder
  11. Magnitude Comparator
  12. BCD Adder
  13. Encoders and Decoders
  14. Encoder
  15. Binary Decoder
  16. Combinational circuits using Decoder
  17. Multiplexers
  18. Static Hazards

Flip-Flops and Sequential Circuits :

  1. Latches
  2. One bit memory cell
  3. Flip-Flops(Types and Conversions)
  4. Master Slave JK Flip Flop
  5. Introduction of Sequential Circuits
  6. Synchronous Sequential Circuits
  7. Asynchronous Sequential Circuits
  8. Difference between combinational and sequential circuit
  9. RTL (Register Transfer Level) design vs Sequential logic design
  10. Difference between Synchronous and Asynchronous Sequential Circuits

Register and Counters :

  1. Counters
  2. Design counter for given sequence
  3. n-bit Johnson Counter
  4. Amortized analysis for increment in counter
  5. Ripple Counter
  6. Digital Logic | Ring Counter
  7. Shift Registers
  8. Design 101 sequence detector
  9. Universal Shift Register
  10. RTL (Register Transfer Level) design vs Sequential logic design
  11. Verilog Data Types

Memory and Programmable Logic :

  1. Read-Only Memory (ROM) | Classification and Programming
  2. Programmable Logic Array
  3. Programming Array Logic
  4. RAM vs ROM
  5. Operational Amplifier (op-amp)

Data Communication :

  1. Block Coding
  2. Difference between Unipolar, Polar and Bipolar Line Coding
  3. Difference between Broadband and Baseband Transmission
  4. Transmission Impairment
  5. What is Scrambling?
  6. Analog to Analog Conversion (Modulation)
  7. Analog to digital conversion
  8. Digital to Analog Conversion
  9. Difference Between Digital And Analog System

Similar Reads

Digital Logic and Design - GATE CSE Previous Year Questions
Solving GATE Previous Year's Questions (PYQs) not only clears the concepts but also helps to gain flexibility, speed, accuracy, and understanding of the level of questions generally asked in the GATE exam, and that eventually helps you to gain good marks in the examination. Previous Year Questions help a candidate practice and revise for GATE, whic
4 min read
Adders and Subtractors in Digital Logic
Subtraction of two binary numbers can be accomplished by adding 2's complement of the subtrahend to the minuend and disregarding the final carry if any. If the MSB bit in the result of addition is a '0'. then the result of addition is the correct answer. If the MSB bit is a '1'. , this implies that the answer has a negative sign. The true magnitude
4 min read
Difference between SOP and POS in Digital Logic
In digital logic, the inputs and output of a function are in the form of binary numbers (Boolean values) i.e., the values are either zero (0) or one (1). Therefore, digital logic is also known as 'Boolean logic'. These inputs and output can be termed as 'Boolean Variables'. The output Boolean variable of a digital signal can be expressed in terms o
5 min read
Full Adder in Digital Logic
Full Adder is the adder that adds three inputs and produces two outputs. The first two inputs are A and B and the third input is an input carry as C-IN. The output carry is designated as C-OUT and the normal output is designated as S which is SUM. The C-OUT is also known as the majority 1's detector, whose output goes high when more than one input
4 min read
Full Subtractor in Digital Logic
A full subtractor is a combinational circuit that performs subtraction of two bits, one is minuend and other is subtrahend, taking into account borrow of the previous adjacent lower minuend bit. This circuit has three inputs and two outputs. The three inputs A, B and Bin, denote the minuend, subtrahend, and previous borrow, respectively. The two ou
3 min read
Encoder in Digital Logic
An encoder is a digital circuit that converts a set of binary inputs into a unique binary code. The binary code represents the position of the input and is used to identify the specific input that is active. Encoders are commonly used in digital systems to convert a parallel set of inputs into a serial code. The basic principle of an encoder is to
6 min read
BCD Adder in Digital Logic
BCD stands for binary coded decimal. It is used to perform the addition of BCD numbers. A BCD digit can have any of ten possible four-bit representations. Suppose, we have two 4-bit numbers A and B. The value of A and B can vary from 0(0000 in binary) to 9(1001 in binary) because we are considering decimal numbers. The output will vary from 0 to 18
2 min read
Magnitude Comparator in Digital Logic
A magnitude digital Comparator is a combinational circuit that compares two digital or binary numbers in order to find out whether one binary number is equal, less than, or greater than the other binary number. We logically design a circuit for which we will have two inputs one for A and the other for B and have three output terminals, one for A
6 min read
Shift Registers in Digital Logic
Pre-Requisite: Flip-Flops Flip flops can be used to store a single bit of binary data (1 or 0). However, in order to store multiple bits of data, we need multiple flip-flops. N flip flops are to be connected in order to store n bits of data. A Register is a device that is used to store such information. It is a group of flip-flops connected in seri
8 min read
Consensus Theorem in Digital Logic
Prerequisite - Properties of Boolean algebra, Minimization of Boolean Functions Redundancy theorem is used as a Boolean algebra trick in Digital Electronics. It is also known as Consensus Theorem: AB + A'C + BC = AB + A'C The consensus or resolvent of the terms AB and A'C is BC. It is the conjunction of all the unique literals of the terms, excludi
3 min read
Article Tags :