Welcome to the Computer Arithmetic MCQs Page

Dive deep into the fascinating world of Computer Arithmetic with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Computer Arithmetic, a crucial aspect of Computer Architecture. In this section, you will encounter a diverse range of MCQs that cover various aspects of Computer Arithmetic, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Computer Architecture.

Check out the MCQs below to embark on an enriching journey through Computer Arithmetic. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Computer Architecture.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Computer Arithmetic. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Computer Arithmetic MCQs | Page 7 of 16

Explore more Topics under Computer Architecture

01

Computer Architecture Basics

02

Digital Logic Circuits

03

Digital Components

04

Digital Data Representation

05

Microoperations

06

Basic Computer Organization

07

Pipeline and Vector Processing

08

Input Output Organization

09

Memory Organization

10

Multiprocessors

11

8085 Microprocessor

12

Microcontroller

13

8051 Microcontroller

Q61.

In Boolean expression A+BC equals

(A+B)(A+C)

(A'+B)(A'+C)

(A+B)(A'+C)

(A+B)C

Discuss

Answer: (a).(A+B)(A+C)

Q62.

Manipulation of individual bits of a word is often referred to as

Bit twidding

Bit swapping

Micro-operation

None of these

Discuss

Answer: (a).Bit twidding

Q63.

BCD equivalent of Two's complement is

nine's complement

ten's complement

one's complement+1

none of these

Discuss

Answer: (c).one's complement+1

Q64.

Gray code equivalent of (1000)2 is

(1111)G

(1100)G

(1000)G

None of the above

Discuss

Answer: (a).(1111)G

Q65.

In computers, subtraction is generally carried out by

9’s complement

10’s complement

1’s complement

2’s complement

Discuss

Answer: (d).2’s complement

Q66.

(2FAOC)16 is equivalent to

(195 084)10

(001011111010 0000 1100)2

both a and b

None of these

Discuss

Answer: (b).(001011111010 0000 1100)2

Q67.

In signed-magnitude binary division, if the dividend is (11100)2 and divisor is (10011)2, then the result is

(00100)2

(10100)2

(11001)2

(01100)2

Discuss

Answer: (b).(10100)2

Q68.

In computers, subtraction is carried out generally by

1's complement method

2's complement method

signed magnitude method

BCD subtraction method

Discuss

Answer: (b).2's complement method

Q69.

The multiplicand register & multiplier register of a hardware circuit implementing booth's algorithm have (11101) & (1100). The result shall be

(812)10

(-12)10

(12)10

(-812)10

Discuss

Answer: (a).(812)10

Q70.

A floating point number that has a 0 in the MSB of mantissa is said to have

Overflow

Underflow

Important number

Undefined

Discuss

Answer: (b).Underflow

Page 7 of 16

Welcome to the Computer Arithmetic MCQs Page

Computer Arithmetic MCQs | Page 7 of 16

Explore more Topics under Computer Architecture

Computer Architecture Basics

Digital Logic Circuits

Digital Components

Digital Data Representation

Microoperations

Basic Computer Organization

Pipeline and Vector Processing

Input Output Organization

Memory Organization

Multiprocessors

8085 Microprocessor

Microcontroller

8051 Microcontroller

Suggested Topics

CSS

Digital Logic Design

DBMS

Java Spring Framework

Operating System

Cyber Security

Data Science

SQL Server

UNIX