Data Structures and Algorithms - Advanced Algorithm

26. The pointer jumping based list ranking algorithm that we studied this week has a cost of

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 *


27. Pointer Jumping allows us to broadcast a piece of information over _____nodes in k steps.

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 *


28. An array Next is used to define a linked list in the following manner: Next[1]=6; Next[2]=3; Next[3]=NULL; Next[4]=5; Next[5]=1; Next[6]=8; Next[7]=2; Next[8]=7. Which node is ranked 1?

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 *


29. Which of the following statements are true?

  • Option : B
  • Explanation : Option B, C and D 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 *


30. Let pij, where j>i, denote the probability that the ith smallest and jth smallest elements in the input list are compared in an execution of Rand QS. Which of the following statements are true?

  • Option : D
  • Explanation : Option B 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 *