Data Structures and Algorithms - Advanced Algorithm

31. Assume that the binary tree T shown below was produced as a result of an execution on RandQS. Which sequences of picking pivot elements can lead to ?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


32. Consider the graph G given below. Which of the following statements are true?

  • Option : A
  • Explanation : Option A and B both are correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


33. Consider the input graph G as given below. Assume that we contract uniformly at random the edges of G until only two vertices remain. Which of the following statements are true?

  • Option : B
  • Explanation : Option A and B both are correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


34. Consider the input graph G as given below. Assume that we contract uniformly at random the edges of G until only two vertices remain. Further assume that G1 is the resultant graph after the first four edge contractions. Which of the following statements are true?

  • Option : C
  • Explanation : Option A and C both are correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


35. Let G be a graph with vertices. Let the mincut in G be of size. Which of the following statements are true?

  • Option : C
  • Explanation : Option C and D both are correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *