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

What is the main difference between half-adders and full-adders?

a: Nothing basically; full-adders are made up of two half-adders Explanation

Explanation

b: Full-adders can handle double digit numbers Explanation

Explanation

c: Full-adders have a carry input capability Explanation

Explanation

d: Half-adders can only handle single digit numbers Explanation

Explanation

Carry look ripple delay is eliminated in?

a: Full adder Explanation

Explanation

b: Half adder Explanation

Explanation

c: Parallel adder Explanation

Explanation

d: Carry look ahead adder Explanation

Explanation

Parallel adder is

a: Combinational circuit Explanation

Explanation

b: Sequential circuit Explanation

Explanation

c: Both Explanation

Explanation

d: None of these Explanation

Explanation

Which one of the following will give the sum of full adders as output?

a: Three bit parity checker Explanation

Explanation

b: Three point majority circuit Explanation

Explanation

c: Three bit counter Explanation

Explanation

d: Three bit comparator Explanation

Explanation

A full binary tree with n leaf nodes contains

a: 2n nodes Explanation

Explanation

b: (n+1) nodes Explanation

Explanation

c: n nodes Explanation

Explanation

d: (2n-1) nodes Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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