What is the maximum number of edges in an acyclic undirected graph with n vertices?

• n
• n-1
• n+1
• 2(n+1)
• option2

Let G be a simple connected planar graph with 13 vertices and 19 edges. Then, the number of faces in the planar embedding of the graph is:

• 6
• 9
• 8
• 13
• option3

Let G be the simple graph with 20 vertices and 100 edges. The size of the minimum vertex cover of G is 8. Then, the size of the maximum independent set of G is

• 12
• 8
• Less than 8
• Less than 12
• option1

The maximum number of binary trees that can be formed with three unlabeled nodes is:

• 1
• 5
• 4
• 3
• option2

The maximum number of binary 4 that can be formed with three unlabeled nodes is:

• 11
• 15
• 14
• 13
• option3

The maximum number of binary 5 that can be formed with three unlabeled nodes is:

• 115
• 152
• 153
• 154
• option4

The maximum number of binary 2 that can be formed with three unlabeled nodes is:

• 3
• 2
• 4
• 1
• option2

Which of the following is caused by allergy?

• Hunger
• Fever
• Sleepless
• Fatigue
• option2

___ causes pain.

• House
• Furniture
• Utensils
• Hurt
• option4

The man is content get his food from his ___.

• cattle
• fields
• relatives
• parents
• option2