Microprocessors And Microcontrollers MCQ Questions & Answers

1.
In one’s complement 8 bit representation 11111111 represents

A. +0

B. -0

C. +1

D. -1

Answer & Solution Discuss in Board Save for Later

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]

A. Circuit A has more gates than circuit B

B. Circuit B has more gates than circuit A

C. Circuit A has the same number of gates as circuit B

D. None of the above

Answer & Solution Discuss in Board Save for Later

3.
An e-mail message can be sent to many recipients.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

4.
For the number A[15:0] = 0110110010001111, A[14:13] is ______ A[3:2].

A. Less than

B. Greater than

C. The same as

D. Cannot be determined

Answer & Solution Discuss in Board Save for Later

5.
The five flags in 8085 are designated as

A. Z, CY, S, P and AC

B. D, Z, S, P, AC

C. Z, C, S, P, AC

D. Z, CY, S, D, AC

Answer & Solution Discuss in Board Save for Later

6.
A 37 bit mantissa has an accuracy of

A. 6 decimal places

B. 8 decimal places

C. 10 decimal places

D. 11 decimal places

Answer & Solution Discuss in Board Save for Later

7.
DS directive in 8085

A. Forces the assembler to reserve one byte of memory

B. Forces the assembler to reserve a specified number of bytes in the memory

C. Forces the assembler to reserve a specified number of consecutive bytes in the memory

D. None of the above

Answer & Solution Discuss in Board Save for Later

8.
Because we wish to allow each ASCII code to occupy one location in memory, most memories are __________ addressable.

A. BYTE

B. NIBBLE

C. WORD (16 bits)

D. DOUBLEWORD (32 bits)

Answer & Solution Discuss in Board Save for Later

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

A. Set of {AND,OR}

B. Set of {EXOR, NOT}

C. Set of {AND,OR,NOT}

D. None of the above

Answer & Solution Discuss in Board Save for Later

10.
In a C expression using assignment operators, relational operators and arithmetic operators, the hierarchy of operations (in the absence of parenthesis) is

A. Assignment, relational, arithmetic

B. Relational, assignment, arithmetic

C. Arithmetic, assignment, relational

D. Arithmetic, relational, assignment

Answer & Solution Discuss in Board Save for Later

Microprocessors And Microcontrollers MCQ Questions & Answers | ECE

1. In one’s complement 8 bit representation 11111111 represents

Answer & Solution

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]

Answer & Solution

3. An e-mail message can be sent to many recipients.

Answer & Solution

4. For the number A[15:0] = 0110110010001111, A[14:13] is ______ A[3:2].

Answer & Solution

5. The five flags in 8085 are designated as

Answer & Solution

6. A 37 bit mantissa has an accuracy of

Answer & Solution

7. DS directive in 8085

Answer & Solution

8. Because we wish to allow each ASCII code to occupy one location in memory, most memories are __________ addressable.

Answer & Solution

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

Answer & Solution

10. In a C expression using assignment operators, relational operators and arithmetic operators, the hierarchy of operations (in the absence of parenthesis) is

Answer & Solution

1.
In one’s complement 8 bit representation 11111111 represents

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]

3.
An e-mail message can be sent to many recipients.

4.
For the number A[15:0] = 0110110010001111, A[14:13] is ______ A[3:2].

5.
The five flags in 8085 are designated as

6.
A 37 bit mantissa has an accuracy of

7.
DS directive in 8085

8.
Because we wish to allow each ASCII code to occupy one location in memory, most memories are __________ addressable.

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

10.
In a C expression using assignment operators, relational operators and arithmetic operators, the hierarchy of operations (in the absence of parenthesis) is