A Place for Latest Exam wise Questions, Videos, Previous Year Papers,

Study Stuff for MCA Examinations

Study Stuff for MCA Examinations

If we can generate a maximum of 4 Boolean functions using n Boolean variables, what will be minimum value of n?

NIMCET PREVIOUS YEAR QUESTION

Go to Discussion

The Process when processor fetch or decode another instruction during the execution of current instruction is called

Go to Discussion

Pipelining is the process of accumulating instruction from the processor through a pipeline. It allows storing and executing instructions in an orderly process. It is also known as pipeline processing. Pipelining is a technique where multiple instructions are overlapped during execution.

Which of the following is used by ALU to store the intermediate results?

Go to Discussion

An accumulator is a type of register included in a CPU. It acts as a temporary storage location which holds an intermediate value in mathematical and logical calculations. Intermediate results of an operation are progressively written to the accumulator, overwriting the previous value. For example, in the operation "3 + 4 + 5," the accumulator would hold the value 3, then the value 7, then the value 12. The benefit of an accumulator is that it does not need to be explicitly referenced, which conserves data in the operation statement.

One TeraByte(TB)=_________GB and One ExaByte(EB)=_______GB

Go to Discussion

Unit | Shortened | Capacity |
---|---|---|

Bit | b | 1 or 0 (on or off) |

Byte | B | 8 bits |

Kilobyte | KB | 1024 bytes |

Megabyte | MB | 1024 kilobytes |

Gigabyte | GB | 1024 megabytes |

Terabyte | TB | 1024 gigabytes |

Petabyte | PB | 1024 terabytes |

Exabyte | EB | 1024 petabytes |

Zettabyte | ZB | 1024 exabytes |

Yottabyte | YB | 1024 zettabytes |

The Cache Memory is more effective because of

Go to Discussion

Locality of reference refers to a phenomenon in which a computer program tends to access same set of memory locations for a particular time period. In other words, Locality of Reference refers to the tendency of the computer program to access instructions whose addresses are near one another.

Which of the following is the fastest means of memory access for CPU?

Go to Discussion

Registers are a type of computer memory used to quickly accept, store, and transfer data and instructions that are being used immediately by the CPU. The registers used by the CPU are often termed as Processor registers.

The number (2217)_{8} is equivalent to

Go to Discussion

Pair of 4 Bits

1111= F

1000=8

0100=4

(010010001111)8 =(48F)16

To fetch data from secondary memory which one of the following register is used

Go to Discussion

MAR register is used to access data and instructions from memory during the execution phase of instruction. MAR holds the memory location of data that needs to be accessed. When reading from memory, data addressed by MAR is fed into the MDR (memory data register) and then used by the CPU. When writing to memory, the CPU writes data from MDR to the memory location whose address is stored in MAR. MAR, which is found inside the CPU, goes either to the RAM (random-access memory) or cache.

The binary multiplication 00*11 will give

Go to Discussion

Consider a computer system with speed of 10^{6 } instructions per second. A program P, having 2n^{2} steps is run on this system, where n is the input size. If n = 10000, what is the execution time for P?

Go to Discussion

$\text{For n} =10000=10^4$

$$Time = \frac{\text{No of tasks}}{\text{Speed of computer}}$$

$$Time = \frac{2n^2}{10^6}$$

$$= \frac{2\times (10^4)^2}{10^6}$$

$$= \frac{2\times 10^8}{10^6}$$

$$=2 \times 10^2$$

$$= 200sec$$

To access the I/O devices the status flags is continuously checked in

Go to Discussion

Programmed I/O: In program-controlled I/O, the processor program controls the complete data transfer. So only when an I/O transfer instruction is executed, the transfer could take place. It is required to check that device is ready/not for the data transfer in most cases. Usually, the transfer is to & from a CPU register & peripheral. Here, CPU constantly monitors the peripheral. Here, until the I/O unit indicates that it is ready for transfer, the CPU wait & stays in a loop. It is time-consuming as it keeps the CPU busy needlessly.

Which one of the following Boolean algebraic rule is correct?

Go to Discussion

A + A'B = (A + A') . (A + B)

= 1 . (A + B)

= A + B

The representation of a floating point binary number +1001.11 in 8 bit fraction and 6 bit exponent format is

