Register

UGC NET CSE | December 2006 | Part 2 | Question: 9

• edited by
742 views

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
go_editor asked Mar 27, 2020
763 views
UGC NET CSE | December 2006 | Part 2 | Question: 6
The hexadecimal equivalent of $(10111)_2\times(1110)_2$ is : $150$ $241$ $142$ $101011110$
The hexadecimal equivalent of $(10111)_2\times(1110)_2$ is :$150$$241$$142$$101011110$
User Avatar
1 votes
1 votes
0 answers
2
go_editor asked Mar 27, 2020
698 views
UGC NET CSE | December 2006 | Part 2 | Question: 7
An example of a self complementing code is : $8421$ code Gray code Excess-$3$ code $7421$ code
An example of a self complementing code is :$8421$ codeGray codeExcess-$3$ code$7421$ code
User Avatar
0 votes
0 votes
1 answer
3
go_editor asked Mar 27, 2020
1,667 views
UGC NET CSE | December 2006 | Part 2 | Question: 8
A sum of products expression can be implemented with __________ logic gates. AND−OR NAND−OR AND−NOT OR−AND
A sum of products expression can be implemented with __________ logic gates.AND−ORNAND−ORAND−NOTOR−AND
User Avatar
0 votes
0 votes
1 answer
4
go_editor asked Mar 27, 2020
1,531 views
UGC NET CSE | December 2006 | Part 2 | Question: 1
Which of the regular expressions corresponds to this grammar ? $S → AB/AS, A → a/aA, B → b$ $aa^*b^+$ $aa^*b$ $(ab)^*$ $a(ab)^*$
Which of the regular expressions corresponds to this grammar ?$S → AB/AS, A → a/aA, B → b$$aa^*b^+$$aa^*b$$(ab)^*$$a(ab)^*$
User Avatar
Link Copied!