Microprocessors(Engineering > Electrical Engineering ) Questions and Answers
Question 1. In one’s complement 8 bit representation 11111111 represents
+0
-0
+1
-1
Explanation:-
Answer: Option B. -> -0
Question 2. Circuit A is a 1-bit adder; circuit B is a 1 bit multiplier.[Hint: Construct the truth table for the adder and the multiplier]
Circuit A has more gates than circuit B
Circuit B has more gates than circuit A
Circuit A has the same number of gates as circuit B
None of the above
Explanation:-
Answer: Option A. -> Circuit A has more gates than circuit B
Question 3. For the number A[15:0] = 0110110010001111, A[14:13] is ______ A[3:2].
Less than
Greater than
The same as
Cannot be determined
Explanation:-
Answer: Option C. -> The same as
Question 4. An e-mail message can be sent to many recipients.
True
False
Explanation:-
Answer: Option A. -> True
Question 5. The five flags in 8085 are designated as
Z, CY, S, P and AC
D, Z, S, P, AC
Z, C, S, P, AC
Z, CY, S, D, AC
Explanation:-
Answer: Option A. -> Z, CY, S, P and AC
Question 6. A 37 bit mantissa has an accuracy of
6 decimal places
8 decimal places
10 decimal places
11 decimal places
Explanation:-
Answer: Option D. -> 11 decimal places
Question 7. DS directive in 8085
Forces the assembler to reserve one byte of memory
Forces the assembler to reserve a specified number of bytes in the memory
Forces the assembler to reserve a specified number of consecutive bytes in the memory
None of the above
Explanation:-
Answer: Option C. -> Forces the assembler to reserve a specified number of consecutive bytes in the memory
Question 8. Because we wish to allow each ASCII code to occupy one location in memory, most memories are __________ addressable.
BYTE
NIBBLE
WORD (16 bits)
DOUBLEWORD (32 bits)
Explanation:-
Answer: Option A. -> BYTE
Question 9. We say that a set of gates is logically complete if we can build any circuit without using any other kind of gates. Which of the following sets are logically complete
Set of {AND,OR}
Set of {EXOR, NOT}
Set of {AND,OR,NOT}
None of the above
Explanation:-
Answer: Option C. -> Set of {AND,OR,NOT}
Question 10. In a C expression using assignment operators, relational operators and arithmetic operators, the hierarchy of operations (in the absence of parenthesis) is
Assignment, relational, arithmetic
Relational, assignment, arithmetic
Arithmetic, assignment, relational
Arithmetic, relational, assignment
Explanation:-
Answer: Option D. -> Arithmetic, relational, assignment