adplus-dvertising

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 UGC CBSE NET Exam. 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 UGC CBSE NET Exam.

frame-decoration

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 UGC CBSE NET Exam.

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 4 of 9

Explore more Topics under UGC CBSE NET Exam

Q31.
Match the following:

List – I                                    List – II
a. Controlled Inverter              i. a circuit that can add 3 bits
b. Full adder                             ii. a circuit that can add two binary numbers
c. Half adder                             iii. a circuit that transmits a binary word or its
1’s complement
d. Binary adder                        iv. a logic circuit that adds 2 bits

Codes :
      a    b    c   d

a.

iii    ii    iv   i

b.

ii     iv   i    iii

c.

iii    iv   i    ii

d.

iii    i    iv   ii

Discuss
Answer: (d).iii    i    iv   ii
Q32.
Which of the following 2 input Boolean logic functions is linearly inseparable?

(a) AND             (b) OR
(c) NOR             (d) XOR
(e) NOT XOR

a.

(a) and (b)

b.

(b) and (c)

c.

(c), (d) and (e)

d.

(d) and (e)

Discuss
Answer: (d).(d) and (e)
Q33.
Simplified Boolean equation for the following truth table is:

a.

F = yz’ + y’z

b.

F = xy’ + x’y

c.

F = x’z + xz’

d.

F = x’z + xz’ + xyz

Discuss
Answer: (c).F = x’z + xz’
Q34.
The three outputs x1x2x3 from the 8x3 priority encoder are used to provide a vector address of the form 101x1x2x300. What is the second highest priority vector address in hexadecimal if the vector addresses are starting from the one with the highest priority?

a.

BC

b.

A4

c.

BD

d.

AC

Discuss
Answer: (b).A4
Q35.
Which of the following statement(s) is(are) not correct ?

i. The 2's complement of 0 is 0.
ii. In 2's complement, the left most bit cannot be used to express a quantity.
iii. For an n-bit word (2's complement) which includes the sign bit, there are 2^n-1 positive integers, 2^n+1 negative integers and one 0 for a total of 2^n unique states.
iv. In 2's complement the significant information is contained in the 1's of positive numbers and 0's of the negative numbers.

a.

i and iv

b.

i and ii

c.

iii

d.

iv

Discuss
Answer: (c).iii
Q36.
The sum of products expansion for the function

F(x, y, z) = (x + y)z’

is given as

a.

x’y’z + xyz’ + x’yz’

b.

xyz + xyz’ + xy’z’

c.

xy’z’ + x’y’z’ + xyz’

d.

xyz’ + xy’z’ + x’yz’

Discuss
Answer: (d).xyz’ + xy’z’ + x’yz’
Q37.
What will be the output of the following logic diagram?

a.

x OR y

b.

x AND y

c.

x NOR y

d.

x XNOR y

Discuss
Answer: (c).x NOR y
Q38.
The IEEE single-precision and double-precision format to represent floating-point numbers, has a length of ................. and ................ respectively.

a.

8 bits and 16 bits

b.

16 bits and 32 bits

c.

32 bits and 64 bits

d.

64 bits and 128 bits

Discuss
Answer: (c).32 bits and 64 bits
Q39.
If F and G are Boolean functions of degree n. Then, which of the following is true?

a.

F ≤ F + G and F G ≤ F

b.

G ≤ F + G and F G ≥ G

c.

F ≥ F + G and F G ≤ F

d.

G ≥ F + G and F G ≤ F

Discuss
Answer: (a).F ≤ F + G and F G ≤ F
Q40.
Match the following identities/laws to their corresponding name:

(a) x + x = x
x • x = x                      i. Dominance
(b) x + 0 = x
x • 1 = x                      ii. Absorption
(c) x + 1 = 1
x • 0 = 0                      iii. Idempotent
(d) x • (x + y) = x           iv. Identity

Codes:
     (a)  (b)  (c)  (d)

a.

iii   iv     i     ii

b.

iv   iii     i     ii

c.

iv   iii    ii     i

d.

iii   iv    ii     i

Discuss
Answer: (a).iii   iv     i     ii
Page 4 of 9

Suggested Topics

Are you eager to expand your knowledge beyond Computer Arithmetic? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Python

Dive into one of the most popular languages with our Python MCQs. Understand...

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

Object Oriented Programming Using C++

Enhance your programming skills with our MCQs on Object Oriented Programming using...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...