Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Tests > Test: Boolean Operations - Computer Science Engineering (CSE) MCQ

Test Description

Test: Boolean Operations for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Test: Boolean Operations questions and answers have been prepared
according to the Computer Science Engineering (CSE) exam syllabus.The Test: Boolean Operations MCQs are made for Computer Science Engineering (CSE) 2024 Exam.
Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Boolean Operations below.

Solutions of Test: Boolean Operations questions in English are available as part of our course for Computer Science Engineering (CSE) & Test: Boolean Operations solutions in
Hindi for Computer Science Engineering (CSE) course.
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Boolean Operations | 30 questions in 90 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study for Computer Science Engineering (CSE) Exam | Download free PDF with solutions

Test: Boolean Operations - Question 1

Consider a carry look-ahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is:

Detailed Solution for Test: Boolean Operations - Question 1

Test: Boolean Operations - Question 2

Consider an eight-bit ripple-carry adder for computing the sum of A and B, where A and B are integers represented in 's complement form. If the decimal value of A is one, the decimal value of B that leads to the longest latency for the sum to stabilize is ___________

Detailed Solution for Test: Boolean Operations - Question 2

1 Crore+ students have signed up on EduRev. Have you? Download the App |

Test: Boolean Operations - Question 3

An N-bit carry lookahead adder, where N is a multiple of 4, employs ICs 74181 (4 bit ALU) and 74182 ( 4 bit carry lookahead generator).

The minimum addition time using the best architecture for this adder is

Detailed Solution for Test: Boolean Operations - Question 3

Test: Boolean Operations - Question 4

The number of full and half-adders required to add 16-bit numbers is:

Detailed Solution for Test: Boolean Operations - Question 4

Test: Boolean Operations - Question 5

A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only.Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time unit, what is the overall propagation delay of the adder? Assume that the carry network has been implemented using two-level AND-OR logic.

Detailed Solution for Test: Boolean Operations - Question 5

Test: Boolean Operations - Question 6

The maximum gate delay for any output to appear in an array multiplier for multiplying two-bit numbers is:

Detailed Solution for Test: Boolean Operations - Question 6

Test: Boolean Operations - Question 7

Consider an array multiplier for multiplying two n bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is:

Detailed Solution for Test: Boolean Operations - Question 7

Test: Boolean Operations - Question 8

are Boolean variables, operator.

Which one of the following must always be TRUE?

Detailed Solution for Test: Boolean Operations - Question 8

Test: Boolean Operations - Question 9

The total number of Boolean functions which can be realised with four variables is:

Detailed Solution for Test: Boolean Operations - Question 9

Test: Boolean Operations - Question 10

The simultaneous equations on the Boolean variables x, y, z and w,

have the following solution for x, y, z and w, respectively:

Detailed Solution for Test: Boolean Operations - Question 10

Test: Boolean Operations - Question 11

Consider the Boolean operator # with the following properties :

Detailed Solution for Test: Boolean Operations - Question 11

Detailed Solution for Test: Boolean Operations - Question 12

Test: Boolean Operations - Question 13

Find values of Boolean variables A,B,C which satisfy the following equations:

- A+ B = 1
- AC = BC
- A + C = 1
- AB = 0

Detailed Solution for Test: Boolean Operations - Question 13

Detailed Solution for Test: Boolean Operations - Question 14

Test: Boolean Operations - Question 15

In boolean algebra, the OR operation is performed by which properties?

Detailed Solution for Test: Boolean Operations - Question 15

Detailed Solution for Test: Boolean Operations - Question 16

Detailed Solution for Test: Boolean Operations - Question 17

Test: Boolean Operations - Question 18

The function AB’C + A’BC + ABC’ + A’B’C + AB’C’ is equivalent to

Detailed Solution for Test: Boolean Operations - Question 18

Detailed Solution for Test: Boolean Operations - Question 19

Test: Boolean Operations - Question 20

Define the connective

Consider the following expressions

Which of the following is TRUE?

Detailed Solution for Test: Boolean Operations - Question 20

Detailed Solution for Test: Boolean Operations - Question 21

Test: Boolean Operations - Question 22

In boolean algebra, the OR operation is performed by which properties?

Detailed Solution for Test: Boolean Operations - Question 22

Test: Boolean Operations - Question 23

Which one of the following expressions does NOT represent exclusive NOR of x and y?

Detailed Solution for Test: Boolean Operations - Question 23

Test: Boolean Operations - Question 24

denote the exclusive OR (XOR) operation. Let '1' and '0' denote the binary constants. Consider the following Boolean expression for F over two variables P and Q:

The equivalent expression for is

The equivalent expression for F is

Detailed Solution for Test: Boolean Operations - Question 24

Test: Boolean Operations - Question 25

If are Boolean variables, then which one of the following is INCORRECT?

Detailed Solution for Test: Boolean Operations - Question 25

Test: Boolean Operations - Question 26

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: The operation which is commutative but not associative is:

Detailed Solution for Test: Boolean Operations - Question 26

Detailed Solution for Test: Boolean Operations - Question 27

Test: Boolean Operations - Question 28

When multiplicand Y is multiplied by multiplierusing bit-pair recoding in Booth's algorithm, partial products are generated according to the following table.

The partial products for rows 5 and 8 are

Detailed Solution for Test: Boolean Operations - Question 28

Test: Boolean Operations - Question 29

Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is

Detailed Solution for Test: Boolean Operations - Question 29

Detailed Solution for Test: Boolean Operations - Question 30

Information about Test: Boolean Operations Page

In this test you can find the Exam questions for Test: Boolean Operations solved & explained in the simplest way possible.
Besides giving Questions and answers for Test: Boolean Operations , EduRev gives you an ample number of Online tests for practice

Download as PDF