0% found this document useful (0 votes)
71 views2 pages

Computer Aided Digital Design - Unit1 - Assignment-1

The document contains 12 questions about computer architecture and digital logic design topics such as binary number representations, data conversions, logic gates and circuits. Questions cover topics like abstraction levels, binary conversions, addition, majority gates, two's complement, and Boolean equations.

Uploaded by

M N Chethan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
71 views2 pages

Computer Aided Digital Design - Unit1 - Assignment-1

The document contains 12 questions about computer architecture and digital logic design topics such as binary number representations, data conversions, logic gates and circuits. Questions cover topics like abstraction levels, binary conversions, addition, majority gates, two's complement, and Boolean equations.

Uploaded by

M N Chethan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Computer Aided Digital Design

Unit 1: Combinational Logic Design


Assignment-1
1) With neat diagram explain the levels of abstraction for an electronic computing system.
2) What is the largest unsigned 32-bit binary number?
3) What is the largest 16-bit binary number that can be represented with
(a) unsigned numbers?
(b) two’s complement numbers?
(c) sign/magnitude numbers?
4) Convert the following two’s complement binary numbers to decimal.
(a) 1010
(b) 110110
(c) 01110000
(d) 10011111
5) How many bytes are in a 32-bit word? How many nibbles are in the word?
6) Hard disk manufacturers use the term “megabyte” to mean 106 bytes and “gigabyte” to mean
109 bytes. How many real GBs of music can you store on a 50 GB hard disk?
7) Perform the following additions of unsigned binary numbers. Indicate whether or not the sum
overflows a 4-bit result.
(a) 10012 + 01002
(b) 11012 + 10112
8) A majority gate produces a TRUE output if and only if more than half of its inputs are TRUE.
Complete a truth table for the three-input majority gate shown below:

9) Convert the following decimal numbers to 5-bit two’s complement binary numbers and
subtract them. Indicate whether or not the difference overflows a 5-bit result.
(a) 9 − 7
(b) 12 – 15
10) Ben and Alyssa P. Hacker are having another argument. Ben says, “I can get the two’s
complement of a number by subtracting 1, then inverting all the bits of the result.” Alyssa says,
“No, I can do it by examining each bit of the number, starting with the least significant bit. When
the first 1 is found, invert each subsequent bit.” Do you agree with Ben or Alyssa or both or
neither? Explain.
11) Using De Morgan equivalent gates and bubble pushing methods, redraw the following circuit
so that you can find the Boolean equation by inspection. Write the Boolean equation.

12) Find a minimal Boolean equation for the following truth table. Remember to take advantage
of the don’t care entries.

You might also like