Microprocessors(Engineering > Electrical Engineering ) Questions and Answers

Question 1. In one’s complement 8 bit representation 11111111 represents
  1.    +0
  2.    -0
  3.    +1
  4.    -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]
  1.    Circuit A has more gates than circuit B
  2.    Circuit B has more gates than circuit A
  3.    Circuit A has the same number of gates as circuit B
  4.    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].
  1.    Less than
  2.    Greater than
  3.    The same as
  4.    Cannot be determined
Explanation:-
Answer: Option C. -> The same as
Question 4. An e-mail message can be sent to many recipients.
  1.    True
  2.    False
Explanation:-
Answer: Option A. -> True
Question 5. The five flags in 8085 are designated as
  1.    Z, CY, S, P and AC
  2.    D, Z, S, P, AC
  3.    Z, C, S, P, AC
  4.    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
  1.    6 decimal places
  2.    8 decimal places
  3.    10 decimal places
  4.    11 decimal places
Explanation:-
Answer: Option D. -> 11 decimal places
Question 7. DS directive in 8085
  1.    Forces the assembler to reserve one byte of memory
  2.    Forces the assembler to reserve a specified number of bytes in the memory
  3.    Forces the assembler to reserve a specified number of consecutive bytes in the memory
  4.    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.
  1.    BYTE
  2.    NIBBLE
  3.    WORD (16 bits)
  4.    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
  1.    Set of {AND,OR}
  2.    Set of {EXOR, NOT}
  3.    Set of {AND,OR,NOT}
  4.    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
  1.    Assignment, relational, arithmetic
  2.    Relational, assignment, arithmetic
  3.    Arithmetic, assignment, relational
  4.    Arithmetic, relational, assignment
Explanation:-
Answer: Option D. -> Arithmetic, relational, assignment
© Lakshya_Education.com, All Right Reserved.
Contact Us services