Question

Wallace trees are designs that [emphasize] contain components that perform this action. The Model K was devised by George Stibitz to showcase a proof of concept for this action. Kogge-Stone and Brent-Kung are examples of architectures that speed up this action. Those architectures introduce the logic vectors P and G to “look ahead” parts of this action and are significantly faster than the (*) “ripple” method. Two components that perform this operation are prefixed “half-” and (10[2])“full-” depending on the existence of a carry signal. The XOR (“X-or”) logic gate is equivalent to performing this action modulo 2. The (-5[1])binary (10[1])form of this action yields zero if both inputs are one. For 10 points, name this operation exemplified by “1 + 1 = 2.” (10[2])■END■

ANSWER: addition [accept binary addition; accept adders or half-adders or full-adders or ripple-carry adders or carry-lookahead adders] (Wallace multipliers contain half- and full-adders, but are not adders themselves.)
<Ezra Santos, Other Science>
= Average correct buzz position

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Agnijo BanerjeeSee itThe Crying of Team 497410
Justin KeungLimp ChriskitSorted7410
Abigail TanFour Times I Have Despised My SoulGressenheller A96-5
Adam Jones3HK1MMSay it9710
Sam MooreGressenheller AFour Times I Have Despised My Soul12110
Ved MuthusamyOxford School for QuiznessLSE12110

Summary

2024 Penn Bowl Harvard10/26/2024Y4100%0%50%89.50
2024 Penn Bowl UK10/26/2024Y5100%0%20%97.40
2024 Penn Bowl CWRU11/02/2024Y4100%0%50%106.50
2024 Penn Bowl Chicago11/02/2024Y8100%0%25%97.38
2024 Penn Bowl Mainsite11/02/2024Y3100%0%0%96.00