Virtual Labs

Computer Science and Engineering Computer Organisation and Architecture Lab Experiments

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Contributors

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Contributors

Feedback

Wallace Tree Adder

Choose difficulty:

Beginner

Intermediate

Advanced

The number of edges in a tree with n nodes

a: n+1 Explanation

Explanation

b: n-1 Explanation

Explanation

c: 2n Explanation

Explanation

d: n Explanation

Explanation

what is the number of full adders and half adders needed to add 16-bit numbers?

a: 5 full adder, 1 half adder Explanation

Explanation

b: 5 full adder, 5 half adder Explanation

Explanation

c: 12 full adder, 4 half adder Explanation

Explanation

d: None of these Explanation

Explanation

How many gate levels are propagated by the carry in an m-bit parallel adder?

a: m Explanation

Explanation

b: m+1 Explanation

Explanation

c: 2m Explanation

Explanation

d: None of these Explanation

Explanation

How many full adders are needed to design an n-bit parallel adder?

a: n Explanation

Explanation

b: n-1 Explanation

Explanation

c: n+2 Explanation

Explanation

d: n/2 Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

Contact Us Phone: General Information: 011-26582050 Email: support@vlabs.ac.in

Follow Us

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)