Aspire Faculty ID #19328 · Topic: UGC NET Computer Science Dec 2018 (Paper II) · Just now
UGC NET Computer Science Dec 2018 (Paper II)

In computers, subtraction is generally carried out by:

Solution

In computers, subtraction is generally performed using $2$'s complement method.

For subtracting $B$ from $A$, the computer takes the $2$'s complement of $B$ and adds it to $A$.

This makes subtraction possible using the same binary adder circuit used for addition.

Therefore, subtraction in computers is generally carried out by $2$'s complement.

Previous 10 Questions — UGC NET Computer Science Dec 2018 (Paper II)

Nearest first

Next 10 Questions — UGC NET Computer Science Dec 2018 (Paper II)

Ascending by ID
1
Consider the following Boolean equations:$(i)\ wx+w(\overline{x}+y)+x(\overline{x}+y)=x+wy$$(ii)\ (w\overline{x}(y+x\ov…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
2
Consider the graph shown below : Use Kruskal's algorithm to find the minimum spanning tree of the graph. The weigh…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
3
Consider the following statements: $(i)$ Auto increment addressing mode is useful in creating self-relocating code. $(i…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
4
A computer uses a memory unit with $256K$ words of $32$ bits each. A binary instruction code is stored in one word of m…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
5
Consider the following x86 assembly language instructions: MOV AL, $153$ NEG AL The contents of the destination registe…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
6
The decimal floating point number $-40.1$ represented using IEEE-754 $32$-bit representation and written in hexadecimal…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
7
Find the Boolean expression for the logic circuit shown below: $(1-\text{NAND gate},\ 2-\text{NOR gate},\ 3-\text{NOR g…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
8
Consider a disk pack with $32$ surfaces, $64$ tracks and $512$ sectors per track. $256$ bytes of data are stored in a b…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
9
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $0.5$ ns, …
Topic: UGC NET Computer Science Dec 2018 (Paper II)
10
If a graph $G$ has no loops or parallel edges, and if the number of vertices $n$ in the graph is $n\geq 3$, then graph …
Topic: UGC NET Computer Science Dec 2018 (Paper II)
Ask Your Question or Put Your Review.

loading...