MCQOPTIONS
Home
About Us
Contact Us
Bookmark
Saved Bookmarks
Testing Subject
General Aptitude
Logical and Verbal Reasoning
English Skills Ability
Technical Programming
Current Affairs
General Knowledge
Finance & Accounting
GATE (Mechanical Engineering)
Chemical Engineering
→
VITEEE
→
VITEEE - 2018
→
The number of distinct simple graphs with up to th...
1.
The number of distinct simple graphs with up to three nodes is _________.
A.
7
B.
9
C.
15
D.
25
Answer» B. 9
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Minimize the following Boolean expression using Boolean identities. F(A,B,C) = (A+BC’)(AB’+C)
What is the simplification value of MN(M+ N’) + M(N + N’)?
Simplify the expression XZ’ + (Y + Y’Z) + XY.TOPIC 5.5 MINIMIZATION OF BOOLEAN ALGEBRA
Evaluate the expression: (X + Z)(X + XZ’)+ XY + Y.
a ⊕ b =
is a disjunctive normal form.
(X+Y`)(X+Z) can be represented by
The set for which the Boolean function is functionally complete is
Minimization of function F(A,B,C) = A*B*(B+C) is
A is a Boolean variable.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies
