BASU BIR FOUNDATION, BBFians Xclusive Programs Guidance

```UNIT 1 NUMBER SYSTEMS
PART-A
1X10=10
1. The decimal representation of the binary number 1010.101 is _____________
a)10.623 b)10.323 c)10.625 d)10.622
2. The octal representation of the number 1760.154 in decimal format is_______
a)1008.2109375 b)1212.3323 c)11232.3421 d)3234.4321
3. State T/F: 2’s complement is also called radix complement.
a) T b)F
4.
The excess notation is a special case of the _________ notation.
a) biased b) unbiased
5. The octal value of the decimal number 100 is ________
a) 123 b) 124 c) 126 d)144
6. 4 bits represent _________
a) byte b) nibble c) kilobyte d) megabyte
7. The decimal representation of the Hexadecimal value 1A3F IS_______
a) 6754 b) 6719 c) 3212 d)5465
8. 32 bit represents a ______
a) half word b) full word c) word d) multi word
9. State T/F: The 2’s complement is asymmetric system with additional bit required to represent any
numbers.
a)T b)F
10) State T/F: A decimal number must be multiplied by 2 to obtain its binary format.
a) T b) F
PART-B
2X10=20
1. State T/F:
i)
The LSB has the least place holder value.
ii)
The MSB has highest place holder value.
a) T,F b)F,T c) T,T d) F,F
2. The MSB___represent positive value and MSB ____ represent negative value.
a) 0,1 b) 1,0
3. State T/F:
a)The 2’s complement of a number is obtained by adding 1 to LSB.
b) The 1’s complement of a number is obtained by adding 1 to MSB.
a) T,F b)T,T c)F,F d)F,T
4.
Half word is ____ bits and word is ____bits.
a) 16,32 b)32,16 c)32,8 d)8,16
5. State T/F:
The floating point notation is used:
a) To represent integers those are larger than the maximum value that can be held by a bit
pattern.
b) To represent real numbers.
a) T,T b)F,F c) T,F d) F,T
6. State T/F:
a) Hexadecimal numbers have a range of A to F.
b) Hexadecimal numbers have a base of 8.
a) T,T b)F,F c)T,F d) F,T
7. State T/F:
a) The base of octal number has a value of 8.
b) Octal numbers are grouped in 3 digits.
a)T,T b)F,F c)F,T d)T,F
8. In Big Endian Method the MSB value is _____ and LSB value is ______
a) 1,1 b)0,1 c)1,0 d)0,0
9. In Little Endian Method the ______ has priority over ______
a) MSB,LSB b)LSB,MSB
10. The binary and octal value of 100.265 is____ and _____
a) 1100100 and 144 b) 1100101 and 145 c) 110010 and 146 d) 1100111 and 147
PART C (DESCRIPTIVE Questions)
2x10=20
1.
Explain the Big Endian and Little Endian Method in digital Logic. (10)
2.
A) Write the complete Hexadecimal representation table and find the Hex value of 1A3F.
B) Find the decimal value of the octal number 1760.154 and recheck the answer back in decimal
format.
C) Find the 2’s complement of the number 11110010. (5+3+2)
CHAPTER-2 BOOLEAN ALGEBRA
PART-A
1X10=10
1. (a’)’=a is called the ______ law.
a) Involution b) Identity c) Associative d) Absorption
2. State T/F:
a+a=a
a) F b) T
3. 001 can be represented as_______
a) abc b)a’b’c’ c) a’b’c d)a’b’c’
4. State T/F: Minterm is used with reference to SOP.
a)T b)F
5. The logical _____operation is represented by the symbol “.”
a) OR b) AND c) NOT d) NAND
6. State T/F: If a single Boolean expression has many different operators, the result of that
expression does not depend on the precedence of the operators.
a) T b) F
7. “.” and “+” Boolean operators are ________with respect to one another.
a) associative b) distributive c) commutative d) supportive
8. NAND operation is represented by _____
a) | b) || c) &amp;&amp; d) &amp;
9. ____gate is universal.
a) NAND b) NOR c) Both a and b d) only b
10. Logical OR is represented as _____
a) + b) | c) &amp; d)^
PART-B
2X10=20
1. State T/F:
a) Boolean algebra is closed under the AND, OR and NOT operations.
b) There is no identity element with respect to logical NOT.
a) T,F b) F,T c) T,T d) F,F
2. _____ can be represented as ____.
a) 000, abc b) 001, a+b+c’ c) 010, abc’ d) 111, a’+b’+c
3. State T/F:
a) a+a’=1
b) a+1=1
a) T,F b)F,T c)F,F d) T,T
4. _____ is the dual of ____
a) Minterm,maxterm b) Maxterm,minterm
5. ______ is referred with respect to _____
a) SOP, maxterm b)POS,minterm c) POS, maxterm d) both b and c
6. State T/F:
a) For every value X there exists a value X’ such that X.X’=0.
b) For every value X there exists a value X’ such that X.X’=1.
a)T,T b) F,F c) F,T d) T,F
7. State T/F:
a) Logical NOR (NOT (A OR B)) = (A+B)’.
b) Implication, B implies A=A+B’. (If B then A). Also equivalent to B&gt;=A.
a) T,F b)F,F c) T,T d) F,T
8. _____gate functions as ______
a) NOR, addition modulo 2 b) XOR, addition modulo 2 c) NOR, division modulo 2 d) OR, multiplication
modulo 2
9. What are these two laws called:
a) a+ (ab) =a b) a+a’b=a+b
a) Absorption and Redundancy Laws
b) Redundancy and absorption Laws
c) Redundancy and Consensus Laws
d) Consensus and Redundancy Laws
10. State T/F:
a) (X+Y)’=X’.Y’
b) (X.Y)’=X’+Y’
a) T,F b) F,T c) F,F d) T,T
PART-C (DESCRIPTIVE)
2X10=20
1) Explain NOR and NAND gates with their corresponding truth tables. (10)
2) Construct an XOR gate and XNOR gate using NOR gates only. Justify your answer with
supporting truth tables. (5+5)
CHAPTER-3 TECHNIQUES FOR SIMPLIFYING BOOLEAN EXPRESSIONS
PART-A
1X10=10
1. State T/F: A Karnaugh map is a 3D representation of the truth table for a Boolean function.
a) T b) F
2. The simple functions in Boolean function are known as ____ function.
a) product b) modulo c) remainder d) addition
3. State T/F: A, A’B and ABC are all product functions but A+B’ and AB+CD are not product
functions.
a) F b) T
4. State T/F: Basic calculator is an example of LSI and ELSI chips.
a) T b) F
5. A/an _____ of a function is a product term that is include in the function.
a) Prime implicant b) implicant c) redundant d) constant
6. State T/F: Karnaugh Maps are designed using SOP form.
a) T b) F
7. State T/F: Both Maxterms and Minterms are used in designing K-Maps.
a) T b) F
8. Minterms are grouped depending upon number of ____ entered in table form.
a) 0 b) 1
```