S9:E4 Boolean Algebra: Flip-Flops and Adders for Computer Science
Failed to add items
Sorry, we are unable to add the item because your shopping cart is already at capacity.
Add to basket failed.
Please try again later
Add to wishlist failed.
Please try again later
Remove from wishlist failed.
Please try again later
Adding to library failed
Please try again
Follow podcast failed
Unfollow podcast failed
S9:E4 Boolean Algebra: Flip-Flops and Adders for Computer Science
-
Narrated by:
-
By:
About this listen
This episode provides an overview of Boolean algebra concepts essential for computer science, specifically focusing on digital circuits for arithmetic and memory. It explains the function and construction of half-adders and full-adders, detailing how these circuits perform binary addition and how full-adders can be concatenated for multi-bit operations. The text also introduces the edge-triggered D-type flip-flop, describing its role as a fundamental memory unit that stores a single bit based on clock signals and its applications in registers, counters, and static RAM. Ultimately, the document serves as an educational guide to understanding these core components of digital logic.
No reviews yet