Register

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

• edited by
313 views

Please log in or register to answer this question.

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
352 views
UGC NET CSE | December 2006 | Part 2 | Question: 50
The maximum size of SMS in $IS-95$ is ______ octets. $120$ $95$ $128$ $64$
The maximum size of SMS in $IS-95$ is ______ octets.$120$$95$$128$$64$
User Avatar
0 votes
0 votes
1 answer
2
go_editor asked Mar 27, 2020
1,521 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
0 votes
0 votes
1 answer
3
go_editor asked Mar 27, 2020
591 views
UGC NET CSE | December 2006 | Part 2 | Question: 2
The proposition ~ q ∨ p is equivalent to :
The proposition ~ q ∨ p is equivalent to :
User Avatar
1 votes
1 votes
2 answers
4
go_editor asked Mar 27, 2020
12,168 views
UGC NET CSE | December 2006 | Part 2 | Question: 3
The number of edges in a complete graph with $N$ vertices is equal to : $N (N−1)$ $2N−1$ $N−1$ $N(N−1)/2$
The number of edges in a complete graph with $N$ vertices is equal to :$N (N−1)$$2N−1$$N−1$$N(N−1)/2$
User Avatar
Link Copied!