Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Boolean Algebra: Properties and Optimization
Graph Chatbot
Related lectures (29)
Previous
Page 2 of 3
Next
BJT vs FET Operation
Compares BJT and FET operation in logic systems, discusses TTL vs CMOS technologies, and explores Set-Reset Latch functionality.
Karnaugh Maps: Grouping Techniques
Explores Karnaugh maps, grouping rules, and transistor logic in logic systems.
SR Latch and D Flip-Flop: Memory Elements in Logic Systems
Explores SR latch, D flip-flop, multiplexers, XOR gates, and tristate gates in logic systems.
Logic Systems: Multiplexers and Flip-Flops
Explains SR latch circuits, D-latches, D-flip-flops, clock signals, and multiplexers in logic systems.
SR and D Latches: Logic Systems
Covers the implementation of SR and D latches and flip-flops.
Logic Systems: Finite State Machines
Explores Boolean algebra, optimization, sequential systems, and finite state machines design.
Karnaugh Maps: Grouping Rules and Optimization
Explores Karnaugh map representations, grouping rules, optimization, and TTL gate technology.
Finite State Machines: Basics and Design
Introduces finite state machines, covering basics, design, and practical applications like decoders and encoders.
Logic Systems: Sequential and Combinatorial Circuits
Covers fundamental concepts of logic systems, including sequential and combinatorial circuits, state diagrams, and finite state machines.
Logic Gates and Hazard Elimination
Explores logic gates, hazard elimination, ALUs, counters, and shift registers in semiconductor technology.