UGC NET EXPERTS
Discrete Structures and Optimization
* Required
Email address
*
Your email
Q.1. Let S={ {Φ},1,{2,3} }, then the power set P(S) has how many number of elements?
*
1 point
4
2
8
32
Q.2. The minimum number of edges in a connected cyclic graph on 'n' vertices is ?
*
1 point
n
n1
n+1
2n1
Q.3. Which is used to diagrammatically show the set relations and set operations?
*
1 point
ER Diagram
Venn Diagram
Hayes Diagram
All of the above
Q.4. A subset of a countable set
*
1 point
has not to be countable
may or may not be countable
has to be finite
none of the above
Q.5. In Venn diagram, the rectangle represents?
*
1 point
subsets
power set
universal set
all of the above
Q.6. Every bipartite graph is a
*
1 point
perfect graph
bipartite graph
complete graph
common vertices
Q.7. If the graph is not complete bipartite, missing edges are inserted with the value zero. Finding such a matching is known as the
*
1 point
assignment problem
hungarian algorithm
priority queues
maximum matching
Submit
This content is neither created nor endorsed by Google.
Report Abuse

Terms of Service

Privacy Policy
Forms