09:00

[1+1] నుండి స్టార్ట్ అయ్యే మీ జర్నీ ఎటువైపు మళ్లించుకునే అవకాశం వుంది? Why don't you try ? #btech

01:20

In 16-bit 2’s complement representation, the decimal number -28 is: [GATE CSE 2019] | Digital Design

06:14

LOGIC FAMILIES | HANDWRITTEN NOTES | DIGITAL SYSTEM DESIGN #dld #digitaldesign #dsd

05:35

Module-4 |Design of Data Path Circuits Handwritten Notes | Digital System Design #digitaldesign #dld

06:04

Sequence Detector with Toggled Output in Mealy FSM | Non-Overlapping & Overlapping #Mealyfsm #dld

03:49

State Diagram for a Sequence Detector to detect 110 | Overlapping using Mealy & Moore FSM #mealyfsm

16:30

2.17 Obtain the Truth Table for Boolean functions & express Sum of minterms & Product of max terms

22:10

SEQUENCE DETECTOR (11011) | MEALY FSM | OVERLAPPING |JK FLIP FLOP'S #sequencedetector #mealymodel

12:53

2-Bit & 3-Bit Magnitude Comparator Design (Easy Method Without Truth Table & K Map's) #comparator

05:27

1-Bit Magnitude Comparator Design | Combinational Circuit | DLD | DIGITAL LOGIC DESIGN #comparator

13:32

Programmable Logic Devices PLD's Complete Explanation | PROM, PAL & PLA | Digital Logic Design #dld

07:01

BCD ADDITION, GATE EXAM 2024, DIGITAL LOGIC DESIGN |NUMBER SYSTEMS | BINARY ARITHMETIC #bcdaddition

04:31

BINARY CODES COMPLETE EXPLANATION FROM DIGITAL LOGIC #bcd #binarycodes #ascii #graycode #excess3code

05:40

DESIGN OF A 2-BIT BINARY MULTIPLIER | HALF ADDERS AND LOGIC GATES #dld #digitalelectronics #ece #cse

04:28

GATE 2021 CS QN .45 | 3-BIT COUNTER OF T FF'S | NEXT 3 STATES IF INITIAL STATE IS 000 | #flipflops

03:56

COMPLEMENT OF A BOOLEAN FUNCTION | GATE 2021 CS QN |DE-MORGAN'S LAWS #demorganslaw #booleanfunction

03:10

Which of the following circuits implements the Boolean function f (x, y, z) = m0+m1+m3+m4+m5+m6 #mux

09:12

GATE 2021 DESIGN OF A SEQUENCE DETECTOR USING MEALY MACHINE WITH OVERLAPPING BITS #mealymodel #moore

02:12

CONVERT A BASE-3 NUMBER 210 INTO HEX-DECIMAL |GATE 2021, CS QN.6 #gate #gatecse2023 #gateelectronics

07:28

GATE 2023 CS QN 44 REALISE THE BOOLEAN FUNCTION OF MULTIPLEXER CIRCUIT DIAGRAM #multiplexer #boolean

07:16

GATE 2023 CS QN. 43 Consider a sequential digital circuit consisting of T flip flops #flipflops

02:08

A particular number is written as 132 in radix 4 representation | GATE 2023 CS #gate #gateexam #dld

12:53

4.18 Design a combinational circuit that generates the 9’s complement of a BCD digit #complements

02:41

CODE CONVERSION FROM BINARY TO GRAY AND GRAY TO BINARY | M MORRIS MANO #binarytogray #graytobinary

06:20

DESIGN OF A HALF ADDER | COMBINATIONAL CIRCUITS | #combinationalcircuits #digitalelectronics

07:29

2. 21 Convert each of the following to the other canonical form: F(x, y, z) = sigma (1, 3, 5) #sop

04:09

2.20 Express the complement of the following functions in sum‐of‐minterms form #booleanalgebra #sop

14:26

2.18 For the Boolean function obtain the truth table of F | M. MORRIS MANO #booleanalgebra #dld

09:50

2 .1 Demonstrate the validity of the following identities by means of truth tables #truthtable #dld

10:50

4.8 (A) Design of a Code Converter from 8 4 -2 -1 to BCD using Logisim Software #codeconverter

13:14

4.8(ii) DESIGN OF A CODE CONVERTER FROM 8 4 -2 -1 TO GRAY CODE #graycode #digitalelectronics

13:14

4.8(i) DESIGN OF A 8 4 -2 -1 TO BCD CODE CONVERTER #graycode #binarytograycode

04:30

4.6 Design of a logic circuit whose output is equal to 1 if the input variables have more 1’s #dld

05:17

4.4 Design a logic circuit for output 1 when the binary inputs is less than 3 #digitalelectronics

05:05

4.2 Obtain the simplified Boolean expressions for output F and G.#combinationalcircuit #boolean

12:37

4.7 Design a combinational circuit that converts a 4-bit Gray code to a 4-bit binary number #dld

14:18

4.1 Derive the Boolean expressions for T1 through T4 Evaluate the outputs F1 and F2 #kmap #boolean

06:31

3.3 Simplify the following Boolean expressions, using three variable maps #booleanalgebra #kmap

10:49

3.2 Simplification of Boolean function using 3 variable K map | M.Morris Mano & M.Ciletti | #k-map

03:42

3 .1 Simplify the following Boolean functions, using three variable maps | #booleanalgebra #kmap

06:30

2 .19 Express the following function as a sum of minterms and as a product of maxterms #minterms

04:03

2.15 Simplification of Boolean Functions #booleanalgebra #boolean #digitalelectronics #dld

04:40

2.11 List the truth table of the function: (a) F = xy + xy' + y'z (b) F = bc + a'c' #booleanalgebra

04:43

2.9 Find the complement of the following expressions: (a) xy' + x'y #complement #booleanalgebra

07:00

2.4 Reduce the following Boolean expressions to the indicated number of literals #digitalcircuits

06:00

2.3 Simplify the Boolean expressions to minimum no of literals:(a) ABC + A'B + ABC' #digitallogic

06:50

2.2 Simplify the following Boolean expressions to a minimum number of literals: (a) * xy + xy' #dld

10:27

Design of Mod-5 Synchronous Up Counter | JK Flip Flop's #synchronouscounter #counter #flipflops

09:33

5. Convert each of the following expressions into sum of products and product of sums | #sop #dld

15:36

4 Simplification of Boolean expressions to a minimum number of literals using Boolean Algebra

06:27

3. 1's and 2's Complements of Binary Numbers | #numbersystem #number_system #dld

05:56

2. Express the following numbers in decimal: (a) (10110.0101)2 (b) (16.5)16 ..(e) (198)12 #dld

03:24

1. Introduction to Number Systems in DLD | Binary/Octal/Decimal/Hex-Decimal | Radix #digitalcircuits