Register

UGC NET CSE | June 2005 | Part 2 | Question: 22

• edited by
1,376 views

2 Answers

0 votes
0 votes

Ans: B) A tree contains a cycle

  • A tree does not contain a cycle.
  • All other options are properties of the tree.
User Avatar
0 votes
0 votes
  • A tree is connected, acyclic graph having $n$ vertices and $n-1$ edges. All these points are the basic property of a tree.
  • A bipartite graph is 2 colorable structures, and every tree is 2 colorable so every tree is a bipartite graph. Another way is a graph is called bipartite if it has no cycle of odd length. since the tree is an acyclic graph so it’s bipartite.

Here option B is wrong because the tree is an acyclic data structure.

For more understanding please refer here: Tree

 

 

 

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

Related questions

0 votes
0 votes
1 answer
2
go_editor asked Mar 26, 2020
1,360 views
UGC NET CSE | June 2005 | Part 2 | Question: 2
Identify the language which is not context – free. $L=\left \{ w w R\mid w \in \left \{ 0,1 \right \}* \right \}$ $L=\left \{ a^{n}b^{n}\mid n \geq 0 \right \}$ $L=\left \{ ww\mid w \in \left \{ 0,1 \right \}* \right \}$ $L=\left \{ a^{n}b^{m}c^{m}d^{n}\mid n,m \geq 0 \right \}$
Identify the language which is not context – free.$L=\left \{ w w R\mid w \in \left \{ 0,1 \right \}* \right \}$$L=\left \{ a^{n}b^{n}\mid n \geq 0 \right \}$$L=\left \...
User Avatar
0 votes
0 votes
1 answer
3
go_editor asked Mar 26, 2020
577 views
UGC NET CSE | June 2005 | Part 2 | Question: 4
Consider the relation on the set of non-negative integers defined by $x \equiv y$ if and only if: $x$ $\text{mod}$ $3=3$ $\text{mod}$ $y$ $3$ $\text{mod}$ $x \equiv 3$ $\text{mod}$ $y$ $x$ $\text{mod}$ $3=y$ $\text{mod}$ $3$ None of the above
Consider the relation on the set of non-negative integers defined by $x \equiv y$ if and only if:$x$ $\text{mod}$ $3=3$ $\text{mod}$ $y$$3$ $\text{mod}$ $x \equiv 3$ $\te...
User Avatar
0 votes
0 votes
2 answers
4
go_editor asked Mar 26, 2020
1,511 views
UGC NET CSE | June 2005 | Part 2 | Question: 5
Minimum number of individual shoes to be picked up from a dark room ( containing $10$ pair of shoes) if we have to get atleast one proper pair : $2$ $20$ $11$ None of these
Minimum number of individual shoes to be picked up from a dark room ( containing $10$ pair of shoes) if we have to get atleast one proper pair :$2$$20$$11$None of these
User Avatar
Link Copied!