Go to Discussion

Which term is redundant in the expression AB + A'C + BC ?

Go to Discussion

Let the memory access time is 10 miliseconds and cache hit ratio 15%. The effective memory access time is

Go to Discussion

Which of the following is the representation of decimal number (- 147) in 2's compliment notation on a 12-bit machine?

Go to Discussion

The first instruction of bootstrap loader program of an operating system is stored in

Go to Discussion

Consider the equation (40)_{x} = (132)_{y} is some bases x and y. Then a possible set of value of x and y are

Go to Discussion

The smallest integer that can be represented by an 8 bit number in 2's complement form is

Go to Discussion

Which of the following in a functionally complete set of gates?

I. NAND II. NOR

Go to Discussion

The total number binary function that can be defined using n Boolean variables is

Go to Discussion

Assume x' represents negation of x the Boolean function x'y' + xy + x'y is equivalent to?

Go to Discussion

The memory unit which directly communicates with
the CPU is known as

Go to Discussion

Dynamic RAM consumes……. Power and ……than Static RAM

Go to Discussion

The binary equivalent of (234.125)_{10}?

Go to Discussion

Determine the octal equivalent of (432267)_{10}?

Go to Discussion

One Exabyte is equal to …

Go to Discussion

Consider the following circuit.

How many minimum numbers of two input NAND
gates are required to design the above circuit?

Go to Discussion

The time required for fetching and execution of one
simple machine instruction is known as

Go to Discussion

The equivalence of given expression x+x'y with Boolean theorem is….

Go to Discussion

x+x'y

