ISRO Scientist or Engineer Computer Science 2015

Instructions

For the following questions answer them individually

Question 1

Which of the given number has its IEEE-754 32-bit floating-point representation as
(0 10000000 110 0000 0000 0000 0000 0000)

Video Solution

Question 2

The range of integers that can be represented by an n-bit 2’s complement number system is

Video Solution

Question 3

How many 32 K x 1 RAM chipsare needed to provide a memory capacity of 256 K-bytes?

Video Solution

Question 4

A modulus-12 ring counter requires a minimum of

Video Solution

Question 5

The complement of the Boolean expression $$AB(\overline{B}C + AC)$$ is

Video Solution

Question 6

The code which uses 7 bits to represent a character is

Video Solution

Question 7

If half adders and full adders are implements using gates, then for the addition of two 17 bit numbers (using minimum gates) the numberofhalf adders and full adders required will be

Video Solution

Question 8

Minimum number of 2 x 1 multiplexers required to realize the following function, $$f= \overline{A} \overline{B} C + \overline{A} \overline{B} \overline{C}$$.
Assume that inputs are available only in true form and Boolean a constant 1 and 0 are available.

Video Solution

Question 9

The numberof is in the binary representation of (3 * 4096 +15 * 256 +5+*16+3) are

Video Solution

Question 10

The boolean expression AB + AB' + A'C + AC is independent of the boolean variable

Video Solution

CAT Quant Questions | CAT Quantitative Ability

Linear Equations Inequalities Quadratic Equations Averages, Ratios & Proportions Profit & Loss Number Systems Time, Distance & Work Geometry Progressions & Series Probability Combinatorics Venn Diagrams Data Sufficiency Logarithms, Surds & Indices Functions, Graphs & Statistics Miscellaneous

CAT DILR Questions | LRDI Questions For CAT

DI Basics DI Charts Data Interpretation DI Data Change Over Period Tables With Missing Values DI Venn Diagrams DI Special Charts DI Maxima & Minima Quant-Based DI DI Connected Sets DI Miscellaneous LR Arrangement LR Selections With Conditions LR Coins & Weights LR Truth & Lie LR Puzzles LR Scheduling LR Games & Tournaments 2D & 3-D LR Quant-Based LR LR Miscellaneous

CAT Verbal Ability Questions | VARC Questions For CAT

Vocabulary Reading Comprehension (RC) Para Jumbles Para Completion and Summary Questions Grammar & Sentence Correction Critical Reasoning

CAT Content

ISRO Scientist or Engineer Computer Science 2015

Which of the given number has its IEEE-754 32-bit floating-point representation as(0 10000000 110 0000 0000 0000 0000 0000)

The range of integers that can be represented by an n-bit 2’s complement number system is

How many 32 K x 1 RAM chipsare needed to provide a memory capacity of 256 K-bytes?

A modulus-12 ring counter requires a minimum of

The complement of the Boolean expression $$AB(\overline{B}C + AC)$$ is

The code which uses 7 bits to represent a character is

If half adders and full adders are implements using gates, then for the addition of two 17 bit numbers (using minimum gates) the numberofhalf adders and full adders required will be

Minimum number of 2 x 1 multiplexers required to realize the following function, $$f= \overline{A} \overline{B} C + \overline{A} \overline{B} \overline{C}$$.Assume that inputs are available only in true form and Boolean a constant 1 and 0 are available.

The numberof is in the binary representation of (3 * 4096 +15 * 256 +5+*16+3) are

The boolean expression AB + AB' + A'C + AC is independent of the boolean variable

Login to your Cracku account

Hello! 👋

Ready to Unlock Your Success?

Please Enter Your OTP

Please enter the following details

Create a free Cracku account

CAT Quant Questions | CAT Quantitative Ability

CAT DILR Questions | LRDI Questions For CAT

CAT Verbal Ability Questions | VARC Questions For CAT

Which of the given number has its IEEE-754 32-bit floating-point representation as
(0 10000000 110 0000 0000 0000 0000 0000)

Minimum number of 2 x 1 multiplexers required to realize the following function, $$f= \overline{A} \overline{B} C + \overline{A} \overline{B} \overline{C}$$.
Assume that inputs are available only in true form and Boolean a constant 1 and 0 are available.