CS302
CS302
Fall 2009
CS302- Digital Logic Design (Session - 2)
Time: 60 min
Marks: 38
Student Info
StudentID:
Center: OPKST
Q No. 9 10 11 12 13 14 15 16
Marks
Q No. 17 18 19 20 21 22
Marks
Question No: 1 ( Marks: 1 ) - Please choose one
► 1234
► ABCD
► 1001
► DEFH
The Unsigned Binary representation can only represent positive binary numbers
► True
► False
The values that exceed the specified range can not be correctly represented and are considered as
________
► Overflow
► Carry
► Parity
► Sign value
► 0111
► 1111
► 1001
► 0110
L-2
Question No: 5 ( Marks: 1 ) - Please choose one
is an example of ________
► Demorgans law
► Associative law
► Product of sum form
► Sum of product form
The 4-variable Karnaugh Map (K-Map) has _______ cells for min or max terms
►4
►8
► 12
► 16
Two 2-input, 4-bit multiplexers 74X157 can be connected to implement a ____ multiplexer.
► 4-input, 8-bit
► 4-input, 16-bit
► 2-input, 8-bit
► 2-input, 4-bit
The PROM
consists of a fixed non-programmable ____________ Gate array configured as a decoder.
► AND
► OR
► NOT
► XOR
► True
► False
► A&B
► A!B
► A#B
► A$B
L-21
Question No: 14 ( Marks: 1 ) - Please choose one
If an active-HIGH S-R latch has a 0 on the S input and a 1 on the R input and then the R input
goes to 0, the latch will be ________.
► SET
► RESET
► Clear
► Invalid
Question No: 15 ( Marks: 1 ) - Please choose one
Demultiplexer has
Add -13 and +7 by converting them in binary system your result must be in binary.
Explain “Sum of Weights” method with example for “Octal to Decimal” conversion
1. Sum-of-Weights Method
Sum-of-weights as the name indicates sums the weights of the Binary Digits (bits)
of a Binary Number which is to be represented in Decimal. The Sum-of-Weights method
can be used to convert a Binary number of any magnitude to its equivalent Decimal
representation.
In the Sum-of-Weights method an extended expression is written in terms of the
Binary Base Number 2 and the weights of the Binary number to be converted. The
weights correspond to each of the binary bits which are multiplied by the corresponding
binary value. Binary bits having the value 0 do not contribute any value towards the final
sum expression.
The Binary number 101102 is therefore written in the form of an expression
having weights corresponding to the bits 0, 1, 1, 0 and 1 respectively.
Weights do not contribute in the final sum as the binary bits corresponding to
these weights have the value 0.
101102 =
= 16 + 0 + 4 + 2 + 0
= 22
Question No: 22 ( Marks: 10 )