Aspire Faculty ID #19236 · Topic: UGC NET Computer Science June 2019 (Paper II) · Just now
UGC NET Computer Science June 2019 (Paper II)

Consider the equation

$(146)b+(313){b-2}=(246)_8$

Which of the following is the value of $b$?

Solution

Given equation is

$(146)b+(313){b-2}=(246)_8$

Now,

$(146)_b=1\cdot b^2+4\cdot b+6$

$=b^2+4b+6$

Also,

$(313)_{b-2}=3(b-2)^2+1(b-2)+3$

$=3(b^2-4b+4)+b-2+3$

$=3b^2-12b+12+b+1$

$=3b^2-11b+13$

Now,

$(246)_8=2\cdot 8^2+4\cdot 8+6$

$=128+32+6$

$=166$

So,

$b^2+4b+6+3b^2-11b+13=166$

$4b^2-7b+19=166$

$4b^2-7b-147=0$

Now factorizing,

$4b^2-28b+21b-147=0$

$4b(b-7)+21(b-7)=0$

$(b-7)(4b+21)=0$

So,

$b=7$

Previous 10 Questions — UGC NET Computer Science June 2019 (Paper II)

Nearest first
1
The parallel bus arbitration technique uses an external priority encoder and a decoder. Suppose, a parallel arbiter has…
Topic: UGC NET Computer Science June 2019 (Paper II)
2
For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance…
Topic: UGC NET Computer Science June 2019 (Paper II)
3
What will be the number of states when a $MOD-2$ counter is followed by a $MOD-5$ counter?
Topic: UGC NET Computer Science June 2019 (Paper II)
4
The fault can be easily diagnosed in the micro-program control unit using diagnostic tools by maintaining the contents …
Topic: UGC NET Computer Science June 2019 (Paper II)
5
How many different Boolean functions of degree $n$ are there?
Topic: UGC NET Computer Science June 2019 (Paper II)
6
Suppose that the register $A$ and the register $K$ have the bit configuration. Only the three leftmost bits of $A$ are …
Topic: UGC NET Computer Science June 2019 (Paper II)
7
Which type of addressing mode requires the least number of memory references?
Topic: UGC NET Computer Science June 2019 (Paper II)
8
Consider an LPP given as: $\text{Max } Z=2x_1-x_2+2x_3$ subject to the constraints: $2x_1+x_2\le 10$ $x_1+2x_2-2x_3\le …
Topic: UGC NET Computer Science June 2019 (Paper II)
9
Find the zero-one matrix of the transitive closure of the relation given by the matrix $A$:
Topic: UGC NET Computer Science June 2019 (Paper II)
10
List-I List-II (a) $p \to q$ (i) $\neg(q \to \neg p)$ …
Topic: UGC NET Computer Science June 2019 (Paper II)

Next 10 Questions — UGC NET Computer Science June 2019 (Paper II)

Ascending by ID
1
How many address lines and data lines are required to provide a memory capacity of $16K \times 16$?
Topic: UGC NET Computer Science June 2019 (Paper II)
2
Suppose that a computer program takes $100$ seconds of execution time on a computer with multiplication operation respo…
Topic: UGC NET Computer Science June 2019 (Paper II)
3
Consider the following pseudo-code fragment in which an invariant for the loop is $m \times x^k=p^n$ and $k\ge 0$. Pre-…
Topic: UGC NET Computer Science June 2019 (Paper II)
4
Consider the following C-code fragment running on a $32$-bit x86 machine:typedef struct { union { unsigned char a; unsi…
Topic: UGC NET Computer Science June 2019 (Paper II)
5
What is the output of the following JAVA program? public class Good { private int m; public Good(int m) { this.m = m; }…
Topic: UGC NET Computer Science June 2019 (Paper II)
6
Consider the following C++ function $f()$: unsigned int f(unsigned int n) { unsigned int b = 0; while (n) { b = b + (n …
Topic: UGC NET Computer Science June 2019 (Paper II)
7
Which of the following statements is/are true?$P$: In a scripting language like JavaScript, types are typically associa…
Topic: UGC NET Computer Science June 2019 (Paper II)
8
Which of the following statements is/are true?$P$: An XML document with correct syntax as specified by W3C is called "W…
Topic: UGC NET Computer Science June 2019 (Paper II)
9
Consider a raster system with resolution $640$ by $480$. What size is frame buffer in bytes for this system to store $1…
Topic: UGC NET Computer Science June 2019 (Paper II)
10
Consider the following statements regarding $2D$ transforms in computer graphics: $S1$: [ 1 0 …
Topic: UGC NET Computer Science June 2019 (Paper II)
Ask Your Question or Put Your Review.

loading...