Data Structures and Algorithms - Advanced Algorithm

1. When the minimum algorithm that uses accelerated crowding on COMMON CRCW PRAM is invoked on an array of size n with 2n processors, the size of the problem after the third size reduction is

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 *


2. If the divide and conquer algorithm for finding prefix sums is run on "4, 8, 1, 3, 9, 6, 8, 7", then what is the last operation performed to find the prefix sum value corresponding to input element 6?

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 *


3. When key value 10 is searched in an array that contains "4, 6, 8, 13, 15, 17, 19" with six processors assigned to the first six elements of the array, on a CREW PRAM, using Algorithm Search-1, which is the processor that reports the rank of 10 in the array?

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 *


4. When a key value is searched in an array with six processors on a CREW PRAM, using Algorithm Search-2, the range of search reduces by a factor of _____ in each step.

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 *


5. Consider the optimal merge algorithm studied in Lecture 8. Consider the two sorted arrays:
A = ⟨3, 7, 10, 14, 18, 27, 35, 49⟩ and A′ = ⟨3, 14, 35⟩.
If B = ⟨4, 9, 15, 26, 29, 33, 34, 53⟩ and are the leader arrays, then B′ = ⟨4, 26, 34⟩ the number of elements left in that charge of leader 26 is

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 *


  • Advanced Algorithms And Data Structures Questions can be used to give quizzes by any candidate who is preparing for UGC NET Computer Science
  • This Advanced Algorithms And Data Structures Questions section will help you test your analytical skills in a tricky method, thereby giving you an edge over other students
  • Any student who wants to prepare for DOEACC A Level, DOEACC B Level, and DOEACC C level can also use these Objective Type Questions Answer.
  • All candidates who have to appear for the Kendriya Vidyalaya Entrance exam can also refer to this mcq section.
  • You can also get access to the Advanced Algorithms And Data Structures MCQ ebook.
  • Advanced Algorithms And Data Structures Questions can be used in the preparation of JRF, CSIR, and various other exams.
  • You can also download pdf for these Advanced Algorithms And Data Structures multiple-choice questions Answers.
  • This Advanced Algorithms And Data Structures Multiple Choice Questions Answers section can also be used for the preparation of various competitive exams like UGC NET, GATE, PSU, IES, and many more.
  • Advanced Algorithms And Data Structures Questions can be used to gain a credit score in various undergraduate and postgraduate courses like BSc, MSc and MCA
  • Advanced Algorithms And Data Structures Questions for UGC NET Computer Science

    Advanced Algorithms And Data Structures MCQ

    Advanced Algorithms And Data Structures Multiple choice questions