

MCQOPTIONS
Saved Bookmarks
This section includes 19 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.
1. |
Let A: “010101”, B=?, If { A (Ex-or) B } is a resultant string of all ones then which of the following statement regarding B is correct? |
A. | B is negation of A |
B. | B is 101010 |
C. | {A (and) B} is a resultant string having all zeroes |
D. | B} is a resultant string having all zeroesd) All of the mentioned |
Answer» E. | |
2. |
If in a bits string of {0,1}, of length 4, such that no two ones are together. Then the total number of such possible strings are? |
A. | 1 |
B. | 5 |
C. | 7 |
D. | 4 |
Answer» D. 4 | |
3. |
What is the 2’s complement of this string “01010100”? |
A. | 10101010 |
B. | 00110100 |
C. | 10101100 |
D. | 10101001 |
Answer» D. 10101001 | |
4. |
What is the one’s complement of this string “01010100”? |
A. | 10101010 |
B. | 00110101 |
C. | 10101011 |
D. | 10101001 |
Answer» D. 10101001 | |
5. |
The Ex-nor of this string “01010101” with “11111111” is? |
A. | 10101010 |
B. | 00110100 |
C. | 01010101 |
D. | 10101001 |
Answer» D. 10101001 | |
6. |
If A is “001100” and B is “010101” then what is the value of A (Ex-or) B? |
A. | 000000 |
B. | 111111 |
C. | 001101 |
D. | 011001 |
Answer» E. | |
7. |
If a bit string contains {0, 1} only, having length 5 has no more than 2 ones in it. Then how many such bit strings are possible? |
A. | 14 |
B. | 12 |
C. | 15 |
D. | 16 |
Answer» E. | |
8. |
How many bits string of length 4 are possible such that they contain 2 ones and 2 zeroes? |
A. | 4 |
B. | 2 |
C. | 5 |
D. | 6 |
Answer» E. | |
9. |
Which of the following option is suitable, if A is “10110110”, B is”11100000” and C is”10100000”? |
A. | C=A or B |
B. | C=~A |
C. | C=~B |
D. | C=A and B |
Answer» E. | |
10. |
Which of the following bits is the negation of the bits “010110”? |
A. | 111001 |
B. | 001001 |
C. | 101001 |
D. | 111111 |
Answer» D. 111111 | |
11. |
IF_IN_A_BITS_STRING_OF_{0,1}_,OF_LENGTH_4,SUCH_THAT_NO_TWO_ONES_ARE_TOGETHER._THEN_TOTAL_NUMBER_OF_SUCH_POSSIBLE_STRINGS_ARE??$ |
A. | 1 |
B. | 5 |
C. | 7 |
D. | 4 |
Answer» D. 4 | |
12. |
Let_A_:_“010101”_,B=?_,If_{_A_(Ex-or)_B_}_is_a_resultant_string_of_all_ones_then_which_of_the_following_statement_regarding_B_is_correct$# |
A. | B is negation of A |
B. | B is 101010 |
C. | {A (and) B} is a resultant string having all zeroes |
D. | All of the mentioned |
Answer» E. | |
13. |
The one’s complement of this string “01010100” is$ |
A. | 10101010 |
B. | 00110101 |
C. | 10101011 |
D. | 10101001 |
Answer» D. 10101001 | |
14. |
The Ex-nor of this string “01010101”with “11111111” is$ |
A. | 10101010 |
B. | 00110100 |
C. | 01010101 |
D. | 10101001 |
Answer» D. 10101001 | |
15. |
If A is “001100” and B is “010101” then A (Ex-or) B is$ |
A. | 000000 |
B. | 111111 |
C. | 001101 |
D. | 011001 |
Answer» E. | |
16. |
If a bit string contains {0, 1} only, having length 5 has no more than 2 ones in it. Then how many such bit strings are possible? |
A. | 14 |
B. | 12 |
C. | 15 |
D. | 16 |
Answer» E. | |
17. |
How many bits string of length 4 are possible such that they contains 2 ones and 2 zeroes? |
A. | 4 |
B. | 2 |
C. | 5 |
D. | 6 |
Answer» E. | |
18. |
Which of the following option is suitable, if A is “10110110”, B is”11100000”and C is”10100000”?$ |
A. | C=A or B |
B. | C=~A |
C. | C=~B |
D. | C=A and B |
Answer» E. | |
19. |
Which of the following bits is the negation of the bits “010110”? |
A. | 111001 |
B. | 001001 |
C. | 101001 |
D. | 111111 |
Answer» D. 111111 | |