MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1917 Mcqs, each offering curated multiple-choice questions to sharpen your UGC-NET knowledge and support exam preparation. Choose a topic below to get started.
| 251. |
The sum of products expansion for the functionF(x, y, z) = (x + y)z’ is given as |
| A. | x’y’z + xyz’ + x’yz’ |
| B. | xyz + xyz’ + xy’z’ |
| C. | xy’z’ + x’y’z’ + xyz’ |
| D. | xyz’ + xy’z’ + x’yz’ |
| Answer» E. | |
| 252. |
If X is a binary number which is power of 2, then the value of X&(X-1) is: |
| A. | 11....11 |
| B. | 00.....00 |
| C. | 100.....0 |
| D. | 000.....1 |
| Answer» C. 100.....0 | |
| 253. |
Consider a code with five valid code words of length ten :0000000000, 0000011111, 1111100000, 1110000011, 1111111111Hamming distance of the code is |
| A. | 5 |
| B. | 10 |
| C. | 8 |
| D. | 9 |
| Answer» B. 10 | |
| 254. |
The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is |
| A. | (W' + X') (Y' + Z') (X' + Z) |
| B. | (W' + X') (Y' + Z') (X' + Z') |
| C. | (W' + X') (Y' + Z) (X' + Z) |
| D. | (W' + X') (Y + Z') (X' + Z) |
| Answer» B. (W' + X') (Y' + Z') (X' + Z') | |
| 255. |
A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that isP1 || P2 || P3 || ..... || Pk if and only if: |
| A. | Pi || Pj for all i ≠ j |
| B. | Pi || Pj for all i = j+1 |
| C. | Pi || Pj for all i ≤ j |
| D. | Pi || Pj for all i ≥ j |
| Answer» B. Pi || Pj for all i = j+1 | |
| 256. |
The number of 1’s present in the binary representation of10 × 256 + 5 × 16 + 5 is |
| A. | 5 |
| B. | 6 |
| C. | 7 |
| D. | 8 |
| Answer» C. 7 | |
| 257. |
The Simplified form of a Boolean equation for the following truth table is |
| A. | F = yz' + y'z |
| B. | F = xy' + x'y |
| C. | F = x'z + xz' |
| D. | F = X'z + xz' + xyz |
| Answer» D. F = X'z + xz' + xyz | |
| 258. |
In a Positive edge triggered JK flip-flop, if J and K both are high then the output will be _______ on the rising edge of the clock. |
| A. | No Change |
| B. | Set |
| C. | Reset |
| D. | Toggle |
| Answer» E. | |
| 259. |
An example of a self complementing code is: |
| A. | 8421 code |
| B. | Gray code |
| C. | Excess-3 code |
| D. | 7421 code |
| Answer» D. 7421 code | |
| 260. |
What is the maximum counting speed of a 4-bit binary counter which is composed of Flip-Flop with a propagation delay of 25ns? |
| A. | 1 MHz |
| B. | 10 MHz |
| C. | 100 MHz |
| D. | 4 MHz |
| Answer» C. 100 MHz | |
| 261. |
A sum of products expression can be implemented with...............logic gates. |
| A. | AND – OR |
| B. | NAND − OR |
| C. | AND – NOT |
| D. | OR – AND |
| Answer» B. NAND − OR | |
| 262. |
Which of the following expression removes static hazard from a two level AND-OR gate implementation of xy + zx’ ? |
| A. | xy + zx’ |
| B. | xy + zx’ + wyz |
| C. | xy + zx’ + yz |
| D. | xy + zx’ + wz |
| Answer» D. xy + zx’ + wz | |
| 263. |
Upto how many variables, can the Karnaugh map be used ? |
| A. | 3 |
| B. | 4 |
| C. | 5 |
| D. | 6 |
| Answer» E. | |
| 264. |
The number of 1’s present in the binary representation of (3x512 + 7x64 + 5x8 + 3)10 is: |
| A. | 8 |
| B. | 9 |
| C. | 10 |
| D. | 11 |
| Answer» C. 10 | |
| 265. |
Which of the following is divisible by 4? |
| A. | 100101100 |
| B. | 1110001110001 |
| C. | 11110011 |
| D. | 10101010101010 |
| Answer» B. 1110001110001 | |
| 266. |
1 Kilo Bytes refers to: |
| A. | 1000 Bytes |
| B. | 1024 Bytes |
| C. | 8000 Bytes |
| D. | 8192 Bytes |
| Answer» C. 8000 Bytes | |
| 267. |
Which of the following binary number is the same as its 2’s complement: |
| A. | 1010 |
| B. | 0101 |
| C. | 1000 |
| D. | 1001 |
| Answer» D. 1001 | |
| 268. |
A V A = A is called: |
| A. | Identity law |
| B. | De Morgan’s law |
| C. | Idempotent law |
| D. | Complement law |
| Answer» D. Complement law | |
| 269. |
Suppose x and y are two Integer Variables having values 0x5AB6 and 0x61CD respectively. The result (in hex) of applying bitwise operator AND to x and y will be: |
| A. | 0x5089 |
| B. | 0x4084 |
| C. | 0x78A4 |
| D. | 0x3AD1 |
| Answer» C. 0x78A4 | |
| 270. |
The following Boolean expression is equivalent to |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 271. |
The hexadecimal equivalent of (10111)2 × (1110)2 is: |
| A. | 150 |
| B. | 241 |
| C. | 142 |
| D. | 101011110 |
| Answer» D. 101011110 | |
| 272. |
The absorption law in Boolean algebra say that |
| A. | X + X = X |
| B. | X . X = X |
| C. | x + x . y = x |
| D. | None of the above |
| Answer» D. None of the above | |
| 273. |
Encoding of data bits 0011 into 7-bit even Parity Hamming Code is |
| A. | 0011110 |
| B. | 0101110 |
| C. | 0010110 |
| D. | 0011100 |
| Answer» B. 0101110 | |
| 274. |
If F and G are Boolean functions of degree n. Then, which of the following is true? |
| A. | F ≤ F + G and F G ≤ F |
| B. | G ≤ F + G and F G ≥ G |
| C. | F ≥ F + G and F G ≤ F |
| D. | G ≥ F + G and F G ≤ F |
| Answer» B. G ≤ F + G and F G ≥ G | |
| 275. |
Which of the following logic expressions is incorrect ? |
| A. | 1⊕0 = 1 |
| B. | 1⊕1⊕1 = 1 |
| C. | 1⊕1⊕0 = 1 |
| D. | 1⊕1 = 0 |
| Answer» D. 1⊕1 = 0 | |
| 276. |
Negative numbers cannot be represented in |
| A. | signed magnitude form |
| B. | 1’s complement form |
| C. | 2’s complement form |
| D. | none of the above |
| Answer» E. | |
| 277. |
(A + B)(AB)’ is equivalent to |
| A. | A⨁B |
| B. | A⨀B |
| C. | (A⨁B)⨀A |
| D. | A⨀B)⨁A |
| Answer» B. A⨀B | |
| 278. |
The equivalent hexadecimal notation for octal number 2550276 is : |
| A. | FADED |
| B. | AEOBE |
| C. | ADOBE |
| D. | ACABE |
| Answer» D. ACABE | |
| 279. |
In a weighted code with weight 6, 4, 2 ,-3 the decimal 5 is represented by: |
| A. | 0101 |
| B. | 0111 |
| C. | 1011 |
| D. | 1000 |
| Answer» D. 1000 | |
| 280. |
The hexadecimal number equivalent to (1762.46)8 is |
| A. | 3F2.89 |
| B. | 3F2.98 |
| C. | 2F3.89 |
| D. | 2F3.98 |
| Answer» C. 2F3.89 | |
| 281. |
An example of a binary number which is equal to its 2’s complement is: |
| A. | 1100 |
| B. | 1001 |
| C. | 1000 |
| D. | 1111 |
| Answer» D. 1111 | |
| 282. |
The logic expression x’yz’ + x’yz + xyz’ + xyz reduces to: |
| A. | x’z |
| B. | xyz |
| C. | y |
| D. | yz |
| Answer» D. yz | |
| 283. |
The decimal floating point number -40.1 represented using IEEE-754 32 bit representation and written in hexadecimal form is |
| A. | 0xC2006666 |
| B. | 0xC2206666 |
| C. | 0xC2006000 |
| D. | 0xC2206000 |
| Answer» C. 0xC2006000 | |
| 284. |
The IEEE-754 double precision format to represent floating point numbers, has a length of _____ bits. |
| A. | 16 |
| B. | 32 |
| C. | 48 |
| D. | 64 |
| Answer» E. | |
| 285. |
Which of the following statement(s) is(are) not correct ?i. The 2's complement of 0 is 0.ii. In 2's complement, the left most bit cannot be used to express a quantity.iii. For an n-bit word (2's complement) which includes the sign bit, there are 2^n-1 positive integers, 2^n+1 negative integers and one 0 for a total of 2^n unique states.iv. In 2's complement the significant information is contained in the 1's of positive numbers and 0's of the negative numbers. |
| A. | i and iv |
| B. | i and ii |
| C. | iii |
| D. | iv |
| Answer» D. iv | |
| 286. |
(101011)2 = (53)b, then b is equal to: |
| A. | 4 |
| B. | 8 |
| C. | 10 |
| D. | 16 |
| Answer» C. 10 | |
| 287. |
The idempotent law in Boolean algebra says that: |
| A. | ~(~x)=x |
| B. | x+x=x |
| C. | x+xy=x |
| D. | x(x+y)=x |
| Answer» C. x+xy=x | |
| 288. |
The octal equivalent of the hexadecimal number FF is: |
| A. | 100 |
| B. | 150 |
| C. | 377 |
| D. | 737 |
| Answer» D. 737 | |
| 289. |
Which of the following expression remove hazard form: xy+zx’ ? |
| A. | xy+x’ |
| B. | xy+zx’ |
| C. | xy+zx’+yz |
| D. | xy+zx’+wz |
| Answer» D. xy+zx’+wz | |
| 290. |
If A⊕B=C, then: |
| A. | A⊕C=B |
| B. | B⊕C=A |
| C. | A⊕B⊕C=0 |
| D. | All of the above |
| Answer» E. | |
| 291. |
2’s complement of -100 is: |
| A. | 00011100 |
| B. | 10011101 |
| C. | 10011100 |
| D. | 11100100 |
| Answer» D. 11100100 | |
| 292. |
The dual of the switching function x+yz is: |
| A. | x+yz |
| B. | x’+y’z’ |
| C. | x(y+z) |
| D. | x’(y’+z’) |
| Answer» E. | |
| 293. |
How many 1’s are present in the binary representation of 15x256+5x16+3: |
| A. | 8 |
| B. | 9 |
| C. | 10 |
| D. | 11 |
| Answer» B. 9 | |
| 294. |
The octal equivalent of hexadecimal (A.B)16 is: |
| A. | 47.21 |
| B. | 12.74 |
| C. | 12.71 |
| D. | 17.21 |
| Answer» C. 12.71 | |
| 295. |
Simplified form of Boolean expression xy+(~x)z+yz is: |
| A. | xy+(~x)z |
| B. | (~x)y+(~x)z |
| C. | (~x)y+xz |
| D. | xy+xz |
| Answer» B. (~x)y+(~x)z | |
| 296. |
In order to build a MOD-18 counter, the minimum number of flip flops needed is equal to: |
| A. | 18 |
| B. | 9 |
| C. | 5 |
| D. | 4 |
| Answer» D. 4 | |
| 297. |
The DIR command in DOS operating system |
| A. | Copies files |
| B. | Erases files |
| C. | Extracts a list of file name |
| D. | None of these |
| Answer» D. None of these | |
| 298. |
In object oriented design of software |
| A. | Objects inherit the properties |
| B. | Classes are defined based on the attributes of object |
| C. | Classes are always different |
| D. | All of these |
| Answer» E. | |
| 299. |
Reliability of software is directly dependent on: |
| A. | quality of the design |
| B. | number of errors present |
| C. | software engineer’s experience |
| D. | user requirement |
| Answer» C. software engineer’s experience | |
| 300. |
The simplest model in software development is |
| A. | Waterfall model |
| B. | Prototyping |
| C. | Iterative |
| D. | None of these |
| Answer» B. Prototyping | |