uestion 1: In graph theory, a graph X is a "complement" of a graph F if which of the following is true? Select one: a. If X is isomorph to F, then X is a complement of F.
Question 1: In graph theory, a graph X is a "complement" of a graph F if which of the following is true?
Select one:
a. If X is isomorph to F, then X is a complement of F.
b. If X has half of the vertices of F (or if F has half of the vertices of X) then X is a complement of F.
c. If X has the same vertex set as F, and as its edges ONLY all possible edges NOT contained in F, then X is a complement of F.
d. If X is NOT isomorph to F, then X is a complement of F.
Question 2: Which statement is NOT true about Merge Sort
Select one:
a. Merge Sort time complexity for worst case scenarios is: O(n log n)
b. Merge Sort is a quadratic sorting algorithm
c. Merge Sort key disadvantage is space overhead as compared to Bubble Sort, Selection Sort and Insertion Sort.
d. Merge Sort adopts recursive approach
Step by step
Solved in 4 steps
