Solved Questions on Simplification of Boolean Expression with K-Map (Part 1) | Digital Electronics

preview_player
Показать описание
Solved Questions on Simplification of Boolean Expression with K-Map (Part 1) | Digital Electronics

Digital Electronics – Switching Theory & Logic Design(STLD)
Рекомендации по теме
Комментарии
Автор

Amazing thanks.❤ nai to ma rona vali thi is sa pela

tziypwb
Автор

absolutely amazing sir !! thank you so much sir ❤❤

animeshsarkar
Автор

0.1 ko to bul hi gaye mahase😅 last bale Question m

gauravr
Автор

Bs ye smj nhi aya sir ki 4 variable k-map m apne 0 and 1 kis basis p fill kiye uske ander ????

ankit.nautiyal
Автор

How are you naming the cells in the second box

ireneagnes
Автор

00:08 Solving boolean expression using K-Map
01:06 Understanding how to increase and simplify a Boolean expression using K-Map
02:15 Identify number of groups and overlapping groups for simplification
03:11 Simplified Boolean expressions using K-Map
03:49 Understanding the solution for simplification of Boolean expression using K-Map
04:47 Introduction to Boolean expression simplification with K-Map
06:00 Understanding simplification of Boolean Expression with K-Map
07:27 Introduction to simplification of Boolean expressions with K-Map

bhagavataa
Автор

What will be the length of various fields of
an instruction considering the following ?
(i) 64 possible operations
(ii) 8 addressing modes
(iii) Memory size of 4 KB (byte addressing
is used)
(iv) It has 32 registers
(v) Each instruction has one register and
one memory operand
Make suitable assumptions.

can anyone solve this question ?

himanshurana
Автор

Par sir bada se bada group lete hai aur overlapping bhi hoti hai to overlapping ko avoid kyu ???

rambhavanyadav
Автор

Ques 2 me 0 and 1 ko bhi lena chaiye tha

anishmalik
Автор

What is the ans of
Y=P'Q'R+P'Q'R'+PQR'+P'QR

yashchikane