=(x+x')(x+y)=(x+y)

The logic XOR operation of (4AC0)_{16} and (B53F)_{16}
results

Go to Discussion

The maximum and minimum value represented in signed 16-bit 2s compliment representation are

Go to Discussion

Which of the following is true about Von Neumann architecture?

Go to Discussion

Equivalent of the decimal number (25.375)10 in binary form

Go to Discussion

Consider the following minterm for F:F(P, Q, R, S) = Σ0, 2, 5, 7, 8, 10, 13, 15. The minterms 2, 7, 8, and 13 are don't care terms. The minimal sum of products form for F is

Go to Discussion

Suppose we have a 10-bit computer that uses 10-bit int (2's complement representation). the number representation of - 35 is

Go to Discussion

A wrong sentence related to FAT 32 and NTFS file systems is

Go to Discussion

A bulb in the staircase has two switches, one switch is at the ground floor and the other one is at the first floor. The bulb can be turned ON and also can be turned OFF by any of the switches irrespective of the state of the other switch. The logic of the switching of the bulb resembles

Go to Discussion

Suppose we have a 10-bit computer that uses 10-bit floating point computational unit (Float number uses IEEE floating-point arithmetic where a floating point number has 1 sign bit, 5 exponent bits, and 4 fraction bits). The representation for +∞ (plus infinity) is

Go to Discussion

Cosider the following Boolean Expression for F:

$F(P,Q,R,S)=PQ+\overline{P}QR+\overline{P}Q\overline{R}S$ .

The minimum sum of products form of F is

Go to Discussion

What is the name of the storage device that compensates the difference in rates of flow of data from one device to another?

Go to Discussion

If a processor clock is rated as million cycles per second, then its clock perios is:

Go to Discussion

A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can hold a total of 128 page table entries and is 4 -way set associative. The minimum size of the TLB tag is:

Go to Discussion

The number of minterms in a $n$ variable truth tableis

Go to Discussion

Let $\oplus$ and $\odot$ denote the Exclusive - OR and Exclusive-NOR operations respectively. Which of the following is not correct?

Go to Discussion

Which of the following registers is used to keep track of address of the memory location where the next instruction is located?

Go to Discussion

The time required for fetching and execution of one machine instruction is:

Go to Discussion

Consider the circuit shown below and find minimum number of NAND gates required to design it.

Go to Discussion

How many 32K $\times$ 1 RAM chips are needed to provide a memory capacity of 256K bytes?

Go to Discussion

What is a potential problem of 1’s complement representation of numbers?

Go to Discussion

The reduced form of the Boolean function $F=xyz+xyz^{\prime}^{}+x^{\prime}yz+xy^{\prime}z$ is

Go to Discussion

In IEEE single precision floating point representation, exponent is represented in ______

Go to Discussion

With 4-bit 2's complement arithmetic, which of the following addition will result in overflow?

Go to Discussion

If the 2's complement representation of a number is (011010)_{2} , what is its equivalent hexadecimal representation?

Go to Discussion

For the circuit shown below, the complement of the output F is _________

Go to Discussion

If N is a 16-bit signed integer, then 2's complement representation of N is (F87B)_{16}. The 2's complement representation of 8*N is

Go to Discussion

The base ( or radix) of the number system such that the following equation holds 312/20 = 131.1 is

Go to Discussion

Which of the following represents (D4)_{16 }?

Go to Discussion

How many Boolean expressions can be be formed with 3 Boolean variables?

_{}

Go to Discussion

In an 8 bit representation of computer system the decimal number 47 has to be subtracted from 38 and the result in binary 2's complement is _________

_{}

Go to Discussion

The maximum and minimum value represented in signed
16 bit 2's complement representations are

Go to Discussion

Range for 16 bits = $-2^{16-1}$ to $2^{16-1}+1$

Range for 16 bits = $-2^{15}$ to $2^{25}+1$

Range for 16 bits = $-32768$ to $32767$

The minimum number of NAND gates required for implementing the Boolean expression $AB+A\, \overline{B}C+A\, \overline{B}\, \overline{C}$

Go to Discussion

=$AB+AB'C+AB'C'$

=$AB+AB'(C+C')$

=$AB+AB'$

=$A(B+B')$

=A

Which of the following is equivalent to the Boolean expression:

$(X+Y).(X+\overline{Y}).(\overline{X}+Y)$

Go to Discussion

$(X+Y).(X+\overline{Y}).(\overline{X}+Y)$

=$(X+Y)(X+Y')(X'+Y)$

=$(XX+XY+YX+YY')(X'+Y)$

=$(X+XY)(X'+Y)$

=$X(1+Y)(X'+Y)$

=$X(X'+Y)$

=$XX'+XY$

=$XY$

Suppose the largest n bit number requires ‘d’ digits in decimal representation. Which of the following relations between ‘n’ and ‘d’ is approximately correct

Go to Discussion

So, ${10}^d{\gt}{2}^n$

Take on both side

$\log _{10}({10}^d)\gt{\log _{10}({2}^n)}^{}$

$d{\gt}n\log _{10}(2)$

If a processor clock is rated as 2500 million cycles per second, then its clock period is:

Go to Discussion

we know that Frequency is defined as the number of cycles in one second

Number of cycle in 1 sec = 2500 million

=> Frequency = 2500 Mhz

we know that time period is the inverse of frequency and is defined as the time taken by one cycle.

$T = \frac{1}{F}$

$T = \frac{1}{2500 \times 10^{-6}}$

$T=4 \times 10^{-10} $ sec

Write the simplified form of the Boolean expression

(A+C)(AD+AD')+AC+C

Go to Discussion

=(A+C)A(D+D')+C(A+1)

=(A+C)+C

=A+C

FFFF will be the last memory location in a memory of size

Go to Discussion

The Hexadecimal digits are 0-9 and A-F. The Hexadecimal system represents numbers in16 symbols, zero to nine and ten to fifteen is represented by the English alphabet A-F.

The Hexadecimal character represents 4 bits.

The last memory location in a memory of size 64K is FFFF.

64K is $2^{16}$ bytes, i.e.

$16^4$ bytes = 1000 bytes in hexadecimal code.

The last accessible address is 1000-1 = FFFF.

‘Floating point representation' is used to represent

Go to Discussion

The Boolean expression AB+ AB' + A'C + AC is unaffected by the value of the Boolean variable

Go to Discussion

If a signal passing through a gate is inhibited by sending a low into one of the inputs, and the output is HIGH, the gate is a(n):

Go to Discussion

A | B | Output |

0 | 0 | 0 |

0 | 1 | 1 |

1 | 0 | 1 |

1 | 1 | 1 |

**Online Test Series, **

Information About Examination,

Syllabus, Notification

and More.

View More

**Online Test Series, **

Information About Examination,

Syllabus, Notification

and More.

View More